npm - @aztec/protocol-contracts - Versions diffs - 5.0.0-nightly.20260415 → 5.0.0-nightly.20260417 - Mend

@aztec/protocol-contracts 5.0.0-nightly.20260415 → 5.0.0-nightly.20260417

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

package/artifacts/AuthRegistry.json +238 -234
package/artifacts/ContractClassRegistry.json +32 -36
package/artifacts/ContractInstanceRegistry.json +36 -40
package/artifacts/FeeJuice.json +37 -41
package/artifacts/MultiCallEntrypoint.json +230 -226
package/artifacts/PublicChecks.json +195 -199
package/dest/protocol_contract_data.js +13 -13
package/package.json +4 -4
package/src/protocol_contract_data.ts +13 -13

package/artifacts/AuthRegistry.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "transpiled": true,
-  "noir_version": "1.0.0-beta.19+842974fcf034b0a652631e69fc24f92f9ddd1d37",
+  "noir_version": "1.0.0-beta.20+b3b0faa67d750c16346c556eaf02e28c579b88d1",
   "name": "AuthRegistry",
   "functions": [
     {
@@ -56,7 +56,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBHJwAABEclAAAATicCBQQDJwIGBAAfCgAFAAYARBwARkYBLQhEAi0IRQMtCEYEJQAAAHQnAgIERycCAwQAOw4AAwACLAAAQwAwZE5y4TGgKbhQRbaBgVhdKDPoSHm5cJFD4fWT8AAAACYeAgAFAB4CAAUAHgIABgEKIgZDBxYKBwgcCggJAAQqCQYIJwIGAQAKKgcGCSQCAAkAAACxJwIKBAA8BgoBCioIBQckAgAHAAAAwyUAAAH4JwIFAAIpAgAHAO9SU00rAgAIAAAAAAAAAAADAAAAAAAAAAAtCAEJJwIKBAUACAEKAScDCQQBACIJAgotCgoLLQ4HCwAiCwILLQ4FCwAiCwILLQ4CCwAiCwILLQ4ICy0IAQInAgUEBQAIAQUBJwMCBAEAIgkCBQAiAgIKPw8ABQAKJwIFBAEAKgIFCS0LCQknAgIAAAoqCQIKCioKBgskAgALAAABbiUAAAIKLQgBCicCCwQFAAgBCwEnAwoEAQAiCgILLQoLDC0OBwwAIgwCDC0OCQwAIgwCDC0OAwwAIgwCDC0OCAwtCAEDJwIHBAUACAEHAScDAwQBACIKAgcAIgMCCD8PAAcACAAqAwUHLQsHBwoqBwIDCioDBgIkAgACAAAB7CUAAAIKHAoEAgAwCgACAAcmKgEAAQXBUDSsJUi8UTwEAgEmKgEAAQW6uyHXgjMYZDwEAgEm",
-      "debug_symbols": "tZfbbuJADIbfJddcjA9zcF9ltaooTSskBCiFlVYV776eMs6h0oxY2L2BD4f88di/J8ln99q/nN+ft/u3w0f39OOzexm2u932/Xl32KxP28Neo5+dyx8AoXuiVQcI3VPM3/obQIE0APkIhQLsyiH2BXyO+Ay+QLBISAUiGUSFoJCwgDgDPR31EuicgRQgixAb2CG2CFvEW8SnAgENYoEIBqFAskskSyNlQc0ZhQzSFciRgUXAImARzGmEDFKALEL5P0mBycAi3iIBDHJvsmB0Br5AskiyiFhE2CBdgXPOV4gFAA3KJTj3/wpZMGaQAjn5K1iELcIW8RbJBqCUwRvof9gpRDawSIoFRPNhzpAj8XJZdebV59PQ99mqM/OqpY/rod+fuqf9ebdbdb/Wu/PXnz6O6/3X92k96FHV7vev+q2Cb9tdn+myms529VPVeb6cjYR+FNCJWUhAQ8KxR9NwHMIoEtJCAxsaMZmC8JREpJvXEVIwhZhSdR1clyBmKwVpX0eJiAsF/w8qEf5jJQic5UAAsVqJVJfQwbFism56tUpIYxV62rgO8BFqlYDWSlhsIaFeinYWkysgUKpm0bAmo5tqIaOCv6uYs3V8KyY0nClgxhSc1sBwlyWoPuQNCY/BcvAok6v8cqeB2JCAvPddJWDmbXTLhkKjmHoXs4XIVAlK39rZ8IRMG54Q46Thlx3FRjHEMZmGE1fXgJa5TYJm2xWGZUewtWdCnMyd+D4NJEsDdQuta3CrrzD11U+TDunmNEgijH2NUk2jaS8naXSo81V7YWzuOKO/vItVjRsHReeuNigojw8KuUcHheDxQSF8fFCyCR8bFOLHB6WpceOgUHh4UFpp3DooTXvdOCjU0GDthd3UeK5x3x2FqDoo3LBoFGdNiYJSzYJbWw+DG0vKANUnFaZWZ6eb42za5G/ScIHHNFyqPjpy4/lTX8DInK4sWBVpuJRCGh8WItLyueun/lxvtsPiHfuSxYbt+mXXl59v5/1mdvT0+2hH7B39OBw2/et56LPS/EVdX3vEryT+vOSr/QE="
+      "debug_symbols": "tZfbbuIwEIbfJddceA4+TF9ltaooTSskBCiFlVYV777j4smhki0Wdm/gyzj5Mx7/4ySf3Wv/cn5/3u7fDh/d04/P7mXY7nbb9+fdYbM+bQ97jX52Lv8AhO6JVh0gdE8x/+sxgAJpAPIIhQLsyhD7Aj5HfAZfIFgkpAKRDKJCUEhYQJyBXo56C3TOQAqQRYgNbIgtwhbxFvGpQECDWCCCQSiQ7BbJ0khZUHNGIYN0BXJkYBGwCFgEcxohgxQgi1A+JykwGVjEWySAQV6bLBidgS+QLJIsIhYRNkhX4JzzFWIBQINyC87rf4UsGDNIgZz8FSzCFmGLeItkA1DK4A30HHYKkQ0skmIB0XyYM+RIvFxWnXn1+TT0fbbqzLxq6eN66Pen7ml/3u1W3a/17vx10sdxvf/6P60HHVXtfv+q/yr4tt31mS6r6WpXv1Sd58vVSOhHAe2YhQQ0JBx7NA3HIYwiIS00sKERkykIT0lEunkeIQVTiClV58F1CWK2UpCu6ygRcaHg/0Elwn+sBIGzHAggViuR6hLaOFZM1k2vVglpzEIvG+cBPkKtEtCaCYtNJNRL0c5icgUEStUsGtZkdFMtZFTwdxVzNo9vxYSGMwXMmILTHBjusgTVm7wh4TFYDh5lcpVf7jQQGxKQ976rBMy8jW65oNAopj7FbCIyVYLSt+VseEKmDU+IcdLwyxXFRjHEMZmGE1fXgJa5TYJm2xWG5Ypga8+EOJk78X0aSJYG6hZa1+CWwePYIehmG066OQ2SCOO6Rqmm0bSXkzQ61PmqvTA2d5zRX342le8aNzaK9l2tUVAebxRyjzYKweONQvh4o2QTPtYoxI83SlPjxkah8HCjtNK4tVGa9rqxUaihwboWNhWea9z3RCGqNgo3LBrF2aJEQalmwa2th8GNJWWA6psKU6tjp4fjrNvkb9Jwgcc0XKq+OnLj/VM/wMicrixYFWm4lEIaXxYi0vK966cerjfbYfGNfcliw3b9suvL4dt5v5mNnn4fbcS+0Y/DYdO/noc+K80/1PWzR/xK4s9Lvtsf"
     },
     {
       "name": "consume",
@@ -112,7 +112,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBIJwAABEglAAAASScCBAQCJwIFBAAfCgAEAAUARS0IRQItCEYDJQAAAHgtAgJHJwIDBEcnAgQEATsOAAQAAykAAEMAR9rNcywAAEQAMGROcuExoCm4UEW2gYFYXSgz6Eh5uXCRQ+H1k/AAAAAmHgIABAAeAgAEACcCBAABKQIABQDvUlNNKwIABgAAAAAAAAAAAwAAAAAAAAAALQgBBycCCAQFAAgBCAEnAwcEAQAiBwIILQoICS0OBQkAIgkCCS0OBAkAIgkCCS0OAgkAIgkCCS0OBgktCAEEJwIIBAUACAEIAScDBAQBACIHAggAIgQCCT8PAAgACScCBwQBACoEBwgtCwgIJwIEAAAKKggECScCCgEACioJCgskAgALAAABMiUAAAQjHgIACQAvKgAIAAkACxwKCwkCHAoJCAAcCggJAhwKCQsBHAoLCAInAgkCAAoqCAkLJAIACwAAAW8lAAAENR4CAAgBCiIIRAsWCgsMHAoMDQAEKg0IDAoqCwoIJAIACAAAAZ0nAg0EADwGDQEeAgAIAx4CAAsEKQIADQDDt7IGKwIADgAAAAAAAAAABQAAAAAAAAAALQgBDycCEAQFAAgBEAEnAw8EAQAiDwIQLQoQES0ODREAIhECES0ODBEAIhECES0OCBEAIhECES0ODhEtCAEIJwIMBAUACAEMAScDCAQBACIPAgwAIggCDT8PAAwADQAqCAcMLQsMDAAqDAsNLQIIAycABAQFJQAABEctCAULACoLBwwtDg0MJwIMBAIAKggMDS0LDQ0AKg0DCC0CCwMnAAQEBSUAAARHLQgFAwAqAwwNLQ4IDS0IAQgnAgsEBQAIAQsBJwMIBAEAIgMCCwAiCAIMPw8ACwAMACoIBwMtCwMDJwIIAAItCAELJwIMBAUACAEMAScDCwQBACILAgwtCgwNLQ4FDQAiDQINLQ4IDQAiDQINLQ4CDQAiDQINLQ4GDS0IAQInAggEBQAIAQgBJwMCBAEAIgsCCAAiAgIMPw8ACAAMACoCBwgtCwgICioIBAwKKgwKDSQCAA0AAAMpJQAABCMtCAEMJwINBAUACAENAScDDAQBACIMAg0tCg0OLQ4FDgAiDgIOLQ4IDgAiDgIOLQ4DDgAiDgIOLQ4GDi0IAQMnAgUEBQAIAQUBJwMDBAEAIgwCBQAiAwIGPw8ABQAGACoDBwUtCwUFCioFBAYKKgYKByQCAAcAAAOnJQAABCMeAgAGAC8qAAUABgAHHAoHCAIcCggGABwKBgcCHAoHCAEcCggGAgoqBgkHCioHCgYkAgAGAAAD5CUAAAShLQsLBgAiBgIGLQ4GCy0LAgYAIgYCBi0OBgItCwwCACICAgItDgIMLQsDAgAiAgICLQ4CAzAKAAQABS0IQwImKgEAAQW6uyHXgjMYZDwEAgEmKgEAAQVMr1JlAlqXtDwEAgEmLQEDBgoABgIHJAAABwAABJwtAAEFAAABBAEAAAMECS0AAwotAAULIwAABIUtAQoILQQICwAACgIKAAALAgsMAAoJDCQAAAwAAARzJwEFBAEjAAAEoC0AAwUmKgEAAQXtK68NmiE35zwEAgEm",
-      "debug_symbols": "vZrdbhs5DIXfxde5kCiKFPsqRVGkqVsYMJzATRZYFHn3JT3ijB1AysRy9ib+wrHP6OdQ0tD+u/m5/fHy+/vu8Ovxz+bL17+bH8fdfr/7/X3/+HD/vHs8aPTvJtifCPqS7vQ1b76wvib9P6JBroBYgTxCUoH9EnukeKR4RJIDTwABHKhCjA71FgDBwQTJoFRIycEj6BH0SPZItmZov4DQwSNs7xGDUqF4pHhEaiSF6KBthqxgbQY2UEGwS9bUCTySNJKCgVSwwUzRQCpkjxA46EAluwVbxG7BXKHEeqlQBbGI3UtoAgzoIBWi9gLBQPuF+ikEjWS9FyaokD2SuQL5JfIIe4Q9Yu2ZIFeQ4IAOMkEOyaFUiCaYDKgCRAePJI8kj6BH0JqhJskZHOw92sFMsUbMtCfg4DBHpIKZdgJrmNom27xPUCNkps1swDViBpiAKoBHLJlOYNk0gd1CDEoFM+0EHskeyR4hj5hpSf1DlnET6HvI2mOmnYArCDjUCAdw8Ig1foJcwTJuAnSQCik51JsymqAYUIUcHTxCHiGPsEfMP6y94AIO+h5Wi7L5eYIaKebnCbQ9rB8v5ucJSgXwCHgkeSRxBbPNBFQhB4fs4Lew5WICFSzq1WLmn4ArFI8Uj4hHpEbEPF/AoFQwzxc04ArgEXPLBNoe0WER1IjYp8wkYpfMJBN4xEwi2aBUsJVNyMAiOl9iJjmBDe8EtvYGW5dDCAvmBW2dDGRo4+1YZrRmx5hOSDNaujqaWMwnlBlP20lFE4Pw+nq38Z3p+/Nxu7WN6Wyr0g3s6f64PTxvvhxe9vu7zT/3+5fTm/483R9Or8/3R72qI7Y9/NRXFfy122+NXu+WT4f2RyGFXD8NCfIsECNdSMSORMAMrhGQaBahcqEBHQ0uriC4NILT6n5QIVfgUpr9wLaE7lE+FAlpGQqGC4V8g5GgTxyJRMUVEsdFIl96orQVsh59qkKOZ42AcNkI6fSiuCeTLJORyuUwxE43ZDGmJIRFI+dLjY4zJWByjSChrQE9V7hEOrMV0Jv0SJ2xiDxbU8+J12no6c811Optjdyb1rhMa46Lt8rqZiThOM8rS7MZPXMFcXtmCLlprtjRwDRbHPFc402yr82SlFpZAh0JisXHkyBIsxXQcWgCYl8xlCU1186eRaMIziIhxqZIusUqjqOL1zt9QVn6crYjvW1GZw3V/J5tqgfYdkP6M0PLzHAozYaUnkXYHZLOljChDyjQrMBNhb7R42L03DJ6T6HAvC8WDC2F1JlVjODdwJibW2vqrqI5z+aKmZsmT90tfvYWtf35TjOWg0bUp5pmMzr+RAjLaCwLR75uPM968nY8O8aSOG+vsHQC43pXZJpdwdxyBfbObPpk7POhnLE1ltjJU5Q8b2pw1XmpyLzDS2zuBNgzhT5kLx1haK7i2PGmPrp7R86G8yMd4bJ0JDfzFHuHT63l4Pw4kPjs9HjpLOTxkxuW8ZMbyujJLYfxk1tXY+XJLcPwya3bjAyLQ892kg91JWOcNShdp0HgWyLQ2Xb0MY1l2SC6TkNTfT4y6YmjrVE+dVrWHqj7EvNhOMRm2lMcf+AjGH3iozS+bhCOrxuUR9cNovF1o6uxct2gcYP2mrHWoF17rXzk49g9uc3+yoGbGmsTBZonFk7jicI4miicxxOFaTxRmEcThct4onQ1ViZKCcOJ0mvG2kTp2mtlopT0ubWR80RBalYQ83htpNANaiOFb1AbKeUGtZEio7WRd/qyrjYicbw28s7MrKuNSBqtjfQV1tRGViogXFNdwUAyp0q5prqCpy+N6qM8NhXkFvX6GxTsb1GxD7co2Yfxmn24RdE+3KJqH8bL9mstRtCyWAw87rEYyrjJ5BZfC4UbmCzGYZP1vltabbKuyFqTRfzfTFbaJoudfYUluAYLtE8NMXZPpYHmHV8X5eZmHXtfMSWd3rm+qQ8f0FaRbvF93ifPy4Knzfab/nv/sDte/Drt1cSOu/sf+23999fL4eHs6vO/T37Ff932dHx82P58OW5NafmJm/75CpqO6opvdxv74ctX0OILgHx7tbv/Bw=="
+      "debug_symbols": "vZrRbts6DIbfJde9kCiKFPcqwzB0XTYUCNoiaw9wMPTdDxmLtlNAqhul5yb5Qse/JfmnJDP5u/u5//Hy+/v9w6/HP7svX//ufhzvD4f7398Pj3e3z/ePDxr9uwv2EkHf0o2+590X1veknyMa5AqIFcgjJBXYD7FHikeKRyQ58AQQwIEqxOhQLwEQHEyQDEqFlBw8gh5Bj2SPZGuG9gsIHTzC9h0xKBWKR4pHpEZSiA7aZsgK1mZgAxUEO2RNncAjSSMpGEgFG8wUDaRC9giBgw5UskuwRewSzBVKrIcKVRCL2LWEJsCADlIhai8QDLRfqGchaCTrtTBBheyRzBXID5FH2CPsEWvPBLmCBAd0kAlySA6lQjTBZEAVIDp4JHkkeQQ9gtYMNUnO4GDf0Q5mijVipj0BB4c5IhXMtBNYw9Q22e77BDVCZtrMBlwjZoAJqAJ4xJLpBJZNE9glxKBUMNNO4JHskewR8oiZltQ/ZBk3gX6HrD1m2gm4goBDjXAAB49Y4yfIFSzjJkAHqZCSQ70oowmKAVXI0cEj5BHyCHvE/MPaCy7goN9htSibnyeokWJ+nkDbw3p6MT9PUCqAR8AjySOJK5htJqAKOThkB7+ETRcTqGBRrxYz/wRcoXikeEQ8IjUi5vkCBqWCeb6gAVcAj5hbJtD2iA6LoEbEzjKTiB0yk0zgETOJZINSwWY2IQOL6P0SM8kJbHgnsLk32LwcQlgwL2jzZCBDG2/HMqM1O8Z0QprR0tXRxGI+ocx4Wk4qmhiE19ebna9M35+P+70tTKulShewp9vj/uF59+Xh5XC42f1ze3g5fenP0+3D6f359qhHdcT2Dz/1XQV/3R/2Rq83y9mhfSqkkOvZkCDPAjHSmUTsSATM4BoBiWYRKmca0NHg4gqCSyM4be4HFXIFLqXZD2xL6BrlQ5GQlqFgOFPIVxgJ+sSRSFRcIXFcJPK5J0pbIevWpyrkuGoEhPNGSKcXxT2ZZLkZqZwPQ+x0QxZjSkJYNHI+1+g4UwIm1wgS2hrQc4VLpJWtgN6kR+qMReTZmrpPvExDd3+uoVZva3TciZH9piAEXrxVNjcjCcf5vrI0m9EzVxC3Z4aQm+aKHQ1Ms8UR1xpvkn1rlqTUyhLoSFAsniYEQZqtgI5DExD7jKEsqTl39iwaRXAWCTE2RdI1ZnEcnbze6QvK0pfVivS2GZ05VPN7tqluYNsN6d8ZWu4Mh9JsSOlZhN0haTWFCX1AgWYFbir0jR4Xo+eW0XsKBeZ1sWBoKSToTT3g3cCYm0tr6s6iOc/mipmbJk/dJX72FrX9+U4zlo1G1KeaZjM6/kQIy2gsE0e+bDxXPXk7nh1jSZyXV1g6gXG7KzLNrmBuuQJ7ezZ9Mvb7oZyxNZbYyVOUPO9V4KL9UpF5hZfYXAmwZwp9yF46wtCcxbHjTX10946shvMjHeGydCQ38xR7m0+t5eD8OJB4tXs8dxby+M4Ny/jODWV055bD+M6tq7Fx55ZheOfWbUaGxaGrleRDXckYZw1Kl2kQ+JIItFqOPqaxTBtEl2loqs9bJt1xtDXKp96WrRvqvsS8GQ6xmfYUxx/4CEaf+CiNzxuE4/MG5dF5g2h83uhqbJw3aNygvWZsNWjXXhsf+Th2d26zv/KqK281tiYKNHcsnMYThXE0UTiPJwrTeKIwjyYKl/FE6WpsTJQShhOl14ytidK118ZEKelzayPrREFqVhDzeG2k0BVqI4WvUBsp5Qq1kSKjtZF3+rKtNiJxvDbyzp3ZVhuRNFob6StsqY1sVEC4pLqCgWROlXJJdQVPPxrVR3lsKsg16vVXKNhfo2IfrlGyD+M1+3CNon24RtU+jJftt1qMoGWxGHjcYzGUcZPJNX4WClcwWYzDJuv9trTZZF2RrSaL+L+ZrLRNFjvrCktwDRZo7xpi7O5KA80rvk7KzcU69n5iSnp75/qmPnxAW0W6xfd5nVyXBU+L7Tf9eHt3fzz7d9qriR3vb38c9vXjr5eHu9XR53+f/Ij/u+3p+Hi3//ly3JvS8hc3ffkKmo7qim83O/vjy1fQ4guAfHu1q/8H"
     },
     {
       "name": "is_consumable",
@@ -165,7 +165,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBGJwAABEYnAgQEAicCBQQAHwoABAAFAEMtCEMCLQhEAyUAAABELQICRScCAwRFJwIEBAE7DgAEAAMeAgAEAB4CAAQAHgIABAknAgUBASQCAAQAAABlJQAAAn8nAgQAASkCAAUA71JTTSsCAAYAAAAAAAAAAAMAAAAAAAAAAC0IAQcnAggEBQAIAQgBJwMHBAEAIgcCCC0KCAktDgUJACIJAgktDgQJACIJAgktDgIJACIJAgktDgYJLQgBBCcCCAQFAAgBCAEnAwQEAQAiBwIIACIEAgk/DwAIAAknAgcEAQAqBAcILQsICCcCBAAACioIBAknAgoBAAoqCQoLJAIACwAAARUlAAACkR4CAAkALyoACAAJAAscCgsJAhwKCQgAHAoICQIcCgkLARwKCwgCJwIJAgAKKggJCycCCAACLQgBDCcCDQQFAAgBDQEnAwwEAQAiDAINLQoNDi0OBQ4AIg4CDi0OCA4AIg4CDi0OAg4AIg4CDi0OBg4tCAECJwIIBAUACAEIAScDAgQBACIMAggAIgICDT8PAAgADQAqAgcILQsICAoqCAQCCioCCgwkAgAMAAAByCUAAAKRLQgBAicCDAQFAAgBDAEnAwIEAQAiAgIMLQoMDS0OBQ0AIg0CDS0OCA0AIg0CDS0OAw0AIg0CDS0OBg0tCAEDJwIFBAUACAEFAScDAwQBACICAgUAIgMCBj8PAAUABgAqAwcCLQsCAgoqAgQDCioDCgQkAgAEAAACRiUAAAKRHgIAAwAvKgACAAMABBwKBAMCHAoDAgAcCgIDAhwKAwQBHAoEAgIKKgIJAxYKAwIEKgsCAy0KAwImKgEAAQXwQ+Wh+qIsNDwEAgEmKgEAAQW6uyHXgjMYZDwEAgEm",
-      "debug_symbols": "tZjRbuM4DEX/xc95EEWRkvorg0GRtu4gQJAWmWSBRZF/X7IW7WQAqd4q81Kf0PY1ZfGKqj+Gl/Hp/Otxd3h9+z08/PgYno67/X7363H/9rw97d4OEv0YnP7hNDzgZog4PEQ5yC9wmyHJTwA5pumYeTqCA4GkwAWACqBFgjOwU2QRsghbhINBKqCpTBALJG9gj8iWRhZB7xTyBN4FA4uARcAi3iIoaXhQoALBIkGvQYVcgCxCFmGLRG8gOfssoDmj6mQRRD2lqSqgcwYaCQLgDDRCAt4ZSCR4AU11gmCQCwSLBIuQRSgVYG8QC0Qw4ALJHpHsoUkFNbGMBmmC4NDAImARsIi+50AKuQDqNVEhFQgWITCQfEhv1yKZgApEi0SLJIukYJAKaM4TxAnIeYPyCAIwUEFWyAU0+QksghZBiwSLaIVTVCADvUYqgbRIJrCIFsknaJEwKUiE9S4tEpZTrEUygUW0SKJToAJaJBEUyEAeEf3lshnM6Y+n4ziq0a+sLwvC+/Y4Hk7Dw+G832+Gf7b78+dFv9+3h8/jaXuUs/KQ8fAiRxF83e1HpctmudvVbxVrUbnbSxHPAgB8IwENCRfIm4YLzLMIpxsN39CIyRRyWJKIuHocnNgUYkrVcYS6hPjTXgVKKc8SnxO1KNAd3gT/xTeBGOM8DBeqbyI1JMAFy0KYc20cua4Bbp4QAJf7R8LVkTQkKM3lTQlhlqBbg0CjNAl0jZwk4GpKvLsdCGBjUpNZVBbmWQHT7duERnHmxacZg180iG41GuWZXUDTcNnVNbhlEpPAK5d5/mO1iI13AXF2KqTwPQ2PloYX59c1cmteYZlXWkoD0uo0MOtqXuY15noarfJy2axG3lG1vHxDQ7q0aYRwrfFNo5CrGcU3SpRlNouEtLxczcI3ShQ9R1tBhTNWe0mrRmWXGWYRB1AViffoaql3Mf9iLCEvY7nq0H+kga2FlGiuU3a+nkh7ZniZmehSNRHfKhFb0Bmv1rDM/0OBZ4XYqxDqOTStwnG2Ss41qyD39xSMvT0FU39PwdzfU4Lr7SkB+ntKU2NlTwnY3VNaaaztKc3yWtlTQrPR57m+yMWqxkqjZOCaUULqN0rIvUYh128Ugn6jkO81CmG/UZoaK41C1G2UVhprjdIsr5VGofSXN19XRkGqGYVd/+aL4Q6bL/Z32Hwx3uMf6dC7+fpiLOs2X8z9m68vZmbd5otT7+arrbBm87VS4bubLxcWq8Qbq/yUX9vn3fHm8/lFtY677dN+LD9fz4fnq7Onf9/tjH1+fz++PY8v5+OoSss3eP0I+QNkvw/ofl70ef8B"
+      "debug_symbols": "tZjRbtswDEX/xc95ECWSkvorw1CkbToECNIiSwYMRf59ZC3aSQGpXpW+1Ce0fU1ZvKLqt+Fp83D6db/dP7/8Hu5+vA0Ph+1ut/11v3t5XB+3L3uJvg1O/3Aa7sJqiGG4i3KQX+BWQ5KfAHJM4zHzeAQHAkmBCwAVCBZBZ2CnyCJkEbYIo0EqoKmMEAskb2CPyJZGFkHvFPII3qGBRcAiYBFvkSBpeFCgAmgR1GuCQi5AFiGLsEWiN5CcfRbQnIPqZBEMekpTVQjOGWgEBcAZaIQEvDOQCHoBTXUENMgF0CJoEbIIpQLsDWKBCAZcINkjkj00qaAmloNBGgFdMLAIWAQsou8ZSSEXCHpNVEgF0CIEBpIP6e1aJCNQgWiRaJFkkYQGqYDmPEIcgZw3KI8gAAMVZIVcQJMfwSLBIsEiaBGtcIoKZKDXSCWQFskIFtEieQctEiYFibDepUXCcoq1SEawiBZJdApUQIskggIZyCOiP59Xgzn9/njYbNToF9aXBeF1fdjsj8Pd/rTbrYY/693p/aLfr+v9+/G4PshZechm/yRHEXze7jZK59V8t6vfKtaicreXIp4EAPhKAhoSDsmbhkPmSYTTlYZvaMRkChnnJGJYPA5ObAoxpeo4sC4h/rRXEaSUJ4n3iZoV6AZvgr/xTYQQ4zQMh9U3kRoS4NCyEOZcG0eua4CbJgTA5f6RcHUkDQlKU3lTCjBJ0LVBoFGaBLpGjhJwMSXeXQ8EQmNSk1lUFuZJIaTrtwmN4syzT3NAP2sQXWs0yjM7DKbhsqtrcMskJhEuXOb5w2oRG+8C4uRUSPg1DR8sDS/Or2s0ChQh2qSgd3GurrQ4jZB1NS/zGnM9jVZ5uWxWI++oWl6+oSFd2jQQLzW+aBRyNaP4RomyzGaRkJaXq1n4RokGz9FWUOEcqr2kVaOyy8RJxAFUReItulrqXcw/GQvmeSwXHfpDGqG1kBJNdcrO1xNpzwzPMxNdqibiWyViCzqHizUs838o8KQQexWwnkPTKhwnq+Rcs0rg/p4SYm9PCam/p4Tc31PQ9fYUhP6e0tRY2FMwdPeUVhpLe0qzvBb2FGw2+jzVF10M5aPGQqNk4JpRMPUbBXOvUcj1G4Wg3yjke41Cod8oTY2FRiHqNkorjaVGaZbXQqNQ+ubN14VRAtWMwq5/88Vwg80X+xtsvjjc4h9p7N18fTKWZZsv5v7N1yczs2zzxal389VWWLL5Wqjw1c2Xw9kq8coqP+XX+nF7uPp8flatw3b9sNuUn8+n/ePF2ePfVztjn99fDy+Pm6fTYaNK8zd4/Qj5A2S/D8H9POvz/gE="
     },
     {
       "name": "is_reject_all",
@@ -211,7 +211,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBFJwAABEUnAgMEAScCBAQAHwoAAwAEAEMtCEMCJQAAAEAtAgJEJwIDBEQnAgQEATsOAAQAAx4CAAMAHgIAAwAeAgADCScCBAEBJAIAAwAAAGElAAABRikCAAMA71JTTScCBAABKwIABQAAAAAAAAAAAwAAAAAAAAAALQgBBicCBwQFAAgBBwEnAwYEAQAiBgIHLQoHCC0OAwgAIggCCC0OBAgAIggCCC0OAggAIggCCC0OBQgtCAECJwIDBAUACAEDAScDAgQBACIGAgMAIgICBD8PAAMABCcCAwQBACoCAwQtCwQEJwICAAAKKgQCAycCAgEACioDAgUkAgAFAAABESUAAAFYHgIAAgAvKgAEAAIAAxwKAwQCHAoEAgAcCgIDAhwKAwQBHAoEAgInAgMCAAoqAgMEFgoEAiYqAQABBaI/jBZF7Cr/PAQCASYqAQABBbq7IdeCMxhkPAQCASY=",
-      "debug_symbols": "tZbdbusgDMffhetcYGwM9FWmacq6bIoUpVXWHulo6rsf6HA+KsHZWXd6Uf4xyS82tgkf6qV7Pr899ePr4V3tHj7U89QPQ//2NBz27ak/jNH6oXT6Y1I7bBQHtXONcvEKdBzjJUCjPH2OweTRxdE3CjRnAZAFGhEyRTJFYrFisWJhLYJEhCwcivBZeHmFFzdCBBqdhP0URmsRYgGxgFiMWEx0w8SwDIIIsVC6B5OwWVixWLGwWNhnkXw2IYlowcTxEYhpKrn6KbIFdbJQEpxFWky0SXAW5mq5XBolqXs6TV2XMrfKZczwsZ268aR243kYGvWrHc7Xm96P7XgdT+0UZ2PQ3fgSxwh87YcuqUuzPK3LjxrUNj9t0NgZAMAbBFQQmqwRhibmGcJ+wzAVhvNCCLQ44fDLcbBnITjvi3FQGYFEshRIvCyFMxuC/YGV4P+4EojOzWFoKq6EryBAk3gRNYdSHKHMAD0nBECH+yPhYiQVhLWpb68IG38zwm4bBCqlaYFIELBKidHbQAArSfXSohiW2kS/XU2oFGdY+jQgmYVh7ZZRKc+gCYWhgy4zuNYkgsBVlxm+2S1cZS3AzZ0Knr7HMChuxN2+4keo5RWWvFpYqst/2Q0MDua8ulB2o1ZeOkir2fh1K5aXqTAo5iIziNaMbzaKo1KjmEqJcsxmRrBZdfytF6ZSomjYyQ4adcDit6RWoxACzRANUIS4n/iq+Xs387/EQmGJZfWFvnEDaxuptXOdsjZlR+qZ4SUzTvuiI6ZWIrKhM672sMD/QOCZ4O4l0I0Pj/Gy3ffT5kB9Saipb5+HLl++nsf9avb0+ygzciA/Tod993KeukRaTuXpIPjA1DA/XtLb/gA="
+      "debug_symbols": "tZZLbuMwDIbv4rUX4kOUlKsUReGmbmHAcAI3GWBQ5O4jpaYfAaTpNJ0sot+U/ZkUSVkf1Uv7fH576obXw3u1e/ionseu77u3p/6wb07dYYjWj8qkP+FqR3Ulodq5unLxCkwc4yVAXXn+HANOo4ujryswMgmASRCq0CnWKVaLVYtVixgVrCJMwpEKPwmvr/DqRohANEnYT4HGqFALqAXUgmrB6AbGsJBAhVo43UNJ2ElYtVi1iFrETyL5jCGJaKHE8RFIaSq5+ikmC5lk4SRkEmkxySYhk8Cr5XKpK03d02ls25S5VS5jho/N2A6najec+76ufjX9+XrT+7EZruOpGeNsDLodXuIYga9d3yZ1qZenTf5RJGOnp5HQzgAA2SCggDBsURmGRWaI+A0DCwznlRB4ccLRl+MQL0pw3mfj4DyCmHUpiGVZCocbgv2BlZD/uBJEzs1hGM6uhC8gwLB6EbWEXBwhzwAzJwTAhPsjkWwkBYS1qW+vCBt/M8JuGwQKpWmBWRGwSgmabSBAhaR6bVEKS22S364mFIozLH0aiHFhWLtlFMozGCZlmGDyDCk1iSJo1WUoN7uFK6wFuLlTwfP3GEjqRtztC34UCpTBaVIYjVuqy3/ZDQoO5ry6kHejVF4maKvZ+HXLlhcWGBxzoaHwmvHNRnGcaxQslKjEbE4IwVXH33qBhRIlFKc7aNSBst+SUo1CCDxDDEAW4n7iq+bv3cz/EguHJZbVF/rGDSptpNbOdSoG846UMyNLZpzxWUewVCK6oQut9rAg/0CQmeDuJfCND4/xstl34+ZAfUmosWue+3a6fD0P+9Xs6fdRZ/RAfhwP+/blPLaJtJzK00HwQbgWebykt/0B"
     },
     {
       "name": "set_authorized",
@@ -245,7 +245,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBGJwAABEYlAAAASicCBAQCJwIFBAAfCgAEAAUARBwARUUBLQhEAi0IRQMlAAAAcCcCAgRGJwIDBAA7DgADAAIsAABDADBkTnLhMaApuFBFtoGBWF0oM+hIeblwkUPh9ZPwAAAAJh4CAAQAHgIABAAeAgAEAQoiBEMFFgoFBhwKBgcABCoHBAYnAgQBAAoqBQQHJAIABwAAAK0nAggEADwGCAEnAgUAAikCAAcA71JTTSsCAAgAAAAAAAAAAAMAAAAAAAAAAC0IAQknAgoEBQAIAQoBJwMJBAEAIgkCCi0KCgstDgcLACILAgstDgULACILAgstDgYLACILAgstDggLLQgBBScCBgQFAAgBBgEnAwUEAQAiCQIGACIFAgo/DwAGAAonAgYEAQAqBQYJLQsJCScCBQAACioJBQoKKgoECyQCAAsAAAFYJQAAAeItCAEKJwILBAUACAELAScDCgQBACIKAgstCgsMLQ4HDAAiDAIMLQ4JDAAiDAIMLQ4CDAAiDAIMLQ4IDC0IAQInAgcEBQAIAQcBJwMCBAEAIgoCBwAiAgIIPw8ABwAIACoCBgctCwcHCioHBQIKKgIEBSQCAAUAAAHWJQAAAeIcCgMCADAKAAIAByYqAQABBbq7IdeCMxhkPAQCASY=",
-      "debug_symbols": "tVfbbtswDP0XP+dBJHVjfmUYijR1iwBGErjJgKHIv49KRF8CSPDq7SU+PrKPKfJQkb6at/b1+vFyOL6fPpvtj6/mtT903eHjpTvtd5fD6SjsV2PSDwA2W9rINTTbIFeUe4AEhIA0QqjA5yELChLjBDhQoIy3CjiDQM0WMYGYQQwPgCYzmKJ5AB1CZVAZUibFcwfWKHAKOANnFegnPClIglZAAAU+g6hMVIaV4cyQSWG4BEIGoAykZySZhKBAGVKGOAMrEVIStDEDRwqU8cp4ZQIq8BmkmB/AZcBGgX6C+QGsSYI+gZDB3Qd3oAwqg8qQMpTCkOCtJQXpGRbgUIEy3mUQJB5LCQhj/e22adSQL5e+bZMfJw4V3553fXu8NNvjtes2za9dd70/9HneHe/Xy66XUbNp2uObXEXw/dC1Cd0249um/CqScflt8ZUbBAD8TAIqEkbmrBrGej+I+DjTwIpGiKrAdgwi0OJ5+OhVIcRYnIctS4gRNRUkNRskAs4U3D/IhP+fmSAfhopGHCTc3BOxrCCtoLm04IqJ4EoM8towDXABSokAU6sHazl8ORP1KEZTgKdYjKLiTItmzAWP2fxWMifzeEomVIzJoL5kHOdgYbkj0pKXHTEx5ZMjoOJKB1YlHEx8iWZeDQiVMKJmknicBsWnWlRyyeNixWRHa5OblwMqpmCTVuCHhmFT1MCqM1WCJksN+vlSg7U1E8LozGi/pyF1VQ1Z/soaVKsrjHV1Y5tCXBwGcYChroGLYVTtZViXC4fGFe2FvrpcDP5yJhQ1ljbKpLJPjYJxfaMgr20UMusbhWB9oxCubRSi9Y1S1VjYKORWN0otjKWNUrXXwkah2j+S1EL/kexU42mrtLBRrCk2iq1IBDZalMDIxShsbemxYIaUWoDiNsNirbJuyOik2/hvwjDeDmGYWNz22druU3pFnS6YsShScakcj3T/KQckmm+afsrtbn/oZ4fgWxLrD7vXrs2379fjfjJ6+X3WET1En/vTvn279m1Smp6k5cgi1mLz85a+9gc="
+      "debug_symbols": "tVfbbtswDP0XP+dBJHVjfmUYijR1iwBGErjJgKHIv49KRF8CSPDq7SU+PrKPKfJQkb6at/b1+vFyOL6fPpvtj6/mtT903eHjpTvtd5fD6SjsV2PSDwA2W9rINTTbIFeUe4AEhIA0QqjA5yELChLjBDhQoIy3CjiDQM0WMYGYQQwPgCYzmKJ5AB1CZVAZUibFcwfWKHAKOANnFegnPClIglZAAAU+g6hMVIaV4cyQSWG4BEIGoAykZySZhKBAGVKGOAMrEVIStDEDRwqU8cp4ZQIq8BmkmB/AZcBGgX6C+QGsSYI+gZDB3Qd3oAwqg8qQMpTCkOCtJQXpGRbgUIEy3mUQJB5LCQhj/e22adSQL5e+bZMfJw4V3553fXu8NNvjtes2za9dd70/9HneHe/Xy66XUbNp2uObXEXw/dC1Cd0249um/CqScflt8ZUbBAD8TAIqEkbmrBrGej+I+DjTwIpGiKrAdgwi0OJ5+OhVIcRYnIctS4gRNRUkNRskAs4U3D/IhP+fmSAfhopGHCTc3BOxrCCtoLm04IqJ4EoM8towDXABSokAU6sHazl8ORP1KEZTgKdYjKLiTItmzAWP2fxWMifzeEomVIzJoL5kHOdgYbkj0pKXHTEx5ZMjoOJKB1YlHEx8iWZeDQiVMKJmknicBsWnWlRyyeNixWRHa5OblwMqpmCTVuCHhmFT1MCqM1WCJksN+vlSg7U1E8LozGi/pyF1VQ1Z/soaVHNnGOyNJoxdFheHQRxgqGvgYhhVexnW5cKhcUV7oa8uF4O/3GQqzxpLG2VS2adGwbi+UZDXNgqZ9Y1CsL5RCNc2CtH6RqlqLGwUcqsbpRbG0kap2mtho1DtH0lqoVOxU42nrdLCRrGm2Ci2IhHYaFECIxejsLWlx4IZUmoBitsMi7WOdUNGJ93GfxOG8XYIw8Tits/Wdp/SK+p0wYxFkYpL5Xik+085INF80/RTbnf7Qz87BN+SWH/YvXZtvn2/HveT0cvvs47oIfrcn/bt27Vvk9L0JC1HFrEWm5+39LU/"
     },
     {
       "name": "set_authorized_private",
@@ -2068,7 +2068,7 @@
         }
       },
       "bytecode": "H4sIAAAAAAAA/+2dd2BURdfGc86EFooUFTsRBFGxgL0DSYCoFMHe4possBKSuNkgYI29mwRQELFRRbEi9oIiqMwjSFEpir0X7F2/G1J2UzaZTfZ5LR/vP+91997fmTt3Zu7Mmc0PU1J885oeGRm+8SF/ZkZOMCOQE/IHc3zZ+RkZ+f5Qhq8gNDI3GBjvz8rICwbG+EJ+mA3rzeLCB/pm+zJH9c0d268gJzPFl51dOHNon0H900oKZ58YCOX48/M12eEkIw4ntXMhdejtcNLW9mKHszo6nbWDS6l2dDlpJ5eTOrmclOxU8p2dzursdFYXp7N2cSn8rlJ4T99gIDs7MKL0+4kJRUUTiooWJSfU/T8pnNsnP98fDJ3iD+ZOKCouWZS8T9ag4Ls979jtsSFpCwoLTzq9+76fDBj3eF5xyrs/TNjoXQJzQ93Y1Xu+P6oh2BujYhMrDmqpiPlDcvP9gazcnF5D/MHRBSFfKJCbUzKxsmK84lYed6086hbx/Y0TYYpgimFKYCZULfmEkvqrcFeHc7wITnUwsV5Uw+og8rg44rgk4niCVw+TYG6CuRlmctV6KHG4x12c7nCKQ5usv7l7nOTYS9jBqYS31AOSYy92KuEtvat2SSkunDUskDMi21/WI+orrUtdJWxijs7L9l4tU906vEvRp1YbTVqQi35r7GNV8QSnYnhstwJPq79pNCz+tCKHPh07eapHnuDUnqc6nTXN6azbHJ5So1pOQv2nRLSb2zntxrvR20ucWs3tTmfdQWhbXhnvKHaNXs9JCf/LZ3Yn7Znd6VYfd8b4NBynL3fVHbt1z8kP17ip+qilD9mlISY4lXA6aXJxV8Tx9PASptoUawbMTJhZMLNjn2J5ExOns2Y41cMcUj3MiTieGXE8K+J4tlcTd8PMhbkH5t6q/U4nxfqWdXmiMSE13kDvycUfeXe8kV3rB/KWU/NinB84Yu+LitVKbOOWU96DiDieF3F8n9fK74d5AOZBmIeqtnJvzTGzTzDoG1f8tz1ur3Bxe+BV7i1xUtzbXRhYT2mWjE3vSKgGwsTf+ZZKiSXhmcPD4cP58VvrPNyAhaR3lVMffCROZXwkuWo7axLzemy+y3qsvF/CLGho9cY2fCyoY/h4FOYxmMdhnmjI45nv9HgebcjIW3/wBXXHntO11w0NGdCfrDt2+rqNwxuCfSoq1lRWQkMe9JO1pN2qvjGe8h7z0zDPwDwL81zVFt405hb+NOcd7tbeHnGq6oVxGg4WJjfkQT9fd/QZV86Z2hDsC3VjfTeNOr8h2EVRsU0qDhrULJ+POH6h1ia6yGuWL8IshlkC81Lsi5VuTi3mRadaeDnWESp+CevFTgV8hbSWejni+JWI4yURxy95D2opjIUBzKtVx49mFbPMifX2+dIWGrfpmhuoW7xAu8Z/Arf07xxHFzo1umVxGkeXVZtWNS/++yqrkVsF9VdJZL59efymz8sbmJaf6vYaeI2dvHQKEVF1K1hbFa95bLcCr6RsVXjxVxbFWttJJZW17ZLP3LRtMSUeLVo2lcVxIbnp5IiF5Krw4er49YRVbqetTo45DVzWYdwSpcvq7lYlGzedtcqp8612eASxN7SVpeGd4ruV8nVKd1zugd2GqDcasL9XP7U0vts7c7lTKd9sQCnrj+0+kK9p5NBSf1luKx9aGjt/aNTQsjZ8uC5+Q8tat9PWJTfsEd7mtpHsNrSsdWKtowwtXqdZ63Yvbp3G7V7WN2Qu7IB1OustyuhX2ijc+tLbMY4rJU7xl3nDqtOJb3oji1tBN8S6lHYbfd1+XbG8IcHr3R12KGB3RmBxCLwbI7A6BN6dEdg4BN6D0cB6ODWvSbGGdpmC78moyESHwHsxAjdxCLw3I3BTh8D7MAI3cwjckxG4uUPgXozALRwC78sInOQQeD9G4JYOgfdnBG7lEPgARuDWDoEPZARu4xD4IEbgLRwCH8wI3NYh8CGMwO0cAh/KCNzeIfBhjMAdHAIfzgi8pUPgIxiBt3IIfCQj8NYOgXszAnd0CNyHEXgbh8B9GYG3dQicwgi8nUPgVEbg7R0CpzEC7+AQuB8j8I4OgfszAu/kEHgAI3Anh8DpjMDJDoGPYgTe2SHw0YzAnR0CH8MI3MUh8EDGonsQAzqYkZkY4pSZuIXxdHZxKN6xjHseGofthZqhS5w2hLyU6HqnE9/ykrIurWIYJXPrpeDXuG5wbXCp8+Pitr0Uc785ngE9gQE9kQE9iQE9mQE9hQE9lQE9jQE9nQE9gwHNYEDPZEB9DOhZDGgmA5rFgPoZ0OEM6AgGdCQDGmBAz2ZARzGg2QzoaAY0hwHNZUDzGNBzGNAgA5rPgIYY0AIGdAwDei4DOpYBHceAjmdAz2NAz2dAL2BAL2RAL2JA7cUUaiGFegmFeimFehmFejmFegWFeiWFehWFejWFeg2Fei2Feh2Fej2FegOFeiOFWkShFlOoJRTqBAp1IoVK+bGivYlCvZlCnUyhTqFQb6FQp1Kot1Ko0yjU2yjU2ynUOyjUOynUuyjU6RTqDAp1JoU6i0KdTaHOoVDvplDnUqj3UKj3UqjzKNT7KNT7KdQHKNQHKdSHKNSHKdT5FOojFOoCCpViuLKPUaiPU6hPUKhPUqhPUahPU6jPUKjPUqjPUagLKdTnKdQXKNRFFOqLFOpiCnUJhfoShfoyhfoKhbqUQrUUKijUVynUZRTqcgr1NQp1BYW6kkJdRaGuplBfp1DfoFDfpFApP0G2aynUdRTqegr1LQr1bQp1A4X6DoX6LoX6HoX6PoX6AYX6IYX6EYX6MYX6CYX6KYX6GYX6OYX6BYX6JYX6FYX6NYW6kUL9hkL9lkL9jkL9nkL9gUL9kUL9iUL9mUL9hUL9lUL9jUL9nUL9g0L9k0L9i0GFw78Q1yCscLDKwRoONpGDbcLBNuVgm8WKjZfmENKcEbqrU+gWnMpMqrt83a9c8FlDsC1j/XcXnQSc0qrE5e/D72/IU6o/eGun4PM5wds4BZ/CCb6FU/CHOS20LQfbjoNtz8F24GC35GC34mC35mA7crDbcLDbcrDbcbDbc7A7cLA7crA7cbCdONhkDnZnDrYzB9uFg92Fg+3KwXbjYHflYLtzsLtxsLtzsHtwsD042D052L042L052H042J4cbC8Odl8Odj8Odn8O9gAO9kAO9iAO9mAO9hAO9lAO9jAO9nAO9ggO9kgOtjcH24eD7cvBpnCwqRxsGgfbj4Ptz8EOaEhKNT5pb4rh2C00xXFsnEI3yHJcP/YYp2TqUk7wgU7BF3Ja8CAOdjAHO4SDPZaDHcrBDuNgj+Ngj+dgT+BgT+RgT+JgT+ZgT+FgT+VgT+NgT+dgz+BgMzjYMzlYHwd7FgebycFmcbB+DnY4BzuCgx3JwQY42LM52FEcbDYHO5qDzeFgcznYPA72HA42yMHmc7AhDraAgx3DwZ7LwY7lYMdxsOM52PM42PM52As42As52Is42Is52EIO9hIO9lIO9jIO9nIO9goO9koO9ioO9moO9hoO9loO9joO9noO9gYO9kYOtoiDLeZgSzjYCRzsRA52Egd7Ewd7Mwc7mYOdwsHewsFO5WBv5WCncbC3cbC3c7B3cLB3crB3cbDTOdgZHOxMDnYWBzubg53Dwd7Nwc7lYO/hYO/lYOdxsPdxsPdzsA9wsA9ysA9xsKS/OZzPwT7CwS7gYB/lYB/jYB/nYJ/gYJ/kYJ/iYJ/mYJ/hYJ/lYJ/jYEm/tXueg32Bg13Ewb7IwS7mYJdwsC9xsC9zsK9wsEs5WMvBgoN9lYNdxsEu52Bf42BXcLArOdhVHOxqDvZ1DvYNDvZNDnYNB7uWg13Hwa7nYN/iYN/mYDdwsO9wsO9ysO9xsO9zsB9wsB9ysB9xsB9zsJ9wsJ/G+ud2btjPOKX9nIP9goP9koP9ioP9moPdyMF+w8F+y8F+x8F+z8H+wMH+yMH+xMH+zMH+wsH+ysH+xsH+zsH+wcH+ycFyvMTK8RIrx0usHC+xcrzEyvESK8dLrBwvsTbjYJtzsByfsCZxsC052FYcbGsOtk2sWCcnhLrZfTl7gNqWc0/tnO6Jsx+v7TlYjgNYOQ5g5TiAleMAVo4DWDkOYOU4gJXjAFaOA1g5DmDlOICV4wBWjgNYOQ5g5TiAleMAVo4DWDkOYOU4gJXjAFaOA1g5DmDlOICV4wBWjgNYOQ5g5TiAleMAVo4DWDkOYOU4gLUXB8txACvHAawcB7ByHMDKcQArxwGsHAewchzAynEAK8cBrBwHsHIcwHokZRdWOQ5g5TiAleMAVo4DWDkOYOU4gJXjAFaOA1gHcLDpHOxRHOzRHOwxHOxADpbj0lWOS1c5Ll3luHR1KAfLcekqx6WrHJeucly6ynHpKselqxyXrnJcuspx6SrHpascl65yXLrKcekqx6WrHJeucly6ynHpKselqxyXrnJcuspx6SrHpascl65yXLrKcekqx6WrHJeucly6ynHpKselqxyXrgY5WI5LVzkuXeW4dJXj0lWOS1c5Ll3luHSV49JVjktXOS5d5bh0lePSVY5LVzkuXeW4dJXj0lWOS1c5Ll3luHSV49JVjktXOS5d5bh0lePSVY5LVzkuXeW4dJXj0lWOS1c5Ll3luHS1hIPluHSV49JVjktXOS5d5bh0lePSVY5LVzkuXeW4dJXj0lWOS1c5Ll3luHSV49JVjktXOS5d5bh0lePSVY5LVzkuXeW4dJXj0lWOS1c5Ll3luHSV49JVjktXOS5d5bh0lePSVY5LVx/iYDkuXeW4dJX0t3scl65yXLrKcekqx6WrHJeucly6ynHpKunvaDkuXeW4dJXj0lWOS1c5Ll3luHSV49JVjktXOS5d5bh0lePSVY5LVzkuXeW4dJXj0lWOS1c5Ll3luHSV49JVjktXV3CwHJeucly6ynHpKselqxyXrnJcuspx6SrHpascl65yXLrKcekqx6WrHJeucly6ynHpKselqxyXrnJcuspx6SrHpascl65yXLr6KQfLcekqx6WrHJeucly6ynHpKselqxyXrnJcuvotB8tx6SrHpascl65yXLrKcekqx6WrHJeucly6ynHpKselqxyXrnJcuspx6RqOS9dwXLqG49I1HJeu4bh0DcelazguXcNx6RqOS9dwXLqG49I1HJeu4bh0Dcela9pwsFtwsG052HYcbHsOluO/NRz/reH4bw3Hf2s4/lvD8d8ajv/WcPy3huO/NRz/reH4bw3Hf2s4/lvD8d8ajv/WcPy3huO/NRz/reH4bw3Hf2s4/lvD8d8ajv/WcPy3huO/NRz/reH4bw3Hf2s4/lvD8d8ajv/W9OJgOf5bw/HfGo7/1nD8t4bjvzUc/63h+G8Nx39rOP5bw/HfGo7/1nD8t+ZIDpbjvzUc/63h+G8Nx39rOP5bw/HfGo7/1nD8t4bjvzUc/63h+G8Nx39rOP5bw/HfGo7/1nD8t4bjvzUc/60ZysFy/LeG4781HP+t4fhvDcd/azj+W8Px3xqO/9Zw/LeG4781HP+t4fhvDcd/azj+W8Px3xqO/9Zw/LeG4781HP+t4fhvDcd/azj+W8Px3xqO/9Zw/LeG4781HP+t4fhvDcd/azj+W8Px35ogB8vx3xqO/9Zw/LeG4781HP+t4fhvDcd/azj+W8Px3xqO/9Zw/LeG4781HP+t4fhvDcd/azj+W8Px3xqO/9Zw/LeG4781HP+t4fhvDcd/azj+W8Px3xqO/9Y4+W8H+kfnBsel5wRCE5LWm+Hdd9t9jx577rX3Pj177bvf/gcceNDBhxx62OFHHNm7T9+U1LR+/QekH3X0MQMHDR5y7NBhxx1/woknnXzKqaedfkbGmb6zMrP8w0eMDJw9Knt0Tm7eOcH8UMGYc8eOG3/e+RdceJG92BbaS+yl9jJ7ub3CXmmvslfba+y19jp7vb3B3miLbLEtsRPsRDvJ3mRvtpPtFHuLnWpvtdPsbfZ2e4e9095lp9sZdqadZWfbOfZuO9feY++18+x99n77gH3QPmQftvPtI3aBfdQ+Zh+3T9gn7VP2afuMfdY+Zxfa5+0LdpF90S62S+xL9mX7il1qrYV91S6zy+1rdoVdaVfZ1fZ1+4Z9066xa+06u96+Zd+2G+w79l37nn3ffmA/tB/Zj+0n9lP7mf3cfmG/tF/Zr+1G+4391n5nv7c/2B/tT/Zn+4v91f5mf7d/2D/tX5AEiEAUYiCJkCaQppBmkOaQFpAkSEtIK0hrSBvIFpC2kHaQ9pAOkC0hW0G2hnSEbAPZFrIdZHvIDpAdITtBOkGSITtDOkO6QHaBdIV0g+wK6Q7ZDbI7ZA9ID8iekL0ge0P2gfSE9ILsC9kPsj/kAMiBkIMgB0MOgRwKOQxyOOQIyJGQ3pA+kL6QFEgqJA3SD9IfMgCSDjkKcjTkGMhAyCDIYMgQyLGQoZBhkOMgx0NOgJwIOQlyMuQUyKmQ0yCnQ86AZEDOhPggZ0EyIVkQP2Q4ZARkJCQAORsyCpINGQ3JgeRC8iDnQIKQfEgIUgAZAzkXMhYyDjIech7kfMgFkAshF0EuhhRCLoFcCrkMcjnkCsiVkKsgV0OugVwLuQ5yPeQGyI2QIkgxpAQyATIRMglyE+RmyGTIFMgtkKmQWyHTILdBbofcAbkTchdkOmQGZCZkFmQ2ZA7kbshcyD2QeyHzIPdB7oc8AHkQ8hDkYch8yCOQBZBHIY9BHoc8AXkS8hTkacgzkGchz0EWQp6HvABZBHkRshiyBPIS5GXIK5ClEAsB5FXIMshyyGuQFZCVkFWQ1ZDXIW9A3oSsgayFrIOsh7wFeRuyAfIO5F3Ie5D3IR9APoR8BPkY8gnkU8hnkM8hX0C+hHwF+RqyEfIN5FvId5DvIT9AfoT8BPkZ8gvkV8hvkN8hf0D+hPwFTYAKVKEGmghtAm0KbQZtDm0BTYK2hLaCtoa2gW4BbQttB20P7QDdEroVdGtoR+g20G2h20G3h+4A3RG6E7QTNBm6M7QztAt0F2hXaDfortDu0N2gu0P3gPaA7gndC7o3dB9oT2gv6L7Q/aD7Qw+AHgg9CHow9BDoodDDoIdDj4AeCe0N7QPtC02BpkLToP2g/aEDoOnQo6BHQ4+BDoQOgg6GDoEeCx0KHQY9Dno89AToidCToCdDT4GeCj0Nejr0DGgG9EyoD3oWNBOaBfVDh0NHQEdCA9CzoaOg2dDR0BxoLjQPeg40CM2HhqAF0DHQc6FjoeOg46HnQc+HXgC9EHoR9GJoIfQS6KXQy6CXQ6+AXgm9Cno19BrotdDroNdDb4DeCC2CFkNLoBOgE6GToDdBb4ZOhk6B3gKdCr0VOg16G/R26B3QO6F3QadDZ0BnQmdBZ0PnQO+GzoXeA70XOg96H/R+6APQB6EPQR+Gzoc+Al0AfRT6GPRx6BPQJ6FPQZ+GPgN9FvocdCH0eegL0EXQF6GLoUugL0Ffhr4CXQq1UEBfhS6DLoe+Bl0BXQldBV0NfR36BvRN6BroWug66HroW9C3oRug70Dfhb4HfR/6AfRD6EfQj6GfQD+Ffgb9HPoF9EvoV9CvoRuh30C/hX4H/R76A/RH6E/Qn6G/QH+F/gb9HfoH9E/oXzAJMN47WWEMTCJME5imMM1gmsO0gEmCaQnTCqY1TBuYLWDawrSDaQ/TAWZLmK1gtobpCLMNzLYw28FsD7MDzI4wO8F0gkmG2RmmM0wXmF1gusJ0g9kVpjvMbjC7w+wB0wNmT5i9YPaG2QemJ0wvmH1h9oPZH+YAmANhDoI5GOYQmENhDoM5HOYImCNhesP0gekLkwKTCpMG0w+mv7ex723Cexvm3ua2txHtbRp7G7zeZqy3ceptcnobkt7mobfR523KeRto3maXtzHlbSJ5Gz7e5oy3keJtengbFN5mgpf495L0XkLdS357iWovqewlgL1krZdY9ZKgXsLSSy56iUAvaecl2LxkmJe48pJMXkLIS954iRYvKeIlMLxkg5cY8Bbx3oLbWxx7C1lv0ektEL3FnLfw8hZJ3oLGW3x4CwVvUu9NwL3Jsjex9Sah3oTRm9x5EzFv0jR3qD9UEMxJ9YV86xO6J4iaxCZNmzVvkdSyVes2W7Rt177Dlltt3XGbbbfbfocdd+qUvHPnLrt07bZrUdHkksIZfTIDwY4ly5Y3+/z7pYtHFBWVf7RtzY961fxo/5JlI9d+mmHfHjO74qMDSpZdPXhQ6p5Xr0+s+Oiwmhf2q/nRGSXLvizY4oAV2Dl7fUJm4dy0sXlBf35+IDdnQlH9/yLAkFgvGBnrBb5YL8iP9QJ/rBckx3pB5j+vlnJivWDEP69as+hFCtEjZP7zipRFf3C59NYac5GGx3pBAf0e+E0j8B94cOfSbzpEH71jvum8za/df8Rrlz/cj4r1gr3o1ZpOH1uT/3ldNEDvD8n/gSLF3B/G0ke+/5czsh70J11Ab3z890OXWC84lf4WzaZfEPMULuYJVsbm2QyjljYnEVwuOD3WCxKmlqzp7tu0Y5qRmTs6zxcKnJXtz8gN+jK9/xvjD5aCMs4N+vLy/MH1CW0LZ6bk5uSHJhTOSg0E/ZkhLZydnhPyj/AHpx+/b6/6N1urXy8xXX9xWvXrE2KLn1Y4I8WXnV3cspIzZ6g/27vpMf4Y7yShJsHESri3tCxZXv40JTdvXOUtpUWWKQJeVvI2jS55WhxKPmNYKDevuCRKSas9o5SZ/QL+7Pp/U7119QtTHS+UWWWp6MJ7+uUG/YEROaU1NWnNbr7xIX9mRkEoO6OshadUNvDBm9r3CWXN+4RepengeWUb/H2yskq7T2XZo3yeWlI4a1hgdF62v6yMVf+rvDwla5ID+Rn+sf7MglBpNwrkZAT9Xp8q62N5I335/v9Cl2psc5KahMT4dKWUyDJFwL2uFNk+wweRUQunD8wdU6WJV55W1hVbl59R0SQiT21snaQ2uk6kZietUgdV+0q3sr6SFxyTEchPq2ix6TlDK9vrkNLmWly9O4TZxRVdoLKYdx3fM/r5WvP82is9HKGyV3X1jw6EMnwFoZG5wcB436a+5cvPyB0+PHOkz+tk/uHDveexPqH339y10hvZtdLLG1q7mo2hWWykJjUJzePTxVIjyxQBr9rF0sIHTl0stfo3Jgyo9k1ixTf9qn/TpOKb/tW/aVrxzYDyGu7Q6Ldq+v/8rRobvaL3VK+KZuG23dgm4o0pfQM5vtIfyYUG502qBE/3Ov+mp10ZKSLCvPScrLL7aVwLl2rBwyEqw9e8Z606Cj4eHgRH+EMDfPkjh3hfjvaN8Ma9uwf4fXl9gkHfuIjKa+6NejPLPiyuOgMw0Ue+xGqnVnSViEoJP/XyUxr/io1SOy1qq53ISecxub6siDtuEXnY2FJptFIlxViqpMjDKExTRztIqUE0tfW88IUuE9Ohy5I7Ve9tLevoba1iq7yk2Htbq+i9rWWc2lOrmrXcMtzbqtVG68iizfQGv6C/9m+bRQvXuma41uFwdSGbxB/ZNP5IjT+yefyRifFHtog/Min+yJojkUa2+yjxtGY8rSNeS4fmoHV2uyovuafCq+LSafTg8klz2qY5c1FRlDedtoj2pmsRXuzm+0MZ3iphpPcGLXttVuSRKvNHXf97i93EWN95NQhN4r7YTYyEN3Zmm9LoEkvUOXstr8GmjZtDOLwGm0Z/DSbG6TXYtGZ/TKz+Giz/TxP5YKp8kxhZ5CrfNIl8FGUrmI51rJwTo66mUsuv7vwvyCrW+pybVX/OJlxHVaqsefiEKp+3CNf2jKMKRucVd6oY08s/bxomVAzN1S9tWnvZmlcvW/OIIbm2C1pUv6BFPRckzTnGW1ocN9KXU2sYb35bekvpwyuLnLR9Zaq09oabWOe7KdpqKb/qaqk0nVrrWyRRouePSqK8X6T21OozmV4ZvOCBMb6QP2N4QU5meYo15A/m+LLXJ3T7m181RzXyVXPUPzjpk1Lruqx60ic1fFAl6VP1rH7hgzrO6h8+iEgv1pGijT7iRXsXpUXNH/WLmj/qXz5+bll1UBkQdUxPr3NdGePrZ0Cj38xac8ytMnfgJYvMvz1Z9HR4+CsdioaUjUT9ygeiaAkjjTaN1knRU+XRB83oSaao3zSJ+k3TSbXvaVXtl+6nVOmpjZ1fSEx5nYgodWZ2qqfeEqPNXmqcGTm9ipLHM9FuttGVoTG8vuusjMQ6JolVJl81htPwdRVv5BnZHvs/ucT7x+9n1rdT2T6GzhOZimjkbaTGbeVYc61koq6VEutdK233L9iejTZ/kThkIGJ+8yZGf/PGayOilpHLxGubJlGivXXFZYO6fHivf2f6f7VE7fyfXqLuFN7nz8kNBYaPy8gM+r2pVVZGTkF2dmB4wB+syCvmBXPHjpv2N79wUhv5wkn9D75wGv/7ulR+PqnKD2CSw4NKWatLKWt0gyraXGlq3HWs+DelxAc0svkOaHTja/L/MCWeSEyJN9mcEm9ESrx/3FLiAzanxDenxOtNiSfGnhJPjPK26VH+Q/4xvuxAVkZewVnZgcxNyamM0pGx2ptn87Rp87Sp9nuKZdrUJdziyxrfCaVtb8impldRNQ2ZOT1Q9jLyzvC2dEp/gjylenPZqpHNdcv4POqEcHkqwdU7luOfMSQUzisbgTadPjhvYuX4PCvtnAJfdn6NmFpjNDPNa3RL1z+iiBY9YXpqYEy4k1eWoaKZVN52RUWUPBH58DZVccY5Bd6k2p8Tmly9eEkN/flE+fUt4/wYk8LgKPWhc8sDRlRLQrh+olwl0wcWZEc8t3pPH1ZwVi30Ki/qiHZQ7WFU/vgn6f8AAE53etWrAQA=",
-      "debug_symbols": "tVvbbhs5DP0XP+dBFC+i8ivFokhTtwgQJIGbFFgU/feVZiTN2FnRisd5CenLHFMUSVEk82f3ff/t7efXh6cfz792t1/+7L4dHh4fH35+fXy+v3t9eH5K7/7ZufwHaHeL7u/NDqZXuLv1Mb3y06u4u6XEu5nATPxMcCY0E97dxkRkdwuQaChUC40zRVcoFOoLxUITGvhEuVApNBSqhcaZkisUCvWFYqEFjwoeFTwqeFTwqOBxweOCxwWPCx4XPC54XPC44HHG00TjTMUVmvGSfiTjZfViVm9ebVmsT+9Rfi/r2sOs7In6QrFQKpQLTRJ4mjU+US00SeB51vhEodCMF2aNTzTjhfTrPG14fjrJmzc+00kaLdJokUaLNJqekump/Gk2ofA/q9L6DfibXlX7+/p62O/zJyuDTGb6cnfYP73ubp/eHh9vdr/vHt+mL/16uXua6OvdIX3qbnb7p++JJsAfD4/7zP29WZ52/UeFpTwcXGiPQ6RRANZYAMSvAHRYAqAQQ4EAUi8NhP0RBvYxAnFdReCLhGBQqkKwB+4JwX0M8ogFgtBBQyA4FkP6EBikQqCi70KE7RBqQHipe4pe1xD+Qn166ukTLNt0rNW2nCzGhR9AIN8QmDsI9jqaOtM6ELrrMKwTGao6ZWWd8WQd1EeIBNVFIqF2dwQM84zi6q5GQexjGPbJ4qo+WYD6GIaBeqzhyvPatnBcn75ZuGhXn+5z4iVWk1S3rB9S1BkEUK3Ca9QugPfG8qUGOwyrLXDxGMFQoG/h0q/c6h3CmAyKXQRDDdFXgIjSV4NsXYT7xENDYt3KQHFlhzoeXZy04KJriPFFxLYT6vyyFQDHmkQwxEBdDmB/kRjeQ9WF9yurzBZ6JIZ1iEv1y6DQDS1ohUlsUZLdJceWR6kIPj/W1aZllyDaVLFKiRSOIYK1Drd4By1iIJ+IYRzi0VHdkeii62NEw8tpSSWWWOVFjhDIUGjKg6pC0Xm+DANcNQwENDCMeMUANR3hdKavvH1cDCFZjnG6bCnSMhoUuVClAks6sfL4D2HEpg6Mq9j1DiN8rkpjaEuJoS+G5bFE1Dx2faCeeCxbYThZZt2WxMdlb9PBMg5CLRKDS1eIHoh1l/JcvYX9+jw4XYx1tiuGFsOUVtep08WYIMH7BhJWzj++GApUlUoKSwDi4/OVjVCacm+oOWviCbu3MsNOIZlIS+GTjXBXIWrd7WoIIuBlY/jSpawy35OliJU0QTsW/PoS8AEpiNpRLxRcVwp/hXsubr+lCl0Bg7dfdc8otVlHVmrXSsW6FXnXCikpmSLtguj2vEHi9rwhuK15Q4DteYOJMZg3BNx8yJliDOYNNsZY3mBjjOUNJsZg3hD0c1U6mDfYXisKzWuDdCtUNkgI7WwRxdgDUSOeQpB2eUp8hMtA2LccJnA/CKkRUTlqrC7DMbruUam8+f6jsj2Oadgex1S3xjGN253fxhhzXBNj0HHj9juULcaY49pGuqRBieduth6tWj3ykpt2az9nxBBqtWXX95UYrGoitfxDUjHzMpC0hHpYJp66ChmPH4Fdv2BvXYKwFXch2eoiSPwIRmz3KFrVmN9h+M0xCBxaFUrxLdteBeXTAJIufttbGLg9GIKT7dEQXNgaDsHp9nh4BmQsINoggxERADaHxDOCjMXEM06ztNsMp7EjQFgKGCFEf1EaotBiUeKle40Bq83kPUdYysnQD0ZwhSoqwBXKqACb66jgr1BItUEGb0Tgt6cBtiCjYcBfoRB6xl4DLfYau8MHYLWiUuvRt+JO6md1T2DwVkFVdUkFVk2YDwlCTbGJF+wLYpirOm4VnszTJdU/XSpmytir/oHZl0o9GFgqd2HVj3Gn3Xe/dQjgjCTcEsbEh2BIQmZ7qaUltGrBn6YlyFeIaniNdAC3pwNWk2o4qpkgo1HNakWMRjW8RnJjg4yVes6ADGZIeI0MifiT9TqaIZ1x4bgEE1mFpHcuTLr14nhGEmld5nQgQOxLYjWcQsKplpL4/t0RGK4Q68/IgtrmCIHQ9VGMmw61OUDm9QE4PouYOoANYSXEaf8MmK/QQDuDQi2xSHvj8UIUXtqbmm6QF8uCK5RwIcr2niDT0uBk7M9XWKYmoY3tyKpVO0H8k17e3T8cjse6QXJ352YHIfvvzTTUO9E402mcuwz1Uhnq5TJizGXEmP08YjxRySuZR4y5jBhnzeURYy4jxlxGjLkMdXOcR4wnSoUmPIF5qHuiIU8SzUPdE40zzUPdIc5D3RP1OWWYh7rzCFIe6p4oFyp5xG8e6s4OkYe6J5rwYpyHuieah5AdlKnuNtadA/Y0153LbPNgN9bJbqyj3Vhmu30d7s6Fn2m6e2JguoeW+e6JwcpQZTJyPjBFKhMqk5Epj4dn5Kzy4CqTkbPSQ0bOtfmAlcnI2b4CV0YqEyqTkfMBG2Jh1FUGKjMhp19XLD+qVBmuTEbOrVoNldHKxMLEKnOEyvjKVOSYkSUfJL/vDg933x732WKzUb893VcDTi9f/32pn9T/XHg5PN/vv78d9tnYJzvH8udL2h3E7Avc3pEblPxOOPlO9pn/AA==",
+      "debug_symbols": "tVvbbhs5DP0XP+dBvIrKrywWRdp6FwGCtMgmBRZF/32lGUkzdlf0xOO8hPRljimKpCiS+Xn4evz89venx+e/vv1zuP/j5+Hzy+PT0+Pfn56+fXl4ffz2nN/9eQjlD/DhnsKvuwNMr+hwjym/wulVOtxz5sNMYCY4E5oJz0QO9ykTPdwDZBortUrTTClUCpVipVRpRgPMVCrVSmOlVmmaKYdKoVKslCqteFzxuOJxxeOKxxVPKp5UPKl4UvGk4knFk4onFU8KnmWaZqqh0oKX9aMFr6iXinrLautiMb/H5b2ia4RZ2RPFSqlSrlQqzRIgzxqfqFWaJUCZNT5RqLTgxVnjEy14Mf+6TBtens7ylo0vdJLGqjRWpbEqjeWndHqqfFpMKP7Pqqx9A37lV83+Pr2+HI/lk5VBZjP9/vByfH493D+/PT3dHX48PL1NX/rn+8PzRF8fXvKn4e5wfP6aaQb86/HpWLhfd8vTYfyoitaHY4j9cUi8FUAsVQDFFYBtlgA4plghgA21gwieYNAYI7K0VUS5SggB4yaEIMhICBljMBJVCKYAHYHhVAwdQ1DUBkFGOISI+yHMgUBte0poawi8Up/II32CZ5tBrNlW0MW46B0IjB1BZIDgr6OrM6+DYLgOxzpJoKlTV9aZztbBY4TE0FwkMdlwR8Axz6Sh7WpSojGGY5+ioelTFHiM4RgoUgtXKGvbou36xG7hakN9ho+Jl9RM0sKyfshRZyOAWRPekg0BEJ3lawt2FFdbENIpgqNA7OESV271G8I2GYyGCI4aEjaARDpWg+5dRPjAQ0NT28rIaWWHtj26BO3BxdYQ2xeR+k5YwGUrAE41SeCIQbYcwHiVGIjQdIG4sspioSdieIe4Nr+MBsPQQl6YpB4lJVxzbCFpQ8Dy2FCbnl2CWlfFKiUyOIWI3jrC4h28iEFyJoZziKfAbUdSSGGMkRwv5yWVWGIVqp4gsKPQnAc1hVJAuQ4DQjMMAnIwnHiVz8+GwbhOdG27GMq6HON83VK0ZzSkeqVKFZZ0YuXx78JI0LIzSqvY9RtG/FiVptiXkuJYDM9jmbl77PpAPfNY8cJwtsy2LZlPy97mg2U7CPdIDCFfIUYg3l0KpXmL4Po8OF+Md7YbxR7DjFfXqfPFuCARsYPElfNvXwxHbkplgyUAyen5Kk4ozbk3tJw180zDW5ljp5BNpKfw2UZkqBDz7nbd1kGWjZFrl7LKfM+Wol7SBP1YwPUl4B1SMPejXjmGoRR4g3su7b+lKt8AQ/ZfdS8otVtHUerQStW7FWHohZScTLENQWx/3qBpf94Qw968IcL+vMHF2Jg3RNp9yLlibMwbfIxteYOPsS1vcDE25g3RPlalG/MG32vVoHtt1GGFygeJsZ8tapRGIObEU4jaL0+ZT3AdiGDPYaKMg5A5EVURAvRqLsAwdzDZff8x3R/HLO6PY2Z745il/c7vY2xzXBdjo+Om/XcoX4xtjnvBSFEXI9VhPpe8Wj3JkpsOaz8XxIjSxcCxr6Todl+s6TSH+HQdSA483WvVZJisb48fUcK4YO9dgqgXdyHb6iJIeg9G6vcoXtWYf8PA3TEIAnkVSsWeba+C8nkAyRe//S0M2h8MIej+aAgh7g2HEGx/PLwAsi0g+iAbIyIA7A6JFwTZFhMvOM3SbnOcxo8AcSlgxJjwqjTEoCfumdfhNQa8NhOiJFjKyTAORnCDKirADcqoALvrqIA3KKT6IBtvRID70wBfkK1hAG9QCL1gr5EXe03D4QPwWlG59Yi9uJP7WcMCImD0Jin6UbFuiaV3CcJdsZlXGgvimKshL03KzPM11T9bKmYmNKr+gduXyj0YWCp3cdWPCefdd9w7BHBBEukJY+ZjdCRht73U0xJeteDP0xKSG0Q1ukU6QPvTAa9JtTmquSBbo5rXitga1egWyY0Psq3UcwFkY4ZEt8iQWD5Yr1szpAsunJZgoquQ9JsLs+29OF6QRHuXOR8IkMaSeA2nSAjNUjJPw3swCNwg1l+QhajPERJZGKN4xdY+ByiyPgC3zyLmDmBHoDDsn4HIDRpoF1C4JxZognQliiztTcs3yKtloRVKvBJlf09QeGlwCo3nKzxT0152ybVSPoX4M798+PL4cjrWDVq6O3cHiMV/76ah3ommmU7j3HWol+tQr9QRY6kjxoLziPFEtaxkHjGWOmJcNFdGjKWOGEsdMZY61C1pHjGeKFea8RTmoe6JxjJJNA91TzTNtAx1xzQPdU8US8owD3WXEaQy1D1RqVTLiN881F0cogx1TzTjpTQPdU+0DCGXgu801d3HukvUn+a6S7dxHuymNtlNbbSb6mw3tuHuUviZprsnBqZ7aJ3vnhhqDDemIJcDU7UxsTEFmct4eEEuKo+hMQW5KD0W5FKbj9SYglzsK0pjtDGxMQW5HLAxVcZCY6AxE3L+daP6o8aNkcYU5NKqtdgYa0yqTGoyJ2gMNqYhp4Ks5SD58fDy+PD56Vgsthj12/OXZsD55eu/39sn7T8Xvr98+3L8+vZyLMY+2TnVP3/k3SEqviD9Hb0jLe/Es+8Un/kP",
       "verification_key": "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAANsAAAAAAAAAAAAAAAAAAAANcxRZTxUIPDfgUGZWV1ofMQAAAAAAAAAAAAAAAAAAAAAAB/O8Bp8lv8Pn2g2XUGMPQAAAAAAAAAAAAAAAAAAABxanqlMkGPcss/Pu4YY9X6mAAAAAAAAAAAAAAAAAAAAAAAcLlApryWGo6DavcdN31YAAAAAAAAAAAAAAAAAAACMILHXFnHP6kq/VlbJyRIISAAAAAAAAAAAAAAAAAAAAAAAKPENgzACMJynso5Q2izsAAAAAAAAAAAAAAAAAAAAa64yrOIhQyw0FOMnPbrveXwAAAAAAAAAAAAAAAAAAAAAAAP2pMIXwOczO6EFhtcU5AAAAAAAAAAAAAAAAAAAAAH/9LPB/JbEfbqBoJr1bO2uAAAAAAAAAAAAAAAAAAAAAAALyoKQ5nEnF4+Wpr5O+WwAAAAAAAAAAAAAAAAAAACLr/9B7EZgQZebbqu8sFdE3AAAAAAAAAAAAAAAAAAAAAAABG3a+jK3QB/zNpZpgQJyAAAAAAAAAAAAAAAAAAAA5lbvqD/st9SlUffosLw3KVkAAAAAAAAAAAAAAAAAAAAAACnuwmhtw+ajIZCL90mVjAAAAAAAAAAAAAAAAAAAAODHlL5mT5G1ObZxjAOAnJN2AAAAAAAAAAAAAAAAAAAAAAAguHf9p5Y2klBUjRuhCVcAAAAAAAAAAAAAAAAAAAAFmEhrQz8r9fN1TJHcQE8epwAAAAAAAAAAAAAAAAAAAAAAByaPUw8/T8W7QW1DsHPQAAAAAAAAAAAAAAAAAAAAVfFvT9yz6u8v5Ct6wPPgBX8AAAAAAAAAAAAAAAAAAAAAABXyq9jATGEsKlU4jNOwMQAAAAAAAAAAAAAAAAAAALj18uKYbr+bMHMGcWM43nqsAAAAAAAAAAAAAAAAAAAAAAAn/UMAP/ASLDWjc8pZE0oAAAAAAAAAAAAAAAAAAACKofwHpYS1j3YNfk+Fd0jx8gAAAAAAAAAAAAAAAAAAAAAACqH0/bav875EO9SVW+IBAAAAAAAAAAAAAAAAAAAA0keFgXt5FOJa1FRGgAxYVSUAAAAAAAAAAAAAAAAAAAAAACKRtL5tI6UPJuhJdxShmQAAAAAAAAAAAAAAAAAAAJ/tqrZEtOwjVpiZTTg72iwPAAAAAAAAAAAAAAAAAAAAAAAZxnq60zGT9tq/8MzLh3gAAAAAAAAAAAAAAAAAAAAKqkPy4/OpejCszOmQz8W59QAAAAAAAAAAAAAAAAAAAAAAA9i+k7nZPFe1a95MIf/FAAAAAAAAAAAAAAAAAAAA1HlT90lD0eflyvrX/MoNLasAAAAAAAAAAAAAAAAAAAAAAC6eWtz86hE5NuBCecKeUgAAAAAAAAAAAAAAAAAAAGjYgotZbo6O3crH5wOVQRjuAAAAAAAAAAAAAAAAAAAAAAAiABgZIb9OVOy8aICWa6gAAAAAAAAAAAAAAAAAAACkyBfKcOm3I4n2OulpELouBAAAAAAAAAAAAAAAAAAAAAAACJEZfmKcd8AmeQEmosLHAAAAAAAAAAAAAAAAAAAADpsDepDgSnBBS07ZDxDKSvsAAAAAAAAAAAAAAAAAAAAAAAUWkxuq43kQdhRFySJ63AAAAAAAAAAAAAAAAAAAACxDmTyQCFa3sJFixNpLsMzxAAAAAAAAAAAAAAAAAAAAAAAUO4Hq7MW8wSCQTK0yhGkAAAAAAAAAAAAAAAAAAAByCQkrGf2yoO0k4h2gmOdpwQAAAAAAAAAAAAAAAAAAAAAACBlgQptvteSHUIgVaMSoAAAAAAAAAAAAAAAAAAAAVJGWQjP80PfqJe0ay9le5M8AAAAAAAAAAAAAAAAAAAAAACPf/XNYqq17eQ2WcqycAAAAAAAAAAAAAAAAAAAAANnst0fVuELwl6Sec9V/FRqRAAAAAAAAAAAAAAAAAAAAAAAwENlOSTvtCDYS60zQN0UAAAAAAAAAAAAAAAAAAABcpIGWlRGTJYiZNq6FWPOTxQAAAAAAAAAAAAAAAAAAAAAAKGJMehTm4+VZTdHZc0IcAAAAAAAAAAAAAAAAAAAAWzk4ReqvyEAAFTXcX6HcIuQAAAAAAAAAAAAAAAAAAAAAAA5K+Oq+BooXpGZ1ijOykAAAAAAAAAAAAAAAAAAAAM+bCunLFTo9I0l3nKQLaUrFAAAAAAAAAAAAAAAAAAAAAAAlhxchiTS1q+VJKgS9dU0AAAAAAAAAAAAAAAAAAACspt+pNj+fABfxMPAO8p1SfAAAAAAAAAAAAAAAAAAAAAAABP+jB/gdMa7NcIZWiUuHAAAAAAAAAAAAAAAAAAAAiurcMWw8q/KBIah9orLvP9gAAAAAAAAAAAAAAAAAAAAAAANGS+cS9Le3XQEzt09MWAAAAAAAAAAAAAAAAAAAAJfLkiEt5SVEIfRzzloBZSoyAAAAAAAAAAAAAAAAAAAAAAAc1xWYMpdJzcApuRyMgxsAAAAAAAAAAAAAAAAAAACFglzmUGknSaOd9epUeiBQUQAAAAAAAAAAAAAAAAAAAAAAG00Eb1uxvsLdAbmECIPYAAAAAAAAAAAAAAAAAAAAiY0NM+3Ixfpz6mlZQnQ6ENkAAAAAAAAAAAAAAAAAAAAAACVS2A5S8CZcCUbLjzaAjgAAAAAAAAAAAAAAAAAAALEXdD4IbVAamZz5PiRnAJDXAAAAAAAAAAAAAAAAAAAAAAAEr1NalLeRIu6QIfe4txsAAAAAAAAAAAAAAAAAAAACw0HalVUOCeXc38nYB1iwDQAAAAAAAAAAAAAAAAAAAAAAD1igBwcNNIe2fdCf8SBUAAAAAAAAAAAAAAAAAAAA94WFGNeU7E7dzn1rHYUlngQAAAAAAAAAAAAAAAAAAAAAAAZO+2PEp9+eYpwT4NDMSQAAAAAAAAAAAAAAAAAAAHkOgWZHL8eLL0RV3Ug1q6IXAAAAAAAAAAAAAAAAAAAAAAAf/wvjTO9RMY93lInRM+cAAAAAAAAAAAAAAAAAAABh+w+ll00dhNKlbt8b3Sh+wgAAAAAAAAAAAAAAAAAAAAAAHkAsrqJYZo21VwYMmtfmAAAAAAAAAAAAAAAAAAAAmNhNn+BZkfTtsqwIfH82exsAAAAAAAAAAAAAAAAAAAAAABDQtHr4OSB9zyg52GN9HQAAAAAAAAAAAAAAAAAAADPDtJLPWjkF2bwO4ME6SGJjAAAAAAAAAAAAAAAAAAAAAAAg4/Sv0LI4GXBlBDOB9GQAAAAAAAAAAAAAAAAAAAA/ud9Jhp+CV7WrCcXb55MiGwAAAAAAAAAAAAAAAAAAAAAACtoPhJKjxBNWaOy/F1f1AAAAAAAAAAAAAAAAAAAAvbbTOPvL7aR/If8Pklh7nyoAAAAAAAAAAAAAAAAAAAAAACaABrh2htG+fHG7sSQXFAAAAAAAAAAAAAAAAAAAAKDpBp6ws1pkNI4bkoMoZWKzAAAAAAAAAAAAAAAAAAAAAAArN4FNL1dKGreR0YDb3DcAAAAAAAAAAAAAAAAAAAAsXa1MYiJeAnuQ9zKNJLxlpwAAAAAAAAAAAAAAAAAAAAAAHSKyIRIBjQDl+3aC6mzSAAAAAAAAAAAAAAAAAAAA4CI7LjZ4c7oFDDzVNFzuhJIAAAAAAAAAAAAAAAAAAAAAABTqHowrePp72DAqKf689AAAAAAAAAAAAAAAAAAAAD+xMGQVpHqEjTUoDv8avxLCAAAAAAAAAAAAAAAAAAAAAAArGPNHM0plJIR9PJIANMcAAAAAAAAAAAAAAAAAAABAU1+KSPbyC1Zm/OGRyreLpQAAAAAAAAAAAAAAAAAAAAAAA/chLDMOjbhS322L0X9hAAAAAAAAAAAAAAAAAAAACZ69xS0ooHLQy2zth4pRxbQAAAAAAAAAAAAAAAAAAAAAABVV8KM5AoHxJxHsxU43VgAAAAAAAAAAAAAAAAAAAJW12Le0pjsF32UrDRDvFG0mAAAAAAAAAAAAAAAAAAAAAAAJnjvVoKAKt/4YBAEFubMAAAAAAAAAAAAAAAAAAAAhKa86Y39aYioyRA+GDR4qfwAAAAAAAAAAAAAAAAAAAAAAABW40lFdduLM7Jnc0ZRZAAAAAAAAAAAAAAAAAAAAIiuIgQjcJdGqRQ4LS8ISw34AAAAAAAAAAAAAAAAAAAAAABuRdReSC609i8AclZUJKgAAAAAAAAAAAAAAAAAAAEghQcfr5CAAodWMy3Q4H20ZAAAAAAAAAAAAAAAAAAAAAAAwXomSsUju2yLm6ZIHeoQAAAAAAAAAAAAAAAAAAAB8hoR2GGgdwp2Kk2OrfEDhwwAAAAAAAAAAAAAAAAAAAAAAFkZaXMu1UM0sY71YEW/kAAAAAAAAAAAAAAAAAAAAQ5lzrBLXynltb+mMpA5sprcAAAAAAAAAAAAAAAAAAAAAAC4k1CD7+VCO0x3mkttHewAAAAAAAAAAAAAAAAAAACjt0afkbIQNnJQ/30VSHGTOAAAAAAAAAAAAAAAAAAAAAAAEPQY7Ewrfs3NCr0XQFVoAAAAAAAAAAAAAAAAAAACTMJUq50xXPRaG2ctKAHM4VAAAAAAAAAAAAAAAAAAAAAAAJhUixAiTMGRq/5ZzYZSUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACyOYGGAwugTPYMxNz2+faUJgAAAAAAAAAAAAAAAAAAAAAAByGeLUrTmDnMx2CuHHUMAAAAAAAAAAAAAAAAAAAAWKOqiLjuXodGKFG23pjuWBQAAAAAAAAAAAAAAAAAAAAAACuMjYmDGJLTvydRJXxqLwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAF6UyFPM7GtAJ5GGyaZJyGb4AAAAAAAAAAAAAAAAAAAAAABQQfUvkU8gEqOKRhpGbPgAAAAAAAAAAAAAAAAAAAJKHn2GoKCaTAlYbtX87FVfPAAAAAAAAAAAAAAAAAAAAAAAoRQUJTjXTtVikNALK2uI="
     },
     {
@@ -2096,7 +2096,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBFJwAABEUlAAAARicCAwQBJwIEBAAfCgADAAQARBwAREQBLQhEAiUAAABsJwICBEUnAgMEADsOAAMAAiwAAEMAMGROcuExoCm4UEW2gYFYXSgz6Eh5uXCRQ+H1k/AAAAAmHgIAAwAeAgADAB4CAAMBCiIDQwQWCgQFHAoFBgAEKgYDBScCAwEACioEAwYkAgAGAAAAqScCBwQAPAYHASkCAAQA71JTTScCBgABKwIABwAAAAAAAAAAAwAAAAAAAAAALQgBCCcCCQQFAAgBCQEnAwgEAQAiCAIJLQoJCi0OBAoAIgoCCi0OBgoAIgoCCi0OBQoAIgoCCi0OBwotCAEEJwIFBAUACAEFAScDBAQBACIIAgUAIgQCBj8PAAUABicCBQQBACoEBQYtCwYGJwIEAAAKKgYEBQoqBQMEJAIABAAAAVQlAAABYBwKAgMAMAoAAwAGJioBAAEFursh14IzGGQ8BAIBJg==",
-      "debug_symbols": "tVbbbuIwFPyXPPPgc/GNX6mqKkCoIkUBpbDSCvHva7c+cYJki1bbFzI5JpPjmbHjW3Podtf3t348nj6a7cut2U39MPTvb8Np31760xiqt0bFH1Cu2dKmAaBma+M13AMEgKEAcQRdAoRpiGwCHCs6ApuAlopRArQA32wRA7AuAUdfABULSEMIMgRSQamgVGI/X8AkwCBAJ6CVAHmFTm2giYQcgU3AogCpOKk4qXip+NhGmBcpEiAViP+xEdgEUCooFdIJcOiQIIJQIb7fN43Y9HaZui66tPAtuHlup268NNvxOgyb5k87XD//9HFux8/rpZ3CqNo03XgI10B47IcuovsmP63KjyIpnZ4OIuuZAMCsKKBCoVijcCg2ZiYxbsWBFQ7rhMFzbsLS0/MwzgiDda44Dy5TELNIQWyyFBZXDPo/KGF+UwkLs6OWciT0OhOuzMCAoiWDLgrhKz2Ex+ZpgLZQEgJUzQ8vdpiyEvUucijAkCt2UUkmo8pa+Kzmj8RczONBTKgE08+GesxzYPjG2pjNsMClREAllRqYE4WGRS5Rrd0AW2nDiZLk8zTIPXhR0dLnzcoTY+bQazugEgqvmIRDeVXkwGoyhYIWWw2a9VaDtT0TbE6m459xIEkbGCwuc1DNV8i+6rxMwT3dBnkLs6/WF9uoxkt5SahGpYvxwgoH05xy5iXHwxfg2YVCvrRQsBJR65WYYj36Yhfoa/ECNUvKAMXdk1TNWT0rulht/jttKMNzG8oVv2ZU2T4prBVJesAeiySVlJJx8lkli7T+FryG23bfT6sT7z2STX27G7p0e7yO+8Xo5e9ZRuTEfJ5O++5wnbrItDg2h4Pmi4GNodd7fNs/"
+      "debug_symbols": "tVbbbuIwEP2XPPPgufjGr1RVFSBUkaKAUlhphfj3tVtPnCDZotX2hZyM8cn4zBnbt+bQ7a7vb/14PH0025dbs5v6Yejf34bTvr30pzFEb42KP6Bcs6VNA0DN1sZneAcIAEMA4gi6BAjTENkEOEZ0BDYBLRGjBGgBvtkiBmBdAo6+ACoWkIYQZAgkghJBicR8voBJgEGATkArAfIJndJAEwk5ApuARQEScRJxEvES8TGNsC5SJEAiEP9jI7AJoERQIqQT4JAhQQQhQny/bxop09tl6rpYpUXdQjXP7dSNl2Y7Xodh0/xph+vnnz7O7fj5vLRTGFWbphsP4RkIj/3QRXTf5NmqPBVJ6TQ7iKxnAgCzooAKhWKNwqHYmJnEuBUHVjisEwbPOQlLT6/DOCMM1rniOrhMQcwiBbHJUlhcMej/oIT5TSUszBW1lC2h155wZQYGFC0ZdFEIX8khTJuXAdpCSQhQtXp4KYcpK1HPIpsCDLliFhVnMqqshc9q/kjMxToexISKMf1cUI95DQzf6I25GBa45AiouFIDc6LQsPAlqnU1wFbScKIk+bwMcg+1qGjp82bliTFz6HU5oGIKr5iEQ3lV5MCqM4WCFlsNmvVWg7U9E2x2puOfcSBJGhhKXOagmjvtbG9UNneZezoN8hbmulpfTKNqL+XFoRqVLtoLKxxMs8uZlxwPJ8CzjUK+1ChYsaj1SopiPfpiFuhr9gI1S8oAxd2TVK1j9azootv8d9JQhuc0lCueZlTZPin0ijg9YI9FkopLyTg5Vskirc+C1/Da7vtpdeO9R7Kpb3dDl16P13G/GL38PcuI3JjP02nfHa5TF5kW1+Zw0XwxsDH0eo9f+wc="
     },
     {
       "name": "utility_is_consumable",
@@ -2152,7 +2152,7 @@
         }
       },
       "bytecode": "H4sIAAAAAAAA/+1bTWwbRRS298e7ttP/Nk5xnMR2+BOnFgS90jSBtE1TtZSrWZIlWDh2WNsV4YQ5IcHBTou40yQU0SKE4EIlDgg4QCNxQVCpFyRuIPWCEEIcWDe29+3Mvtmd9ZiCSE6bffu+N/Pmmzdv3ozltdY7tx4pFIxXa+ZCoWwViuWaaZWNUrVQqNeKpWJttVCsFhYq5Wp92Xi+ZEqtxgfHrWKpVFyaMkqly5G1xub5YnmpZF5qtta+nIiw/6IR308ifIBRf8BWG3F5xW78pWbTH3EtEm22JNs4l2NuS2pjY8r+t3apsXmiaJkLNanx3qyttWRaVy48etTfMKkf5dJ/bZ7Uj/DZn2+st4e0tbuHc/WcWTJqxYumwock0QgqH0Kkca3dlkWjZkxVVlZ7XToN2wTAr8xVLq45LyTne0IidyVznd6OdL7ovD4DQaheyHy9ONO3J6ON9fO1ykrL1QMARoz41MZM0Swt+sIOk4onAipSHJ3m649M6s/w8oLQfypgwynFp3uG371whL/fs33O7ZN8+tSAneLTT22eM2t1q9z4YKZimcWlcpv7b996eDu81WulglGtmlZtqrK8YlPLjmfzlrFQMp81rWqxUn72aLO51rg+Zy5XrNUnFxcts1rtcQ55f2KtG3a3h4j4z9WQG047lszahe34ane4Zr5Sux1JkRbABMAkKiqJoRINleioJI5KEqgkiUqGUMkuVLIblexBJXtRyT5Ush+VHEAlB1HJIVQyjEpwHoygksOo5L42sVgM/df/5woBvp88/hgX5vqFI0ePsd/6t7TZpFfAdJCIfefc+TladdRHVe4+kKt+xkmpKNAxvkiq2vlvsWxYq7bS/MrbPeArNsG2x6FrCVi4Plte3A6WhPEM7zLiNu6Y6Jmn+yyR3hiHTduw8wvL9JamMXPjtLlxx5wHZHdNEAYIsjThkKOkw8YY9BkfOH3GcfqMCaLPOJM+iNIErTTmKF09XjIWXjpeeaXxydlK1SwuVspHz5rWcr1mf1kpr0HXK+CfCQWzl2HYm22sn64Yi64pDx6vbyPejR7zK5cBwOb0y3V7U+fR76dYYx0kZ4ygjusYtUFgVyBNT9aXV2ZfgG55orNf2Yre334iaOCs350wTH6yDyzXyCcHwBqMfDIMFuPOJ8RUSTGmygRnzso/VSbwqZISNFU8WJ9CI20WNo0KOVmYyCLmsrS5LCOKZWEGLBwyJh5SEw+pi4eMi4dMiIdMioccEg+5SzzkbvGQe8RD7hUPOSYecr94yH3iIQ+KhzwkHvKAeMhh8ZAj4iEPeyz+QbZ9f+7//Sd6DcUzihxvXZo7o8jhGUVWUEaRY7qZ8EYeNo0agjzMNwjNnNO7oF7AxzoH20oNS57PM5NkUyedEwxC8gBsAiF7EGZknl2MkF2MwDZ38+uH3CcC4JsII797oG925umxxtxwP2wCd1dzva5eDN7VFLS+M0XhFHWVsj93lbJnrMry2frzpeJCewYZS2ar8f7TprHypGUZq3A+RVuNje2XLXcJLXo5RD30PlSSQar1s5f7rT8irksxXEfv2lPwkdx9ZqHQ2Ykfoz4Ee/8sspNNwa9ZWIjRI0yjLsQNfCtqi8OXEbK9MsIxz1akaMuZgKdlEmPx6Dfah6iA5fEZnhM0w/M0TXPoIjwJm0atjUCKFlAnaXOTjOV2Eg6wcEhJPOQoeiLvQaDMwAmUwQkkCSJQhkmg4KyTQpVQM7CEmucpoUr9llAlVgkVW0+9KqCS8+hVAc3d/AiUQDnolRs4vXKDp1eOyZSwm4Q0BzHzjJmfDxCfwkPK4iFH0XtBHgRKD5xAaZxAsiACpZkEQpRGaSU5VHxKw/g0isYniWGPjk8SfETjk0zFJ8k3PqW94pPMjk/pm9/g8UkgvVL/FXrJaHwahU2jpimQKhzEHGXMfACpioeMiYfUxEPq4iHj4iET4iGT4iGHxEPuEg+5WzzkHvGQe8VDjomH3C8ecp94yIPiIQ+JhzwgHnJYPOSIeMjD5EKoMNICdeCFUxVPCxRBaYFK+0pB04IYbBrlRyClzjZUkWcbKmwrNSwxPs/k0EpahFFVUhkFf5m/4B8Lc7ahwJb1y85wblD4u6qGOduQofWdKQqnqICzDTXM2YYc4mxD+qfPNiSG63y2q+TpgQKFrPMI+PMf5GxDgl+zsBCjR5hGXYiYY7yOJgBIqnHlTAUxILUbgDp8rl5ybcrB8Yzc/Y0LOWV60wpehscnzGc3sj+8/uiI7ddnLKP90ytqzegaIkc4Bv0ZnDOxgJzBF71+V6kR/sgUwyOTKigyxWhXqWjyoMGmUWu6FmBkNNqcxkgTNN8q0g7gDuAO4A7gDuAO4L0HxPY1M4319lmGvWN6Ds1Zrp620+lnXjTKSLJ70uM8RNqKmj3oBfrA1lnTe79NDpNlB/eT7HvcFfNyLjDKyPfQMwAN8V3vEOqUh++0rWipt5H91b2RlWE2RPwqXOFN+7o27tDpVAcSPS/RmUxElOK0kg59QhE4Dl2MVyg8kmPQKofg9Bbe50ZUqvvAUxeIDfzAODb4ukCMp3Tnl33/DwOvxyy9GnKHpPVNMQk9kHbC/xu8IcwViTyD2LUe+JsYuMxVQ5HhY/CCluQsVCSiCh/RSwR3Rx/pORadlT6js4pHZ9k3OqvMmxSsmrfGVSgEhGR6FsFUGGN1ikJU4CN+Ic09Vq5yPjZW8uDGSgkzVgoznqqMhY91E04e+LokD/4mnMyuV/PHBK6LTDK8yKQqHI2UAkY1PFGWfRJljSuUagGmvN6utyJRZBrN8ZDlQmdlvPGt6Mcg40WgE2EusXnknAnYKtIxcfiIRpmEO8poUOkerAj++XqckcDMMhPvBAckc0VweTb4EOu+u73kh13KbZ87oDuMhAf1klvRL7qOlVAWJRFWJ1istqG/8mf1UBhWJ2mlIdgq0vdJ+BiU1XGohLFaGxyr476s9nBDnLl2JgPwmhVIp0MF0gRz3xsbFK+/9+e1HobX+lb0R39eJ8Pw2qOskGTxWoePIaK1jvI6fi+jNau6Mk2z2kUFjkqFPvCMUB98pUJUJUoJlRHqMCOMK2EKkrOMCyka2J/3ebD9s352Wvr0rfHAB9ud1zFncngOv7YJohOpIznho/v5lhRxT7rw17eQG0JxUkF2FFyWE84HrvdJp2ld9/9FeEV3MLrTkVTWvVuXIFuXwNjaBSQVkj4KQ+6gTpqJU2MytBX9A6MX93F+x2NSFBllURc1vtN++e3br5eavnz+G5YuLVPmWgAA",
-      "debug_symbols": "tZvfbty4DoffZa57YZH6m1dZFEXaThcBgrTIJgc4KPLuh5T5oz05sNaxd2+qb5qZj7IsSqIn+X35fv36+ueXh6cfP/+63P3x+/L1+eHx8eHPL48/v92/PPx8kv/9fZn0H4qXO/50oXS5y9Lky13Ql8Xaam2bW56sDdaStWxttDZZaz42H5uPzRfNF9WXpCVr2dpobbI2W1usVZ/0O7a5Teqr0gZryVq2NlorPtJWfNSkFR8Haau14mPpV56sDdaStWxttDZZm60t1lZrzVfMV8xXzFfMV8xXzFfMV8xXzFfMV81XzVfNV81XzVfNV81XzVfNV83XzNfM18zXzNfM18zXzNfM18zXzBemCRAABGBABCRABhSAipNCMwgTIAAIwIAISIAMKACYg5plDgWaAAFAAAZEQAJkgJqbQgU0A02fGQKAAAwQcwwKCZABBVABzUATKWp0zaQZxByrAgMiQM0aS9NpBjGnSaECxJyKgKbUDAFAAAZEQAJkQAFUAMwZ5gxzhlnzK2nHNMFmSIAMKIAKaAaaZlmvQvNsBjFnUmBABCSAmHP/eAFUQDPQhJshAAjAgAhIAJgrzBVmzbyid1BTb4YAIAADIiABxFy085qBM4i5RIU2A2kOzhAAYq4dGBABCZABBVABzUBzcIYAgDnAHGAOMAeYA8wB5gAzwUwwE8wEM8FMMBPMBDPBTDAzzAwzw8wwM8wMM8PMMDPMDHOEOcIcYY4wR5gjzBHmCHOEOcKcYNYcrLpPaw7OwIAISIAMKIAKaAaagzOouSgQgAERkAAZUAAVIOY26QliAgQAARgQAQkg5kYKBVABzUBzcIYAULNG1xycQc1NIQEyQM8OkwbTJDTS88MU9KAzOekZYlK9JplsV0r9s3onWnXqn016OJqcghM5sVN0Sk7ZqThVJ48RPEbwGMFjBI8RPEbwGMFjBI8RPEbwGOQxyGOQxyCPQR6DPAZ5DPIY5DHIY7DHYI/BHoM9BnsM9hjsMdhjsMdgjxE9RvQY0WNEjxE9RvQY0WNEjxE9RvQY/YQ5ZaX+vqLU31eVGihPTsGJnNip96UpJafsVJyqUwOVyUktYVJKTtmpOFWnBtL0MgpO5MROHqN6jOoxqsdo/bNBqb+PlLJTf18vCapTM4o9o/R9sWfUTOTETtEpOfUYUak49RhaOPSM6tQzaqaA9/WMmomdolNy8hg9o0JRqk4N1DNqpuBETuzUY1Sl5NR9TamBevbQpKQ+CkrkxE7RKTllp+LkMdhj9OyZKTiREzv1GDriPXtm6jH0Dvbsmak6NVCv10jHr1dsM5ETO0Wn5JSdCuL2zJupgXrmzRScyKnH6KVldOoxtKzsmTdTcapOPYbet555MwUncmKn6JScMuL2vJypOjVQz8uZglOPoXeh5+VM0Sk5ZafiVJ16jPr29umCBwRfXp6vV30+sHpiIM8Rft0/X59eLndPr4+Pny7/uX987W/669f9U29f7p/lpzIvr0/fpRXhj4fHq9Lbp+XT0/ZHpRaI9mk54JMLJD1uFGGgYD2IzApJmUXR2o2CBoqkK/qsSHVbMbiQVv06Jgqb1xG3DZHQB0kiF5TboUzbn+eE+yDL/NKBsvsS5FY0M2SpklyRbrtQtg1Jak4zJCle3CB1x42ibivktIeraMtVcK03gja4Eaz7dDc02f0XRUq3M2p0M6fIcExt2nYMpiW7QjvvI5HzrWEwK6VewoyQiikecxCjG1ItDfoRR3c1LHc1reZ23d0N2faD39bSNrsxmltTq+iFVK2bcysMHLLvVc+xtSPkQ0mymuLvkiQMZmgtFYNR65Q3e0HjddNXrMybywWN1s24LL2y2WwqBre1+hyvuaxWzds1T3f+zU60huGUxxW8jEV55xgunD7H5aC0zE856d06RotnyUu6Mm078j/gGMxQqacwHlJGrR202yGnY5/lUw6HHHuvhQdzVE4ruBY5pAyuZTCmKWtFPme9pN6mg0drIGNLkccoKwN/YJbmZZbGuDlLeTBLG/mINnmSsbmn/I2D3NEOOnbuj1zO749cz+6Pw9WnYf1qqW6uPnEwQ5MfuXLYNgz7UHwwc9ruw2hrrC371kirsWy3IxFH83M5d8k3HotDqt5bRxyN5uS3NG0bBmto9m2tTGXTMN7VlnN4XuXquy0pltH+jGIgr5at/xvMocEnxWpjPWiI230YHTIoYCizPEveOmSkcP4onujsWTzx+cUmxfOLTUpnF5uUzx/Gh46dh/FUTx/GR93YexgfTq+dp/E8rJB8yZHatWw69ibKauF7lyiZzydKjmcTJafziZLz+UTJ5Wyi5Ho+UYaOnYlSptOJMurG3kQZTq+diVL43y1b14myupT3z3bS+bK15NNlaymny9ZSz5atpZ0vW+t0vmyt4XyZVul8iVX5bIk1HtF9JVZN50usv3HsKrHqP7CY13p+Ma/t7GI+zJRdJVYLZ0usYR92lViNz5dYLZ4vsVo6W2K1fLbEGq/Au0qsVs+WWGPDnhJrp+FgiRX8IVlerxVp91dXqSWsWKmtZgTvF/gXV6mtTp4fEHhqiOuAQFZ+H8aJyhHB8jR8Sod6kPw2TPlYD2jpQfq4ICy3UdaUaXOZHChoGQWaMh1SJH9WSmmVEx9SxOCKzIcUmTAjZStNxxTsF5LzIQU3P+Fxi9vH7hDy6eP/dP70P5wYlXxitGNzq//CmpVTUz3WC9/FRXHsQsIyMcLBiRFickU6NsPDMrdCOjYWO6vToWIZTlrXQR9ReEEnimNjsfeLXTr4MOmzvLr/9vB88zckb+p6frj/+ni1lz9en76tfvry31/4Cf4G5dfzz2/X76/PVzUtf4gi//wR5bSUAn/W38aXl/IoRl7mz28a/X8="
+      "debug_symbols": "tZvfbty4DoffZa57YZH6m1dZFEXaThcBgrTIJgc4KPLuh5T5oz05sNaxd2+qb5qZj7IsSqIn+X35fv36+ueXh6cfP/+63P3x+/L1+eHx8eHPL48/v92/PPx8kv/9fZn0H4qXO/50oXS5y9Lky13Ql8Xaam2bW56sDdaStWxttDZZaz42H5uPzRfNF9WXpCVr2dpobbI2W1usVZ/0O7a5Teqr0gZryVq2NlorPtJWfNSkFR8Haau14mPpV56sDdaStWxttDZZm60t1lZrzVfMV8xXzFfMV8xXzFfMV8xXzFfMV81XzVfNV81XzVfNV81XzVfNV83XzNfM18zXzNfM18zXzNfM18zXzBemCRAABGBABCRABhSAipNCMwgTIAAIwIAISIAMKACYg5plDgWaAAFAAAZEQAJkgJqbQgU0A02fGQKAAAwQcwwKCZABBVABzUATKWp0zaQZxByrAgMiQM0aS9NpBjGnSaECxJyKgKbUDAFAAAZEQAJkQAFUAMwZ5gxzhlnzK2nHNMFmSIAMKIAKaAaaZlmvQvNsBjFnUmBABCSAmHP/eAFUQDPQhJshAAjAgAhIAJgrzBVmzbyid1BTb4YAIAADIiABxFy085qBM4i5RIU2A2kOzhAAYq4dGBABCZABBVABzUBzcIYAgDnAHGAOMAeYA8wB5gAzwUwwE8wEM8FMMBPMBDPBTDAzzAwzw8wwM8wMM8PMMDPMDHOEOcIcYY4wR5gjzBHmCHOEOcKcYNYcrLpPaw7OwIAISIAMKIAKaAaagzOouSgQgAERkAAZUAAVIOY26QliAgQAARgQAQkg5kYKBVABzUBzcIYAULNG1xycQc1NIQEyQM8OkwbTJDTS88MU9KAzOekZYlK9JplsV0r9s3onWnXqn016OJqcghM5sVN0Sk7ZqThVJ48RPEbwGMFjBI8RPEbwGMFjBI8RPEbwGOQxyGOQxyCPQR6DPAZ5DPIY5DHIY7DHYI/BHoM9BnsM9hjsMdhjsMdgjxE9RvQY0WNEjxE9RvQY0WNEjxE9RvQY/YQ5ZaX+vqLU31eVGihPTsGJnNip96UpJafsVJyqUwOVyUktYVJKTtmpOFWnBtL0MgpO5MROHqN6jOoxqsdo/bNBqb+PlLJTf18vCapTM4o9o/R9sWfUTOTETtEpOfUYUak49RhaOPSM6tQzaqaA9/WMmomdolNy8hg9o0JRqk4N1DNqpuBETuzUY1Sl5NR9TamBevbQpKQ+CkrkxE7RKTllp+LkMdhj9OyZKTiREzv1GDriPXtm6jH0Dvbsmak6NVCv10jHr1dsM5ETO0Wn5JSdCuL2zJupgXrmzRScyKnH6KVldOoxtKzsmTdTcapOPYbet555MwUncmKn6JScMuL2vJypOjVQz8uZglOPoXeh5+VM0Sk5ZafiVJ16jPr29umCBwRfXp6vV30+sHpiIM8Rft0/X59eLndPr4+Pny7/uX987W/669f9U29f7p/lpzIvr0/fpRXhj4fHq9Lbp+XT0/ZHpRaI9mk54JMLJD1uFGGgYD2IzApJmUXR2o2CBoqkK/qsSHVbMbiQVv06Jgqb1xG3DZHQB0kiF5TboUzbn+eE+yDL/NKBsvsS5FY0M2SpklyRbrtQtg1Jak4zJCle3CB1x42ibivktIeraMtVcK03gja4Eaz7dDc02f0XRUq3M2p0M6fIcExt2nYMpiW7QjvvI5HzrWEwK6VewoyQiikecxCjG1ItDfoxmphSX2NmSnW4TK26uxuy7Qe/raVtdmM0t6ZWMbekat2cW2HgkH2veo6tHSEfSpLVFH+XJGEwQ2upGIxap7zZCxqvm75iZd5cLmi0bsZl6ZXNZlMxuK3V53jNq3nRbtc83fk3O9EahlMeV/AyFuWdY7hw+hyXg9Ky9spJ79YxWjxLXtKVaduR/wHHYIZKPYXxkDJq7aDdDjkd+yyfcjjk2HstPJijclrBtcghZXAtgzFNWSvyOesl9TYdPFoDGcuXPEZZGfgDszQvszTGzVnKg1nayEe0yZOMzT3lbxzkjnbQsXN/5HJ+f+R6dn8crj4N61dLdXP1iYMZmvzIlcO2YdiH4oOZ03YfRltjbdm3RlqNZbsdiTian8u5S77xWBxS9d464mg0J7+ladswWEOzb2tldUp4bxjvass5PK9y9d2WFMtof0YxkFfL1v8N5tDgk2K1sR40xO0+jA4ZFDCUWZ4lbx0yUjh/FE909iye+Pxik+L5xSals4tNyucP40PHzsN4qqcP46Nu7D2MD6fXztN4HlZIvuRI7Vo2HXsTZbXwvUuUzOcTJceziZLT+UTJ+Xyi5HI2UXI9nyhDx85EKdPpRBl1Y2+iDKfXzkQp/O+WretEWV3K+2c76XzZWvLpsrWU02VrqWfL1tLOl611Ol+21nC+TKt0vsSqfLbEGo/ovhKrpvMl1t84dpVY9R9YzGs9v5jXdnYxH2bKrhKrhbMl1rAPu0qsxudLrBbPl1gtnS2xWj5bYo1X4F0lVqtnS6yxYU+JtdNwsMQK/pAsr9eKtPurq9QSVqzUVjOC9wv8i6vUVifPDwg8NcR1QCArvw/jROWIYHkaPqVDPUh+G6Z8rAe09CB9XBCW2yhryrS5TA4UtIwCTZkOKZI/K6W0yokPKWJwReZDikyYkbKVpmMK9gvJ+ZCCm5/wuMXtY3cI+fTxfzp/+h9OjEo+MdqxudV/Yc3Kqake64Xv4qI4diFhmRjh4MQIMbkiHZvhYZlbIR0bi53V6VCxDCet66CPKLygo/Xk/Ihi7xe7dPBh0md5df/t4fnmb0je1PX8cP/18Wovf7w+fVv99OW/v/AT/A3Kr+ef367fX5+valr+EEX++SPKaSkF/qy/jS8v5VGMvMyf3zT6/wA="
     },
     {
       "name": "offchain_receive",
@@ -2290,7 +2290,7 @@
         }
       },
       "bytecode": "H4sIAAAAAAAA/+2dd3xUxRbHk9300El200xBwV6QYlcggIIgSoioqLgmS1gJSUg2SECEFbCiJgHsFUhAERt2sHc5Y++CitixY8X2JsjuTu69M7t38+P5ee8z/HWS2fmec+fMnJkzezlxNjddeWf1pEllkz2+qom13jKvb7qXxQ9qCqwaUuurrPRVFHsqKxfHNQdaBtfWeho2xA9a1NjU/FRhnPpffFzEj8RFB4pHgRwokBMFSkCBElGgJBQoGQVKQYFSUaA0FCgdBeqEAnVGgbqgQF1RoG4oUHcUqAcK1BMFykCBMlEgFwrkRoGyUKBsFCgHBcpFgfJQoF1QoHwUqAAFKkSBilCgXijQrijQbihQbxSoDwq0Owq0Bwq0Jwq0Fwq0Nwq0Dwq0Lwq0Hwq0Pwp0AArUFwU6EAXqhwL1R4EGoEADUaCDUKCDUaBDUKBDUaDDUKDDUaAjUKAjUaCjUKBBKNBgFGgIClSMAg1FgYahQMNRoKNRoGNQoBEo0EgU6FgUaBQKNBoFOg4FGoMCHY8CnYACjUWBSlCgcShQKQp0Igo0HgU6CQU6GQU6BQWagAKdigKdhgKdjgJNRIHOQIE8KNCZKFAZClSOAnlRoEkoUAUKNBkF8qFAZ6FAU1CgShRoKgpUhQJVo0A1KNA0FKgWBapDgfwoUD0KNB0FOhsFmoECNaBAM1GgWSjQOSjQbBToXBRoDgpEc2GkAIx0How0D0aaDyMtgJHOh5EugJEuhJEugpEuhpEugZEWwkiXwkiXwUiXw0iNMFITjNQMIy2CkRbDSEtgpCtgpCthpKtgpKthpGtgpGthpOtgpOthpBtgpBthpJtgpJthpKUw0jIYaTmM1AIjtcJIK2CklTDSLTDSrTDSKhjpNhhpNYx0O4x0B4x0J4x0F4x0N4y0Bka6B0a6F0a6D0a6H0Z6AEZ6EEZ6CEZaCyOtg5EehpEegZEehZEeg5Eeh5GegJGehJGegpGehpGegZGehZGeg5Geh5FegJHWw0gEIzEY6UUY6SUY6WUY6RUY6VUY6TUY6XUY6Q0Y6U0Y6S0Y6W0Y6R0Y6V0Y6T0YaQOMtBFGeh9G+gBG+hBG2gQjfQQjbYaRPoaRPoGRPoWRPoORPoeRvoCRvoSRtsBIX8FIX8NI38BI38JI38FI38NIP8BIW2GkH2Gkn2Ckn2GkX2CkX2Gk32CkbTDS7zDSHzDSnzDSXzDS3ygSw1VgYrgaTAxXhYnh6jAxXCUmhqvFxHDVmBiuHhPDVWRiuJpMDFeVieHqMjFcZSaGq83EcNWZGK4+E8NVaGK4Gk0MV6WJ4eo0MVylJoar1cRw1ZoYrl4Tw1VsYriaTQxXtYnh6jYxXOUmhqvdxHDVmxiufhPDVXBiuBpODFfFieHqODFcJSeGq+XEcNWcGK6eE8NVdGK4mk4MV9WJ4eo6MVxlJ4ar7cRw1Z0Yrr4Tw1V4YrgaTwxX5Ynh6jwxXKUnhqv1xHDVnhiu3hPDVXxiuJpPDFf1ieHqPjFc5SeGq/3EcNWfWDT1nwKtJb6qikpvtMgoKkE1LmqM/N9p4jfED46LdzgTEpOSU1LT0jt17tK1W/cePTMyXe6s7JzcvF3yCwqLeu26W+8+u++x515777Pvfvsf0PfAfv0HDDzo4EMOPezwI448atDgIcVDhw0/+pgRI48dNfq4McefMLZkXOmJ4086+ZQJp552+sQzPGeWlXsnVUz2nTWlcmpVdc202jp//fSzZzTMnHXO7HPn0FwK0Hk0j+bTAjqfLqAL6SK6mC6hhXQpXUaXUyM1UTMtosW0hK6gK+kqupquoWvpOrqebqAb6Sa6mZbSMlpOLdRKK2gl3UK30iq6jVbT7XQH3Ul30d20hu6he+k+up8eoAfpIVpL6+hheoQepcfocXqCnqSn6Gl6hp6l5+h5eoHWExGjF+klepleoVfpNXqd3qA36S16m96hd+k92kAb6X36gD6kTfQRbaaP6RP6lD6jz+kL+pK20Ff0NX1D39J39D39QFvpR/qJfqZf6Ff6jbbR7/QH/Ul/0d/8VpLfJvJbQH57x2/d+G0Zv+Xit1P8VonfBvFbHH77wm9N+G0Hv6Xgtwv8VoBn8zwL59kzz3p5tsqzTJ4d8qyOZ2M8i+LZD89aeLbBswR+uuencn6a5qdgfnrlp05+WuSnPH4646cqfhripxh++uCnBr7b812a7658V+S7Gd+F+O7Boz6P1jzK8ujIoxqPRjyK8NXPVy1fbXyV8NnNZ2NjI5+3ppL5G5znB1qKq6vq/IsCrUN9/Ld+R2DFiCq/t8Jbu6y0X+RtLt7YP95W/8ACY/84W/3jFwSWt5X6b2KOihBp5VhvpcfPHy/BHmuwmZBobzTiAre1WVPu8XuKq2saQg81VLRJgHPbhUcvCQuiVsOnSsNC8FNLS/saPjQ+LIRRA/sbPlURFhQKfWFBrnBKWFAonBUWFApnhwW5wjlhQaGQLhckhUpqEiS5UhIlldplgqRS2yJICrUrBEml9n5BUql9UJAUatcKkkrtekFSqWWCpFD7kiCp1H4gSCq1mwRJoXazIKnUbhUkldqfBEmh9hdBUqjl240oKhTzLUkU5ar5riWKSuW5oqhUvosoqpQXiKJS+f6iqFTeVxRVyvuJolJ5sSgqlQ8TRZXyo0VRqXy8KCqVnyyKKuUTRFGpfIooKpVPFUWV8mpRVCqfI4pK5QFRVCmfJ4pK5fNFsZ1y0wnB5nlpaIfPGGcElo2unt4snihCRy8TO8ke2xNYNcRX5alt4J3G1CwJgZcNLi/f/vghTYKG1SOqyrf/tmPHL36UbK88rCKk3vzMDuNopIiuMbSlimabxirdnrldjfQ0hR862WN3s++HTnI/pIH80MnshzSjH3b86BQd0q4lQTS5XUui6Irgqd4XaCnxV9d6rb2YBvCi5GFTzA+bImqRdEs1d0sNj9HyUdWecuFRkkW46kGTbZkZ0qeN1Eb+Xxipg7UO1jpYayO1kTpY62Ctg7VevdpIbaQO1jpY62CtQ4w2UgdrHax1sNbBWhupjdTBWgdrHaz16tVGaiN1sNbBWgdrHWK0kTpY62Ctg7UO1tpIbaQO1jpY62CtV682Uhupg7UO1jpYayO1kTpY62Ctg7VevdpIbaQO1jpY62CtV682UgdrHax1sNbBWhupjdTBWgdrHaz16tVGaiN1sNbBWgdrHWK0kTpY62Ctg7UO1tpIbeS/aKQh1DrCYoKxzRns1VbePBhG/B2tbR6/wExw2v37Kcv5aNY0WT+H0/i3Yopbhvu8leUcu7HsgOoLlnh/WznhhMYZCyezUbeWJH312oBtLZM3P79u3Q+tY73++toq6y0j2bhlOMPhtl30TQl/oN3vU8OBe/nI+qk1fDCnBefMjpakMCM4X4ydk6ytSzFaJ50nQaCxQ2qEDmkrR3nr6sZN9lRZqkkOtLY91IhJIZPTmGNqaESH84fxVVS1TaIlaz0z/d6yifX+yokVXn+p31fp8zdwl/m9M/wb4tyB1aO9U6trG7h9tVyjuExkLSnSllRpS5q0JV3a0kna0lna0kXa0lXa0k3a0l3a0kPa0lPakiFtyZS2uKQtcs9lSVuypS050pZcaUuetGWXtonVWuKbWlPp/Scc/K/91P4PTET6yMD+tpjLS/seeLD6t5EtbWw0R/bkUOyNFNINm0+iIgdIsbdddLefA6TIc4BEUA5gsbcnKnKq1I7lPerTwUpjiiFESaEtuG0FzKeZtChOM2nKrEfSKb39tmOlMDW89YS7McecDk+cOJUblpb2jcL5LR1MIbt1OC9L6nAObfEUne0RLOZzF3sEp5nQ1R4hwUzoZo+QaCZ0j/JoudXctYfd9NpE6GmP0NP8F4Hk6z7Jat03yxZphmSRJrRLJkyLNIM5rgrBl8jgDmWgbHeyfKd3+GhZ520L3f5aT5m/pKGqrNhTNtk7omq6p9LHN6pF8oNC4JZjvJ6awbW1ngYxv5AfyZIWGTbFln86N7X/dTfLjTx4QLYcnGuCWZezvAMjn2YNvz4Er5DCl42ur5RypTc3brPDHBHjvMvcyS0eVI3JtUsUozckQ4yCkm7ZsdifZe6ULT6K0f4sUYzJ/s6ybjmx2G/x0Dkq+7NFMSb7u8i65cZiv8VD56rszxHFmOyXXnjmxWK/xUPnqezPFcWY7O8GtT/Dpv0ZqsXtjm1xu4Xzs/GA6mr3MVNAzGGOdaGt6CHjbpgpnm6Dn3rcGvOoeaN2277eGlfrabveMicmboVpuYJpxhHNi2JE86xcGNWI5hmtyldkbwV2z462s7cCefaWD8reCsxjlS85lNzT7rqr2FNTV1/Jx1F+h2F5ACmIbzYdINr+eqX1YSN+seKAY2gJ3pLGcOuVvbijNxd2hlcwyDi9C0Rxx5/ptOqZt0Pt6n/Ubv9hTM1icQ3wI49lVzO3QHSa1d8etcTssMD4kTzZHJXbun2Qwj92FwmG9ZijWI82l0SG/fWYL1+POaD1mG91fJHfphTaTZ0kagvNagsVbigS24LBeqM5tBaJ+41EdZFZdVHEXbqXJF0oEu03b2u9mOM905rLj2JLyVeGSdWWkv9f12fwlXAGMWXHuWJb0I+fS42SDLqgoYfFoOcz53Eh+BZTwBBsz1IHU7dEv/AUPS30u5njWyFHlL2VkGP8ui3BbjwJ6jjL7ILQN2zRZ13uiIvAYpJkiaNimibRzDyXMv+Q5ppZtwd9M2xavaeyTkpwWXgoizm2hUZvtlSFxP0utfs5/M8o3O/eee7Piuj+HCtPxpBp5YijYnK/4AU7qa4rCvfnKN0fMWdxpkR2vyty9LFyv4s506Nwf9bOc78rFve7Ouh+t9L9mTJopvL2KsbV7xYVWy1Qp0twv3F/EG/P1PuD7A4xUz1DMpgzJ4oZ4tp5MyQjlv0hI5arpCxxVEwzpN38iX5/yIxihriVMyRTvT+4mbN35ACR2Roh9lg5P5M59wih59pYFhmRs+S6UJbc2Ggjjw21FFhn0Jk9Y81jrXPsntGlsuqLManjM5WOz2s3oFbe2U8RGjLNoUG2sizyRddOv79xyfPFDFC+6FLOTHkqYHE8cMe2P+y8hRC60LFeBvHYZRAf5TKQbDLCF43WX1Q5DwvN5HnSTSaxg5tM945sMpmxbDLq/SBJmatm27AkKYpY41LGmiT1MYQfFIdHcQo1W5bQ4e0vIeL2N1KwTP7tt8v88pHgSfk345mRvxkvjOWImq+8VXKrbkbypYbEdglQyJzj/t1LgMKI66/Iargi3oRZXZ8Jo2Jaf72iGOT82C4BiqK9BMi38FARc06MvP6KIiQo8h2vyHyXLAyz/GIsX7gYM27noS1ffGFRPkk6P/3AmE2/1vQxfy8W9HLwNYoOKvo45fhhjnsXFkRWJHlv2yl5d1w8Yhv7OExvTicz5yzj/+gJWRLtaSq0EKN7/dsZ7tBOc5rkbfb0sGk7/Ow82zAqKWGG4W329PBHrN81N1qXFuHl9HRjh/QIHTpZvs2eJrwMb/BJJ+ask00v26+EBkfsHImXnaD5/HLylh/XP1PRuNMXzvziJ/f96LM1M3e6ojUD9jm080l95kZU9B9brTyt/PcAAA==",
-      "debug_symbols": "tZndbhs5DEbfxde5EEn9Ma8SFIWbOoUBwwncZIFFkHdfMqNPtreQ4NrtTXXSeI4pDkVpMu+r75tvbz++bvdPzz9X9w/vq2+H7W63/fF19/y4ft0+7+1/31fB/8lcV/dyZ6Ou7rONEtpIbeQ2ShtjG1MbcxtLG2sbmy82X2y+2HzJPldszPb/6iO30fxEDglg30AeYi6ACtAGJQAIwAABREACwFxgLjAXmCvMFeYKc4W5wlxhrjBXmCvMFWaFWWFWmBVmhVmbuQS/KjkQgAH+meyQAQVg387BQRtQABCAAQKwb2e/nBIgAwrAzcVBG3AAuFkdzCwePAsgAhIgAwqgArSB1+YCBIBZYBaYvUDF0+IVukABuLk6aAOv0gXs8uhzj/bhyA724RgdtEEKAAsjujAxQAARkAAZUABu9hwmbZADgABu9hxmAUSAmZOH6gtkgQKoAG3gC2QBApg5kYMAIiAB3OzJ9AWyQAW42ZPgC2QBAjBAABGQAG72JPgCWaACtIEvkORJ8AWS/O74AllAAG72bPgCWSADCqACdIHqi2gB70rBgQECiADvdOyQAQXgzU4ctIEvqxwdCMAAAbi5Opi5+Ff4slqgACpAG/iyWoAAZi7kIAAzFw/Dl9UCGeBm/3ZfVgtoA19WCxCAAQJwc3JIgAwoADdnB23gy2oBAvhVxaEAKsCuqj4vX18LEMDiqT5BX18LREACZEABVICb/X75+lqAAAzwmdaPj7sVNsmvr4fNxvfIk13T9tKX9WGzf13d7992u7vVP+vd2+eHfr6s95/j6/pgv7WoN/vvNprwabvbOH3cHa8O40sp2KbbLjfO2hUUziU0lkRvzp+KGEsXlPPreXy9JMxALCs9gKK/MQutfRbWvoaziGNJSlWbI+WQj4okZ4o0VnBmJJPt8NEV+eIYcsk9BuVhDBOFHaakKeycFIaKOlbYnt4M5VRQysXTKD2GZLvuMAaa3FNhwu0QljTI5dygva4k1JFhUpiRGIZIolfcT9tOkAjr2+NETBzq561PhfJxEpEujkH7JJJquKqmQoAiBxorqEzWqGZUFWmJ3ZHOVzlN6pIK9V5lp4ShQmfJRBBaT1tNvtygsXcaSkMFT/olc4SDOQ3vKfOs4/GxbScahyGTwqjdkWzbOgmDzx3zytBeGRzGjlnXjKk3zeNNjeHKwtBxYZTZPRHq9yTKSMGTKHJKPRdJ41VRUC6Iwvr4SCGTrhdT34zLuC5ktp1T7QqmeHJPz/dSmdVn6jckyYlBLo+CBXtIlEDjKCbVSVzhICEaxzFxSMlwiJ1Vx3HkSRyZYs9HphSH60QmxSGxb4hnq1WujaPIOI5ZB0yKjOhpnf/imEYixz6aI407R5zUiOTjwTEOMzI1XJTTOOmiMQjaVwwnx99f5jFxsGAenPiqKLj2HlrzVbVxaZ3HMju+hr6jZBpXRqx/IJ/15nzWv5nPS3OR+PZczByX5WJquDkXFnzt88h0Vce4OBfl7zouzGe5OZ+zvVH6s1GUyVrN9Af2xtlZo/Qn5hjGp+lpNvtZg+2WXHVmitRP0+nkKPw/RU63npnyrHsGxWq3ZI731Tzb3zkfn3grX+noUzFdHTv01gqf5vOiupg9VnBCw8icx8/NZdK27EULUmFvWGTw8D41VMZp3F676FWG0udRyxV/QLBXZf2ZQsL4yXt6Xsv9GU0z5evOfKcOGdd3qbfviEVv7+Dl5vqeGsYd/Iv9uH7cHs5ef3646rBdf9tt2o9Pb/vHk9++/vuC3+D16cvh+XHz/e2wcdPxHar981Dtr+RV+cvdyv6O/GDn+LvMxX7y1wAP1QpGA3358Fj+Aw=="
+      "debug_symbols": "tZnRblo5EIbfhetceDz22JNXiaqKprRCQiSiyUqrKO++Mzn+DbSyxUJ6E38EzsfYnrF9OG+r75tvrz+/bvc/nn6t7h/eVt8O291u+/Pr7ulx/bJ92tt/31bB/0isq3u+s1ZX92Ith9ZSa2NrubWptbm10trS2tra5kvNl5ovNV+2zxVrxf6v3sbWmp/IIQPsG8hDlAKoAG1QAoAAEcCABMgAmAvMBeYCc4W5wlxhrjBXmCvMFeYKc4W5wqwwK8wKs8KsMGszl+BXZQcCRIB/RhwEUAD27TE4aAMKAAJEAAPs26NfThkggAJwc3HQBjEA3KwOZmYPPjIgATJAAAVQAdrAc3MBAsDMMDPMnqDsw+IZukABuNkj9CT9AM/SBfxyjznZhxM52IeTC5M2yAFgYaTkEAEMSIAMEEABuNnjydpAAoAAbvbAhAEJ4ObqIIACqABt4AWyAAHc7D31AlkgATLAzNkHwQtkgQowc44GXiALECACGJAAGeBmH0MvkAUqQBt4gWQfKC+Q7MnmBbIAA9zso+EFsoAACqACdIHqRbSAm6tDBDAgAXylCw4CKABf7MhBG3hZSXQgQAQwwJdQcXCzf4WX1QIFUAHawMtqAQK4WR0YYObiYXhZLSAAMxf/di+rBbSBl9UCBIgABriZHTJAAAXg5uSgDbysFiCAX5UdCqAC/Crvl9fXAgTweLyDXl8LJEAGCKAAKsDM1efL62sBAkSAm+X9/W6FTfLry2Gz8T3yZNe0vfR5fdjsX1b3+9fd7m71z3r3+vGhX8/r/Uf7sj7Yu6bc7L9ba8If293G6f3ueHUYX0rBNt12ubFoV1A4l9BYknxx/lCkVLqgnF8fx9dzRg+41GMARf9HL7T2XtjyNexFGktyrtocWYIcFZnPFHmsiBIxmNEOH10hF8dgx4Qeg8ZhDBOFHaa4KeycFIaKOlbYnt4M5VRQysXdKD2GbLvuMAaazClHwnRw5DwYy7lBe15xqCPDJDETRRgSsV4xn7adYCBs3R4PxMShft76UGg8diLRxTFo70RWDVflVAhQSKCxgsqkRlWQVaQldUc+r3Ka5CUV6muVnRKGCp0NJoLQerrUyOUGTX2loTxUxMl6GWOCI8Y8nNMYZytePC7bmcZh8CQxandk27ZOwojnjnlmaM+MGMaO2aqZcl80j5OawpWJoePEKLM5YepzknikiJMoJOc+FlnTVVGQFERh6/hIwZNVL+W+GZdxXvBsO6faFZHSyZye76U8y8/cJyTziYEvjyIy9pDEgcZRTLKTYoWDmGgcx8TBdpzALmJn1XEc8ncdJJT6mAoVHtYaT3JUsyISPc3RPxzTSPi4BkqicdWn2e4sx0NfGs7M1JD6AeFs9frNMNvfA2PpSeHk6PpHPyaOyOhHzPGqKGLt61+VcY6W2bEx9JVcaDyrST5hLOTmsZCbx0JuH4scbh+LmeOysZgabh4LC772fghdVe0Xj0X+u44LxzPfPJ6zPYn7PUniyTqe9RP2pFl+ln6nmsL4FDs7aHDf46NNyVVnlUT9FJtPjqC/KYRvPavIbHcOimq3wRzviZJn94lyvNOs8UpH74rp6thRbs3w6XhelBez43zMWDAkyvh+tUyS0x5wYCjsyQYPbpqnhhpxCrbHHXqVofR+1HLFjbs9oupneQ7jO97pWUv6vZEKyXXntVMHj/O7fMKOWMrtK3i5Ob+nhvEK/sVerh+3h7PHju+uOmzX33ab9vLH6/7x5N2Xf5/xDh5bPh+eHjffXw8bNx2fXdqfh2q/KleNX+5W9vvtg53B7yQWe+U/vz9USxgN9OXdY/kP"
     },
     {
       "name": "public_dispatch",
@@ -2346,7 +2346,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBHJwAABEclAAAAQScCAwQBJwIEBAAfCgADAAQARi0IRgIlAAAAdScCAgRHJwIDBAA7DgADAAIpAABDAEfazXMsAABEADBkTnLhMaApuFBFtoGBWF0oM+hIeblwkUPh9ZPwAAAAJwBFBAMmKQIAAwC4Od6RCioCAwQnAgUEACcCBwQDACoFBwYtCAEDAAgBBgEnAwMEAQAiAwIGLQ4FBgAiBgIGLQ4FBicCBgQDACoDBgUnAgUEAScCBgQCJwIHBAAnAggAACcCCQEAJwIKAAIpAgALAO9SU00rAgAMAAAAAAAAAAADAAAAAAAAAAAkAgAEAAABBSMAAAKqLQgBBCcCDQQDAAgBDQEnAwQEAQAiBAINHzoABgAFAA0AKgQFDS0LDQ0AKgQGDi0LDg4KKg4IBBYKBA4eAgAEAB4CAAQAHgIABAEKIgREDxYKDxAcChARAAQqEQQQCioPCQQkAgAEAAABeCcCEQQAPAYRAS0IAQQnAg8EBQAIAQ8BJwMEBAEAIgQCDy0KDxEtDgsRACIRAhEtDgoRACIRAhEtDhARACIRAhEtDgwRLQgBDycCEAQFAAgBEAEnAw8EAQAiBAIQACIPAhE/DwAQABEAKg8FBC0LBAQKKgQIDwoqDwkQJAIAEAAAAfYlAAAPti0IAQ8nAhAEBQAIARABJwMPBAEAIg8CEC0KEBEtDgsRACIRAhEtDgQRACIRAhEtDg0RACIRAhEtDgwRLQgBBCcCDQQFAAgBDQEnAwQEAQAiDwINACIEAhA/DwANABAAKgQFDS0LDQ0KKg0IBAoqBAkPJAIADwAAAnQlAAAPthwKDgQAMAoABAANLQsDBAAiBAIELQ4EAwAiAwINLQsNDScCDgQDACoDDgQ7DgANAAQjAAACqikCAAQAiVX1/AoqAgQNJwIEAAEkAgANAAACyiMAAAPoLQgBDScCDgQCAAgBDgEnAw0EAQAiDQIOHzoABQAFAA4AKg0FDi0LDg4KKg4IDRYKDQ4eAgANAB4CAA0AHgIADQEKIg1EDxYKDxAcChARAAQqEQ0QCioPCQ0kAgANAAADNCcCEQQAPAYRAS0IAQ0nAg8EBQAIAQ8BJwMNBAEAIg0CDy0KDxEtDgsRACIRAhEtDgQRACIRAhEtDhARACIRAhEtDgwRLQgBDycCEAQFAAgBEAEnAw8EAQAiDQIQACIPAhE/DwAQABEAKg8FDS0LDQ0KKg0IDwoqDwkQJAIAEAAAA7IlAAAPthwKDg8AMAoADwANLQsDDQAiDQINLQ4NAwAiAwIOLQsODicCDwQDACoDDw07DgAOAA0jAAAD6CkCAA0AJxaxZgoqAg0OJwINAgAkAgAOAAAECCMAAAf+LQgBDicCDwQDAAgBDwEnAw4EAQAiDgIPHzoABgAFAA8AKg4FDy0LDw8AKg4GEC0LEBAeAgAOAB4CAA4ALQgBDicCEQQFAAgBEQEnAw4EAQAiDgIRLQoREi0OCxIAIhICEi0OBBIAIhICEi0ODxIAIhICEi0ODBItCAERJwISBAUACAESAScDEQQBACIOAhIAIhECEz8PABIAEwAqEQUOLQsODgoqDggRCioRCRIkAgASAAAEwiUAAA+2HgIAEQAvKgAOABEAEhwKEhECHAoRDgAcCg4RAhwKERIBHAoSDgIKKg4NESQCABEAAAT6JQAAD8geAgAOAQoiDkQRFgoREhwKEhMABCoTDhIKKhEJDiQCAA4AAAUoJwITBAA8BhMBHgIADgMeAgARBCkCABMAw7eyBisCABQAAAAAAAAAAAUAAAAAAAAAAC0IARUnAhYEBQAIARYBJwMVBAEAIhUCFi0KFhctDhMXACIXAhctDhIXACIXAhctDg4XACIXAhctDhQXLQgBDicCEgQFAAgBEgEnAw4EAQAiFQISACIOAhM/DwASABMAKg4FEi0LEhIAKhIREy0CDgMnAAQEBSUAAA/aLQgFEQAqEQUSLQ4TEgAqDgYSLQsSEgAqEhAOLQIRAycABAQFJQAAD9otCAUQACoQBhItDg4SLQgBDicCEQQFAAgBEQEnAw4EAQAiEAIRACIOAhI/DwARABIAKg4FEC0LEBAtCAEOJwIRBAUACAERAScDDgQBACIOAhEtChESLQ4LEgAiEgISLQ4KEgAiEgISLQ4PEgAiEgISLQ4MEi0IAQ8nAhEEBQAIAREBJwMPBAEAIg4CEQAiDwISPw8AEQASACoPBREtCxERCioRCBIKKhIJEyQCABMAAAaqJQAAD7YtCAESJwITBAUACAETAScDEgQBACISAhMtChMULQ4LFAAiFAIULQ4RFAAiFAIULQ4QFAAiFAIULQ4MFC0IARAnAhEEBQAIAREBJwMQBAEAIhICEQAiEAITPw8AEQATACoQBREtCxERCioRCBMKKhMJFCQCABQAAAcoJQAAD7YeAgATAC8qABEAEwAUHAoUFQIcChUTABwKExQCHAoUFQEcChUTAgoqEw0UCioUCRMkAgATAAAHZSUAABA0LQsOEwAiEwITLQ4TDi0LDw4AIg4CDi0ODg8tCxIOACIOAg4tDg4SLQsQDgAiDgIOLQ4OEDAKAAgAEScCDwQBJwIRBAMAKg8REC0IAQ4ACAEQAScDDgQBACIOAhAtDg8QACIQAhAtDg8QJwIQBAMAKg4QDy0KDxAtDEMQACIOAhAtCxAQJwIRBAMAKg4RDzsOABAADyMAAAf+KQIADgBhlmt8CioCDg8kAgAPAAAIGSMAAAnZLQgBDicCDwQEAAgBDwEnAw4EAQAiDgIPHzgARQAFAA8AKg4FDy0LDw8AKg4GEC0LEBAAIg5FES0LEREKKhEIDhYKDhEeAgAOAB4CAA4AHgIAEgEKIhJEExYKExQcChQVAAQqFRIUCioTCRIkAgASAAAIlScCFQQAPAYVAQoqFA4SJAIAEgAACKclAAAQRi0IAQ4nAhIEBQAIARIBJwMOBAEAIg4CEi0KEhMtDgsTACITAhMtDgoTACITAhMtDg8TACITAhMtDgwTLQgBDycCEgQFAAgBEgEnAw8EAQAiDgISACIPAhM/DwASABMAKg8FDi0LDg4KKg4IDwoqDwkSJAIAEgAACSUlAAAPti0IAQ8nAhIEBQAIARIBJwMPBAEAIg8CEi0KEhMtDgsTACITAhMtDg4TACITAhMtDhATACITAhMtDgwTLQgBDicCEAQFAAgBEAEnAw4EAQAiDwIQACIOAhI/DwAQABIAKg4FDy0LDw8KKg8IDgoqDgkQJAIAEAAACaMlAAAPthwKEQ4AMAoADgAPLQsDDgAiDgIOLQ4OAwAiAwIPLQsPDycCEAQDACoDEA47DgAPAA4jAAAJ2SkCAAMARvtE2goqAgMHJwIDAQEkAgAHAAAJ+SMAAAtPLQgBBycCDgQCAAgBDgEnAwcEAQAiBwIOHzoABQAFAA4AKgcFDi0LDg4eAgAHAB4CAAcAHgIABwkkAgAHAAAKPiUAABBYLQgBBycCDwQFAAgBDwEnAwcEAQAiBwIPLQoPEC0OCxAAIhACEC0OBBAAIhACEC0ODhAAIhACEC0ODBAtCAEOJwIPBAUACAEPAScDDgQBACIHAg8AIg4CED8PAA8AEAAqDgUHLQsHBwoqBwgOCioOCQ8kAgAPAAAKvCUAAA+2HgIADgAvKgAHAA4ADxwKDw4CHAoOBwAcCgcOAhwKDg8BHAoPBwIKKgcNDhYKDgccCgcOACcCDwQBJwIRBAMAKg8REC0IAQcACAEQAScDBwQBACIHAhAtDg8QACIQAhAtDg8QJwIQBAMAKgcQDy0KDxAtDg4QACIHAg8tCw8PJwIQBAMAKgcQDjsOAA8ADiMAAAtPKQIABwD41F6bCioCBw4kAgAOAAALaiMAAA31LQgBBycCDgQDAAgBDgEnAwcEAQAiBwIOHzoABgAFAA4AKgcFDi0LDg4AKgcGDy0LDw8eAgAGAB4CAAYAHgIABgkkAgAGAAALuCUAABBqLQgBBicCBwQFAAgBBwEnAwYEAQAiBgIHLQoHEC0OCxAAIhACEC0OBBAAIhACEC0ODhAAIhACEC0ODBAtCAEHJwIQBAUACAEQAScDBwQBACIGAhAAIgcCET8PABAAEQAqBwUGLQsGBgoqBggHCioHCRAkAgAQAAAMNiUAAA+2HgIABwAvKgAGAAcAEBwKEAcCHAoHBgAcCgYHAhwKBxABHAoQBgIKKgYNBy0IAQYnAhAEBQAIARABJwMGBAEAIgYCEC0KEBEtDgsRACIRAhEtDgoRACIRAhEtDg4RACIRAhEtDgwRLQgBCicCDgQFAAgBDgEnAwoEAQAiBgIOACIKAhA/DwAOABAAKgoFBi0LBgYKKgYICgoqCgkOJAIADgAADN8lAAAPti0IAQonAg4EBQAIAQ4BJwMKBAEAIgoCDi0KDhAtDgsQACIQAhAtDgYQACIQAhAtDg8QACIQAhAtDgwQLQgBBicCCwQFAAgBCwEnAwYEAQAiCgILACIGAgw/DwALAAwAKgYFCi0LCgoKKgoIBgoqBgkIJAIACAAADV0lAAAPth4CAAYALyoACgAGAAgcCggKAhwKCgYAHAoGCAIcCggKARwKCgYCCioGDQgWCggGBCoHBggcCggGACcCCAQBJwILBAMAKggLCi0IAQcACAEKAScDBwQBACIHAgotDggKACIKAgotDggKJwIKBAMAKgcKCC0KCAotDgYKACIHAggtCwgIJwIKBAMAKgcKBjsOAAgABiMAAA31JwIFAlUnAgYCbicCBwJrJwIIAm8nAgoCdycCCwIgJwIMAnMnAg0CZScCDgJsJwIPAmMnAhACdCcCEQJyJwISAnsnAhMCfS0IARQnAhUEHAAIARUBJwMUBAEAIhQCFS0KFRYtDgUWACIWAhYtDgYWACIWAhYtDgcWACIWAhYtDgYWACIWAhYtDggWACIWAhYtDgoWACIWAhYtDgYWACIWAhYtDgsWACIWAhYtDgwWACIWAhYtDg0WACIWAhYtDg4WACIWAhYtDg0WACIWAhYtDg8WACIWAhYtDhAWACIWAhYtDggWACIWAhYtDhEWACIWAhYtDgsWACIWAhYtDhIWACIWAhYtDgwWACIWAhYtDg0WACIWAhYtDg4WACIWAhYtDg0WACIWAhYtDg8WACIWAhYtDhAWACIWAhYtDggWACIWAhYtDhEWACIWAhYtDhMWCioJAwUkAgAFAAAPticCBgQeLQgBBycCCAQeAAgBCAEtCgcIKgMACAWbW7/3Slv/GQAiCAIIACIUAgonAgsEGy0CCgMtAggELQILBSUAABB8JwIKBBsAKggKCC0OBAgAIggCCC0OAggAIggCCDwOBgcqAQABBbq7IdeCMxhkPAQCASYqAQABBUyvUmUCWpe0PAQCASYtAQMGCgAGAgckAAAHAAAQLy0AAQUAAAEEAQAAAwQJLQADCi0ABQsjAAAQGC0BCggtBAgLAAAKAgoAAAsCCwwACgkMJAAADAAAEAYnAQUEASMAABAzLQADBSYqAQABBe0rrw2aITfnPAQCASYqAQABBcFQNKwlSLxRPAQCASYqAQABBaI/jBZF7Cr/PAQCASYqAQABBfBD5aH6oiw0PAQCASYAAAMFBy0AAwgtAAQJIwAAEKAtAQgGLQQGCQAACAIIAAAJAgkMAAgHCiQAAAoAABCOJg==",
-      "debug_symbols": "vZ3dbh03DoDfxde5EKk/Kq9SFEXauosAQVpkkwUWRd59RUoixy5GVix5bzLfYU6oP0qiSM3J3w+/P/767V+/fPz8x5//fnj/098Pv375+OnTx3/98unP3z58/fjn5yr9+8HxHwD54T28ewBM7enh4T3yM7Vn6J9D/xxdf8b2TP1zGp9Le+bQn9Se5OWJqeoL/IztmV1/9s/UP1P/XOq/y/wkeXqHD+8LP3N7QtUHjiF1wKoBAkNVAVTBcx2RgSvJfxXcgND/KpQOkSWJoXRIuUPGAbUs7ytwbRvEDmVISpcE5waEAdQB/IDcAXFALyLwgDRghZGhdODKNxiSOCRxSNKQcEf7xBAH8Hdq/wQKA4ak5AaRuztEhtSBO7zBkOCQ4JBwhzcIA0qH4AdQhziKiLmD2EhmiB3ESgSGhIaEhqQMSeFq1MonBwPqd2K1jQRuwJCgH1DrE6tJJM+SzNBMOQXfn82UE1c4FobcgSvcIHXIQ0Io8yoVkGeGIHadgdqTy5dn/+z7Z98/87yrenKE/ozNzDNPvAah2Xvmqcf2nnnuJc9QJan2aOYRbkD9r3heNWBJbS4534FHuEHqwFMqB4YwoHTwQ+KHJAwJ95cAd1iD3IE7rEHqkEcRPMINWGG1U+KlowF1KENSuqQ4P2BIuKNzZigduKtzYaAOfkh4lWtQ60O1Wwr3N7EernMd9ZKgP9tCWLjCPMKFK9ygdODebtAl4HgRAIHSwaMMcIXUIcCAIYlDEoeEB5tEI492o9yWyArUQYxOvk+52QS4wgtnEkqdgCdIJ5WBykBlPP6dglIZxL3YiQYFVMqDxIRJKA5iK+6ksqyyrDJSGXGtuN3AU6qTTArZxqSjO5qUF9qBxMjdhChS1oC8ytYWCybFYNIgUt7JMIKhSL3sn2BYFHkq1nYIilRKo2BI+gW26oEsRdmP2bI7yl7XMSnKfsebGbQdD1mD7HnA+0b9oygmk8qy0dG+kE2aTUomlfo2ZIsamAcGtqmBSRGcYTSUIiKjjEVHUvQm9SYNJg0mjVLJJFgUk3w3C5JKMxpmRTIpJUVZuTtK1UncIGcoBRfBolIxuY6kiCbFrOjRkAsOPLAxOMOoGE0aTZpMmkzKu1DtT8GkSPJdqa8MbMeiWExaVJpcMCRFQMOsiGCYFL0zjIZcROT6yk47kBSjSaNJk0mTScV+oziiYr8NSb4bBEmxqDSL0Xbk+iZWlsVoO0ZFNCma1JuUt8SBpCht65gVeWscaAXLWtJRivCCRVGa2dGkZFIyaVEpidGmIBgN5bts4ATB0KRiqQ3FUnNz6FmaRYOYZ5YviHl2NKmYJ2/CFaNiFikJipTtgcQ8O5KiDBaJMllsBAu7pwO5+4iVFRm3jtGQG1R4qRBPYCApSttKFkyKsgd05OOD48aLe4DOCybFZNJkUm7mwKhIJqWLtCjyuA2kjnV784Ym5Vk4UAqOjAiGUVFOQx1NGtr5r36KHXLzRCvkDoQDhqQMSekSYLtitwSBR6FTaGc4EFeMgQdA/oq7X0A63wnlQdL1olVqR0yt4+WfSMfz7owgHd8x6hdaxzdkKW/JKK7EQFJk+xrIHp+Ui2xfHcEZsjLefOsfRRGDoUm9Sb1J5UjRMSvyYjAwKUrbOlrB0raOUoQXJEU5cHc0aTFpUan4GAOlktxMD8FQvpsY0RuaVMIFDSVi4EWZTJiGEjfoaNJk0nSRFkU2woGkyIY4MCsWK5hd3IZy/Eb2EFAO4AOLIpgUTIomRZPKhGFfAIOEEDrKd0mwKEaTJjTk+vI+jOKEYBC9PUqC4oI0yB1KP0lW6odLFOejUxwEKsN21EQ5hgvEPpXbEZsh4YAhyUMyprucrGUCy9G6Uz9sYvMMuEniGGBoyM3nbR3FG+jIQY1akmBSlEhTR5MGkwaTivV0DIZFkb2BgaSYrWBuVUeSIqS+svI2LM5Qpdk5Q5OCSWW5lX7Pstx25O/yBo7iGAw0qSwAHbm+fMyuMTCRigaZ9Vm+IFtJw2zSLFI2kSwN6ihSNvws06EjF8w7MYoL0HYKcQE6gknhIi2KGAxN6k3qdTOi4A2zYkRDk+qOiZR0M6LsDINhUSSTlr5fFfFPGbBbcsE0YogwYEjCkIQhif1kXakMSiP4mKhD7ifrSv1kXddRHPZfSI2+SJ8HCVVKn3NUoWIwLIpgUjApmlRW2oa8UQ7MijJtOibFaAXLottRioiMMm06kmI2aTYpmZRMKl4Ke2AVy0CQDYXdroqkCCaVudKR61s4GNuCz0U0yGZZ5AuyvHY0qawDRULA0qCGEu50LR7MwUw+6HvgBg0kRTIpmbSYVKKggsgHhIFJkafNwGioBYtPMFCK4EoiD+HArBhMGkwaTRpNyuPmW7Sbx60jG6fnwETFrEgmleB0R64viDIet4ZeQtQdTQomBZOiN8yK0raOSZHNc6AWLD7BQC6C3ZmKpCjN7GjSbNJsUjKphLFbwL8EQ/lui/57Q5PyUt4RJejuBCUQLykCLwF8+YLE4BsGk0ocnj0F3yLxHUXKVt2i8R0lCcCmEWS+ZZHmsYz6QN7QpMWkZSyjXsL0A00KJoWkiGAYFb0zvEiLYlvVoyAptlW9YVZMJpW2uSBIimRSMmkxaVFpct7QpGBSMCmaFE3qTepNGkzatinB1qCGJk0mTSaV3bhjVGwHu4bBsChaM5M1Mzs01CIygGFSRGcYDbWI7IOhFWEtztbibC3O0YpIVnCyIrIVnK2IbAXbwGYb2FysiKIFkwNDLbi7Ig2joRbRXZGGWgTZGEtgomNAQysiWsHRikhWcLIikhVspkxmykRWBFnBxYooWnBxzjAayvrAy6AkLTq2TGDDrNiygQ2TYjCpLK8NZSFtKAtpR5Nmk2YrgkwZmbKW12w4pME5ZxgMiyJ4w1bw9+/vHkYe+pevXx4fOQ19SUzXdPVfH748fv768P7zt0+f3j3858Onb/Klf//14bM8v374Uv+2rs6Pn3+vz6rwj4+fHpm+v7N/7e7/aQjsF8u/rmt2UAU1erGsosashooaknqNinr2i10FH99uVfiZioKqwntTkf1yLUoZfVGdQLytRbxXkRx7JaIiObSGBMAnKtK0L0Y7UjYFrqzWoWYUqGuAujXe1oH+X3WI6bYOk9GoC04aZuXc/WhwrOu2Hd5pQ6rXaDogPdWBEx0uRLWseqSwxiR6qmRmnXl0B14n2TPbnDYl0eiOqozumzIZleqWje6oXpd1R346KJBO9EZ+097wKevAkhlHfLrwsUd9v2yh2ldNIN11Bs4WjPrvtCWcY7rrDITZoIwVo3pft53xQjXMNmp+g26rMbHQgM56wxaN+Lr+vLTkeX9O7LPAMM+ajLisGT9gFnz66GZxsc1nZoET24z1kN1VRLhYZ/X9n+qYLZ80+rI6DqqhekVPNUw6s9jCVerBy3TEZxvixCxqGGhsZ9Wxcvc6psapO+JlzamRxacaZsun5L26bVJ4nQ4JYDcddR281xFm4wo2rtFmKtByNapvCDquudxWY2perowVI9Zz4a15+TxdMdS+6iH3VsfyTLkM7bOZ4sv+TAlud6YE2J8pAfdnSvC7MyWE/Zky1bE4U0LanimzaqzOlKl5Lc6UMNuTPJGebq46njtNizOlxsjuZkqcqMjFjVGpAYByW404W3yC3NrqzhvAra8R/Wxoo3bpZbqVH6mGS0Gr4ejW/4szP7ROlmHqlQveKpmYaQ0kDUe0BnxedeCrno65LOX+2Bknez2nFvTQmOPrvNms48JZsjsTS27bm01wwJtNuOvNvlCNNW82hU1vdrk/773ZlN7Sm026elULCbdmQft7dCq7e3R2+3t0hv09OuPuHp39/h491bG4R+e4vUfPqrG6R0/Na3GPzvTGe/R1pvhyN1PI7e/RBAf2aMLdPXpejcU9msKBPZri/h49iwkkHJGeGrC/rqPPxjbvR2VpOyQ6M1JvRuony3lx+8t5gd3lvOD+cl78/nJewu5yXuL+cj7Vsbicl7y9nM+qsbqcT81rcTkH5952PX8yVS7JnOfhXTex0poMH32a0N0v6OBmmyTfnBs1wZqvvg13u5mh8hVm1eLu9wVw8UTo3aXt2PsLzTEvny9U31dkdnCKUQ02XfM7/6jKfHySjU92t4cFADczlbHFJI+3W+4LKpKqyBMVU5sHs/l4a/MzFYSa36Hg7lWE7YMkQDxwkoRZqmntKPlSRdbOkgC0mxpZ7tT70yTMsjzbx0lPGu3wlPOtdeAsEh+dL5pmdzHcdug011TUxQV8VcTEk6XqC9xvELNsE8bsrC1X9/QfbZlFS9OYtfHSpz/UlkzWlng/a6cZJ4/B4vk+X7zL5yZ2IOsEJ9JOsJ93ghOJJziReYIDqad5RSKarV52mB9rTQygSpJ/pRI7kGG67FM/qMSWkZReqYQvienECfcuLwT3toOz6ntPV4GijllwcL8KBL9/PIRpCmnpfAghHlhHZmmo5XUk5O11JNCBdWSqZHUdiQdMdVaRZVOd2tnqOTH6t81iP5k0eO/SxHhg0sySUYuTJuYDk2aWjVqeNLFsT5rkDkyaqZLVSZNwf9LMKrI8aaZ2tjppUnzj4Mp10oTbS1KQ8oHgyix7sB5cmaWn1oMrsxTVD9xrhO3gygvNWQyuTJM7q8GVF8ZnMbgyS1UtBlfmKpaCK4sqAr4qPlOTKkWnDb0qPhPkp3B6GCDcq6ADKQCg7RwA0IEkANCBLADQdhoA6EAeYK5kdbui/UzAspWl+7vRdOBuH5Tty31QDtzug3Lgeh+U7ft9UA5c8JsrWbWykv5/Vja7gU/7OXco5UC2G2dZq+V0NzrYz3dP02e5mId3GZofeCHLh4uTeP9OF06TPAfutXlJ0DUdAJfo6LPxxVnCavk9jXwgIYHTjNXimxr5QEICZ8mmpYTEeqdOXtaYvRi1n5C4moefvJ010REx2XWZchsBQDgQAUDYjgAgHIgAIByIACBsRwAQD0QA5koWNzvE/QjAtCLLr37AgQgAYnzbsNl10vj7WDMeeU/qwItSJ3JWeCJnhfs5KzyRs8ITOSs8kLPCI+9LnXhhCmdvTJ0Imz2ZNPeX9HH2Tsuqw4uzjNXyLVOcvTe1ds30hYqset7TF6eWPe/pG0eLnvfUH/E5W3PCvbs6S1vV9VS9b8+/TX3fnInBglM3EeASX319c9Lr3CtLO8cYbyNWGA9ErDBuR6wwHohYYTwQscK4HbHCeCBiNVeyulPE/YjVtCLLO0U8cHsV0xvfXn0yafLtRW9MB26vYjpxexXTidurmE7cXsW0fXv1peasJVgwHbi9+tL4rCVYMG/fXn1BxUqCZVXFJMEyDWpYWvLqX/0japUng5vT2CYywSUm8SyskaeXV/R9k3j/qsh0/pNuNJE83M7/fOJ4lfePV/nE8YpOHK9o/3hFJ45XdOJ4RQeOV3Tk5yhOHK/orY9X10lzfwsWZ1mr5U1zlrVa3zQLnNg0y4nfnsKy/eNTLzVncdOcvqO0umm+MD6Lm2bJ25vmXMXSprmo4pW3Emo6Ieu0KbdvvnoH+3uNn71utbbX+NnLPOs/ehT29xrv4u5e46fvWa3+7tFUyeoPHzna3mumFVn+QZepna3+9hHAG8e/L5OmwO0NOA8H7lp72L5r7eHAXWsPB+5ae9i+a+3hwF3ruZLVSYP7d62nFVmeNHDgrrWfvnB1xEG7TJr79xM9xn0Hzc/euFp20Pwsr7DsoPlpAmvVQfOzHNaag/ZSc9YcND9NYS06aC+Nz5qD5r3fddBeULHioK2qeLWD5oJNm9sLCrOlyH5LN/rrTZznP47sp4aq71tdfnqitun7z/XTh98+fnnyXyJ/Z01fPn749dNj//jHt8+/Xf7263//Gn8z/kvlv778+dvj79++PLIm+3+V6x8/cR8Q4s/vHjx/8vEdhVg/8W+6/0R15SKMP3/nuvwP"
+      "debug_symbols": "vZ1bjh03Dob30s9+EKkb5a0EQeAknYEBwwk89gCDwHsfkZLI6g5KLbfU8+L6zu9j3YqSKLLq+O+H3x9//favXz5+/uPPfz+8/+nvh1+/fPz06eO/fvn0528fvn7883NV/35w/AdAfngP7x4AU7t6eHiPfE3tGvrn0D9H16+xXVP/nMbn0q459Cu1K3m5YqrlBb7Gds2uX/tn6p+pfy7132W+kly9w4f3ha+5XaGWB44hdcBaAgSGWgRQBc9tRAZuJP9VcANC/6tQOkRWEkPpkHKHjANqXd5X4NY2iB3KUEpXgnMDwgDqAH5A7oA4oFcR+IY04AIjQ+nAjW8wlDiUOJQ0FB5onxjiAP5OHZ9AYcBQSm4QebhDZEgdeMAbDAWHgkPhAW8QBpQOwQ+gDnFUEXMHsZHMEDuIlQgMhYZCQylDKdyM2vjkYED9Tqy2kcANGAr6AbU9sZpE8qxkhmbKKfh+baacuMGxMOQO3OAGqUMeCqHMq1RArhmC2HUGaleuX679s++fff/M866WkyP0a2xmnnniNQjN3jNPPbb3zHMveYaqpDqime9wA+p/xfOqASu1u+R8B77DDVIHnlI5MIQBpYMfih9KGAqPlwAPWIPcgQesQeqQRxV8hxtwgdVOiZeOBtShDKV0pTg/YCg80DkzlA481LkwUAc/FF7lGtT2UB2WwuNNXA63ud71kqBf20JYuMF8hws3uEHpwKPdoCvgeBEAgdLBo9zgCqlDgAFDiUOJQ+GbTVIi3+1GuS2RFaiDGJ18n3KzCXCFF84klDoBT5BOqoFqoBrf/05BqQziUexEgwIq5UFiwiQUB7EVd1Itq5ZVI9WIW8X9Bp5SnWRSyDYmA93RVF5oBxIjDxOiqFwC8ipbeyyYFIOpQVTeyTCCoahe9k8wLIo8FWs/BEWV2igYkn6BrXogqyj7MVt2R9nrOiZF2e94M4O24yGXIHse8L5R/yiKyVRZNjraF7Kp2VQyVdrbkC1qYB4Y2KYGJkVwhtFQqoiMci86kqI31ZsaTA2mRmlkEiyKSb6bBUnVjIZZkUylpCgrd0dpOokb5Ayl4iJYVBWT60iKaCpmRY+GXHHgGxuDM4yK0dRoajI1mcq7UB1PwaRI8l1pr9zYjkWxmFpUTS4YkiKgYVZEMEyK3hlGQ64icntlpx1IitHUaGoyNZkq9hvFERX7bUjy3SBIikXVLEbbkdubuLAsRtsxKqKpaKo3lbfEgaQofeuYFXlrHGgVy1rSUarwgkVRutnRVDKVTC2qkhhtCoLRUL7LBk4QDE0VS20olpqbQ89qlhLEPLN8Qcyzo6linrwJV4yKWVQSFJXtgcQ8O5Ki3CySwmSxESzsng7k4SMurMh96xgNuUOFlwrxBAaSovStZMGkKHtARz4+OO68uAfovGBSTKYmU7mbA6MimUoXtSjyfRtIHev25g1N5Vk4UCqOjAiGUVFOQx1NDe38Vz/FDrl5ohVyB8IBQylDKV0Btit2SxD4LnQK7QwH4oox8A2Qv+LhF5DBd0J5kAy9lCqtI6Y28PJPZOB5d0aQge8Y9Qtt4BuyylsyiisxkBTZvgayxyf1IttXR3CGXBhvvvWPoojB0FRvqjdVjhQdsyIvBgOTovSto1UsfesoVXhBUpQDd0dTi6lFVfExBkojuZsegqF8NzGiNzRVwgUNJWLgpTCZMA0lbtDR1GRquqhFkY1wICmyIQ7MisUqZhe3oRy/kT0ElAP4wKIIpoKpaCqaKhOGfQEMEkLoKN8lwaIYTU1oyO3lfRjFCcEg5fYoCYoL0iB3KP0kWakfLlGcj05xEKiG7aiJcgwXiH0qtyM2Q8IBQ8lDGdNdTtYygeVo3akfNrF5BtwlcQwwNOTu87aO4g105KBGrUkwKUqkqaOpwdRgqlhPx2BYFNkbGEiK2SrmXnUkqULaKytvw+IMVc3OGZoKpspyK+OeZbntyN/lDRzFMRhoqiwAHbm9fMyuMTBRpQSZ9Vm+IFtJw2xqFpVNJEuHOorKhp9lOnTkinknRnEB2k4hLkBHMBUualHEYGiqN9XrZkTBG2bFiIam6o6JlHQzouwMg2FRJFNL36+K+KcM2C25YBoxRBgwlDCUMJTYT9aVyqA0go+JOuR+sq7UT9Z1HcVh/4XU6IuMeZBQpYw5RxUqBsOiCKaCqWiqrLQNeaMcmBVl2nRMitEqlkW3o1QRGWXadCTFbGo2lUwlU8VLYQ+sYhkIsqGw21WRFMFUmSsdub2Fg7Et+FykBNksi3xBlteOpso6UCQELB1qKOFO1+LBHMzkg74H7tBAUiRTydRiqkRBBZEPCAOTIk+bgdFQKxafYKBUwY1EvoUDs2IwNZgaTY2m8n3zLdrN960jG6fnwETFrEimSnC6I7cXpDC+bw29hKg7mgqmgqnoDbOi9K1jUmTzHKgVi08wkKtgd6YiKUo3O5qaTc2mkqkSxm4B/xIM5bst+u8NTeWlvCNK0N0JSiBeUgReAvjyBYnBNwymShyePQXfIvEdRWWrbtH4jpIEYNMIMt+yqHksoz6QNzS1mFrGMuolTD/QVDAVkiKCYVT0zvCiFsW2qkdBUmyresOsmEyVvrkgSIpkKplaTC2qJucNTQVTwVQ0FU31pnpTg6ltmxJsHWpoajI1mSq7cceo2A52DYNhUbRuJutmdmioVWQAw6SIzjAaahXZB0OrwnqcrcfZepyjVZGs4mRVZKs4WxXZKrYbm+3G5mJVFK2YHBhqxd0VaRgNtYruijTUKsjusQQmOgY0tCqiVRytimQVJ6siWcVmymSmTGRVkFVcrIqiFRfnDKOhrA+8DErSomPLBDbMii0b2DApBlNleW0oC2lDWUg7mppNzVYFWWFkhbW8ZsOhBuecYTAsiuANW8Xfv797GHnoX75+eXzkNPQlMV3T1X99+PL4+evD+8/fPn169/CfD5++yZf+/deHz3L9+uFL/du6Oj9+/r1ea4F/fPz0yPT9nf1rd/9PQ2C/WP51XbODFlCjF8tF1JjVKKKGpF5TRD37xV4EH99ui/CzIgpqEd5bEdkvt6KUMRbVCcTbVsT7IpJjr0SKSA6tIwHwSRFpOhajHylbAa6stqFmFKiXAHVrvG0D/b/aENNtGyZ3oy44aZiVc/d3g2Ndt/3wTjtSvUYrA9LTMnBShgtRLaseKawziZ4WMrPOPIYDr5PsmW1Ou5JoDEctjO67Mrkr1S0bw1G9LhuO/PSmQDoxGvlNR8OnrDeWzDji04WPPer7ZQvVvmoC6W4wcLZg1H+nPeEc091gIMxuylgxqvd1OxgvNMNso+Y36LYZEwsN6Gw0bNGIrxvPS0+ej+fEPgsM86zJiMua8QNmwaePbhYX23xmFjixzVgP2b2ICBfrrL7/0zJmyyeNsayOg5ZQvaKnJUwGs9jCVerBy8qIzzbEiVnUMNDYzqpj5e7LmBqn7oiXNadGFp+WMFs+Je/VbZPC68qQAHYro66D92WEmXlmNfCayLGJRsvNqL4h6H3N5bYZU/NyZawYsZ4Lb83L5+mKofYVL115XsbyTLnc2mczxZf9mRLc7kwJsD9TAu7PlOB3Z0oI+zNlWsbiTAlpe6bMmrE6U6bmtThTwmxP8kR6urmW8dxpWpwpNUZ2N1PipIhc3LgrNQBQbpsRZ4tPkKe2uvMGcOtrRD+bslGH9DLdyo80w6WgzXB06//FmR9aJ8sw9coFbwuZmGkNJA1HtAZ8XnXgq56OuSzl/tgZJ3s9pxb00Jjj67zZrPeFs2R3Jpbctjeb4IA3m3DXm32hGWvebAqb3uzyeN57sym9pTebdPWqFhJuzYL29+hUdvfo7Pb36Az7e3TG3T06+/09elrG4h6d4/YePWvG6h49Na/FPTrTG+/R15niy91MIbe/RxMc2KMJd/foeTMW92gKB/Zoivt79CwmkHBEemrA/rqOPru3eT8qS9sh0ZmRejNSP1nOi9tfzgvsLucF95fz4veX8xJ2l/MS95fzaRmLy3nJ28v5rBmry/nUvBaXc3DubdfzJ1Plksx5Ht51EyutyfAxVxK6+wUd3GyT5CfnRkuw5qtvw91uZqj8CLOW4u73BXDxROjdpe3Y+wvdMS+fH6i+b8js4BSjGmy65nf+0ZT5/Ul2f7K7PSwAuJmpjC0mebzdcl8oImkReVLE1ObBbD7e2vysCELN71Bw90WE7YMkQDxwkoRZqmntKPlSQ9bOkgC0mxpZHtT70yTMsjzbx0lPGu3wlPOtdeAsEh+dL5pmdzHcDug011TUxQV8VcTEk6XqC9xvELNsE8bsrC9X9/QffZlYaUxj1sbLmP5QXzJZX+L9rJ1mnDwGi+f7fPEun5vYgawTnEg7wX7eCU4knuBE5gkOpJ7mDYlotnrZYX6sNzGAFpL8KwuxAxmmyz71g4XYMpLSKwvhh8R04oR7lxeCe9ubs+p7T1eBoo5ZcHC/CgS/fzyEaQpp6XwIIR5YR2ZpqOV1JOTtdSTQgXVkWsjqOhIPmOqsIcumOrWz1XNi9G+bxX4yafDepZklo5YnzSwZtThpYj4waWbZqOVJE8v2pEnuwKSZFrI6aWYJqdVJM2vI8qSZ2tnqpEnxjYMr10kTbh+SgpQPBFdm2YP14MosPbUeXJmlqH7guUbYDq680J3F4Mo0ubMaXHnh/iwGV2apqsXgyryIpeDKYhEBXxWfqUmVotOGXhWfCfJTOD0MEO6LoAMpAKDtHADQgSQA0IEsANB2GgDoQB5gXsjqdkX7mYBlK0v3z0bTgWf7oGw/3AflwNN9UA483gdl+/k+KAce8JsXsmplJf3/rGz2BD7t59yhlAPZbpxlrZbT3ehgP989TZ/lYh6eOTM/8kKWDxcn8f6dLpwmeQ481+YlQdfKALiY2bP7iy5tJyTQ5QMJCZxmrBbf1MgHEhI4SzYtJSTWB3Xyssbsxaj9hMTVPPzk7axJGRGTPS5TbiMACAciAAjbEQCEAxEAhAMRAITtCADigQjAvJDFzQ5xPwIwbcjyqx9wIAKAGN82bHadNP4+1oxH3pM68KLUiZwVnshZ4X7OCk/krPBEzgoP5KzwyPtSJ16YwtkbUyfCZk8mzf1D+jh7p2XV4cVZxmr5KVOcvTe19pjpCw1Z9bynL04te97TN44WPe+pP+Jztu6Ee3d1lraq66l6355/m/q+OxODBaduIsAlvvr67qTXuVeWdo4x3kasMB6IWGHcjlhhPBCxwnggYoVxO2KF8UDEal7I6k4R9yNW04Ys7xTxwNOrmN746dUnkybfPuiN6cDTq5hOPL2K6cTTq5hOPL2Kafvp1Ze6s5ZgwXTg6dWX7s9aggXz9tOrLxSxkmBZLWKSYJkGNSwtefWv/hG1ypObm9NYizLBJSbxLKyRpw+v6Psm8f5Vken8J91oInm4nf/5xPEq7x+v8onjFZ04XtH+8YpOHK/oxPGKDhyv6MjPUZw4XtFbH6+uk+b+KVicZa2WN81Z1mp90yxwYtMsJ357Csv2j0+91J3FTXP6jtLqpvnC/VncNEve3jTnRSxtmotFvPKphJpOyDptyu2br97B/l7jZ69bre01fvYyz/qPHoX9vca7uLvX+Ol7Vqu/ezQtZPWHj2Zpq9VfPpo1ZPkHXaZ2tvrbRwBvHP++TJoCt0/AeTjwrLWH7WetPRx41trDgWetPWw/a+3hwLPW80JWJw3uP2s9bcjypIEDz1r76QtXRxy0y6S5fz/RY9x30PzsjatlB83P8grLDpqfJrBWHTQ/y2GtOWgvdWfNQfPTFNaig/bS/Vlz0Lz3uw7aC0WsOGirRbzaQXPBps3tAwqzuKb9lm701ydxnv84sp8aqr5vdfnpidqn7z/XTx9++/jlyX+J/J1L+vLxw6+fHvvHP759/u3yt1//+9f4m/FfKv/15c/fHn//9uWRS7L/V7n+8ROPASH+/O7B8ycf31GI9RP/pvtPVFcuwvjzd27L/wA="
     },
     {
       "name": "sync_state",
@@ -2443,10 +2443,6 @@
             "error_kind": "string",
             "string": "Attempted to delete past the length of a CapsuleArray"
           },
-          "12469291177396340830": {
-            "error_kind": "string",
-            "string": "call to assert_max_bit_size"
-          },
           "12820178569648940736": {
             "error_kind": "fmtstring",
             "length": 48,
@@ -2482,8 +2478,8 @@
           }
         }
       },
-      "bytecode": "H4sIAAAAAAAA/+29eYBcRbU4PNP7Pr33zHTPkgFB2QkQFkEJIWwmIZCALElwkmmSwGRmmMyELGSZhDDJJIEsE9zeU5RVEVQEBZ+8h6L4lLQfbk95goroww13/bn7TaC7uu6tOqdu3a6b3GZu/urMvXXq3LPXqVOn3Hv3vPujK9f0Lblu5VD3ULFhz8iD5w0u7+1dvnRGd2/v+MT/75u3vG9pb3Hf7j17v9jZgP9rbBC+0rB73+7dYkB7GnbvnpiRQu2Frs+O3Dujv2/l0L6R+85fPlhcMuQauf/ivqHi0uLg3VecMlUMVD++UWr8pvfoxzfIzf+ekXsOEnVPhMB54PJib/fQ8lVFt9kvIRA8chAaRj52EJee7qHuGf0Da8gnHXg3jRQF/e7Z/av2Vv/goga8/lXdLE4uWfrUSpeGkXvmDfUP7NEgSgHT8W/GvRcsL/b2TIB9cclJ/aP7i3954NrLdq/euaw066PzfL/85ml/vXfZy1/53Od+px94Phm4O/7jE188+ed/+fSzp575/b3z/uu6n8y4JNNw1eOfuPC993zo5q/pB84kA+Mfv7hvyVs/fuZJ4+Mbjr78y+/+6n/9+QvDC/cM7H36/R98dM4/9AMvoAgx7VQBIRpX3KUffyEZ/+ErzhDSkaHURVLDffrhF5PPfttn3Ncs++Rf+8MXbvn4zf/7/JzhaKH7Cx3b7r3mS3s6fnbdbfqBl5CBP935/o1NH997V+expT/6Lrzjl9f9/mLvGf9buqXl6c1//9lv9ukHvoMM/MY1f3/x0aZ9a1fvemLdGW9OdX9s33d++/MvP/tw0+9feuim75ymHzhLTuIC+vGz5caH9OPn1GjTLpUa37hXP36u3Pxx/fjLZAR14p9+/OVy45nvnyc33qUfP19K0Vj8ryCCN3LPAy9O31U66eW/h8Zmd9+6+pQd33znq2ub73/TT254qPCxhH7glXKEP1c//p2ViZunHn3mwHueS7/w5q7vnfvUx04Yb/nDkWe/8PhFH/rNX7/yZw7Fr6oMbBRMqR94tQTG4WtnzdKPv4aQiqEqPvG1wEAGgH7gAjkaM2Zwoaw70o1fJDeeEc7rBB9e+efVD3wXNbBxS9fKdwd3Nc7+wubjH42EvvCz6R88b0bp2VvHOpo+9kH9wO7KwGPODv7m3rENWxt+eP8vbv/TMZ879/hE+/TECd96///k+wavbfmNfuBiuU/16McvoTzOyfKU7jFIKWZgUWpexvxcb3BeZuBSOXoxHF4mN55x0cvlxvv142+QGx/Vj79RbnxMP75XbnyTfvwKufEp/fg+qQipUz+8X2r48frhA1LDT9IPv0lq+Mn64YNSw6fqh6+UGj5dP3xIavgM/fBhqeHn64evkho+Vz/8Zqnh8/TDV0sNn68fvkZq+LX64Wulhi/UD18nNbxbP/wWqeGL9cPXSw1foh++QWp4j374RqnhRf3wA5ukxl/PjB+RGr+UGb9ZavwyZvwWqfHLmfG3So2/kRm/VWp8LzP+NqnxK5jxo1Lj+5jx26TG9zPjt0uNH2DGj0mNH2TG75Aav5IZv1Nq/BAzfpfU+GFm/O1S41cx4++QGn8zM3631PjVzPg9UuPXMOP3So1fy4zfJzV+HTN+XGr8emb8fkGc7qr8YEbeaTCXNXrf5cWh4cG+kQcv6B8sLl/adzBLuv8/utcOFZdcNzzUe93S4tAVQ8t7lw+tmZhhqLh66IWG3MhDs4sr+gfXTO/pGSyuXEknYKEnXvCJD3ziB58EwCdB8EkIfBIGn0TAJ1HwSQx80gQ+iYNPEuCTJPgkBT5Jg08y4JMs+ASWg2bwSQv4pPWgYE1s46wY6C2+Lrz19j/N2kz4yrRTpWDec8XJU8/A/yrGdPdu/Q6Jp7rLxGxreOUWm8dNbMot7+seXDMx6NKB/QTw3ROsfp0ilZloq3BxX8/ruxy17RQ16iavTkGmZ7/ZpaeGj0bt3olNmsGi5ilZkACT+djJfNXJYIDrVAOc8HyqIe5UDXGjaoDrVQPsV07EUeUQx1RDXKsaYJ9qgKtsL4nquTKxlFYNcVsdfPVtyiFuqQOdHrG9Ck6sjG3vX9ZNQhdYD4zeY38NVB5JTGQi7W9st9WBaVRvvvdOQrtjARmtEB7d6sxbXUEaXWmSecB1plfROpPzmd7q9MYHeYSD/PhMdB7voWoer7d/6e7d4/rsS3nYRSMfuajYPTB9cLB7Dc2LY4H3F/Lf9zeMMxmKicTnyL2vv7iH9/BYfvZEP+T1/EWD9vOen6LJU84tTvC4b+n87qVLiz2z+peuvG7V1D1wrlIHG37TpXtTi8QTGhxmDiwrrigOdvfOKvbBEN17uF9tHNmakzXzWQg+OQiJkXsuGV4xsOfAV0BBfWDWxEfMX9bdRyvlQooMI/cdBHHx9bQMlYINFcgHtJR+vErpJb3F7kFC69279wCCej7KOhMAZ+oB6myUfwTOpwVk66qk82kB2M75Fdm5AGt9/ID1eVSjGTO6B1YO906YenjzgGtUAo17OXbjZMBCNI7DCWaApTOAv8+BDcJ4relgE8SdM3LPrP7uHpoy9M97ZnTr+F0lbHnSh16f9LX/XDowTr1w9+zhXu5QFm6AZpjmCxEMAmUM9K94IPlklcdvsAr+93qNdFcNT9msfB8kv9ZgUSBo98yYrEAp8JUK7Jd0HupojQ7MngDfvbRY3klbed6a+asv6l65DPVTAZGfMmTqzHipoKyXCuwxJuah+2beNNzdu1JL5SBO5dCBV1ipCEufvJg/2H3w5AVrO8NqtkCdDch63YDMg08K4JM28Ek7+KQDfNLpbIEeii1QxooE5azI+SyEkByEeTVbshmsm6OsZ9kZvQoZYI+ZyNxT8s+pQP7NoVsDQYF3GZPfKf5G35YK5D86sX3dx/YXO7H9oYrtJQpLDquyeKxTFriwJEijxuQ8gzRhrTM6R9ah0ZGko6hAJ8hOFkSS0UFhTt8sQHjbwTTEnaohblQNcL1qgP3KiTiqHOKYaohrVQPsU/7N+5RDHLf/R2+3vf6pl+4NylHcUgcqPTIJhXGd/Q2jeg+oXhrVk3Gr/YVRvQZum4TRE1yKJVi3G0bDY00ZQeAIcBXOfT/YKF9GcIRMGUGjk9lxMjtOZueQ7toi/77i+95Twl3bUuP1yrdtfacQ4MuxhPbBWqKJvdrupbUVFJW/6ArVNSlXKN/59ddcn8TkbWADG7LcwIZgAxtUZGBDqFOvxcAG+AY2NIkMLEZc1sCG6J962xVkzRtoYANaAxvE4IaggAHDIAQY2AAkn2Asxy2o0HgE1v4FS43ra9ZGrKIiZMtCSb/UmfwLiIfYZND9GNtoDJQatxPQWzgtRQ126ApweqwaHKpjz/OnVPmzqrt3eU/3UHF6X89ry5GZfTcNF4eLPXP6h4orJ/44c1Wxb+hgee3u3fsBM3EJ8Pd3wLxGYkzQ5OxXVL9Qqw++RLVTf4cOIOnTwBfCprvnDS/Whz/ERAKD4g9XJJcyH2QQKr/xUuOuckvdUoiJ3uKIu0/IGZgr5N19Anb3cUXuPsF6pDjg7j/NN3t7+G49MX8P4MLn7zWhH017jThhEx/Jut2EhgGQT02WPRX9chlkD0fMkiXXO4iZfI9ezJKImGVkO8RKi1kGFrOkIjHLsBxIUqki/bRZ2e6CwLRZdtos/d06NuToZxVm3c1msnJVTgMT59iJc8JEVjOw/MvR2LOi1Vxq/JAE3ePVnz5G9jMaCuiiuRwklMybFJFzQGiYgbitZ0qiGojonqTAJ2lKu8tsfBiUEYDqZN5eDs2zJddRBPQnIdAtxJcRUNT3A4PyPF9GDUOwypcaH6N8mXGZaBF6WByrFg2CPLyeIHg9DVOLwStdM73Smo/kYfakGLM0ICLUZ3s5wNOlxqcI8GekVFRkKtLsoAyNl16v0/RPyPyYkYuMUblo5hAoU2r8MkV9nRJn1TnF6UqdYtY6p5hFnGKLbMdy43rWgjjFPM8pfoN1inmhU8yzE+eFkl4AdC+PK3ah1PicBN2bK3hcCVINFfRm3AC2lBq/a8AAAp+awc3MBPDvic1M3oyZaeFxjBYHnZlp0dggncfPQ6KMxQZ5IHxoAWMRw+FDjs3M/xgUGVGQcCXXvLkaCehXwLWrPki4kv5KaEUjMLsIVolS4y/EQQK+ZDLlDOIasvGcwa/FOhLn6S4F1xRmzZqP5GH2ezFmCUBE4rj2TrDjT2LtjZlhR8IoO2J8vP4K++ZAZfIiUtia1D8L0bG77lmYjlB0zyK0g9Q9i9IKXVY2140QSdpAPUa9SVvJxdQzZxCk8jRSumcFWu4qCHfKItyMS9UEwiGxVLWb8Qlt7KB2zSfpfEIb/RNy8ohHBsW73ahOFzgEai+5EmKdbgdX5IiBnQCdJqC/UmZ/+X03LTS6Vrce2Zi2MscBVjTLIL0SnM8IOd+Bcj7HhoQdBlifRzIlIOvbUNbnaEXk6kYHxXqxCrIYJqoYMuEG9cnMgoYiNpx6yuufaURZGKq0iE0cP0R1HYcgnEQQTiEIpwl9Z8oinBaFva4TD0vYm8bDXuOr63SNWZe0xlpychuuaWITlweon8ITTa4zDZi4ZI0mLg6buKzQxOXR1bVxR5SnacKYuIIB1nOSwSkh6/H1ZkpjLXm6cT7HxM2UEHhDJq6F3ciAg6IUEhSlOUHRRMpWovgmbvk2Sdz64ps4XlFb4w5kk8RiL0F/N8zkOJGtK1ndSAozQkl0WwgYlAIsVlIjvIxOpEqu+ezCQplATVcqUBHrBCqiTqDOtVKgltSBQHWD6+Il7NoXykOFq1/FrG2hMTE6NhKueuPcqqoYHl/FS64+4kN+YGFhhIk6SHsVRkjWQcaAgolJVAdZQ0GGPhFMp7FEdZAxbR1kHIOboBmGZqtpMEC2OgbJJ6ixgElqomFydXYD0dkfYWg0iWj1mucgJ3bupIFAGXaOKZCsH4nJm4IkbAoSikxBEomOLTEFyaiMKYhKmAI69uAagxssNAa17mjm2TRrGesG/ZM2RF7baTZy5a1BL28NNM4V/fqJdt1LvdOABDhtyLKoHVkWdSD5504kcTMFSdx0IYmbI/hFbO9muRhTV2gdY+Mcm4YZMevCjFjVtsBilOBFx5Rs8Aq13ceRUPEu7DRXTOJ8WGAEPvAZo1+DAuXGmruYmVh5BWHGBhQxNojSCt4YC7J0JEuHNRLnSkIIY8izdaoBwt1gTEPcqRriRtUA16sG2K+ciKPKIY6phrhWNcA+ZQDJT79yMm5TDnGX/YVng31ZbZ3CbLP9R6+vA+m+TTnE7cohbrW9x1LvVOEGMzYSnlH7252tdUDGEeUQd9ifMZvqgDFj9iejcmu7zv5UrAdru87+lmxSBnl1sPxVz5c76iA6Ua/Tm+3PmJ32Nzsj9qfiPuUQZZrKUllI42hQOWmVDfWC58o11AuZaKh3rlxDvXKG3PMikyHP0uQASMc9cA5zMEa/JnH8UXLj7Bz5DHmL9ccfW1BawScqWpCzh2skqkHzCGPyQgNlFiCcITcNcadqiBtVA1yvGmC/ciKOKoc4phriWtUA+1QDHFJOxG3KId6mHOJ25RC32l6j1RsdOEa3kfCM2l4F1cuOBWQcsT8ZN9UBGXfZX743OJy2ZSzRZ38vuM7+VKwHL7jO/h6mz/52zAKdtv+yTT1f7qiDqFG9Tm+2P2N22t/s1EHQuE85xHFz2TPjaFiU2W05Wy6zmzeR2T1bLrPLLYl+xOJ6doARwlbbIT66pL1j5BwQNMtjpMe89hIP3cMYDQKYLoaKFCPZQfq1w3MgJIgcCAnpn3VUScfNoRs6KhI51/hRkRiNM3ysox27LSCnaIMphxAGa1ks2Xo/KL89EbK+ZTGHVtRRYh01WmjUGDqSfmw9Eta8BWGMA9AB+Jqscd3IrOoLzSAq5SPhB48VsrZgCbeniPuHxKBtQNoslndQ3T8yiDUFg8KbRSBU8nUR4D+RoHEzbUGhyMhoMzF+F2H3z6Q77bDMAhvIFHjMymPMKpTcr8LMClWZBfd2SRJa/wbCKwkwMkQTnHeM0BciwH+PObKIIkcWoV9D5ksomi+hcQc1eihzUU4UiXJa2SjngWoUqHvWCZPHQAyUJFI4YjwGCiExUIz+IoBbUaDfBZF6ViajJS85HenxMyfnkxQY/sVgWLlGsxzD3fLxULP15RrNJss1mnnLW4qwqlbM5GfGwts13ibPmsN+uwZ8xjvD0pG03VwjIQfNCGOahQkhswDhShrTEHeqhrhRNcD1qgH2KyfiqHKIY6ohrlUNsE81wGHlRNyiHOIO2ws3vGtjGuLttjcR6tVFOYobbK9/cCrfLMQB5SiO25+Ko3Wg0fZ3+uotrXpOb6oDTo/Zn4zb7R92j9lfA9UHO+rJuNWx3pPDeqvnyx11sDhQr9Ob7c+YnfY3OyOTMPS+6dCF3ngqzlRqVWVZTuYc4P1F/PebXfJlOefIlOW4sFR7C95FmENr6tYC9GpbAGIWgbgIOxCalWAtgbiAgdhM/zS+wUkgLjZ1NUkegbiUgZinf0IblgjEZQzEAv0TgIhdwrPc1J1T7QjEWQzEdvon3Ka9soN0HzRrB7BlSl1jxmvs3FHy/IAA/4jMvRghy7ukhqy/FyOE1LTV1oE5AB00nzzN2ENSBYMh+qfedlPVfQFRg/GAthl7EIMbohmGNmOnwQDN2AOQfEIECoqbsQc4Ohssecit11GwKiRIrv+kgVWoD7GMV61CBqFYhUqeJ8XXf4a4O+hNGgnhgX6OGKmnJMStSfjBYbQ8p4mWFBavcMnzRfo2JJ08hFmRAYX2NeRJFHgnDQTCnMdfCnNgWMToB/N4HCl5virmcYDFLCxkRMSY5IX5WH2Nxoq22o9VrfaS/oE1ZbO9e/d+E63tQ8ab3lNUBM3ufiNm17gRrujHc6hdEslhEJLDgJaun6nStafYWxwqEsruM0HZIEylfRJUcqIXOnqB78HlVBKHNZyG9NpMsLSSBEucRaWBcIYbRgUazYYz4CEOrjK9qKeim7aVlfvkNjHBDFX3BtbMc2497UByBDn6NWS+hKL5EgbnCyqaL2hwvoii+SL0a9KLqjLcK/lLql+J7w/tOBilAlAXQIOmoNWiwKBOdtAUjNad9E/jiHQIXfwRZrDvYgcdQX+IHvsu+qcJ7Bcpxb5DEvsOjDFTDCj5FB6zDSn5lEM+n860TkHc9RFyHjMp766PgN31FEXu+giUVjpqHEmjxtDxSNpzAtMdyU53JMIaCmRKPciAepBp9SA71YPMqAeZVQ+yWT3IFvUg8+pBFtSDbFMPsl09yKR6kF3qQXaoBxmW8NVTgOUNtfodGF65bObAsuKK4mB37x5wVdK5h7uG3wssey7hL3s6EnsNLWdk1gDRatzGbD/QwQjZgGCcs4vepBO6x6PZJRXs9yXvdV8i7/c9sN93K/L7HpbobtDve2nUGDn2VsathCbzspN5EcXwCnfbzQKEK87MQlynHMUx5RB3Koe4xf5k3Gp/YRxVDnGb/WVnozKAlK1X/dU7bC886+tAdm6zv/lWbyY2TkbzbYHwjNrffm+tAzKO2J6MG+wv3hucWMKWhkw9Gcfs7w6UxyZwZ2UbWcY6kJ0tk9AHrqsDQ7bHsd5v8JVg/SzbbrE/EevAjNVBVAsfEbaRSu+yP6vtH3r3218W1WcQNteB2bG/N7Aglt88Kc3O1slndtSbWvWhxO32R3HM/oxWrtLqF23b7Q9x46FTQBfVwbb88pLKjyKnONd1sEVsrWUGPeymfXlKTgmDTxa2dAmDT4+Oj8YMLG+gEZt2KozYq8NN075RmtILscDHMtVXZSowyI/WRDBEDMgRcbG2JSxVtO/XPvGwVCw/8dKTVw7bPcNi5pfFTIaK1CyMchAa95hjTOVyCUpUKH0AQCZZkNTR8hA0zHAT7CS3CbYvJt0Em8Kp/MU38kEnxKX6nEPnMaGAc86+F2isTJ1+B76RNIKYxe3Y7ctR3wgpRoKINlENybsWKnMc0JujQlWngA9r4xFLRGHOOfs2miaMxrQbIDFHwIkEzUHaSSeRhucFccNzuHM9wtlQyfcmsfRy2jrkhLTlnCxrobFCD29DIpa0TsRahCKW532RiAwczc9rVEYvYgUDxpBD2wQoYgmWsBQ9qU+pXo7gnIJ0ejg4PRwOonw4ezi4aZi8Hg6+GcSc/QhDw13DkW3oeg6OKQjLaWNM3hSEYVMQUmQKwoj3tsQUhKMypiA6ruJsfPl7brDQGDDSkTgUN4sE0PvTuPLWoJe3Bk2UUtavnxi/ISRIYwafoGdaNWlOE8PnKDqRW0eYA5FUM44u/bN49ecRfPOyoOZVdANyASHDqwBiWyQ9vVfetgRh2xJQZFuCrG0JVG0LvDIIslEi9dQv4Xixi4FCtLipAilKMJgFeGC/hUGqt16C1IBw+RFGI9sHzuvtXnLjef2rRx6d27+yuLynv2/q3OLgiuGhiTf7+/bSlPfQZgzM7tRww6d1/HTX4aLDbOuVVglJCCOapribi/xxx5DccccrgC4vLmPHHV0S3+iuCjRk6NFkpTiuH6GSlXD3mADpHnM9zHSmj5YYe4N9tNzcPlq+UaqPFhPhwCodldOq+fIqHYVVOqJIpaOssEQAhfi0ZvFA6QNXjKPz9gCCOw9SiJmgZoX3Ggnndbzzq+NdXCnv/Nbxzo9sJ0nexA020+PeUU19NxzQRyvq73sPa76bhJFXEztxkzCciIvbTfJaxMZLvjvN6MxcJmKIar5fl/JogkSSeZMicROQxolCvNazxFPBdiG4oFkIBjekLa/vblBCAJqTeXs5FI+V/G8hoMGOvwniHgioB4RrgCTq3KIYVsmS76Pi5o9RNLttCquEBkEeXg+L9wcTvHCnVnoFNR/Jw+wRMWZB8a3FIX6k8Zh490fg1AwvdaM0Xnq9DtI/IeNjRi6iRuUizr151fc5OBSLqXOJ05W6xJh1LjGGuETJDN+5EnqWQFxikucSv8y6xKTQJXJ2bsUXJKTAHXVUsVMl35ck6B6v4HElSDVU0OO4AUyUfCUDBlDcID7EB/6c2MwkzZiZBI9jtDjozExCY4Pg2x0SePhAfXASCB8SYCxiOHxoYoOE50GREQUJV3LNm99DQL8Agfbog4Qr6a+UWUOyZvtK/hryh+IgIcJy3lOjM/BoJI/nDH4s1hEPT3cpuKYwi2s+kofZT8WYRUARQbV3gh2/EGvvYWHHrw2wg9ssPoJ/sqfk+x0B/QPGiFCI+SXEwINk2/z0a7XWlprbOmtlt85INazuSQeNuO4Z1fo1wLbnpII83bMuOsbQPTuCtolwk0uX/Aafh9Rlft34Bh+VgguXzeeB30GCkBZrHS88SJf8IWQTMIYEQQyJUrQhKZt7/xGyCMdxnZlAOCo2ExkzTj7NDspoPkmnn2n6JxS1ISEWaK8yRo10ikOgTMmfFturDJhgQTzmBOhqfeZXwOK5WI3Fc9Ph4rmosHguw1sQijifRTnfxNrRrAHWJ5HEF8j6tNE7L5J83eiiL/kQqiDqTJn4kfpkuDQAyyQmkdKAlDj2TIhNHH/N4T8RQdiPIBxAEA4S+l4ki3AQN3ETCE89LOuYIL6OMZ4uCdaYRgtqrCUnWeU/U2zikgD1A3jm0H+2ARPnr9HExWETFxOauKSZIv8UyvkAa+JSBljfhJQKzDGXQNBcDMTVjQs5Ju4iCYE3ZOIS7L4UHBQFkKAoyAmK4Bx8wsw+atL8PuqEuF8O76MmkcRjSk7gZ8onHlNw4jGpKPGYwhNx5vdRU+dD+6jn7zVxAVPC0E6qiY9kS2VSGgZAhbzp8nJXE4pWsp7cwORxoqsLIURzCKLszaM5+qdOcNOI4LZYnjFvgQU3rUhwOSdl0kjGPK8oY55HD5m0sKepqGcV9t/AO4oiypgXzJy6agMCgAKNPSusbSX/Mgm6U140jF89q0/dFiChZN6kiFwA8sAtELfZVTqUB86AT7KUGpbZOCx7ujGFrSzzJf8+Ano1bMngDDF8sy8abrQIsLpFnCHmyERK6LNxrFIaBHl4bRLHvxy7n62ZXlnNR/Iwu1WMWRYUESpsYoFnS/5R8booa2ZzrQmlVYrR6yb6p/F1UcpcLMcjELAuuh3eRiZxbxE5EZBDkoHYsj9DtPdZ8BCsmOs8YW8v+d/LJpphpAo0UnAaOksQfkQW4SwuphMI/5uRS9VMiCnnHHGH5pOwG7shL8kTfZGYdhg1Em3cW+f8d4uNBHShXQaz2BOg7zOwfE9bl6HMC5fvHbwgSsT5TpTzGTam6jTA+gIv7SlifTvK+owmQOPpxic5y/dHJAQ+BS7fU/QnMysCithM3EPhzEQ+lChXYx8oLc1ZbyQtX28k4fVGVNF6I4lm1WtNDpwrEcKk6O+GmZwkzHqa1Y20cL2RRtdXknsqaTxmmthV+Tzoq5eAte09YOIQLvDoMZTPBj148j7BflSQH5R8jdrkti7FZOLIv71STJLnfONA6snqI/8z7HPkv4bUFlKUFRcdY49rj/wnMbiakB1d5NNggEV+HJJP2T2QhHAh8X3kyD+FRkJEq9c8R/W/fhoKlJng2ALJxFla3hakYVuQUmQL0kg0Y4ktSKdkbEHKzJn/JGANVhzKM/8FOQa1setCqHCpA5HXTpqN0iVBhYqCtT9lvCQoTWMGh7GdSBjLnN2nEuldbLMi8vMIZBF+JD/n/yeWU3F15/rjgsTLtFNpXMvjLwBdCbOs0Y5H7WWq5P+rgYQcZYxp4JQ5beYD/0clNgucbKHRdDlG87UJJ1EAlUbX12jBGxboSAZQKQxu2nAARYMRB1ApY5un5gKoVClAqhSjT4v3M2hgZirE2N3+ONckBxLi/Yz0fYITTCk+6COJkUpLiJv4ZFXO6MmqNAevXCnQTCecdPKQY0UG3vMGI9kcvKPNYTCFOrSjVMtZspZSoF3M5DiLWU7IiRZjopfjY9VFY0Wb7ceqZntJ/8Cast3evXu/iXA0bTxQpagI2t39RuyucStcUZAjUcNUy5IKaobRU+wtDhUJafepiPSrZNonQSYnAUQngOD4PsXLWxoOfiXzTStJuLR7t5mAhhtIxRvNBjRAqAVo08ncozWB08gLpyAnKxKVkxWv8qGcUXNYja1h0jLqILlJZaJ1icd6dfCg8lkrredJJfSp74bXxOTkYmAGq5E54U5CzkxP4xYg6szhwc6Ek52OnSLLKDpFltFQ5xDPx+xgQLseKeZYawCMbDzgYSSkVnzCOnyKgL6McekU1ll8FWagHibErYcJXGGgXXqtvaznw5vdWeFmdw6pLnBJVFTlUMfYYkDmkmbKcTJGy3GS3I29wLvkskJaq4gyf2KFucQA87PWMT8uZD52+A3eRRXs+WLWISJh/pNC5uNny5O4LY6UAn30wlNnJamSq6jEWecIYiWj9GuHej642UDFQK6SPy+OFPpMkPffCeg1jO2lnFAMt70R8aY9/7R6YL0B9Ytbp34RofqZaqgTQxvqpFkxiNFUN+7v00L1w0/ta6I33qn9wDax7Y2aa1UwAXyHAeZHrGO++BxszMw52DjaJM7DMp9KWzRJmBVxy4ZYLS0bYqXAnZa1bAi8twK6Y46EvEeBRbh8w9KIXMPSmfzFuWeesYal84ytnU3VjRkXmCS24ogYCACS5sx8shS4+/Ca+aSZKCtZY5SVNhdlRcyY+ZRRMx/hR8EGGuqlTB4CTSHlcljxYUQc9KSR0luXlBulkEOW4qBrTptbe07s9zxxeNeeaTNrT3ERZy1rT5n4R7z2zBlde3r4+15fFCtGDu1OAgt/jrVSFInhsmwPlYmxrg27c/fT6xNOojoG5+4nq+5+Cjyv9O4n8l8/DYW5kgS2BWHLC0HfkJc/WV8IGrRDIahkeaEtLn+KmykEte3lT1wb8tu6veDJRCxRtxc8xcxNd2jvXzmfb+CCjXsN1hAA33g47l8J/FPq/pUD34f9yaG+fiXoOSTXr1whr351ff3KfKht0HzY5XvUXsASUMe9hFLuBazjXgCpQJFsch+XSMjLXsASzNj/ApZgSkpryE9fPVzB4geLTYLgkxCzFRrsBGUEoDqZdy53tyP0fgIa7PXJXMEyl/5+U91IohhWyVLwaHtewRI81tQVLKGa6RXSfCQPsxPFmIXEBxK8HOChUtBAT1FTO8YhyStYQvBqqWpHDsMVLMEznStYtN4Jdoo2uoIleL79r2AJnidBd8uvYAleouQKFi8f+GznChb58IG9giV4pWzRih+rl4qWQqsI6Ksh0P5DfgVLcKGpK1j8NToDv0byeM6gW6wjfp7uUnBNYRbXfCQPs6L5K1j8uPZOsGOZqStYrGdHrwF2iOp5eJ/sLwX7qe40UqCpmJ8HOER6EAUHDeoygUfPwSPHcAXnyDlmlrlz8MUWVOjbWHMgYCKdmoCDn7ii4CeB1inDMUiCF3nAdIyqo+PRSukYtY6OUdN0LI9bYy6CgwGuUw3wwF7lEHeqhrhRNcD1qgH2KyfiqHKIY6ohrlUNsE81wFX2J+KBbbYXbuXqd2BHHUDcUgcqPWJ7DTyw1f4KUw9kvKMO5Fu53z+w2f6M2Wn/CK8OxHufaogDylEcN7duMI5GHNiEf6i6Cd/bv5TT4aI87CL+rnziKLDQlft+snGcU2x3BrOzTz88ir83DxWxIMv3gERCIIrwLUC/dqjns66iJF6HFSW1ljnKXFERR9igSXRXclsvs6xMCLdfuPs+Qo0328w2+BKSia98xyum8+29/Hx7IwH9c3G+nfxJfHViwFjdFi9zGCgFfyXOtwe4Scle+suherhynvRgaTGl2GUIS7hFcMHf16zTDUhxaLTm0tNDec11BOkx60euuQ7Z45rrgKFrrstqERqSsIbiHYY4uGNZHjmXW68U8op3PBJ4/atECQPiUuP0T6uOlCP3jhL7K3PvqNho4/eO+tF7R+Os2cZiBAqrqlGHDH9jzXbBxF5GAI4k/IoiiQCiOy7kFAHnBtggYl8Ultgf88YvsRftZYTQ80AwwHWqAcJ7GaYh7lQNcaNqgOtVA+xXTsRR5RDHVENcqxpgn2qANysn4q3KIW5RDnF7HUDcUgcKM2J7+VZuGA/cVgeyo9y/HNhje07De0KmIW6bhApzYJP93aoFjLnN/oxRr9S77f/R+1RDHFCO4ri55ZJxNPw1buFcCBwPfovcFk7IxBbOWyS3cEgWDD75G66c/P0KRMK0uNI3wW3fFLoFOf4fQ4r1mpD+PnHyVftlEabSX14+whvFibqMmYMF3FZc9Cdht+AYz3qJb3bJGC0M598iGrpNXCOdAY91lpG7kg96u4FLlWPWXaosbneZMbOFnEU538QawqwB1ieR47Zyl/pQ4ylF5OrGOHupMqKCaHodTrli979j55eTSCexlPi8S0Js4vjnnEIfQhAOIAgHEYRDhL6flUU4hJu4CYTvOSxnp0L42Snj+xshoZwbPiDL38gNPSg2cdAucRDbB5oA/bABExeo0cQlYBMXM7P9Eqtx+yWIbr+ArOd0FBBvW+OHFoMaa8nTjSc4Ju6zEgJvyMQl2H0OOCgKIkFRiBMUBTuZbQuytVEVo2mnwmKU/1zxube/8PMX2P3uihzcd3lxaHiwr9aJnvP/4g/PPrN0t+UT/Tgwd6brsZ0dlk/0qdOOOyt61VGbxBOVjWH5z76qGeBuU2mOhunHuKqiXHm9FHpRa168VUyM7oMR48MdENQPcFcHaGYOVV/Q/D1cRa2iaM/rqBKowqhYEP3gAB+7kB67EGTDKgD1A8KCARFu+QqZJsjwJFIKfRsSL6/sdmKFYt8HuOxWJM9/9N7xnZnf3fEdyxVn+1RP4varZ18knog1265S2E0o8opMy1eXHN2D8nvILutbvroQP+lClv2cFAzRYbCkzs1O5kZyOg7ASQYQuqGFKUfzgmN84BM/+CQAPmEbI0VOk6gIoxrcoYeZAYgxBOIiBmKM/mk8KiYQFzAQm+ifxpdYBOJivIDMeFxMIN5gahmYRCAuZSAm6Z/ITc+Jmm961txXbOKmZyKbYhKkuSPnGBiZ4Y5cZGBkljtygYGROe7IxQZGNnNHLjUwsoU7cpmBka3ckcuRFVseiSoKlkcVBTiqyCuKKgqsxuXBqKKNRo1xD21Cf9PGTtaG+BsH4CQDyOt2FT5VL4UuWlSZbtXE1EKnfhZXAoTwLBYyrO0py7UduT7apUjbOQk8F6jteRo1hm152vkC0+VR48IBKRItB+AbCiCkvHNA5V1KKS9v7yp8GbLZ7EI2m8OI9JMbmMI3yG5ER6rxMBfd+eI9mgK6SDO+K1fQfJCJbeg8slkEJuoLaKI+ohELhkCFUvha8/3JiDjN4nYnCy8ysEfjqnGPJljLXWzcq+tEnC/wuETRhNHHggHWc/xGWMh6F8r6MK2G3GTfcnaPJnwDt6Ig3I/ECEnWzFAzw+d+8mTSbbJanxdo/aCp4hNTWp/RfJAJrY8g1t1k8YnGtHL5ucZ88UkK0/oJ0LcY0PqkdVrvEmp9Bo3RjNvmjNHwDWQ952Ih8UVzSaMXzYW5O+fhUY7Wb+PeVx/epcrX825bDN8nK3mor5+QvN1irc+a0XqOwGQxX5+hfxq3JGJfnzXq69N8fr7bOl//vjekr8/K+vqsAdYfFl9/L0fr7+PeRBl+0AJfnyaTflFW69MCrX/4sGh92pTWm7pyN1vLlbsTWv+YWOvTZnz9RJz1uN19fdqMr8/yuIT5eiNaf1h8/dMcrf8i59XmUvgrlvr6H6n29QccX4/7+m9a5+v/x/H1tvb1L3G0/kecV1tK4Ves9PWRBtW+/ueOr8d9/W+t8/V/cHy9rX39v1itn1BA9tXWUsRrpa+PtCv29ZHAG93Xu2vx9e5SpEms9W4zvn4CdNLuvt5txtdHeOKC+fqITX19pI2j9e1whavuwqBZ1WcJc8KZEMhPl7iBoRux2yDdwihWLo0ZYPAKlyJHiVXGhboGtznM0pqP5GF2jAFlvo//0YgZnWDF8dTNOVB5aZEtLyU/o2yBKfkZQ07pNCGndOLIKZ0kckonRRWhwhGsh/1OCnn4awIIxiGkEtyLUM+PUCioqPg/+qXHL33pzwNHGT41w0MGNJp+9Pw/YzJd9GvGQRJRvBEaFEAVzKPBjtNTNXKhWMHM91T1S/dU9Zci76hg1HEZWMTNqZiSbELYJF8x5YcrpnyKKqY4IkAdyKq16yNY/h3gdcCAlTVIP6uYnit5TRhFxTxB9JQJMCgEnpKlZYxzjWxkPnheoFrHfw3IG2Bab1VHufK8nIBeKA5FeIbUAw3zGtV9ntv3liLdBsIRru7faMBAeni678Z031OKXM/KuOQptgakn7IXPbcEe05fxVEY11qvAfbhptsrNN0rpE0366p6+aAHxIvMoJkEQ4Cn77Qx0XniABuGsCsuX40rriZ4xeUXrriCaBwAWTCUDF5eFyOKDsZp6wVLHL1IfOfjmfdrag3H9n/x+It+fdmr7QbCMd1xGAofV/nEjEQltWRc4FEaF7isiwvgSmqN68buqvBJxQNwcBugLapykB7WasPcllT9xfLc9sDcdivitgfN38Ha6mHpSKJHsH+zDw85QYDrVAOE+zebhrhTNcSNqgGuVw2wXzkRR5VDHFMNca1qgH2qAa60v2zXgbbA7T9NQ9xeB4zZUgc6PWJ7FbTgo7fZH8f1tldq5YzeUAcKuMP2fLZAuG+3v4NRHprAHdntYxjrwIyp/+h9qiEOKEdx3P5U3F4HwlgHce2o/T9avRNUn0HY6gShk0Rhdjhe1Y4fXQ9RaD3Y2jHb29r19qdiHcSMN03GmHFTHRiJMfuTcUcd2LE6YIz6KHTE9uFTPQjj1joQxsnosgYPncvC98GNo0HXJZm5mOsi/kVbnm7g/QX8931u+Yu5umUu5nIz9VNUEZsXLj7ECMbwzUu/JlGHI1kc8Rb5ygy39XU4bpk6HE0BJkNHUtq9WkL8PQhjyLMDm5VD3KIc4g7VEPtUA1yv/Ju3KYc4qhziTuUQx1RDXGd/Tu+0vXRvsL90b5yERscCjd42CaX7wC77y85G+1Nxu/2dgQWhye22d1jqNbAOhHFSWsZD6APd1IGt8stLKj+K3EPU0adrLsA/BjyRx1lC+mRhSy8hsXPQXmPHP7EzMHd2N39sy/GDJitFgEH42ZBaz4y+GTx25dc+4ZwmLz/RnDUqH7WKPlPzSZ03S1GRmgVORfWYY0zlRBMlKpQ+1Hhu6j1/mHPaluYjfi0+N8WVdr9e2t1Vtmi4FKi+oPl7sMrg8lmw6NegeyYDhLb6wT4+dgE9dgFI3CsA9QOCggEh7gFWMo2fuVExVIp+VXDeMya6bol3RXKsFP0JoeC3wCsHaj/TZOJkO3KmKWLdmaYIYqW8ik62e9lpNcoJX7JdFfcfsBYjJrQYnDvaxDceNwHHdWO4aDWVoi+CN9QtAe+96AGvqien4aN/xi5/A082c66Ta0KDE+o1RhSa5EQhzl6AXp65AWn05UEafXnZRl9liHP4qtagV7UG+mvKHjByrtbOUu80IP0EkyzTKJy5Zof0qoucAzEsjEST7B2FYfonJHdFSoYQnk7scQhZegoLIC4nFBFuP4gYadMW/btMHBqSmzwqb5BDsEH2KjLIIZ5lhA1yWJbgxiUtTH83LPmhCrNinBAuIjTIEdQBAYOiYJM+2pwyohUtxbzGLy2NMWY38cTIQ68j9Nq+3qUD45QBuHv2cC+gi+CglHZQkh7EsDr5+m6ikMcJeL70wYYmXGOarPmus4yefhnQwOdom6171lwZ9U55I54iLYrmGzfiSRovhFMaypHufdfDQzIgc1OIGJVX+xwy9hiWI+IIr+N24YwdTVS2nSNmh4LtKXnmkiaPHeuNMzdBzw6HYhVynHSYyJG2EzmKFDlAictqJU5zrS9Dw5xUWHETC6DZoOlz8eOJb5IvOg3+ohCjeWmh82rhNVOi5IrXzjp2ZoVzXTGQB5zopkVOEN8mH920wNFNSFF008J6+1DV2+uo0UqjxoQWrZVxYKFGKztZK7LcIc/gQg2zEDeqBthn/2+Gd4BMQxxVDnGn/Rmzz2G1PVkNF0jaRng2KP/mbbY3jfBOmn10etT+fKkD07jB/rJ4Wx0wetT+GmiB8R5TDXGd/T+6DsLQnfaPduqA0fUQhe6ehPGYBYGyE+1MEhVcZ39Gq5NF8jOnHMld9vcHY+odP5j2zDFpT+p6qRT38t3YczVnJ6ezuT4485mXhS2d+czr0cnTmIFZ0bzBWrF3fPC6lqMenfF1iK2ce9vzVbYCgwpoKpUhYpscEc8B6wsLYH1hHqwvbMPqCwuymMlQkZqFUQ/qabM51mAgE+pBps2BZOogNYl16DKzJeBOVk9lO6VpPlaEYWSv5zq2vge2A5I25mSlOyAp63ZAUlVWOTsghy16Wa+ciFvtH2moX4/cZnvJ2aA+Sg1NzlB6bBIuw5z9OGc/zsn/HGbZmYz5n3pIjdfBBoPjWO3KGfVKvcn+H717MgY8Vmz9SNR1UgnONLdgtOkyrIbV0Pr/VP1SvgVJbLTKwpZObLSimQUw6dFqMMH5yZ/33jKl4ainzPHVeFIrhSQ4JdOIJ4EJzjyY4GwFE5wFLMGZl8VMhorULJiPalbv9hLqQabNgWQSnC203kIJziKb4KS+rZri5B2haLqGvHCl8SOeiWoGFUp7VnOrReSQCDn+VBn2Tvor7p7TT4tfmhp4sFAdqek/eMaFIEJB1F/9SR1dKJ9KYl5JUgiUX0GOJWkOE+RoU230BEKSxhc5KDMhR1zSZJHzEPApijDFLq4nuZm8sBQURLsdZUxad5QxiRjwiKKjjNwThdR3wwd1yVHGpkHWTEWrmgFMHGUnjgq9XAI4yhilsWdFK1FqGgBPkC8BT0ZXjzI+pu25+kS15+rS4tC8Zd2DxZ55xSWDxaE9+m6qVZXR9TndD74ZBJ8kwCcpoIvrEnCEa78WHyP/o3arTta9AW1/cdQ1YXkriASsrhlF6ppgxTeDqGtKUSuIFC/Mo74bPjVXddJbWHXNCdU1x06cE6prM6CumrONrLo2l5pGQAdDlLJpVNZKhDSmhmMl2ncT4GMYD41s1jbIdEeRWy81fkpeJXLWd0fJ8VwJrBLNct/8CChk7LTNSESriXYr3L6TVYkWmvHGt6dbhErRCkhnC40/K52tpabxmgWnoVY2NHTUWmkwwUhYtaElQFXpPyBLVoHSt5barybAP8RxVkYO0/7z/z12tIwHlKS5V17dm633gM2oB4QzKM2Hep2cVZ1A61GekdsPSr7dpCdxSKTHOH0T1UEPnNfbveTG8/pXjzw6t39lcXlPf9/UucXBFcNDE2/29+2lIwwPzQawBVQGmY/tKJShf5o2JG8Ge3zUngv1msmFgqLQrEgUWnkOHDIkmlrTQ1xRmFUGUmRIzAKUMySHVXoSh0R6jNPXnCFppQ1J3iNh7RBD0qxxljDXJlbh8ssQTCAkc+9TzNSOWy4QOG9r3QnppKTj/vn9l3f3LF+9n+sDclwbUtDYL8W8zdiVtxnreJs5ZLxtluIt1Jay9oBuitKALmpdQBdFWNMqyxpT23zNSPjQTJZ9P0e9fkrtQRRgmaqJa9hlaqHU9NOaBafTQFLt1/Lr6zKMufzV9TQC+nfsB2QMBsVvsfAElFeppWu1ztK1gkFxgUaNkeUCbSyNn48qIAFnwUBQLA1SFBSbBcgGxRm7Sk/mkEiPcfpmTAXFeTooLngkTHcGDopb0cDJqCE5hnUIsCgULBeFgrHjkrWIQgH1UjpqtNGoMRrVZsCQtLHTtSFK2mbAkEiDFBkSswDlDEnWcunJWm9IsooO25ozJFljhiQrZUiy9E/E/CtfgRUsD/ML1gtEQW4F1qZ0BdbKXYEVuOYkr5y3rXblbat1vG09ZLzNSvFWIqmVtZw1WeuTWlm5pFZOljUyVR/Ud8Or62xl2Rd/q71W1znu6jp+pnhtHH87yB0za+NsqT1FQJ/HuCmKzlFzRTmcojzqNQnHJSlNCaXVKaocV07OcUna1Li5/FQO0SBSnRKfWw/5qfgc/bdk7SpSWetEKlsnIrWwLkTqWgNGuRvkjhmjnCu1/YmA7sGSEKoKVRL0axKbBq2Wa1Cr9ZsGrXKbBnlFGoQ3P2pF0qutRDgG0axoylwSE0pYAKKsyfuywtxWig+wFcE2FamcdSKVqxOR2lgXIrXegFHeongXqe15Avo2zChnFBnljIY98HyqSguzBuc71N8XVTRf1OB8EUXzRRDVS9jVAlpYEZWoEwt4V11YwA8YsID3qLaAzxLQ91u4GW5Cog/7Znitydi4lFhR3w1vnuUJsx5B97xS5raogEHtgGhpdvVY4WovxT9hQKI/DXLHjETnS21PEtBPWL2PLT6q1oauRHTU6UAUrtNyheuEFa5DkcJNYanRQZGQPgv7mepZ2J7iksE1A0PTiytPnnrGPvDkafvIRy4qdg9MHxzsXkMRdUocHNG5j3sC9d7XQezhPDwjzvzx4OeM86fOx4Hjs3P57xfi/L+3xcdNICUYIgDIU+cvE836ool+C1WV/7GsE+uswFjEdWLx7xPQXzUImuBEz8EDXRJfEN2KSLWg4ETfsCEPOTkF22TG0mhlvGdpHAQvifYtcoMikrKat6wXSOvNMmj2CR1RRuVL8e+KGZVHGLWIYVRe43d1jCpAoRCYNvzwpYNgcrUAZujIPaDxl8B3loDJmIXwaM35ReyG0qrS8nprxH9GXvi/mhD8tZziXkpjq+u1QivRQXsOdoqYPdyruTQ0T5NHz/GQNMcPwteHLhTW1S/nXZKdaCQv/FZmqSl36rpxn3ycELF+qRmRW2rKpY0b98ISwQnWqO+GuyBECLP+zuuC8IAwMDfVB6FF3Achyr3+Nv5X4/67ldHVxJsYW1mgSaGmzjaCmEd11ZVmFOCwV1fWGAvACsBdHsJsaKefVYSjiWVluwEFaGenbhcqQAegAO149NJRSkRBZ1UV85TszmO06p14IVPbgwR01qBKs94O7HNa4F2D3VJVax5GiXzNcWUDafzGKkob26uE+g64BRRJcyTaZU1fBGNBS6ntAwT0FFO9xqJIB4IcZSB5sVLidPLC0TJbsiHLLVrI+i3ZkNyWbEKRRUvwIgnqu+Hug6QPWWIqutGRkjjlL25FAJV8ZTSREKfoK3ESq2zGw+/EdAm+JcSBCVrBYuoQpoS+HNYIIGpdBBBVliqLAPmn0oQiQWNy8smyg+Ak0mUhbPpW/piWOJR6GzeFWk1Js6oysRoaKSXmkRdmWLeiM9OGst5XdHAbSskVXYqzokvMYc0/1SkWmJjbUM+s8U/h67kJ4z/L+Houwxr/T9a8vwdnF+8+f/kqcHWahxciTO6kYGBY68HmueBsbaDnKYfOwI7QQm7CMXEDod81MiWqUcvVOWp9iWpUrkQ1pUid8TaVUSRBEyXMKtq/TWViifFYroVV54dk0iVtlotjm/Xpkja5dEm7InHk5iweAFe/HfSzCrOGWXHsEIpjB76Pyh/UCYhjB409K46dpcRKmO6YdW/GKG+k1+kcFkCHFICXsH10IwDuYgFMkQLwFhZAlxSAx1kAR0gBmMkCOFIKwKdZAG+SAjDCAjhKCsBVLICjpQC8mQXwZikAnCYpb5ECcBEL4BgpAE+wAI6VArCHBXCcFIA/sgCOlwKwjwVwghSA37AATpQCwPF/Jxnp8MBvcXuy1NwuZGOFqWFkfPodkAmeClj1VtrZsFZ9aqnwZwIczJ41cwPjAg56In65l4Dezy6x4Fik2fJYpNn6u4Wb0ZVfraXBcpXM1HcbaFiVuEt9T0nVZ7cSH6ilyiDxEaTQAs4F5JGFRQGGHUGWJll6IgOtxNmgPkRPBG9YZJEUdwuVAWCusaAmYu5MoSZiLrmgJqpec6F7y0NPpHvmpSfSPYvRE1WgPwHmPjgmJiynbi55ExOGTUxIkYkJsyoXAjPlERo1bJfdh1HLiIc7jqOxnlKS9EFPPM3UDbjoLwC+1sV+rQupGwjRr+lo4UIkwy3HnAvkJcMNS4ZLkWS4UVrBWuhm6eipjFsDTeZhJ/MgjCHP1qkGeGCvcog7VUPcqBrgetUA+5UTcVQ5xDHVENeqBtinGuCQciJuUw5xl3KIW1VD3GB7RlugLtvsbxf7bM9o+1tu9WbxwB7lELdPQlk8cJvthRG+i90+ENUHjCO250uf/a3OljqwEZvtr4Bj9jeM6j9692T0BpvqQHa22d8H9tlfdtTLt/qP3qca4oByFMeVQSQ/w/ZnzBb7hzt1sVYdqwPOjB46XuO5YeNoUFsNmjL0h6pl6L39S3fvHgeaH1zIr9h2zwTen8N/39M4zqvCRku0Zxqr+X69JIAcwC18ir+xsaDWYyvo4akEs1lCWTGvIrHx0q9BILlFALEK1IV84iyvUC+5GAQsaskQ44Muik/6c+pTvVV50hM2Sv+EKi/JSfxkr/HqTLK93EON5h0OSA6SF/rYfRoIPCmhv4zdoyVPKnC3jTz0OrFek+5LB8arb2cIJzioX8NBOFNKriGAh43TIwUinGYRvpU5g5+l0atq2rRTmTcz1KDX1Zl5RbNVrQEG0il7sL6cKzecm1mjlcqiI//ns/7/99E7PI989zf9N//xmH1fvXDXfz549t7S8W/bNO/lO381G+HLwTJ44PMR2mRw2kTFtEmBhBarx63IPiNWqZBC6gzSlBTX2ok/WHPb6DDfLpGzpcmdoHRzNp49tVUAVQAjG88eeOM5rWjjmeN30pTf0U/rlSU4MK2XZ+ep74brRzyEWe9m3WKsaraBiWPsxDFhMJUAqp5iGi/FiFailNxvwuVcZtz4smeCkj+wTfiBuPJFGJIyt+YSiAvwW3ONn3clEBczEFvon8bL+QjEpXhPKeN1egTiMrz5kfEjqgTicqxFSEHiHAeBOIuB2Eb/NH5Ew0t7Dj3Mdvqn8dMXBMvZDMQO+id0NAPFMsfA7KR/AjCnoDDjDMwp9E8J9+W13H15rXdfXtR96ajRRaPG2LQuAxaoi52uCzGTXQZMkHmQLepBtqoHmVcPsqAeZJt6kO3qQXaoB9mpHuQUCGSGPeUbqy7uoTDi4UrsRWUzyCAaEC+0/59KyiH0lMFsBmW9q4iD5ofXu4da9rM4eUvJ77G2OKYu/RRDVnpw554EUkWfpGJLXgoktZK88NIbqFD4fKdQ2CkUloDoFAo7hcJOobBhiE6hsFMo7BQKHzY+25+ITlGvU9T7xpXF7fZ3qOoZXQ9lOE4NrlOD69TgHk7ZcWpwnRpcpwb3MBsepwa3rmpwZ1hfgztDXQ3uxJ7BqprrqRqQTRADNbHTTq3+FS698VaBG90NIAwG9wK8ivYCIkg9g4spDaQ6xqTK1YNQjZSovhfcD0sg2/Fs+W6C/glATIpuFQNxSSG4sPVHKfonVH/ExWWRAVxaEFwWqKozIhAXq6ozIhCXqqozIhCXqaozIhCXq6ozIhBnqaoyoiqWs6rqjAiWs1VVGVFY5vAqI6QO10i/qbO4e/Ut/1HxGan3mDTflzNo+2nTCAD1s6TwI9GCV/Ma50Oag+RDPmDyQ+ZxAWe+TQB/CNxLp2wUF/R8xjFQAX659B3xggzrfZY3ZvNZ70l9qCfVUcNPo8aIh58mLBLjGFGUEzByGwFwIkeOXKU0uQ829TDnBXcp/TR54RNYRYdXUUWHl37tXrh0wsgnX65nlxsRXr+c/NwqL7x+WHjdioSXY7/coPAGaNQYRgQq48CSkAA7WQDhbECYTDYLEC4JMQ1xp2qIG1UDXK8aYL9yIo4qhzimGuJa1QD7lAGkjN6kk0XlGMIpJ9MQb7f9R2+wr3BbJThwdZJpiDvs71zgpK9piLfZXnbUo7ixDmRnh/2jsRHb80W9LN5RBw5LvdnZbH/GqP/oPcohbp+ECrNl8gU7cKWAWYgDylEctz0Vb6mDkHGn/WVx1P4xaJ/9/dU6+/NFuV2Eq0vtE3ePTUIHqH5pUAfL/W11YBg31YHsjNSBVx2zvd1RZ2vJz/BktGQjkzHcUS/fFnBm1Ma8Jj89tteZm21vyuoghaA8mrcgWaQe4nYbx43kZ049SJ+dQVq21lLuZdbXg/goN+BOyYm9ZMc6TquPUDbWgVO4w/6Gx4Lw9tY6cAl1kNuyAGI9SM+OOpCeQQggp6qWKvQEBmFteNUeQnNNLD0tP4U2MYeyY2juUvoZrNz4IOCajqG5qOnrrIx6NtY/zwiAi9myeUIgBnRAjub69EEFMCEXy4oAXIftV1SHzdF36hyJjhpBGjWGk8HKOLAOO8hOFkREIygMis0ChINi0xB3qoa4UTXA9aoB9isn4qhyiGOqIa5VDbBPGUDKatpdFuGYxj4Q1VudEdvzpc/+dhEuazMNcfsk4ssD1chIMY7D9hfGfaohDihHcdz+VNxif9tdDx89OhmN9+ZJ6ALHJmE4ttH+VITPxdnmozdMQuFeZ39DOxkD+VuUE3GX/d2VEzvZVAG3TUbZsX8csb4OGD1SB+Kt3krsnUSxDvkZnoz+oB7ke5v9bWM9LPgV8pr89NheZ262vSmrg5zEZvsHUBZAVJ7oVxh9k5859SB9dgap3P9b5mXW14P4KDfgTvWFvWTHOk6rj1A21oFTuGNShre31oFLqIdNhLFJKT076iJGaYJAutCqR2AQ5zoNy4qSN8kVJbvNFCVvMluUzNzIXUaOUyPbJFem+mYd7SuACeXJTNQMYI1sVFGNbBPL+GiV8Tpq5GjUGOHMVcaBNbI5drIcIu05YZRmFiAcpZmGuFM1xI2qAa5XDbBfORFHlUMcUw1xrWqAfaoBrrI/EeE4wDbCrVz94LjCRhC31IFKj9heA+FcnI1UUD2rb7e/37e/l+6zvyG73f4ojtpfctRbndvqwMGMMOcum+glp/FVShMynZd+zdTCx/hn17pMvoi/6m06Gnh/If/9XIP8KvlomUVyA+e8brKUnVNZO2dPYm+2gdfOkvdEheXXzl547RxQtHb2stIQANfOERo1RmIjlXHgHZCcuyUjiAo4AB2ANgMIXQO2RP/EU7V10JH1Hvb4NhlTMUjrmIv1ojReGpunf5PyIJUr+JBb+rTWjGMoY6XsvIMAenv3lCLnMC6Qmi0tYWy8CN3T9GuOYa7BMJOfKWUqQX62qAfZqh5kXj3IgnqQbepBtqsH2aEeZKd6kFPg/ap5w4u1IDMjZP8GUseHK1egVu5YPYV/cTRrOL2l7MqK4Qw9BU7AvQd6Nu0dIBKVr3398BUnc+zqEu5V6dnVrNmMqutREwUdZRG5+DRBuT1eY51cjrywHmt9E5LYVsRa34To13RouxD/I3kH50Xy/scN+x+XIv/jRmnFRDsUagwdSSwEbqpx+kl5EMZ4hMk1swDhTTXTEHeqhrhRNcD1qgH2KyfiqHKIY6ohrlUNsE81wCHlRNymHOIu5RC3qoa4wfaMtkBdttnfLvbZntH2t9zq+Wx/IqpXv+3291bw1qlpiLfbP7qzfyzWZ3sM1fN5Yx34P/t7K3jr1D582WF/iOqNzsgk9ICb6sADbrO/BvbZ344d2G3/j96nGuKAchTHlUEkP8P2Z8wW+xvbulhL18PyYPTQ8RrPXRtHI0QNUnh8yH2h9VcaXKjyRoNcK7vJEVa3WxRmNnPc1Z8BCSa7EbEJ0K/p6yCo+TzlUgndDkeoijdDCo8cKaLy+z0eeL8npGi/Bxd/HTXCNGoMqamnfmi6MDtdGOFemOaVKpDlZz0OQAfgpALo0ZuaRdVnYJlBGKmAWKRxz4wHCZdybycVEE+DE2grIMjf4zRwmRoIQgh+DURuBiln26A3cKR8gpTi5WbK4u2licolym8J8IskeO+phgsQNXiseoC7ROASZhbFLL2rpCpswmVX+dDrWLz2n0sHxmnkZw/30kPLiF/L1q/B3lWyLMUj712jsHeNKPKuUbSMSUeNGI0ao94xoXrH2MliiL2wEqDEUfSYHKm98nyOWX8UPYaeyNBRo4lGjaFik5AtkidK6gEgZZmYkJMw1CjjDYWTEcQW1T5RhJYDWBlqnyhadViMNVE4TazqUtleEq+7A1x57ox8gXMLXEJO/XJsU4cyWg36Jy2ISLUiUpBHGFeg6aF71kZLM5feDXp6N9B0KDvernQZMPtOg4FYBdwhaBLHKrwArqmUe4EA38ws1z00QaD6Vl6E5sEiNG8pN8qKSkhd3iFU81LeToIoLWweImyzEGFDeB3GDoFEmIchNKzBUwr4AYeohqegzSpK5D681SAboYAHo0BA4miH11jmynvI5zMOMgBTzGsAYgiBuAiTpZDE0olAXMBADNM/jR9GIBAXMxAj9E/j6wICcSkDMUr/NB6BEojLGIgxA5a7CYG4HDsKDZ5bjiMQZzEQ4/RPAGKCB5H8zDIwE/RPAGYSwXI2AzFJ/9Qvmilcgvz8chBZGaXknFJCfmWUgldGQUUroxRLzSC4MkrTqGHnAsHdnDQ7XRqxeRRIt3qQfvUgvepBhtSDDKsHGVEPMqoeZEw9yCb1IOPqQSbUg0yqBxlQD9KjHiTYcdOF2lLNVvVnqlvVA8Mrl80cWFZcURzs7t2j34Ku2r893K3jvcCe9TuAFpnxvdo9ZmDrOY5uPU+sO79PnTk3v6iN84G/RBLdz0hEFnRZgOGQKUHjhQZNTnakpuyIcZZQazwmpULhKUyqhJHtNK/UHg07Htih+aN4Oy0CagWJYbmg/yzWCWzV4pJYPEUxnTC0fAK+MYxrfrSU+yf1lRpZctN6XlHF8jPpQo/KHAfA3K/X3E6CcSGP0VTBMu4RiXW0Ic0JszU01KdUt1V1b8WRlVBWjgEnyq+EsvBKKK5oJZRl6RkHV0I5GjWGfU67YqUQnXbFKiA67YrtSESnXbFNITrtipWguN3+HnDM/h5QvTSqJ+NW+wvjqP2t92RsI+30NLerTk9GYazPVtfZ6k+vxAo3i0znpV8ztWg2/tkWtbrOnmB9q+sT5FpdQ5UbQMqMtEBcwC3Far6rkrFpXsltDts8TCXqeW22m29GX2guNa+xT3tZrFBZsr1sUD4J5bW+UNkrU6gco1Hj1FeRn63KKsjJz7x6kAX1INvUg2xXD7JDPchO9SCnwNltuHHrAlDQkX2WBRpAPKu332zj1lkU2iCJpBu3TpjZ97EGKa6uJDZuvHErVQaZ0D/zVX+mkIavLWxXb/IzQvzN5xzjjBln51IGB6C9rjzoYc0B9AS+DCEAPmmqxtZVE8FrW9ByPXnhP99A/aIvlbdZTr9oQeLC6RctAdDpF60CotMvWgVEp1+0PdXF6Rc9KSy30y9aBRG32z/OGbO/PqvvWbfO/s7F8QWOkbCPTjtN5SeJMDq9xu0pi06vcXsaRqfXuBKITq9xFSg6vcZtamydXuO2pWPd9hqfY32v8Tkqe423LK95U78BKXDwgt3TGmvuNeaS35gLwRtzXkUbcyHjRZCPVmVtaXFoRvfAyuHe4l64UwBfhEKNezlScjIkD+MgfBcguheDIg1BCo7rmhFw/6cVX+0rJog7B+9ape8RRFU4ukWNdd3axrpeDG6IZpjmCxEMQmUMkEb5WvmEcX2NRMSO3kkDQIo8o4qKPDVHzE2U25hrZhZGIC5S1XqMQFxg6uw8dsB8salGYXEE4lJVbb0IxGWqmnoRiMvxpl4AxBQCkW1mlqJ/6rWLEtYmfpuwJsRbpeUcRkzeW6Vhb9WkyFtxuuVQHYN11MjQqDGqn6HjOGC6DDtdBrEmFEifepB+9SAD6kF61YMMqwcZUQ8yph5kXD3IhHqQSfUgU+pBRiUWW03iAHglCYA5a64HwBD1gWrYxV9fRc0GqfzwOWosTuXQwF0NcWRK56nxlHnlFc+3fAK5RkJ845IHcXVeyxdmSJW3x7oqbw/o6nw0aowa+GjCGk9UeCxTA7JS4yclGtUqQaPurWqGwbreQkfLy5Tdegt10agxMtVVGQdW4Xaxk3UhtrpLuO1lFiBchWsa4k7VEDeqBrheNcB+5UQcVQ5xTDXEtaoB9qkGuMr+RIR3GWwj3MrVD64GsBHELXWg0iO210C49MpGKqie1bfb3+/b30v31YEGbnP4ouCbb6sDf1Df7Vy6jO9k1trO5Si5di5dJtq5HCXXzgXZhvIr2ivzG5AFfrcDYSOF1lMqi/LWZuc4P3acX8MEDovK48BMn5+dzI/y3AE4qQAqOM4fBJ/AbQPYQ/ut13EbnLSeJugj1Xq6oI9U65lOH6n6tG3kZ6syuSc/8+pBFtSDbFMPsl09yA71IDvVg7RRH6nWK6zsI+WX7iPlL7VeU/MN3A1ImWVMTR+pYPVnCul71IL6FHep9S/khe43UCOYC+U9gtMIRpCKchrBSAB0GsGogOg0glEB0WkEY091cRrBTArL7TSCUUFEp8eDTaO7ydjjwWkEY0++OL037GkjnN4b9nRYTu8NJRCd3hsqUHR6b9jU2Dq9N2xLx7rtvXGB9b03LlDZe6P17xb33tDvvVCnwKISTHYjYhOlX2O+xi/3NUytUnNl5gb9k9bqz4D+WZ6WT92zQvVnUP+sDSZPBQ39Xk8D/a2VMogR7RX31DsN7D4d9UXw3e550V4kUD6xkLsZmX+4Ipj5KHNSkC4a4J8UDFRlrdYWLm75LTWkhUvAuhYugaoK6KgRplFj1CNMExaYjtO9IoxoXBiRbr861lyklDV+61jjN82a8rg1yhgjWuuaBQjvdpqGuFM1xI2qAa5XDbBfORFHlUMcUw1xrWqAfaoBDisn4hblEHfYXrjh1Y9piLfb3kSoVxflKG6wvf7BaRyzEAeUozhufyqO1oFG29/pq7e06jm9yf5mzALZuc32jFlnf9HZXgeis8X+gcS6SWgZ++yv0XXgDdRDVC+LI5NQFjfVgQccsz0Z62FVOWp/262e0+vsz+md9jcSyheqNx26hSqeuDaOBrURobIDQ+hC4P1F/PfDLvm90wtl9k5dZO/032Q2OQKW7z8FrN/kCMhscoRo1BjJpJ76JEQzhAg7dtpO4dZg/xt/a7A8ztl/cvafnP2nwxZWOPtP9rQ5ykVxQx0wWr1Gj9heAZ2sqJMVdfbxHL442WrrITrZamcH+I27A2xBKni3U7+jAMU6qN9xdqCcHShnB+pwctrZgbKXqSU/c86qbXIsieogg6De7Gx20oKOTjuZmMOoMOrNzg77f/TkXMHssr+VqIMTO3XgYOoht7N5EhrvQ5ghw2tljKNB18kpbBcS6rO+5K3PbMmbvitDoPqzCb96mkN1ckPEHKYjSIj+aZwl0Sqt9BDD9E8AYgyBuICBGKN/AhCbEIiLGYhN9E8AYhyBuJSBGKd/AhATCMRlDMQE/ROAmEQgLmcgJumfAMQUAnEWAzFF/4SqNMkNNIWPQ7OmtXcxUDDITy+nk0m6VHiUAH+k2mznvsuLQ8ODfQy6afqjIFRYAqQRMxilX5P+ujLcK/nf9llyicUzMLazh3sBqODVGpzL4NxCu5xhB2Xpb9fTOkP/NI5IumqqgEHNZrDPsYOa6Q/RY5+jf5rAfpFS7NOS2KcxxmQNKIHkDYRRDBmr59OZHTKOU4HcLFcErDeSFcAEWTITNQNYgZxVVIHcjNJKR40WGjWGjtRTUPZa2OlaENZQID3qQQbVg4yoB5lRDzKkHmRYPciYepBN6kHG1YNMqAeZVA8ypR5kQD3InHqQafUgfRK+OgusXz9TXb8ODK9cNnNgWXFFcbC7d49+XVq1LHu468m9wEL2Ev5CNp3Yq114AuvRhMQ3+qtxG3wJYZpaCejDhNMMhAmnsfOeZixMOA0GyQTQrbTPBIadfvf5y1fpMREPm8bt1ng6PTe7EphWamuorAS67mejmtPlAotOFsKZtR2aI3DOYPlzOj2LTjKmVQMo6UDrDDjQmqYo0OJ8zTRE2s6gP9o4yDOMgmS4doYirp3O+05qFh3XtEixKJc/Z0AZDURpefNEbVeNI1y2Yx7JDtVI3qQex071IKeoB9mlmpKr1ON4hHqQR6oH+aa6AHmUan6vVY/j0epBNqkH+Wb1IN+i3PbuUY/kMcqR3K4eyWNVIzlkZydGfh6nHuTx6kGeoB5kqi5AnqiPG6dW94N0T06pPGE6zZ9Ko1heO7bNBQNZYJ+F+tnMWV+dXmobJMDniZZuB3d8efidyGzZUkufaeV19kOvw37tP5cOjNN0nliGcoeewl8RXsOSl/zM659RS9MC+dIV0JeeIvxSFqNTSm2L2BXKNHV3WUwDsQWYTt3zEOcj3E22176iva/BTZOy8lHlZx65T4qSOQ6A+uAFP41VvqnCvaJT2UGn0FRhdPZUWn2NJ14Kwo26Ux6ucIaX9CjQ4snlTy+h3dMGhJbFsBVMSbXStIHvDpmK3B1yWgWlxB0StvM0Gjgw7EyUbKdpDDFDtjNLbasoskFTADpD6XuOD3wNuePkHHngZXZcygd9i3i3+yykOAFUiDPZQWfRWOkTkWfSP40abErFTmIcATXdmSJH8NaD2HI5chYoZwJ7neLQ+4xS22166T6dHl1RuPeyVv0cRXmns9G80zkSQnA2rVZ6fp5lgIRnE5nVEPFMeihLxLNLbfsJocDC1nP4sGmh4MA+p9S2R8+gs3kM2oe8dTL81hn0gMpb70beOhF+63SNOhHBMW4Wp4KWWmM/mLCxqjVI4Hg6FTiydG4ptd1FGR4oDojWFgc07oPjgBZhHJBHd6mAQQV2EOXaImwcUKAthnFMIiDvIkhEGqU/peJJ2yW+hdh9cDXQJg4MWzgC0VZq+7jYE7UjhABZ0sYOaqfx0luuNvqnRREqJpkFoWS2I3EhSIYOlAxRVjI7aDoYp20UlMwoS1iekpC1UiIlIZkJIQHyPKqRnyFGDvKsIrFy0FrjSiVRixy0mZEDjvC00WRg5KCdpoNx2oZAOQghFqqVIwfxT5sxjCABWlETzcpBK/0TkoOEdXKQF8oB1+mYMIsFVA7aaDoYp60hOWAuYUzQn1KRg3sk5CBxeOQg6siBSA7A0KEAhA6ayhA2dCiU2l4Rhw5tZkSkgNrKVkZECvRPSERy1olIqxmX0WqpyyhI0NaQqSggYQXjTnIabpXNyBYJqRUnOnI8iiJmRFPjDslI5nDKSN6MjBQE1hRb+OQkaCs2I3nAjORwM5IvtXvEZqRgRkTwyDNnLvLMWiciOTOeJmepp7E+8swg0UhWw62yGemGj1XMG16sRamZxgEUdmZYVpjtz/PS1mQQDYgn8M1EBp4CP8acNmVL7XmxNnGYlxGKURa1NDnsJEzWsvh9Sl3FbVkxbYmVFQtumyJ/0YZxsWAgpMgBsprFZTVXaj/OQDIyb52IJIQikjMTvrbxrDTtQBARKUionyGDmyWG8+1w/GXKcObZYa1Cw1kwZjhbuQuO9reKDWcrIIx5XBhbS+1vMxWGmFrwFmi8DsuCd0pdJcAMLHglDGe7GfeHp7PzeDpbMmRuFYbMlxownAXrRCRqZjETNSMieZoqmIi0qc+NlQ1n06/59uJacXUAZIwIAjfyQS8ytSeTMWOK2mmsUFOk3+in9bNyskq/e97x+oMJWfsX/g+uEejUeQwuAh0cOnaW2q8nJ4k+ysGNal1ysoFyLZ2otFfrthjQnbKHlLT8qgBGTgR1wieC2hWdCOrkCUu1GlI/7RS5aSe2uc7r7V5y43n9q0fun99/eXfP8tX7uZKXo7+amo5iJBT6L0RqmiL6Z220Uy/rfvug+jhjLQE+bHk+P0J/OpzrbyO27gNS+5gm7E2H4dAHQgQgPMU+3k53R6l9k4ESyBqdZuOnYKfZIXSanTxyiWg8hR3USVOFcZpTpOIqCpIotu9Ea/na8Oh+wlrvENfydSJL9jnI5nYnYgg6EEPQKjYECTM+PlFq3yf28Skz+6ycvkspzMcb6byU0nuiqw2E2TlkqXc1jRw3NfA+uh5WF3lQHiFVjjx0LEwhzlmyL4pX3jkjfVFS1vVFSVVFw2xfFAu6EWSVgSTHJhQDPLAfTMTbTXpyh0R6jNOX2nyoRnOPzu1fWVze0983dW5xcMXw0MSb/X17KfI2e2g2eCSsX65q69HmbOBi4rVkP9f2IYOqFp6DyVWMdaIwSYgKoBPawuoUPYFVm5RNcIiSMpMQFUtOM5oQ5aR+mg34pITJGDmB7ECRY1dNoxyv5Cq1f5vEA1/Qg/EiRsMlx6G4vNFwwUbDq8houFiCe5H1oFtWKoFp3ey0bvq7YU6TDqPtJVbEQkJ/gl8UDQwKg9EghT0rWuFS+7P6L/FUJluif+ID17f+6ldBd1UzT4KVJ5dV6NUB9g6I8phBUq96mxylf+rNZBP9UNMvVv8m1RG10g1W/0qUflsDjBEPWEtjlmtpDNbSkCItjaFSy3xzkyIt5XSkbaK/W8eGOP2soqU/YbU0LtRSTuPauHiNBGhpnMaeu2p7Wf8lLlAXw+CTSPVJ5dt/AfITQJXM28tBNFbqeAsB/SvYoFc28AgoSqEgfNBFfhTHqv134g08jolxCVMPOFYuDYI8vP4kTj24eIvxWukV0XwkD7O/ijGLiERkBQd0pNT+D3EGIoLYe1C7/CilXIyb8NM/jSMiloqoUamIcAgULXV4DEgFQPsIRntXqcMvpr3LDO0DPDpRWOlpH6B/ykh+bbQXyP0E7WOWyX1HQkz7qBnaR3h7nojcR+ifxqNfhXLv5tO+Gcm9RWmkq7HDtFOZN2mrC4RtQfptDTBIFLktBd0CZWsn3/MDMMgusus5KoBiAnDKy1eDZiY0oKZh5qWAwdAD+mduGkEYYz+7MKgSvdIwXjI4EnjRRKmD6YISQ2jYRNMQDg8jhL4XySKM2uAJdKeK7UDSjB3gZCaSmA02koGPm7HBSaM2mNczJFnqOFNsg5MA7cNYIDgB+mwDe3GhGhNdcTjRFRMmujicjwk5n0I5H2bXNykDrOcsrcJC1idQ1odpNeTqxoVsOxJEAVEnBVvFBJK8ibHLKQpneJs7Ti2p9IttsiCnXQ0sRrfOePr4H73yqbVso56KHFQsaY0TbVte+N2nzj1tl3giZv3ul1MJTgYgIFUG0wjmojgJlaAccv+ST6gE4YSKT1FCJcgKtw9JqEjmcf6Jl8G4+R6cqzEB0JAGtU889PBKgdRDNWdw/1mzdP4DjM4Wgtn264l5KoJrIsBHefBAOFDquIEAX4aYMS8xA9A2T0C7zeOlf4Jix1RX+2nUoaQ1avc9NDD2i0Oljn5xgiYEkDOIk3MC+KA44Aqj2mY8Ux+m8UKvAUPWJCHR9l1Iy1fNcgYcFH5tD5KIL23LoCFBbZ+kEP2d4CCvFrkAPZPx7IEHdOQeGnZVCRkj4JHdMYdUvQFZ1LjA/Y538b1Kg96rNNAYl+W0Y77WclLvNCArMz/MFI+WKW76p1FOegyJGTwTMsiFGCpwkFs7yGVmJmOEcGZyZnJmcmaq55nu0x9jcFdjgbvn9GsD8OqwicUZE6pQiUIXkGGlk72iaIb5njJe3fAQvzYw8ZmhmyYoZaOHygkSz/tecX1qyS9+et2bbvjgimde7nl082lT/zRj/Yfdl/x95qa9O8/HkIT45MEkAvoyxLv7QPdpXPZ89E+jIYEpKTfm3Z2ZnJmcmZyZbDIT4z5doPukUzQ890nftwy4Ty/rYU18jwdbpWncjL/GaMXDyeJVHGh86ZXv++2/Vj7SmPr1Xx7/7r9f8q5rL//0Ocv+8nBhzZPvPHHO3iSGJPRl6KIV+jKP4Zl8ZqTPY2gmnwI5N+aqnZmcmZyZnJnUz8T4Qh/oC31KfaFP5At9ZjyGG/QYximnKW5iz2FUfOExK+f8x9Ql03/9ofe7u59PRb617qjPXLTrmW/0/bJ06dseX31KK4akiSUe7AtNLZO9hyy/bNxVm1IOZyZnJmcmZyaBW/OAbs2j1K15RG7NYy6/p3Qh5ELcWuSDD3751oVzv7H1hGPcNz1zfkd6UfTxE7YcdWfhTb99+eVjPdcqzlx6FThstyGZcCvIkZpK6ptSDmcmZyZnpjfwTIyH8oIeil76CDyUG/BQbtaJmfgeUx7KVECAeShX/J9Lrnn0y7NvXPf/DXzuiA+deeWmZ87tevG9HY/Nnul7cNOX/t3MysZlZklpyveaWq0ZT0KaknNTCQZnJmcmZ6b6mMlcwYhP4Gx8gLPxsf7IxPeYcjamfDvmbFqfP/GCT/75+ftLd33t0zt+uDnzy9YO72kf+MV/3L/i+1d+uOX8DWaSuC5MJpS6UZ/idbVPwQrelHI4MzkzOTMd8pnM7Q55BH7DA/gND+taTHyPKb9hyk1jfqPt1e2bHj72xdbzujKxre/5+86r/ui9+avXLHj5kf9evfXvzz12hJlVAFqpr9QjGpc+Z3fImcmZ6Q08k7OTYnYn5ajkwg+FYs8tOXru2Gd9X3/Z/bHu66d+79VTPzjvvOM/Mu+U1e90dlJq8FBOjtmZyZlJeiZn18HsrkPXu1458tZ3fPXyyzbvm3fn7RdnTrr8qulb3nnhWQvart7Y/fbeJ51dB9mZnMyvM5MzU/mRk6E3m6FvefFzHz9r1wWfX9C46m+PPbFo9pcGtv0r9YevP3nrM/917/rSUz90MvQ1+A0nS+rM9IaZyclmm81m5/98/C/u/87FrqcHdj7zSqz7997kLz9y5RVTYkf3XXXV1+646idONlt2Jid36czkZH7foJnfhl898uzVI6/O7Hnffz75w5EX/pX973e1/fjUDeu/vnjHh//3YzM+42R+a7DmTp7PmcnimZwsqdks6fH5+/qvnv7Cnsabbvrr8l8e+5zrmGOOn565K/iRU6/6x5yjfvk3J0sqO5OTfXNmcjKKhzSjePydV15Wev7HIx1zLns8+sIDDzz6kbe9NNT50f976KONX+i+pW+rk1GswcY6mapJOpOTfTObfWvof/Dix5c/vLih7ef/vfqR69d9M//7H91+1vGrLrnn/bve/+Q34072TXYmJ3/0hprJyVSZzVQFT/72nd8/8etNjS8+t/If1+z+yKrfLv9yv/v9TxQuHB5sOO9bZzmZqhosn5NrsdVMTlbHbFbHtfa0W9/7Jc+xj7o2fufe0xbe9Pjnj8sNjf/mq8+FrvrLqved8CMnqyM7k5MBOQQzORkQsxkQ3z9aPj+Qu6fzF//5uWM/MXrTy2d+ds1TD3zjOw8m/rL/pc+dcHXSyYDUYI+cbIGBmZxsgdlsQVPbq+1/euXEa//11HGxF9/vG/7pScdM//vq44e3n7XxQxc2vvNrTrZAdiZnZU3P4KysDamh/xNf6r4vfavnN7d1XvLBaf/6RPea8+Yvnfu7k/57X/eeoXvXrnJW1jVYCWcVqre1k2AVmn3lnH88dHJwzw8WvPRvP716xg/bnr2i59O/m7Xm32MXRj77780JZxUqO5OzYtPrT92u2NLN6dnXBpq++oVZ31t18ZMP/e6C+5498qiXj/zP743/zZu4w3WWs2KrQXed1c1yu6xugl+a+sxJN+77xp2rO6MXPvXIR/6t+dv5Lbf/ou1tr86a99bHks85qxvZmZyVwHJrVwJTAsd9OPvsf80p9F06c/zFuTvfu+JvL+Xm/O09n8wEn3nZd0HYWQmINcqJms1Gzceesv6l//78pV2/fP8HTrzz47+edvnildf/ORcKje966JLPP7lo0ySLmp0I02yEeVLPnMGXTr7rLZ4dfS1v/+50z4KfH/mnf6y88ZdHJD0DdwxMm1a/EaY54+IRXKdsIBqTNS6mojFjFyBiyn737P5Ve+k/UKS7vDg0PNg38tDFfT2vUawsPmX6NY7cf3HfUHFpcfDuK6ad+sXOBuDf6I/+9d2d61p+NXLP/MHugT17q+PLP1yKJnrHW9+7dvMX/m++eKJ7ZvV39+wFLJn+YYCm8YOv03gCn0sH9lcfBMtidlBsqIHleZeM3HfJ8IqBi6+noAZLXa2sQoaoTz1lKvyplX/sp1KgAFwDZVwPzkCToAxiAQfZQKnr1JF7Dv55T6mrDSOfCyOfm3kYxAgfMkD48AOziitXzl/W3af9nCD2OeFS15EHVbe3d08p9ExZBcrvu+nPulcriB457njIHAf0ahaugAQ/LHJQ0bXfRAa5oEFRdlCEpsm984b6B4sUHlHalABAfSxQQt050CD/wxW+8IQtSE/L8sdf6jqR0O5pFmsXTRPmqZuWPeapxm0wT7209FUE/h2snvrlJCGg5z8xDQ36JyHEOIfpj9Q9i9CfqHsWhRWpggbhMcGL+tYyK7pmaVWFeqfBGpvgPRy6GRLqZpjViFBVIxihCqMi56KBSAszPKuXpigRZcgD0rENqNNaW1ueeqFQl+eS6XuweV2YDLkxGfLgMgR8Tojlor9KT8QZhSTkwgdDDNM/wdgtog34QvQgq5TDe3iUI4Iqhw9VjhBq6QMG1aNHoV7MEerFMjLvLfWiF4uU68UiRy8OEsHeenGLQr1YJNSLTWTe8XrRiwXK9WKBoxcHiWBvvTg88omIml9CeEPV5STztX76NYiljey6KCwrONzVSKN+NdKoEX1dlohCTGryRgmJ9AuX3hGUwA+c19u95Mbz+lePPDq3f2VxeU9/39S5xcEVw0MTb/b37aUF3EOv6jyHS8YV5eS8nvx7Oz/+rlmWJ/8eCn/jvCc/GFgknkhjBf1Vc8gVxYBeFN1VGwkMmDe8mB4QqEpBxWx8pqLCxDYSbLQPfFUgFWbp8fbpnwQgi1sZqf8iULYNfBF3QJDr9/3U8IrXrwwodX2yzJ3/H3iQnqe6tQUA",
-      "debug_symbols": "vf3bruXMkV6Bvouu+4IZhzz0qxhGQ27LhgBBbcjdG9ho9LvvmUEyR1SVVy7WmuvfN6ohqSoGZ5Lx8ZQk//NP//Mv/+M//ve//PXv/+vf/u+f/vm//eef/sc//vq3v/31f//L3/7tX//873/9t7+//tf//NMx/2O0P/2z/tOfRv/TP/vrjxF/lOO4/izXn3L9qdefdv3p15/1+rNdf/brz6teueqVq1656pWrXrnqlateueqVq1656pWrnlz15KonVz256slVT656ctWTq55c9eSqp1c9verpVU+venrV06ueXvX0qqdXPb3q2VXPrnp21bOrnl317KpnVz276tlVz656ftXzq55f9fyq51c9v+r5Vc+ven7V86teverVq1696tWrXr3q1ateverVq1696tWrXrvqtateu+q1q1676rWrXrvqtateu+q1q16/6vWrXr/q9atev+r1q16/6vWrXr/q9Ve99vpzHNef5fpTrj9f9UqZYDf4Da+SRSe8apb6T3+S2QylTXj9ZTkmvP6yyITXXxaf0G7oN4wLZg+cUG54LYWWCXqD3eA3vCrrVMxWOKFfMDd61QnzL8+CczPXuYRzO9c+od8wLpib+gmvxbCpmBuxzYJzq7VZZ26uNn9ybJ/zl8YGGtBu6DeMC2IjDZhrbf7z2EwD9Aa7YVaeixqbasCsPBcsNtaAcUFsrgHlBrlBb3hVrtM+t9kT6g3thn7DuGBuuCeUG+QGveGu3O7K7a7c7srtrtzuyv2u3O/K/a7c78r9rtzvyv2u3O/K/a7c78rjrjzuyuOuPO7K46487srjrjzuyuOuPK7Kehw3lBvkBr3BbvAb6g3thn7DXbnclctdudyVy1253JXLXbnclctdudyVy11Z7spyV5a7styV5a4sd2W5K8tdWe7KclfWu7LelfWurHdlvSvrXVnvynpX1rvy3DtUe8FstBPKDbNyn6A32A1+Q72h3fCq3OKfjwtmD55QbphR5xP0Brth/vNXM+psqzYLzrbqc1FnW3WZ8PrLff7l2VYn1BvaDf2GccFsq1EmlBvkBr3hVXlMxWyrE+oNr8pDJ/QbxgWzrU6YlefCzyYabcIM6mMu/eyZi8ZNs2texzGTZo4fc2wi/o+5wJH/J/miuigqT8foi8ZFdhyLyiJZFLsYmWSLYiejk2a9En9v3DR75aKySBbpIlvki+qitmg5ynLIckg4xiRZNB1zD2ezcy7ym2ZfvI68JsXfm79IbZEvqovmssj8vbMXLho32bFoLsvcNdrsh4t0kS0Kx1x6q4vaor5o3OTHonD0SbJIF9miNaa+xtTXmPoaU19jWteY1rXe6lpvda23utZbXY66HHU5avyOuT7quKkdi8qitd6aLrJFvqguaov6vVbbuKkfi+xe09FbsS6jt04aN0VvnVTudTlkkS6yRX6vy+iyk9qivuheg34ci8qiew36oYtskd8UPaPHpFlvHjR5dMBJZZEs0kW2aNZTm1QXtUV9UThe0eTRKSeVReGYSx/dc5It8kV1UVvUF4Vj/rbonpPKIlkUlV8j6dEBMQaxPccviu35pL5ojVBdI1TXCMX2HL8ytueTbNEaodie4/fG9nxSXzTu3xHb80ll0RqhtkaorRFqa4Rie45fGdvzSX3RGqFe7jGIrdjmGMRWfNK4Kbbik8oiWaSLbJEvqouWYyzHuB31OBaVRbJIF9kiX1QXtUV90XKU5SjLUZYjOmAe7tfogJPKovh7bZIuskW+qC5qi+ayuE4aN0UHnFQWTYfbJF1ki6bDfVJd1BaFY9qiA+aRf40OmAdYNTrgJFmki2yRL5qOWia1RX3RuCm656SySBbpIlvki5bDl8OXw5cj+q3OEYp+O0kWhWOOUPTbSb6oLmqL+qJxU/TWSateW/Wit2qdVBe1RX3RuCn2FSeVRbJIF9mi5ejL0ZejL0dfjrEcYznGcozlGMsxlmMsx1iOsRzjdrTjWFQWySJdZIt8UV3UFvVFy1GWoyxHWY6yHGU5ynKU5SjLUZajLIcshyyHLIcshyyHLIcshyyHLIcshy6HLocuhy6HLocuhy6HLocuhy6HLYcthy2HLYcthy2HLYcthy2HLYcvhy+HL4cvhy+HL4cvhy+HL4cvR12Ouhx1Oepy1OWoy1GXoy5HXY66HG052nK05WjL0ZZj9Xlbfd5Wn7fV5231eVt93laft9XnbfV5W33eVp+31edt9Xlbfd5Wn7fV5231eVt93laft9XnbfV5W33eVp+31edt9Xlffd5Xn/fV5331eV993lef99XnffV5P/t8TBo3nX0eFJV9ki6yRbNyK5PqoraoLxo3RXefVBbJIl1ki5ZDlkOWQ5ZDlkOXQ5dDl0OXQ5dDl0OXQ5dDl0OXw5bDlsOWw5bDlsOWw5bDlsOWw5bDl8OXw5fDl8OXw5fDl8OXw5fDl6MuR12Ouhx1Oepy1OWoy1GXoy5HXY62HG052nK05WjL0ZajLUdbjrYcbTn6cvTl6MvRl6MvR1+Ovhx9Ofpy9OUYyzGWYyzHWI6xHGM5xnKM5RjLMW7HOI5FZZEs0kW2yBfVRW1RX7QcZTnKcpTlKMtRlmP1+Vh9Plafj9XnY/X5WH0+Vp+P1edj9flYfT5Wn4/V52P1+Vh9Plafj9XnY/X5WH0+Vp+P1edj9flYfT5Wn4/V52P1+Tj73CeVRbIoHG2SLfJF4RiT2qK+aDr6dESfnxSOPkkW6aLpmJc0R/T5SXVRW9QXjZuiz08qi2SRLlqOuhx1OaLP5+XREX1+0rgp+vykskgW6SJb5IvqouVoy9GWoy9HX46+HH05+nL05ejL0Zcj+rzPtRV9HhR9flJZFPXmWoj+Hcekvmhc9LpQe4DzX88LxS8UUEEDo5bEDeuQaqCAChroYAVjEU/s4FgY3XlhAQVU0EAHK4gtunRY3GaPuh4ooIIGOljBBnZwLIzevDBsLVBABQ10sIIN7OBYGF16ITbH5tgcm2NzbI7NsTm2iq1iq9gqtoqtYqvYKraKrWJr2Bq2hq1ha9gatoatYWvYGraOrWPr2Dq2jq1j69g6to6tYxvYBraBbWAb2Aa2gW1gG9jGspXjAAsooIIGOljBBnYQW8FWsBVsBVvBVrAVbAVbwVawCTbBJtgEm2ATbIJNsAk2wabYFJtiU2yKTbEpNsWm2BSbYSNLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJKYQiNHCRwLZ5bcOKeJlCNQJkqgggY6WMEGdnAsnFlyYwGxdWwdW8fWsXVsI+pqYFSIXzwMdLCCDezgXN550+jVQgdYQAGnTSzQQAenbd5ZKudUnQs7GLY6MSbsXFhAAcPWAqNuD2xgB8fCmQQy78S8cNad83xKzOaROa/nhQoa6OC0afzimQQ3dnAs1LDFb9NQxPJqKGJxZvuLxeLM9hc7/24FG9jBsXC2/40FnDaLgZrtf2O7N42YQXTjWOgHWEABFTTQwQpic2weix4/vh5gAQVU0EAHK9jADmJr2Bq2hq1hi+4+TnSwgjHVLNZbdPeFY2F0t8cGE919oYAKGuhgBRvYwbFwYBvYBraBbWAb2Aa2gW1gG8sWM5VuLKCAChroYAUb2EFsBVvBVrAVbAVbwVawFWwFW+TDvD1WYkbTjdN2nBj7Fgt0sIIN7OBYeB4TnFhAARXEptgUm2JTbIrNsBk2w2bYDJthM2yGzbAZNsfm2BybY3Nsjs2xOTbH5tgqtoqtYqvYKraKrWKr2Cq2iq1ha9gatoatYWvYGraGrWFr2Dq2jq1j69g6to6tY+vYOraObWAb2Aa2gW1gG9gGtoFtYBvLds7UurCAAipooIMVbGAHsRVsBVvBVrAVbAVbwVawFWwFm2ATbIJNsJElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZElRpYYWWJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpbEDDnx81GVBnZwLIwzlAsLKKCCBjqITbEpNsVm2AybYTNshs2wWdhqYAM7OBbG2cycpfTCAgqooIEOhq0FNrCDYRsT42zmwgIKqKCBDtaFcbIyJyaVmJt3o4AKGujgLFYlsIEdHAvjZOXCAgqoYBSL8Y1zkQvHwjgXubCAAs5iLYrFuciFDlZw2poGdnDcGHP6ZM61LzGp70YBw1YDw9YCwzYCK9jADo6FcS5y4bTN6fol5vfdqKCBDlawgR0cC+Nc5EJsgk2wCba4VjFvepWYKXhjA8PWA8fCSIILCyigggY6WMEGYlNshi2SIO47xczBGxU00MEKNnDa4sZUTCC8MJIgLv3FFMIbBVTQQAcr2MAOhi1+UCTBhWGLDSaS4EIFDXzV1SN+xTx+uHEsnKFwY5kYa3OGwo0KGuhgBcMWi946OBb2AyyggAoa6GAFsXVsHdsIW4zDKOC0xWXYmGp4o4GzQjwyGDMGNS6BxpTBGw10cC5ZXI+KaYM3dnAsnD3/upoQWEABFQxbD3Swgg3s4FgoYRuBBRRQwWmT+PHxFOKFFWxgB8fCeB7xwgIKqCA2xabYNGwxZtrBsdAOMGwWKKCCBjpYwbCdz7d2cCz0KFYD45+1wAZ2cCyssZCxLmoBBVRwLmRcTI6ZgzdWsIGs7srqjpa+kNXdWN2N1R0tfWHYYlOOlr6wgdOmMVDR0idGS184bXo+/iugggY6WMEGdnAsjJa+ENvANrCNqDtXVswIfF3LClTQQAcr2MC5OHFRPSYGXhh9fGEBp23Ovi8xTfBGA6fNNLCCDezgWBh9fGEBw2aBChroYChmZ8XEP40L+zGPT+MidUzku7GAAipoYChioKKdLmxgB6fNYxnmLvTGAk5bXESNWX03GuhgBRvYwbDFQEUXXlhAAUMRqzB6yGPMoocuFFDB+GexnUUPXVjBBnZwLIweikPsmK9347TFAXLMztN6/t0Kzro1VkB0y4VjYXTLhQUUUEEDHawgtoFtLFtM1ntd2wws4LTNyWMl5uvdaOCsEEfmMe1O4xg85t3daKCDc8nicDzm3t3YwbEwGieO12P+3Y0CKmj3+MYcvBsr2MAOjoWxA4xTgpiJd6OACsZCxvBFD/UYkuihCxvYwbEweujCaYvD8Zgwd6OCBoYtRid66MIGhs0Dx8LooQsLKKCCBoYtRif2ZBc2sC+M1uvnixri78boRA9d2MGxMHrowgIKqKCBDmLr2Dq26Is4JRjRFxc2cP7duF4Sc+ACJebA3VhAARV8LZnNw/EXOljBBvaJJXAsnLukG8tECRRQwbCFuITNA8PWAhvYwbFQDrCAYeuBChroYAUb2MGxUA+wgNgUm2Kbh5ZWYszmoeWNDZy2EmM2G/LCeHvGhQWcthLDZ1G3BlawgR0cC/0AZ93zhSOzY29U0MBpm0e6ElPnbmzgtEmszdmxF86OvTFssY6rgAoaGLZYyBp1Y8XWsbAdYAGj7gicdTXGd+4hLd5+EpPkbqxgA6ctXocSk+QunN19YwGnTeO39VDE8vZQxOL0UMTizJY2O/9uB8fCubO8sYACKjht8WaVmBl3Ykxxs/nkpMQUtxsVnP9sHuRITHG7sYIN7OBYGN19YQEFVBBbwVawRXfPQx+JKW43joXR3fF2l5jidqOAUawHzn8Wbx+JuWo2D1wk5qrdKOBcyBqKaNMLHaxgAzs4FkabzqcdJeaq3SiggmGLdRHNe2EFwxY/KJr3wrEwmvfCAgqoYNhGoIMVbGDYYjOK5j0xmvfCaWux3qJ5L1Rw1m0xJNGmLf5ZtGmL3xZteqGAUSGWN9r0Qgcr2MAOjoXRpi1+ULTphQIqyLrorIvOuuisi8666KyLwboYrIvBuhisi8G6GKyLwboYrIu5G7cegzp34yfGXLUbp20eR0nMVbtx1u3x/qZo6QsbGHVr4FgYLX1h1G2BAipooIMVbGDYeuBYGC19YQHDZoFRYQR2cCyM7h7xi6O7LxRwLu+IXxzdfaGDFWxgB8fC6O44NoqpaDcKqGDYjsCoEL8tOvbCAgqooIE+X34VdeONVhc2sINj4uy3881WFxZQJsY6jvdbXWhg2EIcr2Y7Yqjj7Wxx2BHzz24cC+M1bRcWUMBpi6OVmH92o4MVbGAHx8J4iduFBRQQW8fWscVr3UqMWbzZ7cIOhi1+/DjAAgqooIEOTlu81y3mn904bRKjE29HDIz5ZzcWcNaNw6+YaXZjBRsYdS1wLIwXJV5YQAEVDNsIdLCCDezgWBivUbywgAIqiE2wCbZ4t2IclMX8sxunLQ6/Yv7ZjQWcFeI1djF7zOP4LGaP3VhAAeeSxUvvYvbYjQ5WMJasBXZwLIw31104bfO6nMTssRsVNNDBCk7b+WK96PkLx8Lo+QvDFj8+ev5CBQ10sIIN7OBYGD1/IbaGrWGLno+D05g9dmMFGxi2GjgWRs9fWEABFQxbjHr0/IV1YbT0vGIoMQ3MLbazaN4LHazgXMh4EWFMA7tx3BjTwG6cCzkv/UlMA7tRQQPX6o5pYDc2cK3umAZ2YTnAAobNAhU0cNrisDkmfHkcNseErwujeS+cdeNgOiZ83Rh1W6CBDlawgR0cC6N543A8JnzdKKCCBjpYwQZ2cCw0bIbNsBk2w2bYDJthM2yGzbE5Nsfm2BybY3Nsjs2xObaKrWKr2Cq2iq1iq9gqtoqtYmvYGraGrWFr2Bq2hq1ha9gato6tY+vYOraOrWPr2Dq2jq1jG9gGtoFtYBvYBraBbWAb2MayxYSvGwsooIIGOljBBnYQW8EWqTGvFUtM+LpRwbCVQAcrGLYR2MGxMLIkzgtjwteNAipooIMVbGAHx0LFptgUW6RGix8f+RCnqTGJ68LIhwsLGBU8UEEDHaxgLG+MZOTDhWNh5MOFBRRQQQMdrCA2x+bYIhTiZDtmbnmcKsfMrRsNdLCCDQxFrOMIhRMjFC4soIAKGhh7hljI6PkTo+cvLKCACho4Fz3Ojz16/sIGdnAsjJ6/sIACKmggtoFtYBvYxrLF1K4bCyigggY6WMEGdhBbwVawFWwFW8FWsBVsBVvBVrAJNsEm2ASbYBNsgk2wCTbBptgUm2JTbIpNsSk2xabYFJthM2yGzbAZNsNm2AybYTNsjs2xOTbH5tgcm2NzbI7NsVVsFVvFVrFVbBVbxVaxVWwVW8PWsEVUzHt1EhO+bjQwis1Gj4lZHteC6tnzJ1awgR0cC6Pn40JNTMy6UUAFpy0uLMVb4G6s4LTFxaJ4EdyN48Z4FdyNBRRQwbBZoIMVbGAo5vDFxCyf716QmGHlcQkpZljdqKCBDlYwFCOwg2NhtN6FZb6KOpbhfJf1iQraRAl0sIIN7OBYGO+2vjBsMVDxfusLFTQwFHMVnm//Kv1kSayJLbEnrolb4p54LD7fB3ZzSSyJNbEl9sQ1cUvcEydvSd6SvOcbmud0Tjnf9nXz/DsS43O+8etmTWyJPXFNfC5bDe6Jp1fiImC/3u988rlssQwqiTXx6e3Bnrgmbol74gGf74G+uCQ+vSNYE1tiT1wTt8Q98YD9SFwSJ68nryevJ68nryevJ68nb03emrw1ec93QM+ZnXK+E+zi8z3QF5fEklgTW2JPXBO3xMnbkrcnb0/enrw9eXvy9uTtyduTtyfv+T7oczs83wh9Mdvq+cavm0tiSXwujwRbYk9cE59eC+6JB1wYh/M9YDdLYk1siT1xTXx6a3BPPGA5EjM+5xu+bk7jk3r5fM/XzWl8NI2PpvHRND6axkfT+GgaH03jY2l8LI2PpfGxND6WxsfS+FgaH0vjY2l8LI2Pp/HxND6exsfT+NQ0PjWNT03jU9P41DQ+NY1PTeNT0/jUND41jU/q35H6d6T+Hal/R+rfkfp3pP4dLY1PS+PT0vj0ND49jU9P49PT+Iw0PiONz0jjM9L4jDQ+I43PSOMz0viMND5jjY8exxofPY6SWBJrYkvsiWviNT56HD3xgMuReI2PHqUnHrAciUtiSbzGR8/3gd3siWvixjhIT5zGR9P4aBofTeOjaXw0jY+m8dE0PprGR9P4aBofS+NjaXwsjY+l8fE0Pp7Gx9P4eBofT+PjaXw8jY+n8fE0Pp7Gp6bxqWl8ahqfmsanpvGpaXxqGp+axqem8alpfFoan5bGp6XxaWl8ehqfnsanp/HpaXx6Gp+exqen8elpfHoan57GZ6TxGWl8RhqfkcZnpPEZaXxGGp+Rxmek8RmMTzmOxHGcE9+COV/sdbMl9sRxfBUfiDlf7nVzTzzg8xh7nnzp+YKvmyWxJj6PY1uwJ67weSbkgQ3sYJwJxd89z4ROLKCAcSbUAw10sIJhG4EdHAv9AAsooIIGOlhBbI7Nsc0+qnM2pMabrmpsqTGn6MYGdnBWmM80acw0urGAAioYxWIlxYe2LhwL42NbF0axWBfxwa0LFTTQwQqGLTbR+PjWhWNhfIDrwgIKqKDdGNOA6nynlcY0oDqfudF4ZdWNBjpYwQZ2cCyMz2xdWEBs8bGtObFBY3LQjQ5WsIEdHAvj01sXFlBAbIJNsAk2wSbYBJtiU2yKTbEpNsWm2BSbYlNshs2wGTbDZtgMm2EzbIbNsDk2x+bYHJtjc2yOzbE5NsdWsVVsFVvFVrFVbBVbxVaxVWwNW8PWsDVsDVvD1rA1bA1bw9axdWwdW8fWsXVsHVvH1rF1bAPbwDawDWwD28A2sA1sA9tYtvPzfBcWUEAFDXSwgg3sILaCrWAr2MgSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLLEzSyxQQQPjKGgEVrCBYauBY+GZJScWUEAFDXSwgg3EJtgUm2JTbIpNsSk2xabYFJtiM2yGzbAZNsNm2AybYTNshs2xOTbH5tgcm2NzbI7NsTm2iq1iq9gqtoqtYqvYKraKrWJr2Bq2hq1ha9gatoatYWvYGraOrWPr2Dq2jq1j69g6to6tYxvYBraBbWAb2Aa2gW1gG9jGsvlxgAUUMGw90EAHK9jADo6FZ5acWEABsRVsBVvBVrAVbAWbYBNsgi06dj63pjErqc5ZzRqzkm4UUEEDHaxgAzs4Fjo2x+bYnCWLfrtwLIx+m1OvNSYd3SigggY6WMEGdnAsjH6bE7I1Jh3dGLYWqAujWywWMrrlQgEVNNDBCjawg2PhwDawDWzRDBa/IpphPtWnMWWoWvyKaIbAmDJU50RkjSlDNwqooIEOVrCB0zYnLWtMGarzmTyNKUN1Tk/WmDJU59xhjclB1WNxYrO/sIIN7OBYGJv9hXN555wtjWlANzpYwQZ2cCyM3eKctKwxiad6/LbY1V04FkY7XTh/W3xDOybx3KiggQ5WsIEdHAujnS7E5tgcm2NzbI7NsTk2x1axVWwVW8VWsVVsFVvFVrFVbA1bw9awNWwNW8PWsDVsDVvD1rF1bB1bx9axdWwdW8fWsXVsA9vANrANbAPbwDawDWwD21i2mBx0YwEFVNBAByvYwA5iK9gKtoKtYCvYCraCrWAr2Ao2wSbYBJtgE2yCTbAJNsEm2BSbYlNsik2xKTbFptgUm2IzbGRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLOqCiBFWxgB8eN/YyKEwsooIIGOljBBnYQW8FWsBVsBVvBVrAVbAVbwVawCTbBJtgEm2ATbIJNsAk2wabYFJtiU2yKTbEpNsWm2BSbYTNshs2wGTbDZtgMm2EzbI7NsTk2x+bYHJtjc2yOzbFVbBVbxVaxVWwVW8VWsVVsFVvD1rA1bA1bw9awNWwNW8PWsHVsHVvH1rF1bB1bx9axdWwd28A2sA1sA9vARpZ0sqSTJZ0s6WTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmScjd4DQ2yBIR6BChroYAXbwujY+TyRxkSzGx2sYAM7OBZGx15YQAGxOTbHFg05nz3SmH9WW/ziaMgLBVTQQAcr2MAOjoUNW8PWsEXrtRizaLIeyxtNdmI02YUFFFBBAx2sYAOxdWwD28AWLTJfkWExNazO2SEWM8NuVNBAByvYwA6OhdEMF2Ir2Aq2gi2aYcRCRjNc2MAOjoXRDBcWMGwWqODL1ua0boupZDdWsIEdHAtnv91YQAEVxKbYFJti07BJ4FhoB1hAARU0MGwxDlbBsNXADo6FfoAFFFBBA8M2AivYwA6OhfUACyjgtJUYndnHNzpYwQZ2cCycfXxjAQXE1rA1bC2KxZba2ZQ7m3JnU+40TqdxOo3TaZxO4wwaZ9A4A9vANrANbIPGGTTOoHHGapyYWHZjAQVcjVPOUDhxbcoxvezGBnZwNU5MLbuxgAIqaCC2gq1gK9jKapx4r9aNBRRQQQMdXI1TzlA4cTVOkdU4RQ+wgAIqaKCDq3GKNrCDq3GKHWABBVRwbcoxSe7GCjawg6txYpLcjQUUUEFsjs2x+eqhmA7XSgzq2egnGhgVYpM7G/3EBnZwLDwb/cQCCqiggdgatoathc0Dx8J+gAUUUEEDHaxgA7F1bAPbiLqx7Yy6xmw0sINrdOIVWzcWUEAFDXSwgg3sILaCrWAra3Ribt2NBjpYwQZ2cI1OzK27sYDYBJtgi+6OkYz5cm1ON7SYL3ejgAoa6GAFG9jBWN4+Mfr4wgJO27zZbzFf7kYDp22+EMlivtyNDezgWBh9fGEBBVTQQGyOzbHFbny+HtNiDlyTGMno4wsdrGADOzgWRh9fWEABsTVsDVt0rMSgRm9qDF/05oUKGuhgBRvYwbFwxD+LDTxaT2MZovUCYyrajbE4PVDAWJwROBdn3kizmIp2YwUb2MFpmy9At5iKdmMBp23eirOYinZj2DwwbLGQsX+zWJzoiwun2KNYbNUXjoWxVV9YQAEVNNDBCmIzbIYtNlqPRY+N9kIHo1gLbGAHx8LYlC8soIAKGuggtoqtYotN2WN1x0ZbY73FRnthBRvYF8b2O8/9LeY8tRqrcAiooIEOVrCBHRw3xpynGwsooIJRrAV2cCyMbfLCAgqooIEOzmLzrecWM5ZuLKCAChroYAUb2EFsik2xRfDPF6lYTEi6sYEdjGIxUNEM880lFlOPbjTQwQo2sINjYUT8hQXE5tgcWzTDvJhhMbPowmiGCwsooIIGOljBBmKr2Bq2aJF5QcVick3rMdSxec43KVhMmGlxMSMmzNyooIEOVrCBHRwLY0u9EFvBVrDF6p6vcLB4886NY2Ek4oUFFFDBKGaBHRwLYx3Ph8gtprDcKKCCBjpYwQZ2cCys2Cq2iq1iq9gqtoqtYqvYKraGrWFr2Bq2hq1ha9gatoatYevYOraOrWPr2Dq2jq1j69g6toFtYBvYBraBbWAb2Aa2gW0sW8youbGAAipooIMVbGAHsRVsBVvBVrAVbAVbwVawFWwFm2ATbIJNsAk2wSbYBJtgE2yKTbEpNsWm2BSbYlNsik2xGTbDZtgMm2EzbIbNsBk2w0aWVLKkkiWVLKlkSSVLKllSyZJKllSypJIllSypZEklSypZUsmSSpZUsqSSJZUsqWRJJUsqWVLJkkqWVLKkkiWVLKlkSSVLKllSyZJKllSypJIllSypZEklSypZUsmSSpZUsqSSJTF/p8UFwZi/c6ODUxEX+WLSzo3jxpi00+brdiwm7dwoYCh64GvRe1yBi+k5N3ZwTJzH6zE958LZsT0uC8Uclx6XhWKOy40FjL8b/2z2W4/rGjHH5UafaIEVbAtnB/Q4BY9ZJxf6ARZQQAUNdLCCDcTm2Cq2uSl3id82N+UbOzj/WZxWx/SRGwsooIIGOljBBnYQW8fWsXVsHVvH1rF1bB1bx9axDWwjbLGyhoAKGuhgBRvYwXFjzC+5sYACKmiggxVsYAexFWwFW8FWsBVsBVvBVrCVsHngWCgHWMCwtUAFDXSwLtR1RNrPndqJDsbfHYEN7OBYaAdYQAEVNNBBbIbNsBk2x+bYHJtjc2yOzbE5Nsfm2Cq2iq1iq9gqtoqtYqvYKraKrWFr2Bq2hq1ha9gatoatYWvYOraOrWPr2Dq2jq1j69g6to5tYBvYBraBbWAb2Aa2gW1gG8s2jgMsoIAKGuhgBRvYQWwFW8FWsBVsBVvBVrAVbAVbwSbYBJtgE2yCTbAJNsEm2ASbYlNsik2xKTbFRpYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkS0136fDrF4kVKNzZwKuaDKhYzX24s4FTEdfCY+dLj4nfMfLnRwQpOxXwRvMXMl25hiwCJS9cx8+XGaZsvxLd461KPS9fx0qUbp82jWASIR7EIkAunzWMhI0AuHBd6vG3pxgIKqKCBDlawgR3EVrAVbAVb5MO8xOwxYSbGzGPCzI1jYSSBnxiLMwJnhXmJ2WMSzI0dHAuj5y8soIC6MDp2Xq/2mMJyo4DxdyXQQAcr2MAOjoXRsRcWUEBsjs2xOTbH5tgcW8VWsVVsFVvFVrFVbBVbxVaxNWwNW8PWsDVsDVvD1rA1bA1bx9axdWwdW8fWsXVsHVvH1rENbAPbwDawDWwD28A2sA1sY9li5suNBRRQQQMdrGADO4itYCvYCraCrWAr2Aq2gq1gK9gEm2ATbIJNsAk2wSbYBJtgU2yKTbEpNsWm2BSbYlNsis2wGTbDRpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJXpmiQcKqGAoWmAFG7jODlQOsIBRdwQqaKCDFWxgB8fCMzVOLCA2xabYFJtiU2yKTbEZNsNm2AybYTNshs2wGTbD5tgcm2NzbI7NsTk2x+bYHFvFVrFVbBVbxVaxVWwVW8VWsTVsDVvD1rA1bA1bw9awNWwNW8fWsXVsHVvH1rF1bB1bx9axDWwD28A2sA1sA9vANrANbGPZ7DjAAgqooIEOVrCBHcRWsBVsBVvBVrAVbAVbwVawFWyCTbCRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWGFliZImRJUaWOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFkSkxD7nFfsMQnxxgbGvYN5jT9mHt5YQAEVNNDBCjawg8tWjwMsoIAKGuhgBRvYQWwFW8FWsBVsBVvBVrAVbAVbwSbYBBu3U2Lm4Y3YBJtgE2yCTbApNsWm2BSbYlNsik2xKTbFZtgMm2EzbIbNsBk2w2bYDJtjc2yOzbE5Nsfm2BybY3NsFVvFVrFVbBVbxVaxVWwVW8XWsDVsESB6ooIGRku3wAq2hREVcwa8xxzDGwVU0EAHK9jADo6FA9vANrANbAPbwDawDWwD21i2mG54YwEFVHDZztmEcxa+x8u+bhQw/pkHGhgL2QMr2MC5kPPjiB4v+7ow2v/CAgqooIEOVrCB2ASbYlNsik2xKTbFptgUm2JTbIbNsBm2aP8Rox7tf6GDFQxbrIBo/wvHwmj/CwsY/8wCOzgWRh+PGlhAARU00MEKNrCDY2HD1rA1bA1bw9awNWwNW8PWsHVsHVvH1rF1bB1bx9axdWwd28A2sA1sA9vANrANbAPbwDaW7Zx2eWEBBVTQQAcr2MAOYivYCraCrWAr2Aq2gq1gK9gKNsEm2ASbYBNsgk2wCTbBJtgUm2JTbIpNsSk2xabYFJtiM2yGzbAZNsNm2AybYTNshs2xOTbH5tgcm2NzbI7NsTk2sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlgyyZJAlgywZZMkgSwZZMsiSmLg55jMKHhM3bxwLZ4CM+biCx2zNGxW0iSXQwQqGwgJD0QPHwhkgNxZQQAUNdLCCDcQm2BSbYlNsik2xKTbFptgUm2IzbIbNsBk2w2bYDNsMkFFitcwAuXEsnAFy47SVWAEzQG5U0MCoG2uzRoVYWbWAAioYFTxwLm+JLWqGwiixvLWBHRwL2wEWUEAFDXQQWwvbCOzgWNgPsIACKmiggxXE1rF1bCNsLbCAAipooIMVbGAHx4U1JmPeWMBpm+/MqDEZ80YDHaxgAzs4Fs4DjBsLiC2SYD7GU2MG5pjPt9SYgTnmExw1Xll2YwEFjOX1QAMdrGADOzgWRs9fWEABsSk2xabYFJtii56fb92oMd/zxmnTGJLo+QsVnLb55v0a8z1vrOC0aQxJ9PyFY2H0/IUFFFBBAx2sIDbH5tgqtoqtYqvYKraKrWKLfNAYqMiHeRmgxnzPCyMfLiyggAoa6GAFG4itYevYOraOrWPr2Dq2jq1j69g6toFtYBvYBraBbWAb2Aa2gW0sW8z3vLGAAipoYNhGYAWnYk5ErzHJ88IIhTknvcYkzxsFVNBAB6divpClxiTPGzs4FkaAXFhAARU00EFsERVz4nyN6Zw3FlDAqNsCDXSwgg3sYNjmZh/TOW8sYNhiBURUXGiggxVsYAfHwvOSYizDeUnxRAcr2MAOjoXnJcUTCyggtoqtYqvYKraKrWJr2Bq2hq1ha9gatoatYWvYGraOrWPr2Dq2jq1j69g6to6tYxvYBraBbWAb2Aa2gW1gG9jGsp2zNS8soIAKGuhgBRvYQWwFW8FWsBVsBVvBVrAVbAVbwSbYBJtgE2yCTbAJNsEm2ASbYlNsik2xKTbFptgUm2JTbIbNsBk2w2bYDJthM2yGzbDFpYjYB5yzNS8UcNra+XcNdHAG03zAqMa8zDGfKqoxL/PGGXjzFVU15mXeOAPvXIY4frhwBt6cRVdjXuaNDZyBN2fy1ZiXeWEcP1xYQAEVNNDBCjYQW8PWsXVsHVvH1rF1bB1bx9axxfFDjeGL44cLCyhg2GJQ4/jhQgcr2G6MWZVjzmisMavyxgo2sINjYRwIXFhAARXEVrAVbAVbwVawCTbBJtgEm2CLffd8a3iNiZA3VnCK50uuakyEvHEsjH33hQUUUEEDHawgNsNm2BybY3Nsjs2xOTbH5tgcm2Or2Cq2iq1iq9gqtoqtYqvYKraGrWFr2Bq2hq1ha9gatoatYevYOraOrWPr2Dq2jq1j69g6toFtYBvYBraBbWAb2Aa2gW0sW0yEvLGAAipooIMVbGAHsRVsBVvBVrAVbAVbwVawFWwFm2ATbIJNsAk2wSbYBJtgE2yKTbEpNsWm2BSbYiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNL7MwSCxw3+pklJ4aiBipoYChGYAUb2MGx8AyQE+cPmpMTasx+vFFBA6ethzgC5MIGTtucyFBj9uMY8SsiQC4s4LSN+GcRIBca6GAFG9jBsTAC5MICYlNsik2xKTbFFgEy4rfNAHld2ZnrMKY/Li6JJbEmtsSeuCZuiXvi5PXk9eT15PXk9eT15PXk9eT15PXkrclbk7cmb03emrw1eWvy1uStyVuTt53eElwSn14J1sSW2BOf3lil7fTGOm098YD7kbgklsSa+PRGb3VPPM/84pprvKbxxrEwrkZcWEABFTTQwQpiG9jGsp2TJS8soIAKGuhgBRvYQWwFW8FWsBVsBVvBVrAVbAVbwSbYBJtgE2yCTbAJNsEm2ASbYlNsik2xKTbFptgUm2JTbIbNsBk2w2bYDJthM2yGzbA5Nsfm2BybY3Nsjs2xOTbHVrFVbBVbxVaxVWwVW8UWVzbj6sk5WfLEdoDlvnpyTpa8UMGwnehgBSNJ5h3gWs/EmLd1az0T42JJrIktsSeuiVvinnjAI3lH8o7kHck7knck70jekbwjeQfemEG5eI563FQ438J44Rz1uAZ/zpu8MK6mlUABzyW0YEvsic8l9OCWuCcesByJS2JJrIktsSdOXkleSV5JXk1eTV5NXk1eTV5NXk1ePb01uCce8HlMcvHp7cGSWBNbYofP44d5W7228/jhYk8cyxa3nNt5/HBxTzzg8/jh4pJYEmtiS+yJk7cmb03emrwteVvytuRtyduStyVvS96WvC15W/L25O3J25O3J29P3p68PXl78vbk7ck7knck70jekbwjeUfyjuQdyTuSd+Dtx5G4JJbEmtgSe+KauCXuiZO3JG9J3pK8JXlL8pbkLclbkrckb0leSV5JXkleSV5JXkleSV5JXkleSV5NXk1eTV5NXk1eTV5NXk1eTV5NXkteS15LXkteS15LXkteS15LXkteT15PXk9eT15PXk/elFc95VVPedVTXvWUVz3lVU951VNe9ZRXPeVVT3nVU171lFc95VVPedVTXvWUVz3lVU951VNe9ZRXPeVVT3nVU171lFc95VVPedVTXvWUVz3lVU951VNe9ZRXPeVVT3nVU171lFc95VVPedVTXvWUVz3lVU951VNejZRX48orD5bEmvh0teCauCU+XT14wFdGnXy6RrAk1sSW2BPXxC1xTzzgK6NOTt4zo2JC1DizSGMcziyKeVDjzKKLe+IBn1l0cUksiTWxJT69FlwTt8Q98YDPLLq4JJbEmtgSJ68lryWvJa8lryevJ68nryevJ68nryevJ68nrydvTd6avDV5a/LW5K3JW5O3Jm9N3pq8LXlb8rbkbcnbkrclb0velrwteVvy9uTtyduTtydvT96evD15e/L25O3JO5J3JO9I3pG8I3lH8o7kHck7kncsbzuOI3FJLIk1sSX2xDVxS9wTJ29J3pK8JXlL8pbkLclbkrckb0nekrySvJK8krySvJK8krySvJK8krySvJq8mryavJq8mryavJq8mryavJq8lryWvJa8lryWvJa8lryWvJa8lryevJ68nryevJ68nryevJ68nryevDV5a/LW5K3JW5O3Jm9N3pq8NXlr8rbkbcnbkrclb0velrwteVvytuRtyduTtyfvlVc9WBNb4tM1glvinnjAV0adXBJLYk1sieM3ztmj7Tgz6uKWuCcei8uZUReXxJJYE1tiT1wTt8Q9cfKW5C3JW5K3JG9J3pK8JXlL8pbkLckrySvJK8krySvJK8krySvJK8kryavJq8mryavJq8mryavJq8mryavJa8lryWvJa8lryWvJa8lryWvJa8nryevJ68nryevJ68nryevJ68nryVuTtyZvTd6avDV5a/LW5K3JW5O3Jm9L3pa8LXlb8rbkbcnbkrclb0velrw9eXvy9uTtyduTtydvT96evD15e/KO5B3JO5J3JO9I3pRXJeVVSXlVUl6VlFeS8kpSXknKK0l5JSmvJOWVpLySlFeS8kpSXknKK0l5JSmvJOWVpLySlFeS8kpSXknKK0l5JSmvJOWVpLySlFeS8kpSXknKK0l5JSmvJOWVpLySlFeS8kpSXknKK0l5JSmvJOWVpLySlFeS8kpSXknKK0l5JSmvJOWVpLySlFeS8kpSXknKK0l5JSmvJOWVpLySlFeS8kpSXknKK0l5JSmvJOWVpLySlFeS8kpSXknKK0l5JSmvJOWVpLySlFeS8kpSXknKK0l5JSmvJOWVpLySlFeS8kpSXknKK0l5JSmvJOWVpLySlFeS8kpSXknKK0l5JSmvJOWVpLySlFeS8kpSXknKK0l5pSmvNOWVprzSlFea8kpTXmnKK015pSmvNOWVprzSlFea8kpTXmnKK015pSmvNOWVprzSlFd65ZUHl8SSOFxuweGan55oembUxS1xTzzgM6MuLoklsSa2xMmryavJq8mryWvJe2bRnF3f9MyWiwd8ZsvF53KOYEmsiS2xJ66JW+KeeMBntlycvDV5a/LW5K3Je2bL/Ex20zNbLu6Jw1tjGziz5eKSOLxzVn3TM1sutsSeuCZuiXviAZ/ZcnFJnLw9eXvy9uTtyduTtydvT96RvCN5R/KO5B3JO5J3JO9I3pG8A68dR+KSWBJrYkvsiWvilrgnTt6SvGe2zM92Nzuz5eIzW1pwnV97OwIb2MGz+AwHOwPk4pJYEmvi80eF6AyTi2vilrgnHvAZJheXxJJYEyevJq8mryavJq8mryWvJa8lryWvJa8lryWvJa8lryWvJ68nryevJ68nryevJ68nryevJ29N3pq8NXlr8tbkrclbk7cmb03emrwteVvytuRtyduStyVvS96WvC15W/L25O3J25O3J29P3p68PXl78vbk7ck7knck70jekbwjeUfyjuQdyTuSd+D1K2R68Pn3507EzwOMVoI9cU3cEkf9+Q7K5mc+nHzmw8Xxu+bc6uZnPlysiS2xJ66JW+LT68EDPvPh4pL4dEnw+W9r8IDPHr+4JD6XOcbq7PGLLXEsc+TkNan44pa4Jx7w2eMXh7fH2J493mOZzx7vMZ5nj/cYh7N/e/zGs39PPvv34pL4rBm/6+zTHtvD2SM9fkt8xjiOBc5Pol94WmMrObf4i2vilrgnHvC5xV9cEkfNEaNwbs0jvOfWfHFPPBbXcxd7cUkcv3ZIsCa2xJ64Jm6Je+IBn7vP+Ta7Vs/OudgTnzUtuCXuiQd8ds7FJbEk1sRnTQ/uiQd8dsWcUd/q2RUXS2JNbIk9cU3c4LNbRguWxJr4rNmDPXFN3BL3xAM+u+Xi0zuCp7fMaestJsgutsSeuCZuiXtwbD/RURdHR91cEktiTWyJHT73cOeYtDRuLY3buYc7f2NL49bSuLU0bi2NW0vj1tK4nXu4c6x64ff2NG49jVtP49bTuPU0br3xu3oat57GbaRxG2ncRhq3kcZtpHEbZ53Za+eE19dNjuCSWBJr4rOOBXvimrgl7okHXE6vB5fEklgTW2JPXBOf3hp8elvwgOVIXBJLYk18enuwJ66JW+KeeMB6JC6JjXWhzjhrTdwS98RpPO1IXBJLYk2c1qOl8bQ0ntYS98QD9rQePa3HKzdiXXgazys3TvbENXFLnNajp/GsaTxrGs8rN07WxGk91rQea1qPccRc5sT3dk6xvTnql1hHkSc3a2JL7Ilr4vhdJcY88uTmAfcjcUl8emMczjy52BJ74pq4Je6JB3zmQ4lxGOffn5l2TnUt84Vc7ZzqerMlDu+cdtbOqa43t8ThFQke8JkDF5fEklgTW+LTq8E1cUvcEw9+19nXcxpcO6eu3lwTt8Q98YDPvpaoefb1xZJYE4dXY/nPfp/PdbRz6urNLXFPPOCz3y8uiSWxJrbEyWvJa8l79nvczj+nrl589vvFJbEk1sSW+PTGOJz9fnF4Lbals9/jUuk5dfX6389+vzi8Fst59vvFmtgSe+KauCXu8NnLceZwTj+9uSZuiXviAZ+9fHFJLIk1cfL25O3Je+7T40zjnDZ68/n3W3BN3BKfyxljfh4DBJ/TRm8uiSWxJrbEnrgmbol74uQtyXv2cpynnFM/S5xrnFM/Lz733ReXxLGcce4wzn33xZbYE8dyxnH+OSX05p54wGePxzHkOSX0ZkmsiS2xJz69Pbgl7okHHD0ucUx4Tgm9WRJrYkvsiWtwjFX0+M098YD99GpwSSyJNbEl9sSnN8bQW+KeeMD19HpwSSyJT2+MZ7XEDrfTFWMY/SUlflf0182euCZuiXviWM7Yj59TKm8uiSXx6Y3fNSyxJz698btGS9wTj5v7OaXy5pJYEp/eGmyJPXFNfLp08tlf83H+fk5hvFkSa2JL7Ilr4pa4Jx6wJq8m79kj84pYP6cVlnmlqZ/TCkuLZT73axd74pr4rGPBPfGAz/3axSWxJD69Mc7nfq3FGJ77tfl0ZT+nFZZ59aqf0wpv7vC5/6rxu87918Wa2BJ74pq4Je6J43fVGKvzOLbGOJzHsTV+y3kcW+O3nMexF1tiT1wTt8Q98YDPfd/FJXHy9uTtyduTtydvT96evD15R/KO5B3JO5J3JO9I3pG8I3nPfWiN9X7uQ4PLuU+cV4H7Oe2vzKvA/Zz2d/7bc9rfzSWxJNbEltgT18QtcU+cvJK8krySvJK8krySvJK8krySvJK8mryavJq8mrznfvMcz3O/efJ5rHuO7dnv59haWjZLy2Zp2Swtm6Vl87RsnpbN07J5WjZPY+LJ68nryevJ68lbk7cmb03emrw1eWvy1uStyVuTt6bt88qBk53xvHo2xjP1bEk9W1LPltSzJfVsST1bUs+W1LMl9WxJPVtSz5bUsyX1bEk9W1LPltSzJfVsST1bRvIOvOd0uptLYkmsa9zksMRjjaFcPduDWTZJPSupZyX1rKSeldSzknpWUs9K6llJPSupZyX1rKSeldSzknpWUs9K6llJPSupZyX1rGjyavKex7rnWJ378ZPP/fg5blfPxrilnpXUs5J6VlLPSupZST0rqWcl9ayknpXUs5J6VlLPSupZST0rqWcl9ayknpXUs5J6VlLPSupZqexTJPWsNPYp0tinSNrPSupZST0rqWcl9ayknpXUs5J6VlLPSupZST0rqWcl9ayknpXUs5J6VlLPSupZST0rqWcl7Wf1OBKTY3qQY5r2s5r2s5r2s5r2s5p6VlPPaupZTT2rqWc19aymntXUs5p6VlPPaupZTT2rqWc19aymnlVJY6JpTDSNiaYxsbRslpbN0rJZWjZLy5b2s5r2s5p6VlPPaupZTT2rqWc19aymntXUs5p6VlPPaupZdXpHPY1JpXe00jta07K1tGwtLVs6NtZ0bKzp2FjTsbGmY2NNx8aajo019aymntXUs5p6VlPPaupZTT2rnYzVTsbqIGN1kLGa+ktTf2naJ1raJ1raJ1raJ9qhiS2xJ66JW+KeOHlTz1rqWUs9a4V9sRVLzL7YhH2xpf6y1F+W+stSf1nqL0v7REv7REv7REv7REv7REv7REv7RNPk1eTV5FW2YbMjMX1tRl9b6i9L/WWpvyz1l6X+stRflvrLUn9Z2ida2ida2ida2ida2ida2idaTeurcmxvjWN7axzbW+ovS/1lqb8s9Zel/rLUX5b6y1J/WeovS/1lqb8s7RMt7ROtkznW0/oaZI4NMsdSf3nqL0/95am/PPWXp/7y1F+e+stTf3nqL0/95am//OqvGiyJ21p+v/ZfPTgtW9p/eeovT/3lqb889Zen/vLUX576y1N/eeovV3rf03miK73vRu972n952n952n952n952n952n956i9P/eWpvzz1l3taNmc798p27pXt3NPxoafjQ0/Hh57O6Tztvzztvzztvzztvzztv7ylZWtp2Xpatp6WLfWCp17w1Auejg89HR96Oj70dHzo6fjQR1qnIy3bYJ3Wg3VaUy/U1As19UJNvVBTL9TUCzX1Qk29UFMv1NQLNfVCTb1QUy/U1As19UJNvVBTL1QhQ2o6lqtKhlQlQ6qm5U/HcjUdy9V0LFfTsVw1xrYa67066/2az3O60n6hpv1CTfuFmvYLNR13XfN5LmafVSv7rJq225q225q229rYNmrabmtL20ZP20bK8Jq225qOkWo6RqrpGKmmY6SajpFqutZX0zlIS9f6WrrWd81vOf9OORIzDtd8EjvZE5/3JaPOuZ1c3BMP+MxMG8ExDn4EW2JPXBO3xD3xgM9tbL7Grl/zSS6WxJrYEnvimvj0SnBPPOBzm7y4JJbEmtgSny4Nbol74gGf2+rFJbEk1sSW2BMnb03eM7fnoz79mlty8rn9X1wSS2JNnNZpS+u0pXXa0jo983x+CqNfc0g8tsOzRy72xDVxS3wuf2yfZ7affGa7x3Z4ZvvFkljT37fEnrgmbomTd+A9X8d2c0ksiW399mteSvyWa/7JxQM++/TikjjVLJrY1m+85p9cXBO39Pd74vRbJP0WSb9FkleSVyyxJ66JO79d0m88j6Mu1sSWOI2VppqafsuVFfEbr6wItiNx+i2Wfoul32Lpt1j6LZa8lryWxtDSGHoaQ08uTy5PLk8uTy5PLk+ua782e+qaf3JxSSyJNbEl9sSndwS3xD3x+RvHf/3XP/3pb//2r3/+97/+29//5d//8Ze//Omf/3P9D//3T//83/7zT//nz//4y9///U///Pf/+Nvf/ulP/58//+0/4i/93//z57/Hn//+53+8/t+X+S9//5+vP18F/9df//aXSf/1T/zr4+N/2uOlsPGv+yupV4Fy/FiifFzC5mcMo4JZWwXaj/9ePv736vfyv66osABtPP4NY85HiArjdZv2w99gm2XQeTv1XIjXNYlVYoynFV53J+yq8EKnQvuhQv24Ql1rotY0Dn08LdDmdJlzVZa6Crwup/1QoG9+Q53v2T9/QyvtwxLj4xIST2RECXndmPywRNmsz9cNjnsoX/cxxoc1NmtjvjH4HszXsQujKfXHxdhsl04JLR+uj91CtLVlz/fEfrwQuw2zznkf54b5OiGhvfzHEr5ZqzYPKc+1+rp28mGJ7VJYWUth9aMSmwpzNv9VYU7e/ngsNptnjY/4nuM5cla5/lhjs31qvMrv/CVH/fCX7BajxdPO50953ef/cDGk/LGLIWvLmG/G+HgxdLNptCKr4VNy+o/buGxWbHzR+czentO7Pq+w+my+N/rjEnWXGEZiOIth5ccSbTMUh6yhOLx8vBibVeJ91XhdXBlpMeTHGpsNtMY3GM6N/EgB+nMN3QWo3VvG6z4kFY7xtQ1jfLhh7LdP7Wv79I/bZFvD17HFfKzrwxpqu8Gwe0Bfd5j9wyDfLkflt9S0Yn9Zjvp+DD9djCZfG9I6DoJ4M6TjzSM+O9495Nv+jFZ1/Yx8uPTTz9jtkpqs0XxdA/lwl2T69u7Z7O3tYr8U7+6eX+ef93DO+3Mfj0XbHUP3wTF0PubqP9bob++QbLy7Q9pWeLZD8vL2Dsnl/R2S6/s7JLf3d0ju7+6QHm8YH++QHm+f4h9vn9saatRoH9bw8fZP2ZXQ1owAbR+ebJb3z/WqvH+yV/UbTvZ2a6WtU2d9XYX7cK1U350893X2fBw17VB+bNla306v2t5Nr22FZ+lVx9vp1Y7306uV99Oryfvp1fTd9Hq8YXzc8rvtcz6+sbbPHw6ny/MaPu7FeF20/LhGa4+uc8lx2MfXqXbL0fpajtcV+o+X4/0T+V1sWFlD+jpe+XiH0Mv7R2/bxVgnKFbax8dN/f0T+f72iXx//0S+v38i37/hRL5/w4l8/4YT+fH2iXx//0T+cZu0+qXjJiv9Xq8mm3OD8f6l0PH+pdDxh14KfUXvSr92fHxZeGw30HUW/xqV/mGCjt1xaFnHsuU1th8m+W455gfA7+Ww8fFyxJtJ3ozy7XJ4WRfr69E2y6HvL8d266h1bR2pZX+rRKfEsA+vEx3bGF13xF6JKl+ssTbT14F5/7jG7qztZbh/zHzbhn6YguXYbqnilJF05euXMrv7Sr7yw9P18p/TtJTybiA/XYp0W+mXEvvx0GOl+quL+2Y8dkE01nW8Pnoe1J/u/e7vLsloK1M1Zfuvy7Lb2ura40pNW2z9nSXxxpL48M2S7LZZabpi8dhtJ4+XpZbdsmzLcMV38vhqmU7/WK/69TJOmSFfLqNKGd9sMbvbRkX7GmEd+rX19PQgrWzvPj0LhW2JdWIm25+y3W572m71q9tt9bTdVvvqKm7HOraw123wj8to+Ya1o/L22tmWeLh29gPL6rG22xPqbnttra4pBWlZ6m+U6LIO2bqNr5Vo60Z8bx+W2O/CbF2zm+8DKpvx2N2J0vtg/McSv3OIUopyiCL14wWx/XUAErZ9vNf45MiPU4vx8RHX7lZQ2hubinx4olV2t6SkrV2gtF4+vPtr/vYViXgl03uXJPYlnl2TKLt7Dw8vSpTdPaWnVyViiu+7lyWKf0eo+vuh+ngD2Uwx2G+oa1bRa0PVr9Xova90P44Pa/hu6p6vGyHV0znb79Xw8aTG/resG+uvfdbmt7x9/3Rf4mnTPf4pH28eu/tTY51qDdm07S5OVde1WfW6idNtkRWn5vrxxa+yu2b+8JZf2d6GeHjPr+zuLz2e4Vn7+3f99uPaV8f4UTYrZ3ej6tk2sqvwdM3sblM9XjPb+1RP10yzP3jN+GHHWjO7tmn1j+xel3Wi6a+rWZvF2GyqKmVNGxD1jw529yXW1VrVo39Uoh8PL8Lrh4fc29Egy/yVSF/LMq9jFel6fFxkd1PC1i7mla+rxOuY4qcS9vb1ou1SrG3U0jHMr0uxC9SjcZnnaGmvXX+nSB/rssoxDv/Sj1nnhX7shnR7iNrWBjI/4nB8uBzjO0ZkfMOIbLfUXtdJqua5o7+zuVdbZ+2vWwzHF4v0dTX+dRHAvlikHfeQ1FE2WTbq2ymyK/F0bze+4TmTMr7hSZN4SeofurergysqY7ObkWN3BDA/c7UGJc9P+2n++bFdkjXFbX7oabMku8sQra4d3g+b60/30uKNrR+v4nWG+Dok/fBOq+zuQBm7b9OjfHh/Il4Lu/k1yq+RTZHtBquc0lQrH581y+6il1amPecrq/o7S/K64bKWpLSPryPK7j7WqOsiwKilbn7OdpPVxim8dvlKTM9PadybbNskrGyfTyrr9q+WdNXr5+dYyvsXrKS8fcFqX+Lh0zDl/QtWUr7hgpXIN1ywEvmGC1Yib1+wer6BjM0Gst1QmT1Sqn6thvt9YPPaTdUv1lhzzr5eo6U4q+OLNWzN3G3+cY3tE1PPLr59UuPRxbf9b+my5id1a+/X8PK1GnWdC2jf/JbdQ1Olk+zDNt2/WxAr6+DZSrod/8uCvH9l9ZMa769cK+vZ09ex2fHxcuwiVXzdaZIUIL83qLK67nUC+/Gg7m5W2ZoNYG2zbm330P6x7om+dr6bo5Dtc0tM61GpfVNkdyVA12mAy8cHVdvxWKcjbsfH4/HZ4bumw/fy0eH745mWH56e/c7x4WZyhexuV0lfu8tev3ak6nXNUfK6mRYk2+eonq3c/ZnISpDXJVj/r6/cVa0uK0HqZgqs7B6kknUYk2fAmvzOdZHBTfNjfHzz/pMixNAx2keXecTf3lI/Ww7hUHf48bVrZw9/TH3/2uony/Hox+yf8Fgn7/PbAB+fd28fp3p2616qvX8mtPsxD8+EtiWevhegvX8mtLtX9fhMaPdI1eMzod2dpsdnQu3tKazPN5DNmdB+Q310635f49mte2n+/gHmvsazA8z9b3l0615295keNt22xNOme/xTPt48ds9VPbr5t01TXRXm25U/TtO+v/y/ptt5uvf3OgX/qcjusShdV+6HpltVvxbZheGxHtAfrzsimyK7a/fGpVAGVerPbzhp2/tubcVHGpHfKqKDy3X5KObXIrtE5ZqflxzL/XcWpK3LMaN9vCDbDc2cDa3LxxvakPcvlw/9hsvlw77hcvnuMavHh/67G00PD/33o/ro0H//yOx6MdwL9cO1u389x6OHgvYlHj0UpMf2nRSPHgr6pMajh4J0d5PqtWNRDqhKHR9uZHp8w9MrenzL0yt6vP30yidL8vTpFT2+4emV31iW3dMrn5R5+vTKJ2WePr3yaZlnT698Vubh0ytavuHple2yPG6B3Q2nxy8cK+3dk4p9iUcPWWx/ym908+6u1cNu3i/J427e3bV6+kzPJ0UeRsLzH7SNhH2Zx5GwL/M4Ej4r8zASPinzNBJ296CeR8J+50qVVzsfH4eCfsPjLJ8cszx5nEV1V+PZbKNtjfnx+zslj/7xu2A/23AfPhj3SZmnD8aptm/IbO1vZ/a2xHdk9tMH43R3C+fZg3H7Eo8ejPukxJMH4z47aHq6oR3f8gSm2nccHNj7Bwf2/sHB8S1PYOruGayHG9q2xLMNbV/i0ROYuwt9MrjCNvL7zp6/S3ToOlB6XdnSD2vo9t2AD09L9zWenZbubmk9f1eF+vZ50qfvqlDfXt168q4KrW+/POjpUmzeVfHJeDx9V4Xurik/PtWp3/AqS61vv8tyuxy/cZ5S29vnKfsleXyeUsc3nGI8X5btKca+zONTjH2Zx6cYn5V5eIrxSZmnpxi7G1WPTzG2DfBsX/zJOnp6kLMv8/ggp33HK9f7+2m7LfEtA/v0IGd73+vZQc62xLODnH2JR0fT+73P09dM6O4+0aPXTHxydPH0NRO6nTTz8Lx8f9S2jnPGKy0+PmobuxsBz+aZ6Pb2zLN5Jrq76fXslve+xLNb3jr87XkmOrZziJ7NM9HR3p9notu36T0NxO3zWc8C8fEGMjYbSHl7nsm+xrN5JrZ9NOvZPJNPajyaZ/LJb3k0z8SOtx9z2Zd42nSPf8rH7zY9tm+7ePKQ+S5NfX1FYvjmQxTbGlV5Gqv6F2us7WvU8fG3QazsLrc+e47KyvuzB628PXtwX+LZBmbl/dmDVr5h9qCVb5g9aPINswdN3p49+HwD2bySeL+hPnqOal/j2XNUn9R49BzVvsaz56g+qfHoOSqT/v4eal/j0R5q/1uePUf1vMbHz1Htazx7jsp2956ePke1XZCHz1GZvj/N9ZMa76/ch89RmW7nuDx7jmq/IM+eo7LdZ6yePUdltn339bPnqGz7MNbD56hsd7v22Xy7/Xg8eo5qv7fki28vts1xjL396qD9cjjHD745S7btV4ueTeu03aNYVtbUvx9enf/zlW/b3S8q6/7IXP6PV+72o2/PppeaP53QUsrHS7Ir8nSOqu2exnr+oJz59umyp2+G+J2l2bzWwXZXmYaPNUs8J/RvLsvzn/T2yy72JdLB1fi4xO4zV99Q4mEw1v2Z6l1i8zjldq083ujrN0zMtlrfH9L6/pDWt4e0+rdEwO6prO9fkl37794i+Lj96/ckWrO3239b4tmG1uofWuLhttre31Zt/6JrXkS6a//dDabHe9/9Mc2jhyr2G+rD1w89L6Kbltk9nPU4EXcPZz3cynYlHm5l2xIPdzLtG9bL4yK79bL78tXj9TLe3/mP93f+4+2d//5T2usqQpP+8TebbXuL6tkdOxvvf+DSxttfuNyXeHhtd7z/jUs/vuEjl358w1cu/fiGz1z68fZ3Lp9vIJtru/sN9dEdu32NZ3fsfPfmwIeXzD6p8eyS2f63PLpj5+V4t+n2JZ423eOf8vGnj4v+gdd2mqxf0lQ+nvnq5f33W/pu6rvbmqjmtuv83T2qpztK374w8NFe7pMBefaand2KUWfF+OY26Psf4Cvvf4DPZftV60eTmj+p8WhSs8turTx+1tZ3n6d6OvvWZTcF6vGsV9/dYno26/WTJXk669V1ezr1bNbrbyzLbtbrJ2Weznr9pMzTWa+flnk26/WzMg9nvfru/X9PZ71ul+VxC+g3TKxyfXti1b7Eo5mm25/yG928u3X1sJv3S/K4m3fvEXz6rO0nRR5GwvMftI2EfZnHkbAv8zgSPivzMBI+KfM0EnbvFXweCfud68Nnbd13cwSezul9/9Nx7vsPA67zne4ff5d6W6Qd6958O9Kc7V+L7F7L8+iTK5+UePLJFfftjdcnrwXcD+lYD9m13aPHvrt59HA5tnfBnj1G7bsnsJ5+tMHr9h2Yzz7a4HX/tN+jjzbsN1RZDwa8Lq/1zarZHqA0Eja9lUvspxipn+xJ18150U2R/fEfd/jT3flfirTt69rXIxtpRoxYf16iyvrUiYyPS2x/ivMmXU+TUH9zPB4O6vZbWEfra0s78vWs30lEWTflmvf68Ya2HdaVqrXqF9eM8Qpb+2qJtYOw+nGJ/U6Gr/KMuknE/v4X1/Y1jmPNmMyH4r/U2M5m4ZqYpgdkfwmi/g1fbfP+DV9t++yA8eFTeZ+UefpUnvdveMeF97ffcbEv8R3nSk+fyvPx9jsu9iUePZX3SYknT+V9drHi6Ya2L/N4Qxvf8I4LH2+/42Jf4tmG9snAPtzQ6vH2Oy72JR5taJ+UeLKhHe8fndXjW2bDHe8fndXt57DG+sRfKR/ufZ+WkC+WeHaMuC3x7BjxeP8I8Xj/+LAWef/4cD8ajw7t9iUeHdp9UuLJod1uFtzBXdty5AO79rhEOeoq8cPX6x6XKLyGX0q+hfRTibp72urhoeG+xrND1Lp71urpGXfdfvjq4eFl/eRW1KPDy+3KpVVUP94+qjycJZWCWJ5XUF1JrJY+ozl+anvZfgH7wYc8tq2yJkm8UiOdEepPrzffvi2wtXWbsrR+5DL6G2Ve/3JtZP1I0y1+KbN7X+CjFyR88nu4wTKnjrQv/571tvUXl7H5PfbuFchPSjy5Aln17c+1frqZrH1lL3nixi/jsfuCta8V/LpJ7x+uYR3vbiPbpbB18KF+fFxj98DVK4Y4Fut+bAZke9+qEEUlvwff61eLjG8oYvbVIl5WkTSd5dciu2nOvr5gK/ljyXb8PLDbV/Lz9dnRy6bI/px9RfQw/WoRdnojT8/5vSLGktTjO4r4psj2HeVrfyEtv3/m5yK7e1Xe1sVM73nn9zur2Gq7I9pa0S8WOcqdBa9/N744Jr42NvGxG5PdkvRjPdLay/jiwOavWcjxtSKvg/h1xmx2fMPPkd0qfpwnm1CquyLPpujW7bdoZH1e+HXw2DYLstmVt7ggdl7Cz3Psyk+HrnX7jEApHHimw5Kfl6NuT0yUExP7uMb+NZfrzKTMT6Z9/Gu2Dws3hrXtdjrPd8V5YH/eFe/uSjw9NmlvH79ul+LhsUnbvi2AV1KUXtPpya8Dsv22wHr2qlhJtzZH/Z1lSddoe22b46Tdo0+vy2fMC30dHn54iaS9/aLLT5aDTzm9OGX974zJONZDmC8em3OU7Xv+yroH9jorzseOP53I7j6Q9XBMtsshB/manvb5ZTn2Y1K4yvq6+nJsxmT3HJauya5ustnwd09A2WFr13X0zanf9lOOvfPKjnSVYfy8cnYPqDz85Ffd3Xh6+smv2rePUD/55Fcd+89hPPrk17bI009+1d374B5+8uuTBXn4ya/thpbeYpJfP/TLhrZ7GOLphra7d/V4Q9s+TvV0Qxv9/Q1tfMeGNt7f0Nr2maynG9r4ozc0WU93mGwuZrXdLSyXldAu48PD17Z7e35tTA5s6Q7BzweN+x+zHoYyaXXzY9o3/Jj+B/8YXY9UvbB9cYel6wznhfWLu05uZbmXj8Oo7W5l2VjXpG2of7VIXT8nX6f4zSKDIuOLRZwnM/2HM6Vfjl23hzbcki+vpD2+WkaZQD20fnlpfD1I/DqSl2MzMtuQHYTs6F87DOayyWtJ9OONv0l5907ytsSzO8nbHyPHMdY1oNc1pU3GyvacK80FV0k3QH/a7Wxvbz06pv9kOaQwJ+3jWxdNto9orwu5oxT5yjby2m8d3OSS/Hq0X4Z1+5F4Xlx1jPzkavnqsmj/uAGblrfP8Jtu78Ya51yH2aZ1dP944dr7zEcN9ctl1h75xXWz7e/eC/jsZtknJZ7cLGu7b2I9u1n2O+Oxy4LPynTKdP9ymTUor/Pzze6nbd8w+Gzt7Es8Wjumf/TayeNRjq+vnZbKlK/tjn8MlddF883a2d4LWZfHrB3yYahsbw8d6cbb4a7f8Yt8MxWg+faqUh9ccdcPf5G/ezn2k6V4dO+g+XZAxrrH9GKXzYDYu0dcny1JWsOj7VbN23P3tiWeHXHtf0zhNsac8rVJ2d3jWa8Lj8rxcLGPB3ZbJL1L9sXj7WOdUnbnLLvbXQ/vY7TdfZlnjbNdiodHOdsHtEqeIvU6qt0MSP3/58FfMd/kdO3fsHLG2yvn/QkwbXer6zUI3PQufmwOQXdvX9Mua0C65hurXy2STnh+q4gJL8jNJ+m/FvF3183+t7SDK6C7AXn7Ttd+OfIFUD2+uGLGaj0d9asrhpdaWmn+1bW7Zia/rh/ax0V2D2o9WrvbO3argOjIO6yfNpDtdbq2XsXio3487XP7kTE2D//hKt3Py1H/4CIP50i3vn2P+7PH59ruBtfT+c1te4vrG+Y3Kwc1P8xv/nlUdze4Hr3baruRqayTm3nWtlkMe3cxdhXc16xTrz/czpWfitT393Zj+xTheiCg/nioKb9RpPCMRvnh+u3PRcbb5+H7Ek/Ow/vx9ssEnq7bKj+cPstPy6Fvr9u+u6/1OhdZj6n98FrMXxZk93h2WWc07YeHTn4pstlSH04Q67sbWw8niPXdja2HE8T67otYjyeIfTKsa45nK719cd3ICqLXRe/65SLrrXLSji8XUYr0TQI8bZwfzhJ/WpLib19e6bsXDz46HPpkKR5dXum71/1VdWarFtkMx/aDmM+e8ezyDQ8DfrIkz57x7LuntZ49yfdJiSdP8u1/ysPnKz8Zj4eDunvx4NMnLPcH3mPd4as/Xjb+aWvdvXbwW4o8PGru+7cOPjtq7rt7WU+Pmvv2ZtbDo+b9AauuHYVq//jUquvbB6zbxbA1kUrN7GtneIX5DyXPf/hl9b77qeH9T3FJU7FsM6Kb7u3rfWI/zgb58b1m3bYzotfmoZbnD9vvFBnr85qan+T5tYi8e+j9SYlHh967dwM+O/TejoYd6zDEjrSl/zoa9f3RqO+PRv9jR6MwOa7kKVg/j8buRtHD0diXeDQaLn/waAwulNVNu7l9w0HM9h1Pjw5i9hk2Di5i5gmYvxPHr2FIF4brF4vwFnjLn8T4vUt/PA7lpX3x5/hYD3r68M2lne2nSh4egdRveO1Vr9/w2qtev+G1V/txpYjLD3e9f9pf1vpHHoHYcN7v8sMZ88+L0d9cjG2FpxtI+45D1PYdh6jtGw5Rt4dkbV3c6SkAfl2O7VuEnr3Ko+/uUT0fkfoHt4wpt9y8bk6G2u6Mqq7ZCPkKsfy0p2m7C6I9PXXguWd+OtvdPQb17GrIfjEGz6zbbjF2R5h1Xf5L8zvab4yGaeMbYXlq/C+L8fabL/bLYesl2K9TgLFZjvoNF3b6N7wF9JMleXhMtLtN9fCqzHY5nl6V2f+YhyMyvuG9V9v2753vyeQpkr/0f99eq14bifzwyuqff43/wUWe7jZ3t5ke7zZH/4adxP7jWA93m7uVw6eg8usmfh7Vsbtb9exwZruVrSdCe772/8tC7OZU8dRSuvLffmMz5V1gvelmIbYPC9p6vGCk+d6t/VRj+x2MZ88GjGP7bMB6SG/kb0nX3/gtQ3l8JH1K45ffsn0woFHkaOkYpP5WET608Mox+1qRvl7y/rpddvhXhkSIDznSw+k/D8nuw1jlKHyT6ig1B4j/VpmUzGWMr5dZu6tD0nNpv1mGm7wvrsemzC5auTH6Qtaz/vT1sk+KrCc6S368/Nci+x9U0w9qXx5eXVeMXqzy5TJpZWuaZPlLmd09p28q84onJgbn7ffnAZb9KR+PxqTLzr9XRHkZrx0fF+nb+710gEs+Dvby05LsNrpnH5obu9tOJuubKa8LYfkc5/ipyPaNls8+QD62N68ef3J76NufVP2dJdl8cnvsniZ5+sXcT5bl6TuGx/Yhqkef3N4uydOvCY7d9ZJnXxP8ZKt/9DXBz7KNN9gcWtvHoWRv3yD4pMSTGwTD3r5B8Nl4GDtB9frxeOyPd4YyrOPDd3t/VoTnLo7RPjx8s7dfj/nZcgg7rnxV/TfmF9ixvrNlP05T+innbf/i0rUgPc8Olh8vEYztnajOttpHvltanhexdvB6vvyY+S9F3r7lul+Ovl4HbT29rvzX5bA/djmYUG8jPfT063LUP3Q5/Mhvb7fNcvT3L6sN/4apPZ8sybPLamP3Yatnl9X2y/HwstonP+bhiNRv+NzQPgLyndP88reft5L67gTBbZyJraYR/+E7cP03itQ1JVZafs3Sz0XqH13k4eW9sbuh9fTy3mjf8Dr30b7hde77lVMab+vPTxr8PK67W1qPLvCN7dfTBqfTo334hfWxe+rqh6/Wt/Zxje2d1ydfWN+XePaF9dHff+557F4tWHh5Tjny5ItfFmT3Bp7OG3j65uPmY/dtrKef5hnbb2M9+jTP8w1kfLyB7DZUEZ4hkzST7eca229i+boWXX3Y15ajrPuuryXaLMfuDt+6xGJts33sHrl6fE1ilG+4JrG7m/Ub1ySGvn1N4jeWZHdNYncv6vE1if2yPL4msbun9fCaxLbEmk6mP+TIzyXG21cktpv8urfu+R2nP2/y285j1sTrouIXuzcfV6Vs/qnGeb37vfadF8p3R0TrCqmW8vGWWo5j+94f3vYvXb5cZf2gV8G+q/L2ZatPRvbRVrKf8aw8E59fpfl706aVGSlWPp42/TrQePc1LJ/MJ312ulmO7ZWrp5MW9rNSH83A2P6apzMw9kPy7MeUo7T3zxW3k/zLUfkM4w9Pch6/UcR07Sf8h0fjft7U9o9gfUeVh6dp5wHuu+dp89bk+ydq5ZBvmOD6yWo2bhW67cb23Rmu84bxN6ye7QssmcTwapmx+TXbKs4balzrF6to6ey+fngj529VkXWqpPLD9MHfqnLwZTOpZVNldz+rNFtvmnqxfHSlcl/l4dfv5l2I3RHoszmz897Od/Th9pbWwz78dPs/2P79q5tuXx9K0/zlm1+r2PENq8i+I2/tW/LWviVvzf7w9SyMrWwjand763krbr+npTxAV3W3ze2e1tLGcXrPbzfxn/N/e4/r2VyG107qGy4czEtX7185ON9B9v5J8quOvnuW/NmyPL148KrzDVcPPtt4+ULQi7t8vPF+0gKaWqB8WMXfftTwt0Z3c5HodVB9vHuVaL8sTydplGP7da2Hp7v7hn40TWP/gq+DtXNI/grNb72vbB2IvYp8/PK115BsP5G3vm4nLZ+a/VYV5cbIC/tXqxiPtuSz7997eRpvzJ0Py24WZfc417Nn2/bL0f6fH+b5fyzH7s0Wjz5L/0mNR9+l/6zGkw/Tf7J6pRz/rzOH39xIhANKObbj2t6dm/BZjSdTnOYk6/dzej8iym/xr4/rmp2kUuuXq6RleaNKZx33L8eJrjcHaP5cye9WWVNy3qqyLjupvhGQvOsqX03/JSA/ef9v/npZ/+izcPt3IvN2uKofXlncl3j2yPy+xJPrm59892FdRx/5PXe/9emIJ4+H7D/q8Wws5O1pQZ98QYYP0h1t97GVbZGVAH7Y+GIRnk+b36X66pKs2zW++wr4J0XWNWfff19v96Zd45tHu9cx/0YR+2oRnpe1oV8tsj7m+KpXv1jEea+Ll68OLO/9MdevfpHK1xWdV73d2tlOQlE+o5G/wfbThyXn6wXfPiz5pMajw5JS3n5l5n5A1Hh/cK2bASnbj2/zFtJ8c/E3lsPW826v9WK75dhsIw8/wfYqsttdPf0G2+7neOEivpQPf84nRdYDZq+Lf/WrRdbjma970duBHW+f4OxrPDvB+aTGkxOcT7636zwlUN0/bl95+5VZny6IpAX5eERk+1HYJnyZufnH6VqKbO8jpBe8v84JtnX6w4RNcziG/FaRg+/pNPm4yO6JoSHrQurIL+H9+ZmSUnT7Lbj7EoPnhweH/86SPPwW6qvK7oGuhx9DfVXZvk7wyddQS9H91+AefQ51X+Xp91BfVXZf3Xz2QdTPFuXZF1E/baF1sPRpC+3rMIFZat/V2X0c6+G7n0vZvl7w2cufS9ndAnv49udXkd30lKevf/4sdQu3elw+St3j3ezfPlW5bmSUmq4J//wM77bEOm4r+WT0d0r0tZW98GtLMdIXKtMV8t8oIcz0eWH/0lLEtxyuH3J87Yf0dYZSun7phxRZ8+xLvm76OyV0vdu02PG1ErYOPF8dKV8rwXsNzMbXSqwHwkqebvhzidfB/Hg72reTDXl1laaDkdcFuuclmEiTX1315RL9SyXsSLMmjy+V4Gjzhfq1Ekzk8fq1H8JzAurp5Uq/U6IW5g3Yl9ZIGZ5eh1w/LPE6T9xdohXj9Uz1wxPF7XLwad4xvrRaX0fK61jhONrXSsi69Xto/WIJpUR7u4R9dSnSZyLL10o4Y5GnfX9xKfqXGu3hpxRKae9+1O39B7ZK+Y4ntl5Vtm9xKZwqH6Xmhy2On+tsjkP7WBPU+uiyq7KdJ+28nMl85G/u/XyCurui+ToJWAcdeuQgG19emlq2S/PJ7G/q6G72Rtl9O+vZh+I+W5aqzM6vOr78mzofuLde9Y06Tp0hX6+zpojNmrsx3j3R9TpQ5JPuQ7+45QxO40ftfdMNu2e6nj4J+aqy/fTbk0chP6nBm5G+PCa/8WvGN/ya8cf+mte9qMbNqM3jR/El0jd/zb7Gd/+avCS/9uB+X0LzvFbx8fF2L9t3FpoRLe3r6V09pXe1LydL4y0t1vzYrevxDdt/zBJ6d4vZ1viGLeY1orzq7zVCuvs9+vbtj32NZ7c/Pqnx4e2P//76L3/+17/+41/+9m//+ud//+u//f3/vv7df81S//jrn//H3/5y/df/9R9//9f0//77//f/3P/P//jHX//2t7/+73/5P//4t3/9y//8j3/8ZVaa/9+fjus//pu0av/0usUm//2f/lRe/72/Lhv9U+99vP67vv67+uvw6nVyWef/X85/UP5pvtviv//XXML/Hw=="
+      "bytecode": "H4sIAAAAAAAA/+19eYAcVZn4TN/39N3T0z1HAstpOAKEY0EJISRgEgLh1CQ4yTRJZDIzTGZCICHJJAM5JiGZSYIHPxeVw6CCFyLuiouKxwqN6LqLLLIroisKKIu3ovwm0F39qt77vlev+tWkiqn81Zmq972vvvt973vfc4+NfuCTa27sWX7NmoHOgVLD6NCnzutf1d29asWszu7u/eP/v3fRqp4V3aV9e0fHHutowP81NnBfadi7b+9ePqDRhr17x2ckUPvx1NeG7pnV27NmYN/Qveev6i8tH3ANfeLCnoHSilL/XZefMp0PVDu+UWj85g9pxzeIzf+hobsPEXU0osA5eGmpu3Ng1dqS2+iXKBA8YhAahj59CJeuzoHOWb19Nyqf9MQHSaQI6HfN7107VvuDixjw1lcto3FyidKnXro0DN29aKC3b1SFKAFMw79Z91ywqtTdNQ72ueUn9W47UPrzwfdesnfdrpXleZ9c5Hv530/7yz0rX/i3r3yFErzzlYF74z878bmTf/Xnhx4/9cz/Hlv0r9f8fNZFmYarHv7snA/d/bEbntQOnK0MjH/mwp7l//iZM0/av3/j0Zd++wPf/dc/fX1wyWjf2DfuuPPBBX/TDryAIMSMUzmEaFz9Ue34Ocr4j19+BpeOFKXmCg33aYdfqHz2O7/kfs/Kz/2lNzxn62du+K9nFgxGi51fb99+z3u+Odr+y2tu1Q68SBn44q47NjV9ZuyjHceXf++bs+fla357ofeM/ypvyH9jy+u/fHWfduC7lYE/eM/rzz3YtO+mdbu/vP6MY1Kdn9739P/96tuPP9D02+fvv/7p07QD54lJXEA7fr7Y+JB2/II6bdrFQuMbx7TjF4rNH9eOv0REUMf/acdfKjae+v5FYuNd2vGXCSkajf/liuAN3X3wuZm7yye98Hpo5/zO4XWnjPz7la/c1PyJf/j5++8vfjqhHXiFGOHP1Y6/sjpx8/Sjz+z74FPpHx8z9dlzH/30Cfvzvzvy7B8/PPdjr/7l3/7EoPhV1YGNnCm1A68WwDj83nnztOPfo5CKoio+8XuBgRQA7cDFYjSmzOASUXekGb9UbDwlnNdwPrz6z6sd+D5iYOPWqWs+ENzdOP/rW6Y9GAl9/Zcz7zxvVvnx4Z3tTZ++UzuwszrwuLODr96zc+MtDT/5xEu3/eG4r5w7LdE2M3HCD+/4z0JP/3vzr2oHLhP7VI92/HLC45wsTukunZSiBpaE5qXMz7U656UGrhCjF8XhlWLjKRe9Smy8Xzv+/WLjw9rx14mNj2rHd4uNj2nHrxYb36Qd3yM2PqUd3ysUYXVoh/cJDZ+mHX690PCTtMP7hYafrB2+Rmj4dO3wAaHhM7XDB4WGz9IOXys0/Hzt8BuEhi/UDl8nNHyRdviNQsMv0w6/SWj4e7XD1wsNX6IdvkFoeKd2+M1Cw5dph28UGr5cO3yT0PAu7fAnNguNL1Hjh4TGX0uN3yI0fgU1fqvQ+JXU+GGh8auo8bcIjb+OGn+r0Phuavw2ofGrqfHbhcb3UON3CI3vpcbvFBrfR40fERrfT43fJTR+DTV+t9D4AWr8bULjB6nxe4TGr6XG7xUafwM1flRo/Dpq/JjQ+Bup8fuExt9Ejd8vNH49Nf6A0PibqfG3cwJ9V/UHNfIDOpNh2+69tDQw2N8z9KkLevtLq1b0HEqzHviXzpsGSsuvGRzovmZFaeDygVXdqwZuHJ9hoLRu4McNuaH755dW9/bfOLOrq7+0Zg2ZwYWeeMEnPvCJH3wSAJ8EwSch8EkYfBIBn0TBJzHwSRP4JA4+SYBPkuCTFPgkDT7JgE+y4BNYDprBJ3nwScshwRrfB1rd1116S3jt9j/V4oz7yoxThWDeffnJ08/A/8rHdO9e7RaLp7ZNRe2LeMVWm+8Y39Vb1dPZf+P4oIv7DiiA7xpn9VsUqc5EWoULe7re2iapb6upUTN5bQplevqbXVpq+EjU7hnf5ekvqZ4qKxJgMh89ma82GQxwg2yA455PNsTd0iFulg1xo2yAfdK/ebt0iCOyIa6XDbBXNsAbrC+K8tkyvpiWDXGHDb56m3SIwzZQ6i2W18HxtbHlPcwG66Mo3/LYgdNj1ldB6bHEeDLS+tZ2hw1so3z7vW8yGp5hWwiPZoHmrS0i9S42lXnApaZX0lKT8Zne2vT6B3m4g/z4TGQq7/5aKq+7d8Xevfu1CZjKsLlD980tdfbN7O/vvJHkxfHA+0vY7/sb9lNJivHc59A9b704ynp4PDuBoh3yVgqjQf15z0xRpSoXlsZ53LPiss4VK0pd83pXrLlm7fRROF2pgQ2/6dK8qUbiyyocZvetLK0u9Xd2zyv1wBDdo8yv1o9s3fmay2gIPjEIiaG7Lxpc3Tf6xHdBQT04b/wjLlvZ2UMq5RKCDEP3HgJx4bWkDJWD4SrksprSD9covby71Nmv0Hrv3lFAUM9HWWcA4GwtQI2N8g/BKbWAaG2WcEotANs5vyQ7F6Ctjx+wPg+qNGNWZ9+awe5xUw/vHzCNSqBxjGE3TgYsRON+OMcMsHQW8PcFsEHYX29G2ABxFwzdPa+3s4ukDPnz7lmdGn7XCFuZ9P63Jn3zPxf37SdeuGv+YDdzKA03QDJM9YUIBoEKBtpXPJB80srj11lJ/1utRrprhqdiVv4HJL/aYBEgSPdMmaxAOfDDKuyfajzU0SodmD8OvnNFqbKZtua8Gy9bN7dzzUrUTwV4fkqXqTPipYKiXiowqk/MQ/fOvn6ws3uNmspBnMqhJ16kpSIsfHrjsv7OQ6c3aNsZlrML6uxB2nUPsgA+KYJPWsEnbeCTdvBJh7MLOhG7oJQVCYpZkfNpCCExCIvqtmSzaDdHWM+KM/o1ZIA9RiJzT9l/dRXy/03cGggKvCuY/FbyN/puq0L+gxPb2z62v9CJ7ScqtheoLTmsyuIxT1ng2pIgiRqV8wyShDXP6BxpQ6MjSEdejU6QniyIJKOD3Jy+UYDwtoNhiLulQ9wsG+JG2QD7pH/zdukQR2RDXC8bYK/0b94vHeIB63/0TusroHzx3iQdxWEb6PSWSSiNG6xvGU3wgcPWJ+Ot1hdG+Rq4YzLGT3A1FmfprhsNjzmVBIEjwIU48/1go3glwREilQSNTnLHSe44yZ0J3bhF/v2b79lHuRu35cYV0ndufe9UgL8fy2kfKica367tXFFfTVHliy6XXZZyufTNX3/dJUpU6gY2sCHTDWwINrBBSQY2hDr1egxsgG1gQ5PIwGLEpQ1siPyptV1B2ryBBjagNrBBDG4IChgwDEKAgQ1A8gnGcsyaCpVHoO1fsNy4sW5txIoqQpaslfQLncy/QPEQQzrdj769xkC5cacCepjRmVRno68Ao1WrzqEa9jxzSo0/azu7V3V1DpRm9nS9uRyZ3XP9YGmw1LWgd6C0ZvyPs9eWegYOVdju3XsAMBMXAX9/N8xrJMYETc4BSSUM9frgi2Q79XdrACrdGthC2HTXosFl2vBHMZHAoPgDVcklzIcyCJXfeLnxtkpn3nLoca27jyPuPiFmYC4Xd/cJ2N3HJbn7BO2R4oC7f4ht9kbZbj1x2Sjgwi8bM6AfTWN6nLCBj6TdbkLFAMinJiueiny5ArKLIWbJsmueYiY/pBWzJCJmGdFGs8JiloHFLClJzDI0B5JEqkg7bVa0ySAwbZaeNkt+t4YNOfJZlVl305msXI3TwMQ5euIcN5HVDCz/ciT2tGg1lxs/LkD3eO2nj5L9jIoCmmguBwkl9SZB5BwQGmYgbmuZkqgFIponKfBJmtDuChs/A8oIQHVl3tUMmmfLrqMV0J+HQOcVX6aAIr4fGFRg+TJiGIJVodz4EOHL9MtEnuthcazyKgRZeP2zgteTMLUovNJ10yut+kgWZl/lY5YGRIT4bC8DeLrc+DUF+PeFVJRnKtL0oAyJl1av0+RPyPwYkYuMXrloZhAoU278DkF9jRJn5TnFmVKdYtY8p5hFnGJetPG5fj3LI06xwHKK/047xQLXKRboiQtcSS8CulfAFbtYbhTRuOYqHleAVEMFvRk3gPly4zM6DCDwqRnczIwD/zHfzBSMmJk8i2OkOGjMTF5lgzQevwCJMhYbFIDwIQ/GIrrDhxydmf85KDK8IOEKpnlzuRTQL4JrV22QcAX5ldCKhmN2EawS5caX+UECvmQy5AziKrKxnMGrfB2Js3SXgGsIs2bVR7Iw+x0fswQgInFce8fZ8Ue+9saMsCOhlx0xNl5/hX1zoDp5CaltTWqfhcjYXfMsTEYommcR0kFqnkVJha4om6sbIkkrqMeoN2ktuwLaiTMIUgUSKc2zIil3VYSniCLcjEvVOMJhvlS1GfEJrfSgNtUnaXxCK/kTcvKIRwbFu02vThcZBGoru5J8nW4DV+SIgR0HnVFA/7DC/sr7blJoNA1vPaIxbXWOp2nRrID0CnA+w+V8O8r5HB0StutgfQHJlICsb0VZnyMVkakbHQTr+SpIY5ioYUiFG8QnUwsagthw6qmgfaYSZW6okuebOHaI6pqGIJxEEE4hCKcV+l4ginCaF/a6TjosYW8aD3v1r67TdWZd0iprychtuE7nm7gCQP0UnmhynaXDxCXrNHFx2MRluSaugK6u9TuiAkkTysQVdbCekQxOcVmPrzdTKmvJ0o3ZDBN3gYDA6zJxeXojAw6KUkhQlGYEReMpW4Him7jp2yRx84tv4nhFbZ07kE0Ci70E+d0wk+OKbF1J60aSmxFKottCwKAUYLGSKuGldCJVdl1OLyykCdRMqQIVMU+gIvIE6lwzBarLBgK1DFwXL6fXvlAeKlz7KmptC42JkbERd9UbZ1ZVxfD4Kl529So+5FcmFkYYqIO0VmGEYB1kDCiYmER1kHUUZGgTwWQai1cHGVPXQcYxuAmSYWi2mgQDZKtjkHyCGguYpCYSJlNnNyk6+wqGRhOPVm96DuXEzgdIIFCGnWEKBOtHYuKmIAmbgoQkU5BEomNTTEEyKmIKogKmgIw9mMbgOhONQb07mgU6zVrBukH7pBWR1zaSjUx5a9DKWwOJc1W/XlWve4l3GpAApxVZFrUhy6J2JP/cgSRupiCJm6lI4uYIdhHbB2kuxuQVWsfoOMeiYUbMvDAjVrMtsBglWNExIRusQm33NCVU/Bh2mismcD4sMAQf+IyRr0GBcmPdjcwMrLyCMGMDkhgbRGkFb4wFaToqS4ebBM6VhBDGKM82yAYIN4QxDHG3dIibZUPcKBtgn/Rv3i4d4ohsiOtlA+yVBlD56ZdOxh3SId5mfeHZZF1Wm6cwOyz/0RttIN3bpEPcKR3irdZ3WSa41WEbSM926xueW21Axi3SIe6yPmOGbMCYEeuTUbq53WB9KtrB2m6wviWblFGeHRbA8hmz1wbhiXzGbLU+Y3Zb3+5ssT4V90uHKNJZlkhE6keDSEvL7KkXPFesp17IQE+9c8V66lWS5J4XqSR5liQHQDrmmXOYgzHyNYETkIJ7Z+eIJ8nz5p+AzKO0gg9V5JHjhzcJFIQWEMYUuAbKKEA4SW4Y4m7pEDfLhrhRNsA+6d+8XTrEEdkQ18sG2Csb4KB0Iu6QDnGbdIg7pUO81foqbYLZGbaB9Gy3vA6aIDzyybjF+mQcsgEZb7O+fG9yOG3JYKLX+m5wg/WpaAcvuMH6HqbX+nbMBJ22wcJNPmP22iBslM+YrdZnzG7r2x0bRI37pUM8YCyBph8Nk5K7+bPFkrsFA8nds8WSu8zC6C+YXNUOMILbcDvERldp8hiZC4KmeYx0mldf5aF5GCNBANPFUJGiJDtIvjbR89XbbdbYMZQgfQxFYQczNY8dQskqAvBu/YdQYiRe4OYF1X07BOFZ03J93bdDzEYF7u/ym5GFmHrSTdIDQq1y8vXQ6Sn6i5azMfoeLSIFedaggN3zkJO0L5gjXxNoNi14aUJQfFcpZH6zaQatiEPgGmrkSdQoOiqd9LoEPHAeYYwD0AEIm7R5tReapZq0lxSHsQFpkFnZ+Ha/ohNrAgaBN41AqOxTjp65XxWgcbMOE1/Q2waO3f/Z/TvhHkk0s8DWP0UWswoYs4pl959gZoVqzIK78iQVWv8VwisJMDJEEpx1ANSn9AB2/x1zZBFJjixCvobMl5A0X0LlDur0UMYixShyYLlF+6ydjNw1zzpg8uiIMZX2iJFN+mPMEPlFcPzZBnErCnQqUaSelslo2Xu6UrKTpHoeJAkw7CvdsCqbZjGGu8XjoWbzq2yaDVbZNLNSEgRhZWU5lJ8ZE+9Feac4aw77vSjw6fwMTUelYepNAnLQjDCmmZvEMwoQLoAyDHG3dIibZUPcKBtgn/Rv3i4d4ohsiOtlA+yVDXCtdCIOS4e4y/LCDe+1GYa4x/o2Qr6+yMdxk+U1EN6BMQrxeukoHrA+FbfbQKdt4PflG1v5rB6yAatHrE/GndYPvUdsoILD1ifjrY75niTmWz5j9tpggSCfMVutz5jd1rc7WyZh8N0/ccE3no8zlF+VWU+VOQd4fyn7/WaXeD3VOSL1VC4s357Hm0AzaE1cOoHeTAxWr8AQl2KHebMCrFUgLqYgNpM/9e9yKhCXGbpZpoBAXEFBLJA/oV1LBOJKCmKR/AlAxO5QWmXoyrA2BOI8CmIb+RPusl/dRvocNGs7sG9K3ELH6svdXvb8SgH+oMi1JiHTm9yGzL/WJIQUI9bXQDsANQmYPL30Q0KVniHyp9Z2E2WSAV5/+IC6l34QgxsiGYb20ifBAL30A5B8QgQK8nvpBxg6Gyx7HqtugUe/BgKnCyYDNepDLNNXMBlgltJ4vqOjYJK5jd6kkhAW6GcVI/W4gLg1cT84jNboNJGSQuMVLnu+R15mpZGHMC0yoNC+ibwSBX6ABAJhzuIvgTkwLKL3g1k8jpQ9/8HncYDGLMxlRESf5IXZWD1DYkVa7S/WrPby3r4bK2Z7794DBm4mCOm/s4CgImh2D+gxu/qNcFU/nkXtEk8Og5AcBtR0/VKNrl2l7tJASaHsPgOUDcJU2idAJSd6IaMX+BpjRjlxWMVpSK+NBEtrlGCJsajUEc4ww6hAo9FwBjx9w1SmF7VUdJO2snod4BAVzBDFb2DhPOPS2nYkR5AjX0PmS0iaL6FzvqCk+YI654tImi9Cvia8qKrAvYK9pPoz//rX9kNRKgB1MTRoCloyCgzqoAdNwWjdQf7Uj0g718UfYQT7qfSgI8gP0WI/lfxpAPulUrFvF8S+HWPMFB1KPoXFbF1KPmXC59OY1imIuz5CzGMmxd31EbC7niLJXR+B0kpDjSNJ1Cg6Hkl6TmC6I+npjkRYQ4BMyQcZkA8yLR9kh3yQGfkgs/JBNssHmZcPsiAfZFE+yFb5INvkg0zKBzlVPsh2+SDDAr56CrC8IVa/fYNrVs7uW1laXerv7B4FVyUdo8w1/Biw7LmIvexpT4zpWs6IrAGitbiN2n4ggxFlA4Jyzi5yk47rHo+ml1Sw3/eIud7l4n7fA/t9tyS/76GJ7gb9vpdEjZJjb3XcADSZl57MiyiGl7vbbhQgXHJmFOIG6SiOSIe4WzrEYeuT8VbrC+N26RB32EB2NkuDSBh72Ujusrz0bLSB8Gyzvv2WbyckCriNDLgJ0rPd+hb8VhuQcYvlybjJ+uK9yYkmLGnI5JNxxAb+QHp0ArfFtpBptIHwDE9CJ7jBBpZszDHfb/fFoH1WbjfbgIo2MGQ2CGzhg8IWUurbrM9q60fffdaXRfnGe6sNzI713YEJ0fzWSWl2bp18ZscEryo/lthjAxxHrM9q6Uotf+G20wYQN0+cDrqIdraVl5dXf5QYRbquQ/1i6y036KI37ytTMkoZfKKwhUsZfFp0fCRmYJkDidiMU2HEXhlsmvGD8pRuiAU+mqm+GlOBQX60NoIiYkCMiMvU/WGJ4n2/+omHpmLliZecvHro7jEaM78oZiJUJGahlEOhcZcxxlTvAyBEhdAHAGSSBkkcMQ9Bw3R3xE4yO2L78sIdsQmcKl/czQZd5JfsMw6fx7gCzjgDXySxMnQKHvhGpSHEPGb7bt9U4hshxUgooq2ohuDFC9U5ntaao2JNp4APa2URi0dhxnn7VpImlMa06SAxQ8CJ60bg3tJJpPt5kd/9HG5jj3A2VPadxJdeRnuHHJe2jBNmeRIr9BA3JGJJ80QszxWxAuuLeGRgaH5BpTJaESvqMIYM2iZAEUvQhCXoSXxK7aYE5zSk08vB6eVwCOXD2cvBTcJk9XLwLVDM2SsYGu46jm5Dd3UwTEFYTBtj4qYgDJuCkCRTEEa8tymmIBwVMQXR/TLOyFe+5zoTjQElHYmJuGYkgFwzEmLLW4NW3hpUUUpFv17Vf11IkMQMPklPtWxSnSqGz1N0IFeQUAcjiaYcU7XP4rWfR7DNy4q6V9ENyJ1xFK8CiG0R9PRecdsShG1LQJJtCdK2JVCzLfDKIEhHicRTv4DjxW4JCpHiJgskL8FgFOATt5sYpHrtEqQGuMuPMBrZHjyvu3P5def1rht6cGHvmtKqrt6e6QtL/asHB8bf7O0ZIynvIc0YmN2p44pW8/jptuGiw2gLlhYBSQgjmia5q4v4sceQ2LHHy4FuLy59xx5dAt/orgk0ZOjRZCU/rt9FJCvhLjIBpYvMCpjpVD8tPvY6+2m5mf20fGNEPy0qwoFVOiqmVZeJq3QUVumIJJWO0sISARTiIdXigdAHphhHF40CgrsIUojZoGaFx/SE8xre+eXxLi6Vd37zeOdHtpMEr1IHm+oxL/0mvhsO6KNV9ffdRZvvJm7k1URP3MQNJ+L8tpOsVrHxsu9jRnRmIRUxRFXfr0l5NEEiSb1JkLgJSONEIV5rWeKpYrsEXNAsAYMbpT2v7wFQQgCaK/OuZlA8VvafqoAGO/8mFPeggDrIXQMkUecWxbBKln1f5DeBjKLZbUNYJVQIsvD6Mn9/MMEKd+qlV1D1kSzMHuFjFuRfYRxiRxqP8nd/OE5N91I3SuKl1esg+RMyPkbkIqpXLuLMa1h934ZDsZg8lzhTqkuMmecSY4hLFMzwnSugZwnEJSZZLvEHtEtMcl0iY+eWf1FCCtxRRxU7VfY9JUD3eBWPK0CqoYIexw1gouz7kQ4DyG8UH2IDf5ZvZpJGzEyCxTFSHDRmJqGyQfAtDwk8fCA+OAmEDwkwFtEdPjTRQcLPQJHhBQlXMM2bX+lE6vsFBNqjDRKuIL9SZA1Jm+0r2GvIl/hBQoTmvKdOZ+BRSR7LGfyGryMelu4ScA1hFld9JAuz3/Ixi4AigmrvODv+wNfew8KOv+hgB7NpfAT/ZE/Z9zcF9K8oI0Ig5hcQAw+SbfOTr9VbW2ps66yF3jpTqmE1T9pJxDXPiBawAbpNJxHkaZ5NJWMMzbMjSJsIN7t0iW/weZS6zO/p3+AjUnDhivl84reQIKT5WscKD9JlfwbZBIwhQRBFohRpSCrm3n+CKMJxXGfGEW7mm4mMESefpgdlVJ+k0c80+ROK2pAQC7RXGb1GOsUgUKbsb+fbqwyYYEE85jjoWn3mD8HiuVidxXMz4eK5KLd4LsNaEPI4n0U530Tb0awO1ieRxBfI+rTeuy+SbN2YRl72wVVB1JlS8SPxyXBpAJZJTCKlASl+7Jngmzj2msN/FoKwH0E4gCAcVOi7SBThIG7ixhE+57CsY4L4OkZ/uiRYZxotqLKWjGSV/3y+iUsC1A/gmUP/HB0mzl+niYvDJi7GNXFJI0X+KZTzAdrEpXSwvgkpFVhgLIGguiCIqRuXMkzcIgGB12XiEvS+FBwUBZCgKMgIiuAcfMLIPmrS+D7quLgvgfdRk0jiMSUm8LPFE48pOPGYlJR4TOGJOOP7qKnzoX3U88cMXMSU0LWTauAj6VKZlIoBUCFvurLcVYWi1awnMzD5hqKrKyFEcwii9A2kOfKnRnDTiODmTc+Y52HBTUsSXMZJmTSSMS9IypgX0EMmefo0FfGsyv5B1lEUXsa8aOTUVSsQABRJ7GlhbS371wjQnfCiYfwKWm3qtggJJfUmQeQikAfOQ9ymV+lQHjgDPskSalhh42bR040pbGVZKPv/SQG9FbZkcIYYvuEXDTfyHKy28TPEDJlIcX02jlVKhSALrxF+/Muw+9m66ZVVfSQLsz18zLKgiBBhEw08W/aP8ddFWSOba00orVKUXjeRP/Wvi1LGYjkWgYB10YfgbWQl7i0hJwJySDIQW/ZnFO39T/AQLJ/rLGFvK/vvphPNMFJFEik4DZ1VEH5EFOEsLqbjCH9Cz+VqBsSUcY64XfVJ2M3dkJdkiT5PTNv1GolW5u1z/gf4RgK62C6DWexx0J/TsXxPm5ehLHCX7+2sIIrH+Q6U8xk6purQwfoiK+3JY30byvqMKkBj6cZXGMv3RwQEPgUu31PkJ1MrAoLYVNxD4ExFPoQo12IfKC3NWG8kTV9vJOH1RlTSeiOJZtXrTQ6cKxDCpMjvhpmcVJj1JK0bae56I42urwT3VNJ4zDS+q/IE6KuXg7XtXWDiEC7w6NKVzwY9ePJezn5UkB2UPENscpuXYjJw5N9aKSbBc75xIPVk9pH/WdY58l9HagspyorzjrHH1Uf+kxhcVciOLvJJMMAiPw7Jp+geSIK7kPglcuSfQCPBo9WbnqP2Xz8JBcpMMGyBYOIsLW4L0rAtSEmyBWkkmjHFFqRTIrYgZeTMfxKwBj0Teea/KMagVnpdCBUutSPy2kGyUbgkSOnm1fYp/SVBaRIzOIztQMJY6uw+kUifSjcrUn4egSzCj2Tm/AMMPY7LO9cf5yReZpxK4loZfwHoSqhljXo8ai9T5YBXR0KOMMYkcMKcNrOBKycwA2ebaDRdjtF8c8JJFECl0fU1WvCGBTqCAVQKg5vWHUCRYPgBVErf5qmxAGpcZ5UqxejX+PsZJDAjFWL0bn+cbZKL/P2M9L2cE0wpNugTFSPVLiBu/JNVOb0nq9IMvHLlwBFkwkkjDzlaZOA9bzCSzcE72gwGE6hDO0r1nCXLlwPH8pkcpzHLcTmR1yd6OTZW00isSLP9xZrZXt7bd2PFbu/de8BAOJrWH6gSVATt7gE9dle/Fa4qyImoYapnSQU1w+gqdZcGSgpp98mI9Gtk2idAJicBRCaA4Pg+xcpb6g5+BfNNa5Rwae9eIwENM5CKNxoNaIBQC9Cms5lHawLnKi+8EzlZkaierPg1G8qsusNqbA2TFlEHwU0qA61LPOargweVz3ppvUgooU98N7wm9ihitIDWyBx3JyFnpKdxHog6c3iwM+5k52GnyDKSTpFlVNSZ4PmoHQxo1yNFHWsNXA0iBB5GQmrFx63DVxXQiymXTmCdxVdhOuphQsx6mMD7dLRLr7eX9WXwZneWu9mdQ6oLXAIVVTnUMeZ1yFzSSDlORm85TpK5sRe4TiwrpLaKKPPHV5g9OpifNY/5cS7zscNv8C4qZ88Xsw4RAfOf5DIfP1uexG1xpBy4kVx4aqwkUXIVFTjrHEGsZJR8baLng5sNVA3kkPh5caTQZ5y8BxXQw5TtJZxQDLe9Ef6mPfu0emC7DvWLm6d+Ea76GWqoE0Mb6qRpMYiRVNfv79Nc9cNP7auiN9ap/cA+vu2NGmtVMA78dh3Mj5jHfP452JiRc7BxtEmch2Y+kbZoEjAr/JYNsXpaNsTKgY+Z1rIhcHcVdPuZAvIeBRbh4g1LI2INS2ezF+eeRfoali7St3Y2VDemX2CS2IojoiMASBoz88ly4IHDa+aTRqKsZJ1RVtpYlBUxYuZTes18hB0F62iolzJ4CDSFlMthxYcRftCTRkpvXUJulEAOWYqDrjltbO05vt/z2OFde6aNrD35RZz1rD1F4h/+2jOnd+3pYe97fY+vGDm0Owks/DnaShEkhsuyPUQmxrw27M7dT29NOInqGJy7n8y6+ynwM6l3Pyn/9ZNQqCtJYFsQNr0Q9G15+ZP5haBBKxSCCpYXWuLyp7iRQlDLXv7EtCGv2/aCJwOxhG0veIoZm25i7185n23ggo1jOmsIgG88HPevBINC96888T+wP5no61eCTRNy/crl4upn6+tXLoPaBl0Gu3yP3AtYAvK4l5DKvYB53AsgFSiCTe7jAgl50QtYgh3Wv4Al2CakNcpPnx2uYPGDxSZB8EmI2goNHg/KCEB1Zd6FzN2O0L0KaLDXJ3UFy0Ly+w11I4liWCXLwenWvIIlOMPQFSyhuukVUn0kC7Oz+JiF+AcSvAzgoXJQR09RQzvGIcErWELwaqlmRw7DFSzB850rWNTeCXaKFrqCJXix9a9gCc4XoLvpV7AEL5dyBYuXDfwq5woW8fCBvoIl2ClatOLH6qWi5dCQAhrUCv+EX8ESXGnoChZ/nc7Ar5I8ljPo5uuIn6W7BFxDmMVVH8nCrM/4FSx+XHvH2bHG0BUs5rPjBh3s4NXzsD7ZXw7eRHSnEQJNxPwswCGlYVTwZp26rMAj52CRY3MV58hcI8vcBfhiCyr0baw7EDCQTk3AwU9cUvCTQOuU4RgkwYo8YDpG5dHxaKl0jJpHx6hhOlbG3WQsgoMBbpAN8Il90iHulg5xs2yIG2UD7JP+zdulQxyRDXG9bIC9sgHeYH0iPrHD8sItX/+e2GUDiMM20OktllfBJ261vsbYgYx7bSDf8j3/VuszZrf1YzwbiPd+2RCvl47iAWMrB/1oxIFt+Ptr2/DdvSsYPS4qw+ay9+UTR4Glrsz3k437GeV2Z1B7++TDo9i781AZC7KADwikBKII3wLkaxM9n3k1JXEb1pTUW+gocklFHGGDKtVdzW79mmZlgrsBw9z54Wq80Xa2wZeRXHz1O14znHFfzc64K+eAgr/nZ9yVP/EvTwzoq9xi5Q4D5eCf+Rn3ADMtuZr8cqgirpIpPVRcTCh2BcJydhnc3+vW6QakPDRad/HpRF50HUG6zPqRi65D1rjoOqDrouuKWoQ2CVhD/h5DHNyzrIxcyKxYCsX5ex4JvAJWoIgBcalx8qdZh8qRm0cV+yty8yjfaOM3j/rRm0fjtNnGYgQCq5pRhwx/Y912wcBuRgCOJPySIokAojsu5BwB4w7YIGJfJBbZH/f2L7Ln7WaE0BNBMMANsgHCuxmGIe6WDnGzbIgbZQPsk/7N26VDHJENcb1sgL2yAa6TTsRbpEMclg5xpw0gDttAYbZYXr7lW8YnttlAeOR7mDHrs/pW6RB3TEaNGbK+XzWBMduszxj5Sj1q/Y/eLxvi9dJRPGBswaQfDX+dmzhzgCPCx4pt4oQMbOIcK7iJo+TB4NO/4erp3+9CJEzzq30TzBZOoW1IC4AYUrDXhPT4iStf9VFRhIkEmJeN8E5+qi5j5HABsx0X+UnYTTj68178210yeovD2TeJhkb5ddIZ8GhnBbkr2KD367hYOWbexcr8lpcZI5vIWZTzTbQhzOpgfRI5cit2sQ8xnlBEpm7cSV+sjKggmmCHk67YHfDYGeYk0k0sxT/zkuCbOPZZp9CnEYQDCMJBBOGQQt9viiIcwk3cOMKfOSznp0L4+Sn9OxwhrpzrPiTL3soNPcQ3cdA+cRDbCRoH/WUdJi5Qp4lLwCYuZmQDJlbnBkwQ3YABWc/oKsDfuMYPLgZV1pKlG48xTNw3BQRel4lL0DsdcFAURIKiECMoCh5PbVwomxs1MZpxKixGha+UnnrXj3/1Y3rHuyoH915aGhjs76l3oqf8L/3u8W+t2Gv6RD8LLJzt+uKudtMn+sJp7zgretVRm/kTVYxh5c++mhlgblSpjodpx7hqolx9vRx6UW1evDVM9O6EKcaHOSCoHeCuDVDNHKq9oPp7uIZaVdF+pqFKoAajakG0gwNs7EJa7EKQDasC1A4IcwZEmAUsyjRBiieRcugnkHh5RTcUqxT7JcBltyR5/r13z9OzfzTytOmKs2O6J3Hb1fPn8ieizbarHI4pFHlNpO2rS4zuQfFdZJf5bV9diJ90Ict+RgpG0WGwqM5NT+ZGcjoOwEkGELqlhSpI84JjfOATP/gkAD6hmyNFzhWoCSOa3KEHmgGIMQTiUgpijPypPypWIC6mIDaRP/UvsRSIy/ASMv1xsQLxOkPLwCQCcQUFMUn+RG57TtR927PqzmIDtz0rssknQZo5coGOkRnmyKU6RmaZIxfrGJljjlymY2Qzc+QKHSPzzJErdYxsYY5chazYCkhUUTQ9qijCUUVBUlRRpDWuAEYVrSRqlHto5fqbVnqyVsTfOAAnGUBWx6vwu7RS6CJFlepYrZha6NzPsmqAEL6Shgxre8p0bUeukHZJ0nZGAs8FanuBRI1iW4F0vsB0BdS4MEDyRMsB+LYCCCnvAlB5VxDKy9q7Ci9GNptdyGZzGJF+5fRVeFB0IzpSi4eZ6F7D36Mpoos0/btyRdUHGdiGLiCbRWCivogm6iMqsaAIVCyHrzXeo0wRp3nMDmXhVTr2aFx17tEE67mPjXl9HY/zRRaXCJpQ+ljUwXqG3whzWe9CWR8m1ZCZ7Bug92jGFZBVURC+CYkRkrSZIWaGT/4UlEn3iWp9gaP1NxsqPjGk9RnVBxnQ+ghi3Q0Wn6hMK5Ofw8aLT1KY1o+D3qZD65Pmab2Lq/UZNEbTb5szesM3kPWMy4X4l80l9V42F2bunIfHGFq/j3lnffiDsnw968bF8OdEJQ/19eOSdwdf67NGtJ4hMFnM12fIn/otCd/XZ/X6+jSbnx83z9ff87b09VlRX5/VwfrD4us/y9D6zzFvoww/ZIKvTyuTfk9U69Mcrf/yYdH6tCGtN3Ttbraea3fHtf5Rvtanjfj68TjrG1b39Wkjvj7L4hLm6/Vo/WHx9U8ytP57jFeby+EfmurrX5Ht6592fD3u6//bPF//vOPrLe3rX2Zo/SuMV/Pl8Gtm+vpIWLav/73j63Ff/7p5vv4Nx9db2ddHQrTWR1ivtpQjcTN9feRYyb4+knq7+3p3Pb7eXY608LXebcTXj4Nutbqvdxvx9RGWuGC+PmJRXx85hqH1x8IVrppLg+bVniWMCWeCIz/T+C0M3YjdBukWRrFyqcwAhVe4HDmZrzIu1DW4jWGWVn0kC7PTdCjzveyPRszoOCvOIG7PgcpLS3R5qfIzSheYKj9jyCmdJuSUThw5pZNETumkiCJUOIL10N9JIA9/TQDBOIRUgnsR6vkRCgUlFf9Hv/nwxc//qe8ofvE/IFg+xI12Q4P8eq/W9jEvX4pcrOPCKF6XUx/4Rawup0r9M6vLqa8cWVTFqP1ssNyaUcHkq6/Tr44KJh9cweSVVMHEEAEvUWxSZytEsBzbzzoCCCtrgHxWNQVLWY2qecU1ASOtMIJANBVQyRijgW5kMWh6a3X1y0DeANN6ajrKlGelqCdSQqylV9w4eHT4Q9w8eLjm4Tph80BCrFoKJuge/sIiYGRR6WfJFCmwmoWFn3YTdJTtrTPKboKjbB83ymaQwcfXEpQMHrSJqV+Ath6wrM2D+F8vy4Qsq9cFH3hs2tzfXPJKm46Dq5ojEET84aqckhConhW0wx5x3+M3v3rWL1I9q7K12A0FPmOmHwPplg/SQ8eVMLcFVX+ZOLc9MLfdkrjtQXM2cHTOMByKLbpJwHn5EMYozzbIBgh37TUMcbd0iJtlQ9woG2Cf9G/eLh3iiGyI62UD7JUNcMAGwm0DdYGbPhqGuNMGdBy2gVJvsbwOmvDRO6yP40bra7V0Tm+ygQbusj6j5Uv3Hhu4GOnRCdyJ2zqm0QaGTP5H75cN8XrpKB6wPhV32kAY7RDabp+Mgaj8NMKtThw6WTRml+NXrfjRdghE7WBsRyxvbDdan4o2iBr7J2PUOGQDIzFifTLusoEdswFj5IehW6wfP9lBGm+1gTRORp+1ZuJ8Fr4drh8NsjzJyJ1Mc9l3LHk6gfcXs9/3ucXvZOoUuZPJTZVRkbVsAkXdLoRvXvI1gXIcwRqJY8ULNNzml+O4RcpxVKWAFB2VEq0bBcTfgzBGefbEVukQh6VD3CUbYq9sgBulf/MO6RC3S4e4WzrEEdkQN1if07stL92bbCDdmyeh1TFBpXdMQvF+4jbry458+ZZPxp3WdwcmBCd7LO+yTPDTNpDGSWkbJ9INuomzgZWXl1d/lJhnaKNfq7sW/zgTTxQeJ76MxI7BeuElpk/ncZjbO5s/vXVav8FqbWAQfkyEImJAjIjHgCewNGezGIeJK0+85OSVU1fRx+o+tHOMEBWJWeB0VJcxxlQPNxGiQuhDnUeoPvi7BadtbT7iN6KnmCtP/Vppd9fYouJSoPaC6u/BGoMrx8KiT0DXDAYU2moH+9jYBbTYgYdNqwC1A4KcASHmWWllGj91oV6oHP0O5+hnjHfbDuuG3Fg5+oJCwR+AHefrP95k4CA1crwpYt7xpghipbySDlJ76WlVygnfsVwT9+doixHjWgzGFV38C2+bgJO7MVy0msrRZ8ELypaD1x50gTeVK4evYw3Y3V8e8Dvoj29CgxPitYmejxK9JjHRi9P3bVdmbkD6SnnovlKVUQvY6tugVd8GFdHe8qqRd6ttN/FOA9KiDrxQJap0yDlIxWdgL5om1gl3ZRBPkH/P75DjZZrfblKOIdRY7S+8RLTLwugvtIjExUSkgfbdpLSwXIXSuS4yF/qYMLICoK8VDJM/IVtRIvQe0YvxvSnuN59SN9VYPf1C5ZjSTzHmEVk7hMQmj4o70ZD53UhCLG8GO9GwKMH1S1qY/G7YsoQUZjXRZjjCdaIRNGiAjBbYV490gZRoRcuxqP57RmOUq0w8NnT/Wwi9uR97cd9+wsDeNX+wG9BFcFBKPShJDqJYnXxrF5jL4wQ8X/qQsScdEjF1vdeTZbT0y4BOMkdgpH3WXB11pbiTVNomtr9Lv5NMknghnFJRTmm4dy08JAMyN4WIUcV9McjYpVuOlK6r1zAbZ8ZOVFT2KIaYTQTbU+LMTSrMXamfuQlydjh8rpLjjMNEjrSVyFEiyAFKXFYtcaqbeCka5oTCiutpAM06TZ+LHU88q3zROfAXhSjNS3OdV54VbIawYDNfjs2scm7Kn0EeMKKbvJggvlM8usnD0U1IUnSTp719qObtNdRoIVGjQouW6jiwwKaFnqwFWTIqz+ACG8MQN8uG2GuDjx6WDnG7dIi7rc+Y/Q6rrclquLLVMsKzSfo377C+bYT3P62j1NttwBjr28ZNNhDGbTbg9Hbrq6AJ5ntENsQNNvhoG0Siu60f8NiA03YIREcnYUhmQqzsxDuTRAU3WJ/R8mRR+ZmTjuRt1vcHIyZ4fjD3maNyn8S1UCnmpbmxH9WdopxJJ/zg9GdBFLZw+rOgRadAYgamRgs6i/zefec1+aMenAX23Wfct16o8RUYVETzqRQRW8WIeA5YGFoEC0MLYGFoK1YYWhTFTISKxCyUfhBPm42xBgOZkA8ybQwkVcCqyq5Dl5AtB7ezuqp7Kk2LsUoMPRs+14CFUvVvg5wsdRskZd42SKrGKmcb5PDFLxulf/Ot1o815K9ItllfdDbJD1RDkzOaHpmEKzFnV87ZlXNSQIdZdiZjCsgO2XE7bDI4ntWqnJGv1UPW/+jRyRjxmLH9I1DfSeQ408zC0aarsVpWXSmAU7Wr+TyS22gRhS2c22hBkwtg3qNFZ47zc7/q3jCl4ahHjfFVf14rheQ4BTOJJ4E5zgKY42wBc5xFLMdZEMVMhIrELJiPapbv9hLyQaaNgaRynHlSb6EcZ4nOcRLfVstyso5SNC1TXliq/3huopZEhTKftfTqauSwiHIMqjrsSvIr7lrQS4pfmhh4qGAdqe0/dNZFQYSAqL3BlTjCUDmdRL2SJBCovIIcT1IdKsiRplrvSYQkiS9yYGZcjpikySLnIuDTFGGCXUxPskl5oRcURKsdaUyad6QxiRjwiKQjjcyThcR3UyfjiWdVZt1Em6loTTOAiaP0xFGul0sARxqjJPa0aCXKTevA0/+U4VFOtNSOND6q7pn75VrP3BWlgUUrO/tLXYtKy/tLA6Pabrg1ldH0qT0AvhkEnyTAJymgC+9ycITrgBofPf8jNqxO1rwB7YAx1DVhehuPBKyuGUnqmqDFN4Ooa0pSG48UK8wjvhs+PVdz0iO0uua46pqjJ85x1bUZUFfVGUdaXZvLTTtAB6MoZdMeUSsRUpkahpVoW68AH8N4qGe/tkGks43YeqnxC+IqkTO/s02O5UpglWgW++bPg0JGT9uMRLSqaLfK7X+iVSJPMl7/DnWeqxQtgHTmSfxp6WwpN/2/ugWnoV42NLTXW2wwzkhYtaElQE3p7xUlK0fpW8ptFyrA72M4Kz2Hav/+xy8eLeIBBWnuFVf3ZvM9YDPqAeEMSvNEr5OzshNoXdIzcreDkm816UlMiPTop2+iNujged2dy687r3fd0IMLe9eUVnX19kxfWOpfPTgw/mZvzxgZYXhINoDttDLIfHRnoQz507AhOQbs9VF/LtRrJBcKikKzJFFoYTlwyJCoyk0nuKgwKw0kz5AYBShmSA6r9CQmRHr009eYIWkhDUnBI2DtEEPSrHKWMNfGV+HiyxBMIARz71OMlI+bLhA4b+vdCekgpOMTl/Ve2tm1at0Bpg/IMW1IUWW/JPM2Y1XeZszjbWbCeNssxFuopWj9Ad0UqQFd1LyALoqwpkWUNYa2+ZqR8KFZWfa9hnr9lNyzKMAyVRXX0MvUYrnp1boFp0NHUu2P4uvrCoyF7NX1UQpoRv/QjM6g+FgTD0F5pVq6FvMsXQsYFBdJ1ChZLpLGUv8RqSIScBZ1BMXCIHlBsVGAdFCcsar0ZCZEevTTN2MoKC6QQXHRI2C6M3BQ3IIGTnoNyXG0Q4BFoWi6KBT1nZisRxSKqJfSUKOVRI3SqFYdhqSVnq4VUdJWHYZEGCTPkBgFKGZIsqZLT9Z8Q5KVdN7WmCHJ6jMkWSFDkiV/IuZf+gqsaHqYXzRfIIpiK7BWqSuwFuYKrMg0JwXpvG2xKm9bzONty4TxNivEW4GkVtZ01mTNT2plxZJaOVHWiFR9EN8Nr66z1WVffJa1Vtc55uo6PpO/No7PAbljZG2cLbe5FdAXUW6KoHPUWFEOoyiPeE3AcQlKU0JqdYosx5UTc1yCNjVuLD+VQzRIqU6JX2WH/FT8Cu23ZK0qUlnzRCprE5Eq2UKkluswyqtA7hgxyrly6/8qoLuxJISsQpUE+ZrApkGL6RrUYv6mQYvYpkFBkgbh/Y9akPRqiyIcN6FZ0ZSxJCaUsABEWZX3pYW5tRxfR1cEW1SkcuaJVM4mIrXNFiJ1iw6jPCJ5F6n13xTQt2FGOSPJKGdU7IHnk1VamNU530R/X1TSfFGd88lqDpCz6PdFJM0XQUxLwqoW3sSKr4RNLPwDtrDwn9Zh4T8v28L/iwL6iyZu9huQ6MO+2V9vsjkuJFbEd8ObgwWFWY+ie3opY1twwKA2QLRUu5a0cLWV41/VIdGPgdwxItGFcuv9Cuhvm71Pzz+K14qutDTUaUcUrsN0heuAFa5dksJNoanRTpCQPOv7pdpZ367S8v4b+wZmltacPP2MfeDJ2rah++aWOvtm9vd33kgQdUocHNGxj3nC9p63QIwyHp4Rp/546HP2s6cuxIHjwQvZ7xfj7L+3xvcbQIozhAOQpc7/oWjWDwz0k6ip/GuiTqyjCmMp04nFX1ZA/0gnaAUncg4W6Gf5F2G3IFLNKajRNqQoQE5OwjagvjRhBe95KgfBShL+VLkp8nWYMItWdgNpy3k6zb5CR5RRhXL8f/mMKiCMWkoxqqDyuxpGFaFQCEyLfvzifjB5XAQzkMp9p/HfgO8sB5NNS+DRqvOZ2E2sNaVl9Q6J/1F54Xd1Ifg3McW9mMRW00uGVKJD9hzshDF/sFt1OWqBJI+W4yFhjh+Crw1dCKxrX866DDzRpLzwhshSU+xUeeM+8TghYv5SMyK21BRLizeOwRLBCNaI74a7PESUliUhNCuSMralDJ2D5/d5iDKv+U0E9PvvFkpXEyeZV81pRCAPezVnnb4ZFkjmcg32Gm3ksyqzGMc123QIZBs9dRtXINsBgWzDo4n2cqIZdB41sWsT3emM1rwFK4RpvUMBPUWnitHeB0ydFlnXb+drasbCKHFU3XFeg9JojlaUVro3CvEdcMspJe2QOFbUFEUwFuTLrbcpoN9hqLdZFOl4kCMMFit2SZynvDBdZAs4ZLpFC5m/BRwS2wJOSLJoCZZnJ74b7nao9D1LnINurKQEugrwWx9AJWYZVWTCKDJL/COtbPrD4cQ8Ab4l+IECWjFj6NCngL4c1gggal4EEJWWuooA+aDyuCJBY3LiyatD4ATSVyFs+hb2mHwcSoXtN4RaXUmsmjLRGhopJ5YqLywwb4VlpO2l3VdYcNtLwRVWirXCupo2/0RnWmBiZgM/o8Y/ha+vxo3/lfrXVxna+H+l7v02ONt31/mr1oKrxQK8EKFyGUUdw1oONesFZ2sFPU8ldAZ2aJYwE4CJQYV+JZGS2Kjp6hw1vyQ2KlYSm5KkznhbzCiSMIkqzOqzflvMRI/+WC5Pq/PDsFZhytgskmVpM12K28zPsrSJZVnaJUlxO2tbgPhuDRs6yGdVHg/RUtzBleIOeuIOrhRPAffICOxpKZ5STmzCxEZPb9UFGA/0AHge29fWA+CjNIApQgCOpQFMFQLwMA3gCCEAs2kARwoBeIgG8A9CAIZoAEcJAbiKBnC0EIBjaADHCAF4kQZwrBCAuTSA44QAfJkGcLwQgFEawDuEAPyeBjBNCMA+GsAJQgAYrXFOFALAcGQn6ekowW6pe7LQ3C5ko4OqKaR8+och8zwdMM8tZNxLm+fp5eKLCvCPgBEMMzAu4qDH45fPKqA/Si+x4KCi2fSgotn864yb0ZVfvaW6YpXFWGxHPKsy61Pye1jKPiuWuK+eXf/Eg0jhA5wLKCALiyIMO4IsTbLkRDpal48H9XBBRQTZsMgiKe48kQGgrs0gJqLuaCEmoi7VICaqXauhectDTqR55iUn0jyLkRNVoT8G5j4YJiYspm4ucRMThk1MSJKJCdMqFwIz5RESNeyEgQ+jlh4P9w6GxnrKSeX2psSTVM2Ti/wC4Gtd9Ne6kDMTIfI1DS1ciGS4xZhzgbhkuGHJcEmSDDdKK1gL3TQdPdVxN0GTeejJPAhjlGcbZAN8Yp90iLulQ9wsG+JG2QD7pH/zdukQR2RDXC8bYK9sgIPSibhDOsTbpEO8VTbETZZntAnqssP6hrHX8oy2gemWbxefGJMOceckFMYntllfGuHr360DUX7MuMX6jOm1vt0ZtoGV2GoDFRyxvm004atHJ6NHGLKB8Oywvh/stYHGjFr/o/fLhni9dBQPSIOo/AxbnzHDNoh47LBgHbEBZ7ZPHK/xDLF+NIgNB1Ux+v21YvTu3hV79+4HWhLMYddtu2cD7y9gv+9p3M+qxUYLtWfrq/x+qzCgsbp7UbyLvb2xot7DK+gRqgS1ZUJYMa8ksfGSr0EgmaUAsSrUJWziDFSpl1wNAuY1SoixQffxz98zqlS9NXnSEjZK/oTqL5Xz8ckb9NdoKpvMXcRo1hGB5M3KCzfSuzUQeKWQ/hJ6p1Z5UoW7b+j+t4j1pnRf3Le/9nZG4QQD9fcwEM6Uk8MK4M366ZECEU7TCO+hTsZnSfRqmjbjVOrNDDHoLXWmXlFtWKuAgXTKHqoyZ8oN4z7YaLW+6Mj//Gf/Hz+5x/P5H73ae8Pvj9v33Tm7v/qps8fK0965edELt/96PsKXQ8XwwOcjtMngtInyaZMCCc1Xjz3IbiNWr5BCqg3ShBTX2/8/yLYqB5Upbgdlk7F57KmviqcKGNk89sCbx2lJm8cMr5EmvIZ2Wq/YtGDI7WVZaeK74RoQj8Ksj9FOLVYzusDEMXriGDcUSgCVSzGVj6FEK1FO3mnAYVyi33TS53qSv7RM8IA44qUYkh6BAxkKxMXYJQs5gbo9BeIy/O5e/adgFYgrKIh58qf+Ij8F4kq885P+6j0F4iq8RZH+g6sKxHkUxCL5Ezy2ghmILAWzlfyp/+iHguV8CmIb+VP/qQ4F4vspiO3kT/3HNYjvjlMwO8ifAs7La7rz8prvvLyo89JQYwqJGmXRpuiwP4zOglMQIzlFhwEyDrJZPsi8fJAt8kEW5IMsygfZKh9km3yQ7fJBgqeCM/Q53VhtYQ4FEQ9UIy8iE6EMIgGxAvufVNMFocfFMhHvJ0MsyPiweu8QC3YaI285+XPaEsfkJY5iyBoN7ryTQKrgk0RcyUpepGrJi5feRoW+5zuFvk6hrwhEp9DXKfR1Cn11Q3QKfZ1CX6fQ9/Ax2gZUdKpynarct7M07rS+U5XPaTtU0Tg1tE4NrVNDe3g1xqmhdWponRraw2t4nBpaW9XQzjK/hnaWvBra8Z2DzXVXVDUgWyE6alpnnFr7K1x8460B17snoDAY3BHwStoRiCD1By6qtI/o+5KqVP9BVVK8+lxwVyyBbMnT5bcJ8icAMcm7qwvEJYXgQlcgpcifUAUSE5elOnBpRnBZjFcaUWqSF+rQcxZzbzT/cFU/U2MGVeVSCm0/KYYAUD9NCD9imb2q1xgf0pxSPuSDBj9kERNw5nsK4DvA3UtCHpigL6OUkAimKmXCiMWhWO8zvZWVz3yr5UOtloYafhI1Sjz8JGERf6JHUU7AyK0HwIkMOXKV019T5Ogg4wV3Of2I8sInsT10r6Q9dC/52j3wZrWeT75Uyy43Irx+MfkZFhdePyy8bknCy7BfblB4AyRqFCMC1XHgJnyAniyAcDbAzdwZBQhvwhuGuFs6xM2yIW6UDbBP+jdvlw5xRDbE9bIB9koDSFi9ySeM8lGEV/iGIe6x/ldvsq58myY6t0mHuMsGDmaHdIjbLC878lE0we7ssj5E+SHZFuszRr407rWBz5JveLZanzHyP3pMOsSdk1FjhidfvANvzhqFeL10FA9Ynoo32yBq3G19Wdxu/TC01/oOa4P1+SLdLsIVfRYKvUcmoQeUvzqwwZJ/hw0s45ANZGeLDdzqiPUNjzxrq/wMT0ZTtmUyBjwmCPiwDei4Rb7OeCyvM+tsEETZII0gPaI3IWMkH+JOC4eOys+8fJA+K4M0bb0l3c9stIP4SDfhTvWJxYTHPFabEKRstgGv91rf9JgQ4t5iA6dghwyXCRDtID67bCA+ayCAjBpbouwTGIS1QJV7/Mc1Hp+bfv5nfA5pB4Dc5fSjWPHxIcB1HQByEdPbrKh6Pta/TA+AC+kieoVAFOiAGM21KdYqYIVcNCsCcFW2X1JVNkPfiVMlGmoESdQoTgar48Cq7CA9WRARjSA3LjYKEI6LDUPcLR3iZtkQN8oG2Cf9m7dLhzgiG+J62QB7pQEkzKblhRGOaqwDUb7d2WJ9xvTawDSOSYe4czIx5mAtOpKM41rrS+N+2RCvl47iAetTcdj61tsOH719MlrvrZPRCY5Y/6NNCMk224COe6z/1ZsmoXxvsL6xnZTh/M3Sv/k26/ssJ4CyqAbumIyyY4NYYqMNOL3FBvIt30zsm0zhjvIzPBk9gh0EfIcNrKMN1v0Sea389FheZ9bZYMFqg9zEVusHUSZAlJ/y3yVfB/PyQfqsDFJ6BGCan9loB/GRbsKdUgyLCY95rDYhSNlsA17vnZQh7i02cAq22E0YmZTis8sWYUoTBNKFVkECgxgXG5hWpLxZrEjZbaRIebPRImXqhuQKcoya2SaxstVjNLSvAlYor8xEzADWzEYl1cw20YyP1hivoUaORI0Szlx1HFgzm6MnyyHSnuMGakYBwoGaYYi7pUPcLBviRtkA+6R/83bpEEdkQ1wvG2CvbIA3WJ+IcCBgGeGWr39wZGEhiMM20OktlldBOCFnIR2Uz+o91vf8NvDTvTYwZXtsgON26wuPfFZvs4GP2UIdxmwi1536lypNyHRe8jVDqx/9n13vWnkue+nbdDTw/hL2+7kG8aXy0SIr5QbGId5kOTu3uoDOHkdffgMvoAWvkgqLL6C98AI6IGkB7aWlIQAuoCMkapTERqrjwCv5GFf9RRAVcAA6AC0GELopbLn2iadm66Bz7F30mW5lTNUg3ULdvRcl8VLZPO2bhAep3tKHXOSntmYMQxkrZ+cfAtDdPVqOzKVcIDFbWsDYeBG6p3V4VQZI5U7KZRiSXgHhUCCuoCBGyJ8AxCgCcSUFMUr+BCDGEIirKIgx8qf+UEKBOA+Ld8DgJMmCqPzMUjCT5E/9sYuC5XwKYo78CUDMIxDfT0HMkz8FQoW06aFC2vxQIS0SKrSQqFGaTTwF76ltoadrQYwFAbJZPkivfJAR+SCj8kHG5INskg8yKR9kTj5IpIBs0eAyNchMFeQC0PM9UL23t3ox8Cnsm6VpV+4tZ2+uuvLQ4+AEzIui55PxCuRCK3cVf/zykxmefjnzLvXsFtpsRuW1UoqCoVsJua03QQRirP5PuSnKC9uwDk0hgd1urENTiHxNg7YL8T+CF8fOFfc/btj/uCT5HzdKKyr+JlCj6KhE5+BeL6PtmQdhjIeb8TUKEN7rNQxxt3SIm2VD3CgbYJ/0b94uHeKIbIjrZQPslQ1wUDoRd0iHeJt0iLfKhrjJ8ow2QV12WN8w9lqe0TYw3fIZbQMqylfAndb3V/CWvmGIe6wf4NkgHOu1PoryOW0CjtsnocuCt/QtxJhd1oco3/BsmYyGZ8gGbnCH9XWw1wZucNT6H71fNsTrpaN4QBpE5WfY+owZtoG1tcOS2g5rhO0Tx2s8h60fjRAxSOLpNvcc82/gmCPzAo7ckfRmR1jerlGY2tRx134GBJjsRsQmQL6mrdAh5vNUing0Ox2hGt4UKTxipIiK7/t44H2fkKR9H1z8NdQIk6hRpCae+qHpwvR0YYR7YZJXskBWnnU5AB2AkwqgR2tqltaegeUGYaQSYqnKPVMeJFzOXahUQjwJTqCuhFD+HieBi9RCKIRg10LkaoWWG7QGTimjUIpEcxeL4u0licokyl8V4JcK8N5TCxcgarBYdZC5RGAS5gqCWVpXSZRihiuu8v63sHjzPxf37SeRnz/YTQ6tIP5euuQd9q6C5Skece8ahb1rRJJ3jaK10BpqxEjUKPWOcdWbUbcaQ+yFmQAFOiXExEjtFedzzPxOCTH0rJCGGk0kahQVm7hsETzrZAeAhGWiQk6FoXoZryucjCC2qP6JIqQcwMpQ/0TRmsOirInEaWI1l0q3OnnLHeDKc3vk64xLCxNi6peje45U0GrQPskjItWCSEEBYVyRpIfmWSspzUx6N2jp3UDSoeJ4p7xRAUy/06AjVgEzTE38WIUVwDWVc/+rAN9FLdc9JEGgOldWhObBIjRvOTdKi0pIXt4hVPdS3kqCKCxsnqqwTZ2LCBvC6zB28idCPQyhYQ2eUsDPREZVPAVtVkkg9+GtBdkIBTwYBcDMleABrQD52kTPpx9kAKaYngNhIQTiUkyWQgJLJwXiYgpimPwJrasQiMtkHVpTIK6QdWhNgbhS1qE1BeIqQ4fW4ghE+hhcnPwJQEywICo/6WNwCfInADOJYDkfP1inXTQTuATZ+eUgsjJKiTmlhPjKKAWvjIKSVkYpmppBcGWUJlHDTqyCuzmMY3RpxOYRIN3yQfrlg/TKBxmSDzIsH2REPsiofJAx+SCb5IOMyweZkA8yKR9kQD5Ij3yQYENYF2pLVVvVX6ptVfcNrlk5u29laXWpv7N7VLsFXbN/o8yt4zFgz/rdQAfX+Jh6jxnYeo6jW8/j684XiW4Ixhe1cTbwl5RE9/cFIguyLEB3yJQg8UKDJic7Uld2RD9LiDUelVIh8OQmVcLIdppXaI+GHg/s0LzB306LgFqhxLAs0M0uvk5gqxaXwOIpiumEruUT8I1hXPOj5eYA8ZUqWXKTel5Vxcoz4UKP6hxPg7lfr7GdBP1CHiOpgmXcIwLraF2aE6ZraIhPqW2rat6KIyuhrBgDThRfCWXhlVBc0kooS9MzDq6E8iRqFPvy1XHgCWtG55U8En0ozzbIBgifsDYMcbd0iJtlQ9woG2Cf9G/eLh3iiGyI62UD7JUN8AbrExEuO7aMcMvXP/iAkIUgDttAp7dYXgXho7fW8YEjNvCBw9Yn463WF8bt1jffdoifbGAlTFBq+Q5hj/WVelJK4zYbhCd0I/Zs7adXYJWbRabzkq8ZWjjr/2yTGrFnTxBrxJ430Ij9BLFG7FD1BpA2U9ohLmaWYzV/pJq1ab6Z2bq4eRORrGc1gW8eQl/IlZu3Hsbmx/X2ns/TyRso8V4gUaAS6AoXhFPkXqWm6z79BYRREi8wswg3z1wMMgPJcS9WAWJJ25jR5pnzCLTB9Kpw88xx8f4ALSJxeeWIcf3NM4kStIT2ma/2M4U03WymOysrPyOKnn9ZpIJfUF2C4tlZr/kV/F6RCn7nqgYHoLUuQuiizQH0BL4iIQA+aarFNDUTwToynl+uvPAvb6OevReL2yynZy9nxej07BWB6PTslQHR6dkrA6LTs9ea6uL07J0cptvp2SsFxZ3WD3VGrK/R8luGbbC+e3G8gWMlnM7eh1epJ6U0Ou2eLSqNTrtni9pGp92zFIhOu2cZKDrtnq1qbZ12z1alo23bPS8wv93zApntnvPX1r2334DUOXjBBlaNdbd7convz4Xg/TmvpP25kP4atAdrsraiNDCrs2/NYHdpDD6szRahUOMYQ0pOhuRhPwjfBYjuhaBIQ5CC+zXnwZn/U4uv+hUDxF2ANw7StmkhCszcvN6mbnVvUy8GN0QyTPWFCAahCgZIr3K1fMK4vkkixY5+gASA1NhFJdXYqU75Gqi6MdZPKoxAXCqr+5MCcbGh48vYGd9lhno1xRGIK2R1VlIgrpTVV0mBuArvqwRATCEQ6X5SKfKnVrsIYW1id2pqQrxVWsxhxMS9VRr2Vk2SvBWjYQnRtFVDjQyJGqX6GTKOA6bL0NNlEGtCgPTJB+mXDzIgH6RXPsiwfJAR+SBj8kHG5YNMyAeZlA8yJR9kVGCx1cQPgNcoATBjzXUQDFEP1sIu9voqajRIZYfPUX1xKoMG7lqII1JBT4wnzCurhj5/P9LJn3/pjQdxdV7TF2ZIsbfHvGJvD+jqfCRqlBr4SMLqT1R4TFMDZaXGTko0ylWCRs1btQyDee1djhaXKau1d2khUaNkqqU6DizGbaEna0FsdQt338soQLgY1zDE3dIhbpYNcaNsgH3Sv3m7dIgjsiGulw2wVzbAG6xPRHibwTLCLV//4IIAC0EctoFOb7G8CsL1VxbSQfms3mN9z28DP91rAxXc4TBGBorbbOAR7N1Ro0X/bma9HTWOEuuo0WKgo8ZRYh01kK0ov6T9Mr8OWWA3PuD2VGg5qbowb8k4J/uxk/0qJjBYVBkHZvv89GR+lOcOwEkFUMLJ/iD4BO4gQJ/fb7mY2eukZTqnlU/LqZxWPi0zbNzKp4VO1FVmbkD63afpfveKZWZaRDNb+RQhuk58K5+W2Wa28vELt/Lxl1suqvsC2gakxC0mp5VPsPYzhbSeaUZ12V1u+aXywiVvo14cc8SjDKcXBycJ4PTiEIHo9OKQAdHpxSEDotOLw5rq4vTimBym2+nFIQVF55S9RQO8SXnK3mnGYVHGOO0PLGomnPYHFnVaTvsDKRCd9gcyUHTaH1jV2jrtD6xKR9u2P7jA/PYHF8hsf9DyssntD7RbMMRBnKgAk92I2ETJ16iv8U/EZmgAufyb2ghpq/0Map+1w+SpooFso/qVXehN+rdR3eQXwTcct/K2JIHd6yXMPcnCPynbdH+jDmuR9Sjsw1qBmqzV20XDLb6zhnTRCJjXRYO4dVxDjTCJGqUeYZKwwHSMBgJhROPCiHT75bFmrlTW+M1jjd8wayrjbpLGGN5i1yhAeNPTMMTd0iFulg1xo2yAfdK/ebt0iCOyIa6XDbBXNsC10ok4LB3iLssLN7z8MQxxj/VthHx9kY/jJstrIJzJMQrxeukoHrA+FbfbQKdt4PflG1v5rB6ygSGTLzzbLM+YDdYXnZ02EJ1h68cSGyajaey1vkrbwR/IhyhfGrdMRmkcsoETHLE8Ge2wttxuA/M9YnkrsdH6VLTBYrV/4hareP5aPxrEfoTMc/ChOcD7S9nvh13iW6hzRLZQXcoW6i6RvY6A6dtQAfP3OgIiex0hEjVKMomnPgHRDCHCjp29k7hD2Pv23yGsjHO2oZxtKGcb6vDFFc42lDWNjnRR3GQDRsvX6C2WV0AnM+pkRp3dPIcxPBSdlLWTsnZ2gg+v4bH+TrAJtnHUKeSRgKINCnmcbShnG8rZhjqcnHa2oaxlapWfeWfhNjkWRTbIIsg3O1ud1KCj004y5nBqjHy7s8v6Hz05lzC3Wd9M2ODsjg08jB2SO1sno/WewBwZXjKjHw2yXE5i85BQj/mVbz1GK9+0PRoCtZ9N+F3ADKorV5EsoPqDhMif+lkSrdFKCzFM/gQgxhCIiymIMfInALEJgbiMgthE/gQgxhGIKyiIcfInADGBQFxJQUyQPwGISQTiKgpikvwJQEwhEOdREFPkT6hYU7kOpHgnNGtafUEDAUP56WX0NUmXi3crwD9ea71z76WlgcH+HgrdNPlRECo0AdKIGYySrwl/XQXuFexv+6Rys8X3YWznD3YDUMH7Nhg3c7m5dplxc3uW/HYtrTPkT/2IpGumChjUbAT7HD2omfwQLfY58qcB7JdKxT4tiH0aY0xWhxIIXgcXxZAxez6N2VHGMQqRm8VqgbVGsgpYQVaZiZgBLETOSipEbkZppaFGnkSNoiPxFJS9PD1dHmENAdIjH2RQPsiIfJAZ+SBD8kGG5YOMyQfZJB9kXD7IhHyQSfkgU/JBBuSDzMkHmZYP0ifgq7PA+vVLtfVr3+CalbP7VpZWl/o7u0e169KaZRllrifHgIXsReyFbDoxpl54AuvRhMA3+mtxG3zbZZpYCWjDhNN0hAmn0fOepi9MOA0GSQXQLaTPBIadftf5q9ZqMeEPm8Hs3Xg6OTe9EphRLr6q3Nf3UzqqOV0ssOigIZxZ39k5Bc4ZNH9OJ2fRSMaMWgAlHGidAQdaMyQFWoyvmYFI2xnkR+sHeYZekBTXzpDEtdNZ30nMouGaGika5crnXC+NBry8vHGitsnGES7cMY5ku2wk++Xj2CEf5BT5IKfKpuQN8nE8Qj7II+WD/AdbgDxKNr/Xy8fxaPkgm+SDPEY+yGOl294x+UgeJx3JnfKRPF42koNWdmLKz3fIBzlNPsgT5INM2QLkidq4cXptP0jz5JTqE6rv/KkkipW1Y+u5YCAL7LMQP5sZ66vTy63LFOCzeEu3Qzu+LPxOpLZsiaXPjMo6+/63YL/5n4v79pN0Hl+GMoeewlwRtl5Ek1f5WdA+I5amReVLl0Bfegr3S2mMTim3LqBXKDPk3WwxA8QWYDpxW0ScjfAlyvbaD9W3N7hJUlY/qvLMI/ZJUWWOp0F98IKfRivfdO5e0an0oFNIqlA6eyqpvvoTL0XuRt0pD1Q5w0p6FEnxZPJnsUK7J3UILY1hC5iSaiFpo3lWIIkN30ByWhWlxIcFbOdpJHBg2Jko2U5TGWKKbGeWW68lyAZNAegMoe85NvBVyo0nc8WBV9hxMRt0N3+3+yykOAFUiDPpQWeRWGkTkWeSP/UabELFTqIcATHdmTxH8I+HsGVy5CxQzjj2OsWg9xnl1rVa6T6dHF1VuB20VT9HUt7pbDTvdI6AEJxNqpWWn2fpIOHZisyqiHgmOZQm4tnl1lsUQt0MwT6HDZsUCgbsc8qtQ1oGnc1i0FbkrZPht84gB1Tf2oa8dSL81ukqdVIER79ZnA5aapX9oMLGmtYggePpROBI0zlfbt1LGB4oDojWFwc07oPjgDw3Diigu1TAoCI9iHBtEToOKJIWQz8mEZB3ESQijZKfUvWkxwp8i2L3F0KDWvmBYZ4hEK3l1jv5nqgNIQTIklZ6UBuJl9ZytZI/TYpQMcksciWzDYkLQTK0o2SI0pLZTtJBP22joGRGacKylERZKyXaBCQzwSVAgUU15WeIkoMCrUi0HLTUuVJJ1CMHrUbkgCE8rSQZKDloI+mgn7YhUA5CiIVqYchB/DEjhhEkQAtqomk5aCF/QnKQME8OClw5YDodA2axiMpBK0kH/bTVJQfUfZQJ8lOqcvB5ATlIHB45iDpywJMDMHQoAqGDqjKEDh2K5dan+aFDqxERKaK2soUSkSL5ExKRnHki0mLEZbSY6jKKArTVZSqKSFhBuZOcilsVMzIiILX8REeORVHEjKhq3CEZyRxOGSkYkZEix5piC5+cAG35ZqQAmJEcbkYK5dbf8c1I0YiI4JFnzljkmTVPRHJGPE3OVE9jfuSZQaKRrIpbFTOyCj5WsWhwmRqlZhIHUNipYVlutr/ASlsrg0hADIFvCygy8Dj4Mca0KVtuC/O1icG8DFeMsqilyWEnYbKmxe9TbBW3Zfm0VawsX3BbJfmLVoyLRR0hRQ6Q1Swuq7lyW1FHMrJgnogkuCKSMxK+trKsNOlAEBEpCqifLoObVQznHDj+MmQ4C/SwFq7hLOoznC3MBUfb8XzD2QIIYwEXxpZy2wmGwhBDC94iiddhWfBOsVUCTMeCV8Bwthlxf3g6u4CnswVD5hZeyNz2Lh2Gs2ieiESNLGaiRkSkQFIFE5FW+bmxiuFs+iPbXrybXx0AGSMFgW426AWG9mQyRkxRG4kVaoqorfF2ovfHyTrqnTS0bqsVPlGgO0RP+ag/uAoYOVLTAR+paZN0pKaDRe1aOaF22ili047vE53X3bn8uvN61w194rLeSzu7Vq07wGRdjvxqYjqCkVDsvAQpCopon7WSXrGiPG1L5DvqkgL8faYnxCPkp8PJ8lbFWNwrtBFoQGHbdccOECIA4Qn2sbaK28tt1+moIazT6zR+AfY67Vyv08EiF4/GU+hBHSRVKK8zRSgwISDxguMOtBiuFQ+PO8pta/nFcB3ImncBsjvcgRiCdsQQtPANQcKIk0yU2zbynWTKyEYlo3FRCnOSeloXpbSe6GodcWoOWStdTSLHXFvfQhaUamr0CI+QqtToaViYQpyzYGMRr7hzRhqLpMxrLJKqiYbRxiImHOfPSgOpnDuQDPCJ28FMttWkJzch0qOfvkT2vhbNPbiwd01pVVdvz/SFpf7VgwPjb/b2jBHkbfaQbPAIWL9czdaj3c3Ait03s+VM24cMqll4BiZXUdaJwCTBqyBOqCuTU+QEZu3yNcEhSspIRpEvOc1oRpGRO2nW4ZMSBmPkBLKFo5xbatrD8EquctujSjxwvxaMFzEaLjEOxcWNhgs2Gl5JRsNFE9yLrAfdolIJTOump3WT3w1zWmnR2fYwLWIhrj/BL1wGBoXBaJDAnhatcLntIe2XeKqTLdc+8YHrW3/tq6A7n6knweqTS6r0agebukRZzFByl1qbHCV/as1kE/lQ1XBV+ybRUrTaTlX7SpR8WwWMEg9YS2Oma2kM1tKQJC2NoVJLfXOTJC1ltHRtIr9bw4Y4+ayqpU/RWhrnaimj82ucv0YCtDROYs9ctT2p/RIXqIth8Emk9qT67f8J8hNAVZl3NQPRWLldad/U9gxs0Ks7YAooQqEgfNBFfhTHqu05/g4Yw8S4uKkHHCuXCkEWXs/zUw8u1mK8XnpFVB/JwuznfMwiPBHpYYCOlNte5GcgIoi9B7XLj1LKRbkJP/lTPyJ8qYjqlYoIg0DRcttvdEgFQPsIRvvxQPI1Pu1dRmgfYNGJwEpL+wD5U0Ty66M9R+7Haf9n8+T+dT7to0ZoH2FtGiJyHyF/6o9+Jcq9m0n7djeSe4uSSNdihxmnUm+SVhcI24Lk2ypgkCgye/K5cWVrDyrf8yswyC7R6zkigKICcMLL14JmKjQgpqHmJYDB0APaZ24SQRhjP70wqBG92nFdMDjieNFEuZ3afoohNGwiaQiHhxGFvqeIIoza4HF0W/l2IGnEDjAyE0nMBuvJwMeN2OCkXhvMarqRLLcfybfBSYD2YSwQHAd9tI69uFCdia44nOiKcRNdDM7HuJxPoZwP0+ublA7WM5ZWYS7rEyjrw6QaMnVjOt3PA1FA1EnBVjGBJG9i9HKKwBne5o4TSyrtYltZkJOuBhaj4VnfmPbTX3zhJrrTTVUOqpa0zom2ryq+9oVzT9vNn4hav/vFVIKRAQgIlcE0grkoRkIlKIbcG+IJlSCcUPFJSqgEaeH2IQkVwTzO3/EyGDfbgzM1JgAa0qD6iYccXu1V/PO6M7h/r1s6/wZGZ0vAbPu1inkCj/YEAB/lwQPhQLn9cgX4IsSMeRUzAG3zBNTbPF7yJyh2VHmyn0QdSlqjdt9DAqO/OFRufw8/QRMCyBnEyTkOfAk/4Aqj2qY/Ux8m8ULv0ULWJCHe9l1IzVfVcgYcFH5zD1IRX9KWQUOC6kZDIfI7wUFeNXIBcib92QMP6Mg9JOyaElJGwCO6Yw6pegOyqHGB+x3vY3uVBq1XaSAxrshp+7vUlpN4pwFZmflhpnjUTHGTP/Vy0qNLzOCZkEEuxFCBg9zqQS4jM+kjhDOTM5MzkzOTnWeqZDDJGZRY4K4FveoAvDZsfHFGhSpEotAFZFjJZC8vmqG+p4JXJzzErw5MfEbopgpK6ejhLawf6/B8+BeuLyx/6cVr/uH9d67+1gtdD245bfofZt38cfdFr8/ePLbrfAxJiE8eTCKgL0O8uw90n/plz0f+1BsSGJJyfd7dmcmZyZnJmckiM1Hu0wW6TzJFw3Kf5IXFgPv00h7WwPd4sFWays3464xWPIwsXtWBxldc8eH/e2PN5xtTv/nzwz/6yEXve++lD52z8s8PFG985MoTF4wlMSShL0MXrdCXeXTP5DMifR5dM/kkyLk+V+3M5MzkzOTMJH8myhf6QF/ok+oLfTxf6DPiMdygx9BPOVVxE30Oo+oLj1uz4F+mL5/5m4/d4e58JhX54fqjvjR397d+0PNy+eJ3PrzulBYMSQNLPNgXGlomeycsv6zfVRtSDmcmZyZnJmcmjlvzgG7NI9WteXhuzWMsvyd1IeRC3Frkzk99e3jJwh/ccsJx7uu/dX57emn04RO2HnV78R/+74UXjve8V3Lm0ivBYbt1yYRbQo7UUFLfkHI4MzkzOTO9jWeiPJQX9FDk0ofjodyAh3LTTszA9xjyUIYCAsxDueJ/X/6eB789/7r13+v7yhEfO/OKzd86d+pzH2r/4vzZvk9t/uZHjKxsXEaWlIZ8r6HVmv4kpCE5N5RgcGZyZnJmssdMxgpGfBxn4wOcjY/2Rwa+x5CzMeTbMWfT8syJF3zuT898ovzRJx8a+cmWzMst7d7T/umlf/nE6v++4uP58zcaSeK6MJmQ6kZ9ktfVPgkreEPK4czkzOTMNOEzGdsd8nD8hgfwGx7atRj4HkN+w5CbxvxG6ys7Nj9w/HMt503NxG754Ou7rvq994bvvmfxC5//zrpbXn/qi0cYWQWglfpSPaJ+6XN2h5yZnJnexjM5OylGd1KOSi75WCj21PKjF+78Z9/3X3B/uvPa6c++cuqdi86bdt+iU9Zd6eyk1OGhnByzM5Mzk/BMzq6D0V2Hqe/7xZHD7/7upZds2bfo9tsuzJx06VUzt14556zFrVdv6nxX9yPOroPoTE7m15nJmanyyMnQG83Q55/7ymfO2n3B1xY3rv3rF7+8dP43+7a/kfrd9x8Z/ta/3nNz+dGfOBn6OvyGkyV1ZnrbzORks41mswt/mvbSJ56+0PWNvl3f+kWs87fe5Mv3XXH5lNjRPVdd9eSeq37uZLNFZ3Jyl85MTub3bZr5bfj15x+/euiV2V0f/uojPxn68RvZ77yv9Wenbrz5+8tGPv5fn571JSfzW4c1d/J8zkwmz+RkSY1mSacV7u29euaPRxuvv/4vq14+/inXccdNm5n5aPC+U6/624KjXv6rkyUVncnJvjkzORnFCc0oTrv9ikvKz/xsqH3BJQ9Hf3zw4IP3vfP5gY5P/u/9n2z8eueGnlucjGIdNtbJVE3SmZzsm9HsW0Pvpy58eNUDyxpaf/WddZ+/dv2/F37709vOmrb2orvv2H3HI/8ed7JvojM5+aO31UxOpspopip48n/c/t8nfr+p8bmn1vztPXvvW/t/q77d677jy8U5g/0N5/3wLCdTVYflc3ItlprJyeoYzeq4bjpt+EPf9Bz/oGvT0/ectuT6h7/2jtzA/le/+1Toqj+v/fAJP3WyOqIzORmQCZjJyYAYzYD4/pb/Wl/u7o6XvvqV4z+77foXzvznGx89+IOnP5X484Hnv3LC1UknA1KHPXKyBTpmcrIFRrMFTa2vtP3hFye+941H3xF77g7f4IsnHTfz9XXTBnecteljcxqvfNLJFojO5KysyRmclbUuNfR/9pud96aHPa/e2nHRnTPe+GznjeddtmLhayd9Z1/n6MA9N611VtZ1WAlnFaq1tZNgFZr9xTl/u//k4Oj/LH7+/7149ayftD5+eddDr8278SOxOZF//khzwlmFis7krNi0+mPbFVu6OT3/vYGm73593rNrL3zk/tcuuPfxI4964civPrv/r97EHtdZzoqtDt11VjerrLK6CX5z+rdOum7fD25f1xGd8+jn7/t/zf9R2HrbS63vfGXeon/8YvIpZ3UjOpOzElhl7kpgSuAdH88+/q8Lij0Xz97/3MJdH1r91+dzC/76wc9lgt96wXdB2FkJ8DXKiZqNRs3Hn3Lz89/52sVTX77jn068/TO/mXHpsjXX/ikXCu3fff9FX3tk6eZJFjU7EabRCPOkrgX9z5/80WM9Iz35d/1opmfxr478w9/WXPfyEUlP356+GTPsG2EaMy4eznXKOqIxUeNiKBrTdwEipux3ze9dO0b+gSDdpaWBwf6eofsv7Ol6k2IV8anQr3HoExf2DJRWlPrvunzGqY91NAD/tv30jR/tWp//9dDdl/V39o2O1cZXfrgkTfTuf/zQTVu+/r+X8Se6e15vZ9cYIICfeouM41Ne3Heg9iBQkaRDkkEMrIBePnTvRYOr+y68loAaKE9l3LcZJL7mlOnw11T/0V9DgEI+xMP7kEPTM75kMftLjhm6+9CfR8tTA9isLuphgBQ87cMgia/2YYjkivZhWMeXRg7OK61Zc9nKzh71t4axb42Up8YP6XV392g59P2KflTed5PffI9aSj1ifPUoczyt1cFIFSQoi9FDVkD9TcogFzQoRg+KkjS5Z9FAb3+JwCNG2hnqqYucm3rqJgWAeuohJYB66iVFQMt3nw6+++kvVdbgC0C1eKAqLCz1UN3vzlSQDoWhT2JIG1cQL8oDXx088KM8CCqaP4e2Zn4xqQ9oZT1Q5UuD9kkI8VJh8iMp7SE+UfMsCtv5KhqK6Ch4Ed9a4fDUuWqzQLzTcFiM42EwUmGukYrQWhiuaSElcRG91iZ8eKyNC+OsG+NsPYrrZ30OTEQviYCitlDYo8uWqn1oZeolKstKmUN/eeo8Zfpl2LxuYzYcYYUfZyJk/YWmC5A/DaxyApayEoE6rYTXilbCj6pVuD4roUeyBTVqAVejrlXm3SBdo5ZOrEYtdTTq8GjUUotr1AaJGrWUq1GblXlvl65RiydWoxY7GnV4NGqxxTWKI9kIj30CYu+vZR8otFRLZw3t/bWsFrW0DIhymLmga9Qu6BpVeqHJOBKICU3eaERnQUUPogQ+eF535/LrzutdN/Tgwt41pVVdvT3TF5b6Vw8OjL/Z2zNGKqWHVEKP4byEx6y8hB+V8QCel6guawAq+mgqKvtB80DZRrNAbq5LuZ/IAgl5q/frUDyfcAraV576uSpG7Wdrtc+LaJ9PTAGC4trng7XPK0n7GCLgrSkSZYswoVXI3CXJLDoAJxlAjbh5armUqq/+DijHwEaGp2bPmLpfVkA/jmz0ecUNqUdPdIyaUg/XlH5f2JTSLvb9bNA/JDZ49DtuF9dxM4QjQGKFLgmg0NdbZ+gbhENfHzf0lRW/qIIJSkuCJB3005bIhFLKdRCMOb0qjiiqV+fms9dT+FDHZ943j7/5rOKzv8ZwpgMNaB2ouyYFwIBFg8vIAYEau6of+5uqICrcV7BRP/DVgFR5psXbp30SgGSqOlL7RX5InnR8EXNAkBlg+YnhVZtQHVCe+ssKd/4/fSpuoru8BQA=",
+      "debug_symbols": "vb3bjuzKca77LvNaF5VxyINfZWHBkL1kQ4AgGbK8gQ3D774rg2R+McbYlc3u6rluPD/bPeJjJRk/T0nyv3/7P3/6l//693/+81//7W//+ds//a///u1f/v7nv/zlz//+z3/527/+8R9//ttfn//X//7tMf/H6L/9k/7htzF++yf/w2/l8Tj/W87/yvlfPf9r53/9/G89/9vO//bzv2e9ctYrZ71y1itnvXLWK2e9ctYrZ71y1itnPTnryVlPznpy1pOznpz15KwnZz0568lZT896etbTs56e9fSsp2c9PevpWU/PenrWs7OenfXsrGdnPTvr2VnPznp21rOznp31/KznZz0/6/lZz896ftbzs56f9fys52e9etarZ7161qtnvXrWq2e9etarZ7161qtnvXbWa2e9dtZrZ7121mtnvXbWa2e9dtZrZ71+1utnvX7W62e9ftbrZ71+1utnvX7W62e98azX5n/L+V85/6vnf5/1SpngF9QLniWLTnjWLPUPv8lshtImPP9YHhOefywy4fnH4hP6BeOE2QIHlAvkgudSaJlgF/gF9YJnZZ2K2QoHjBPmRq86Yf7xLDg3c51LOLdz7RPGCXNLP6Bc8FwMm4q5EdssOLdam3Xm5mrzJ8f2OX9pbKAB/YJxQmyjAeWCudbmP4/NNMAu8Atm5bmosakGzMpzwWJjnRBba0C5QC7QC+yCZ+U67XObPaBd0C8YJ8zt9oBygVygF9gFV+V2VW5X5XZVblflflXuV+V+Ve5X5X5V7lflflXuV+V+Ve5X5XFVHlflcVUeV+VxVR5X5XFVHlflcVUeZ2V9PC4oF8gFeoFd4BfUC9oF/YKrcrkql6tyuSqXq3K5Kpercrkql6tyuSqXq7JcleWqLFdluSrLVVmuynJVlquyXJXlqqxXZb0q61VZr8p6Vdarsl6V9aqsV2W9Ks+9Q7UJ5QK5YFbuE+wCv6Be0C7oFzwrt/nPZw8eUC6QC2bU+QS7wC+Y//zZjDrbqs2Cs636XNTZVl0mPP+4zz+ebXVAu6BfME6YbXXAczFGmSAX6AV2wbPymIrZVge0C56Vh04YJ8y2OqBcMCvPhZ9NNNqEGdSPufSzZw6aTXNSmTSrz7Z5HslMmvH/mAsc+X9QXdQWReXpGOMkezwWlUWySBfFLkYm+aLYyeikWW/uVGy2ykllkSzSRbbIF9VFbVFftByyHLIcEo4xSRdNx9zD2eyck+pFsy+eR2CT4u/mL1JfVBe1RXNZZP7e2QsHzWY4qSyayzJ3jTb74SRb5IvCMZfe2qK+aFzkj0VlUTj6JF1ki3zRGlNfY+prTH2NaV1jWteY1rXe6lpvda23utZbXY66HHU5avyOuT7aY1FZJIvWemu2yBfVRW1RXzSutdofi8oiv9Z09Fasy+itoOitg8oiudbl0EW2yBfVa11Glx3UF42T/HGtQX+URbLoWoP+sEW+qF4UPaPPX+TRAfOgyaMDDpJFusgW+aJZT21SW9QXjYs0HHVSWSSLwjGXPrrnIF9UF7VFfdG4KLpnHsZ5dM9BskgXReU5ktEBMQaxPccviu35oHFRXSNU1wjVNUKxPcevjO35IF+0Rii25/i9sT0fNC6K7Tl+R2zPB8miNUJtjVBbI9TWCMX2HL8ytueDxkV9jVCXawxiK7Y5BrEVB8VWfFBZJIt0kS3yRXVRW7Qc43LUx2NRWSSLdJEt8kV1UVvUFy1HWY6yHGU5ynJEB8zD/RodcJAsir9rk2yRL6qL2qK+aC6LP7eSGh1wUFkki6bDbZIt8kXT4T6pLeqLwjFt0QHzyL9GB8wDrBodcJAuskW+qC6ajlom9UXjoth/HFQWySJdZIt8UV20HL4cvhx1OaLf6hyh6LeDdFE45ghFvx1UF7VFfdG4KPrtIF206rVVL3qr1kltUV80LoreOqgskkW6yBb5ouXoy9GXoy/HWI6xHGM5xnKM5RjLMZZjLMdYjnE52uOxqCySRbrIFvmiuqgt6ouWoyxHWY6yHGU5ynKU5SjLUZajLEdZDlkOWQ5ZDlkOWQ5ZDlkOWQ5ZDlkOXQ5dDl0OXQ5dDl0OXQ5dDl0OXQ5bDlsOWw5bDlsOWw5bDlsOWw5bDl8OXw5fDl8OXw5fDl8OXw5fDl+Ouhx1Oepy1OWoy1GXoy5HXY66HHU52nK05WjL0ZajLUdbjtXnbfV5W33eVp+31edt9Xlbfd5Wn7fV5231eVt93laft9XnbfV5W33eVp+31edt9Xlbfd5Wn7fV5231eVt93laf99XnffV5X33eV5/31ed99Xlffd5Xn/fV5/3o8+eRdD/6PKgsiso+yRb5olm5lUltUV80LoruPqgskkW6yBb5ouWQ5ZDlkOXQ5dDl0OXQ5dDl0OXQ5dDl0OXQ5bDlsOWw5bDlsOWw5bDlsOWw5bDl8OXw5fDl8OXw5fDl8OXw5fDl8OWoy1GXoy5HXY66HHU56nLU5ajLUZejLUdbjrYcbTnacrTlaMvRlqMtR1uOvhx9Ofpy9OXoy9GXoy9HX46+HH05xnKM5RjLMZZjLMdYjrEcYznGcozLMR6PRWWRLNJFtsgX1UVtUV+0HGU5ynKU5SjLUZajLMfq87H6fKw+H6vPx+rzsfp8rD4fq8/H6vOx+nysPh+rz8fq87H6fKw+H6vPx+rzsfp8rD4fq8/H6vOx+nysPh+rz8fq83H0uU+SRbooHG2SL6qLwjEm9UXjoujzPh3R5weFo0/SRbZoOvq81xl9flBbNB3dJo2Los8PKotkkS6yRb4oHPNXRp8f1BeNi6LP+/y90ecHySJdZIvCIZPqorZoOsZj0rgo+vygskgW6SJb5IvqorZoOfpyjOUYyzGWYyzHWI6xHGM5xnKM5Yg+n1eFn5dxH2ABBYyaGhgF4l50dPGB0cYnFjAq1EAFDXQwirW4Nx7rqQcqaKCDFWxgLOSBY2H06IkFFFBBAx2sYAOxRbOOEXf0593IeYX8iQoa6GAFG9jBsXB26IUFDFusLFfQQAcr2MAOjoX1ARYQW8VWsVVsFVvFVrFVbA1bw9awNWwNW8PWsDVsDVvD1rF1bB1bx9axdWwdW8fWsXVsA9vANrANbAPbwDawDWwD21i2mHByYQEFVNBAByvYwA5iK9gKtoKtYCvYCraCrWAr2Ao2wSbYBJtgE2yCTbAJNsEm2BSbYlNsik2xKTbFptgUm2IzbIbNsBk2w2bYDJthM2yGzbE5NrKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClHlszdVzmy5MACTls5JlxN27z9VGKyzYUOVrCBHRwLI0tOLKCA2Aa2gW1gG9jGskmkRumBs8K8C1WOGTonVrCBHRwLIx8kikU+nCiggmEbgQ5WcNrmDZcSc3cuHAsjH+YknycWUEAFp01jISMJ5s2YEtN8LhwLIwlOjLrHDLmoWwOjbgxfJMGJDlYwbPGLIwlOHAsjCU6cNovfFu1vsbzR/haLE+1vx0S9qfDjbxvYwbEw2v/EAgo4bR4DFe1/Yl+bRnT3gdHdJ7LtRHefqKCBDlawgdgqtuhujx8f3X2igAoa6GAFG9jBsbBj69g6to6tYzu6+8AKNjBsFjgWRnefGLbYuKK7T1TQQAcr2MAOjgtjktKFBRRQQQMdrGADO4itYCvYCraCrWAr2Aq2gq1gK9gEm2ATbIJNsAk2wSbYBJtgi3yY99BKTHG6MPY4PdCvswM9ziQObGAH15lETG+6sIACKmggNsNm2AybYXNsjs2xOTbH5tgcm2NzbI6tYqvYKraKrWKr2Cq2iq1iq9gatoatYWvYGraGrWFr2Bq2hq1j69g6to6tY+vYOraOrWPr2Aa2gW1gG9gGtoFtYBvYBraxbMcsrRMLKKCCBjpYwQZ2EFvBVrAVbAVbwVawFWwFW8FWsAk2wSbYBJtgE2yCTbAJNsGm2BSbYlNsio0sMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbLEyRInS5wscbIkJso9D/ADOzgWxhnKiQUUUEEDHawgNsNm2BybY3Nsjs2xOTbHFtcq5kSlEnP1LhwL42zmxGmrEiigggY6WMGwlcAOjoVxNjNnI5WYuHehgAoa6GAF28I4WanHA0sCKmiggxWMYjWwg2NhnKycWEABFTRwFmsxvnEuEhjz+S4soIAKzmJzln2JSX0XVrCBYWuBY2Gci5wYth4ooILT1kMc5yLzxtgTp23e53piAzs4Fsa5yIkFnLZ5Z6vEFMELDXSwgg3s4FgY5yInFhCbYlNsii2uVfQYvkiCEzs4bXF/KOYMXlhAARU00MEKNrCD2BybY4skGLHokQQnGuhgBRvYwbAdT+o9wKfteZIcKKCCBjpYwQZ2cCycSaBxdbG2AoYtNpimoIEORt34FW0s7A+wgFE31mZX0EAHK9jAaYvn+mKK4YkzFC4soIAKGuhgBRuIbSxbzDa8MGwaKGDYLNBAX1iiwvHAZfxtDTTQwQrGkrXADo6F8gBjyUaggAoaOG1x5TRmEV7YwA6OhfEo4onTJvHjZ89fqKCBYTueLq1gAzs4FtoDLKCAChqIzbAZNgtbjJmNhf4ACxi2HqiggQ5WsIFhi1H3sbA+wFksrivHvEGNy8YxcfDCsTCa98S5kHFdOSYPXqiggXMhNTbEuRu/sIEdZHV3Vne09Ims7s7q7qzuaOkTwxabcrT0iR2M3xYDFS19YgHjt8VARUufaKCDFWxgB8eFMbHwwgIKqKCBs25cKI8pghpXx2OO4IUOVrCBHZyLY3PUY6bghQUUMGw10EAHw9YCG9jBsTD6+MQCChi2HmiggxUMxfGMd/xtDFS0k0tgAQVU0EAHpyIuc8esvgs7OBZGO/nxXHkBBQxbDFT024kOVrCBHRwLowvj2mvM8btQQAVDEasweshjzKKHTlTQwPnP4uwgJuxd2MAOjoXRQydOWz0eqRdw2uIAOSbpaTv+toGzbosVEN0SGBP1LiyggAoa6GAFG9hBbAVbCZsFChi2eE1AtN6JvjDaKY7MY/adtuMVAgY6WMFYsh7YwbEwGufEuWRxvB7T8C5U0EC/xjem4l3YwA6OhbEDPDFsJVBABW1htF6P4Yse6jEk0UMndnAsjB46sYBhi5GMHjrRQAfDFqMTPXRiB8M28yGmz11YQAEVNNDBaRsxOrEnO7GDY2G0Xo91HD0UB/QxHe7CsTB66MQCCqiggQ5WENvANi6bPKIv5inBExvYwfjb+Z6EmAN3YQEFVNDA55LZI4rNXdKFDezgmBivwZg9dGEBZWINVNDAsIVYwjYCp20eQUtMnbtwLJyddWEBBZy2EmM2O+tCByvYwA6OhfYACyggNsNm2CxsMWbWwA6GLcbMH2ABBQxbDN/sWDteUTI79sIOjoWzYy8s4KwrUWx27IUGOhi2eDNKbWAHwxZrsz3AAoYt1nFT0EAHp01jIWdvWrwmJSbJXVhAAWfdeF1KTJIzjfGde0jT480tFWxgB8MWv3g8wAIKGLb4bbOlzWJ5Z0tbvHMlZsaZxeLMljY7/nZcGDPjLiyggAoaGLYRWBfO7rY5K0JiituFBs5/5sdrairYwA6OhdHdJxZQQAUNxCbYBFt0d7wVJqa4nRjdfWLY4rdFd5+o4CxW47dFm84LjRJz1ayGItr0RAXnQs4jG4m5ahdWsIEdHAujTU8MWyxvtOmJCho4bXMvLTFX7cIGTluLHxTNe2A074kFFFBBA8MmgRVsYAfjt8XGFc17YgHDFuMbzXuigVE3xjfatMUvjjZtsbKiTU9UcFbo8eOjTU+sYAM7OBZGm544bT1+fLTpiQoayLoYrIvBuhisi7HWhTweYAEFVNDAtS5irtqFDexg/LZ451N5gAWM32aBCsaYxRuioqVP7GDUjRdGRUufWMCoOwIVNNDBCjawg9M2D6kk5qpdWEABw1YDZ4URYxY74QOju0+MCvGLo7tPVHAu74hfHN19YgUb2MGxMLr7xLDFkkV3n6iggWGLVRgvtXrEb4vXWp0ooIIGOlgnRt14L9uJHRwL4wVt8z00EvPPLhQwbLGO42VtJzo4bSXE8da2OI6K+WdeYpOLd7cdGK9vO7GAAio4bXGQE/PPLqxgAzs4Fo4HWEABFcQ2sA1sI2wxZqOD48KYf+bzXSgS888uFFBBAx2s4LTFm+Ni/tmF0zYveUnMP7uwgAJGXQusYAM7GHXjV8QLFE8soIAKGjhtcRwVM80ubGAHx8J4veKJBRRQQQOxKTbFFq9djGO5mH92Yrx8MQ7rYv7ZhQJGhdm8MXvM41AtZo9dKKCCsWQt0MEKNjCWbASOhdHzJxZw2uLFezF77EIDHaxgA6ctDiJj9tiJ0fMnFjBs8eOj50800MEKNrCDY2H0/IkFxNaxdWzR8xZjFj1/YgM7GLaZRjF77MICCqiggWGLUY+eP7FdGJPD/HivYTRvHBXHNLALK9jAuZDzQqPENLATo3lPLOBcyHkNT2Ia2IUGOrhWd0wDu7CDa3XHNLALCyhg2GqggQ7Gb+uBs268HTAmfF1YwFm3xjJE854YdWMko3lPrGADOzgWRvOeGLYYh2jeExU00MEKNrCDY2G0/4nYHJtjc2yOzbE5Nsfm2Cq2iq1iq9gqtoqtYqvYKraKrWFr2Bq2hq1ha9gatoatYWvYOraOrWPr2Dq2jq1j69g6to5tYBvYBraBbWAb2Aa2gW1gG8sWE74uLKCAChroYAUb2EFsBVvBVrAVbAVbwVawFWwFW8Em2ARbpEac1cWErwsNDJsGVrCB0xZnSTHh68TIkhOnLc5mYsLXhQoa6GAFG9jBsTCy5ERshs2wRWrEaWpM4vIW4xD5cGIBBYwKNdBAByvYwFjeFjgWRj6cWEABFTTQwQo2EFvF1rBFKLRYsREKcd4dM7cudLCCDezgVMTJdrx77cICCqiggQ7GniGWLHr+xAIKqKCBDs5F77G6o+dP7OC4MKZ2XVhAARU00MEKNrCD2Aq2gq1gK9gKtoKtYCvYCraCTbAJNsEm2ASbYBNsgk2wCTbFptgUm2JTbIpNsSk2xabYDJthM2yGzbAZNsNm2AybYXNsjs2xOTbH5tgcm2NzbI6tYqvYKraKrWKr2Cq2iq1iq9gatoatYWvYGraGrWFr2Bq2hq1j69g6tiMqaqCBDkaxmWcxMcvjulFMzLqwgR0cF8bErAvnMsTVpJiYdaGCBoZNAyvYwLBZ4FgYPX9iAQVU0MCweWAFG9gXRqPH5aaYmOVxESpmWPmcMy0xw+pCAx2sYAP7fJN1DNTxUuvAeK31iQWUibEM8XLrEw30iTFQ8YrrExvYwbHQH2ABwxYD5Qoa6GAo5io8XgIWb/KS4zVgF1tiT1wTt8Q98YCPlzqfXBInb0nekrwleUvyluQtyVuSV5JXkleSNybhx9tv5Hjp18XxN/34G01siT1xTdwSx7LFUdbxErCT49GeeIWKHC8Cuzi8cSh2vAzsYksc3miI45VgF7fEPfGA/ZG4JJbEh9eDLbEnrolb4p54wOcLog8uiSVx8tbkrclbk7cmb03emrwteVvytuRtyXu+Cjr64nwZ9MElsSTWxJbYE9fELXFPnLwjeUfyjuQdyTuSdyTvSN6RvCN5B97jlV/Hdni89Ovk8khcEktiTRzrLiZMHC8Au7gmbomP5XkED1geiRmH43VgF2tiS+yJa+KW+PBK8ID1kbgkTuOjaXxSL4/Uy8frvi5O42NpfCyNj6XxsTQ+lsbH0vh4Gh9P4+NpfDyNj6fx8TQ+nsbH0/h4Gh9P41PT+NQ0PjWNT03j09L4tDQ+LY1PS+PT0vi0ND4tjU9L49PS+LQ0Pj2NT+rfkfp3pP4dqX9H6t+R+nek/h09jU9P4zPS+Iw0PiONz1jjo8cbvS4uiSWxJl7jo8fLvi6uiVviNT56vAbs5PJIvMZHjzeBXayJLbEnrolb4jU++igDlkfikrjzGyWNj6bx0TQ+msZH0/hoGh9N46NpfDSNj6bx0TQ+lsbH0vhYGh9L42NpfCyNj6XxsTQ+lsbH0vh4Gh9P4+NpfDyNT03jU9P41DQ+NY1PTeNT0/jUND41jU9N41PT+LQ0Pi2NT0vj09L4tDQ+LY1PS+PT0vi0ND4tjU9P49PT+PQ0Pj2Nz0jjM9L4jDQ+I43PSOMz0viMND4jjc9I4zMYn/J4JGZ8ykMSa2JL7Ilr4paY8SkPxqeUR+KS+DjOacGW2BPXxMfxVQ/uiQd8fkzl4OP4OX7vcYx9sia2xMfYanBN3OA4EyqxOHEmdOJYGGdCJ84zoRKLEmdCJypo4DwTmg/waMw0urCBHRwL6wMsoIAKGoitYqvY4lNcEqMSH9qSWMHxqa0TG9jBuWQSKzc+uXViAQVU0MCwxVDH57dObGAHx8L4DNeJBRQwzlWfh9Qqx4e1amABBVTQQAcr2MAOjoUF2/G5rR4ooIIGOljBBnZwLDw+wHUgNsEm2ASbYBNsgk2wCTbFptgUm2JTbIpNsSk2xabYDJthM2yGzbAZNsNm2AybYXNsjs2xOTbH5tgcm2NzbI6tYqvYKraKrWKr2Cq2iq1iq9gatoatYWvYGraGrWFr2Bq2hq1j69g6to6tY+vYOraOrWPr2Aa2gW1gG9gGtoFtYBvYBraxbOdH+g4soIAKGuhgBRvYQWwFG1miZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFmiZImSJUqWKFliZImRJUaWGFliZImRJUaWGFliZImRJTEdqs7nXTSmQ10oYNhaoIEOxpGjBTawg2NhZMmJBRRQQQMdxCbYBJtgU2yKTbEpNsWm2BSbYlNsis2wGTbDZtgMm2EzbIbNsBk2x+bYHJtjc2yOzbE5Nsfm2Cq2iq1iq9gqtoqtYqvYKraKrWFr2Bq2hq1ha9gatoatYWvYOraOrWPr2Dq2jq1j69g6to5tYBvYBraBbWAb2Aa2gW1gG8sWk6QuDFsNFFBBAx2sYAM7OBYeWXIgtoKtYCvYCraCrWAr2Ao2wRYdO9/8oDHpqM4H2zQmHZ0YvXliAQVU0EAHK9hAbIbNsTlLFv12YgOjwggcC6PfTpzLO5+o05h0dKGCBjpYwQZ2cNrmjG2NSUcXFlDAsGmggQ5WsIFhi58Z/XZg9JvG6ES/nTj/1mLJolsOjG45sYACKmiggxVsILaxbDG96MIopoFRzAKjmAc2MIqNwLEwmuHEAgqooIEOTpvH4kQzzFnNGrOH6py0rDF7qHosWexCPRYndqEnGuhgBRvYF8bOcs4+1pgRdKGCBjpYwbYwWm9O9dKYz1M9flu004kN7OD8bfFh7pjPc2EBBVTQQAcr2MAOYqvYKraKrWKr2Cq2iq1iq9gqtoatYWvYGraGrWFr2Bq2hq1h69g6to6tY+vYOraOrWPr2Dq2gW1gG9gGtoFtYBvYBraBbSxbzBO6sIACKmiggxVsYAexFWwFW8FWsBVsBVvBVrAVbAWbYBNsgk2wCTbBJtgEm2ATbIpNsSk2xabYFJtiU2yKTbEZNsNm2AybYTNshs2wGTaypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSzpR1SUQAMdrGADOzgWHlFxYAEFxFawFWwFW8FWsBVsgk2wCTbBJtgEm2ATbIJNsCk2xabYFJtiU2yKTbEpNsVm2AybYTNshs2wGTbDZtgMm2NzbI7NsTk2x+bYHJtjc2wVW8VWsVVsFVvFVrFVbBVbxdawNWwNW8PWsDVsDVvD1rA1bB1bx9axdWwdW8fWsXVsHVvHNrANbAPbwDawDWwD28A2sI1lG48HWEABFTTQwQo2sIPYyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkHI3eA0M8z2bG0egjsIACKmigL4yOnVNaNaadXaiggQ5WsIEdHAujY0/EVrFVbNGQcyanxmy0GhMTYjLaidGQJxZQQAUNdLCCDcTWsHVs0XotxiyarMfyRpOd2MGxMJrsxAIKqKCBDmIb2Aa2cdksZpDVOQHaYqJYnVP8LeaJXVhAARU00MEKNrCD2ASbYBNs0QwjFjKa4UQHK9jADo6FsWOd054tppZd+LS1OXHHYmLZhQY6WMEGdnAsnP12YQGxGTbDZtgsbLGyrIEdHAv9ARZQwLDFOLiBYauBFWxgB8fC+gALKGDYRqCBDlawgR0cC9sDnLYSozP7+EIFDXSwgg3s4Fg4+/hCbB1bx9ajWGypg015sCkPNuVB4wwaZ9A4g8YZNM6gccZqnJhudmEBBVRwNU7MNLuwgg3s4GqccoTCgatxyhEKB65NOSabXehgBRvYwdU4Mc3swgIKiE2wCTbBJqtx4hVbF67GiVdsXVhAARVcjVOOUDhwNU7RBnZwNU6xB1hAARVcjVPMwQo2sIOrcYo/wAKuTTnmy11ooIMVbGAHV+PEfLkLC4itYqvY6uqhmBnXSgzq0egHChgVYpM7Gv1AByvYwA6OhUejH1hAAbF1bB1bD5sHNrCDY+F4gAUUUEEDHcQ2sI1lixl3bd68sZhbd4xZzK27sIJrdGJu3YVrdGJu3YUFFFBBAx2sILaCrWCTNToxt+5CARU00MEKNpDRkbUuYm7dhdgUW3T3MZLRx3POqcV8uROjj08soIAKGuhgBWN5e2AHx8Lo4xMLKKCCBjoYthHYwA5O25xoajFf7sICCqiggQ5WsIEdxNawNWzR3XPWqsUcuCaxWqKPTxwLo49PLKCAChroYAWxdWwdW3SsxHqL3pQYvujNExvYwXFhzGu7sIACKjj/2bzxZzEVrc27fRZT0S40cC7OvPFnMRXtwrk4872cFlPRmkbdaL0Do/VOLKCA0zbf4WkxFe1CB6fNYiGj9U6ctnmLz2IqWrNYyOgLi8WJvjgwtmqPYrFVn6iggQ5WsIEdHAtjqz4RW8VWscVG67HosdGeOBbGRntiAQVU0EAHK4itYWvYYlP2GL7YaD1WbGy0Jzawg2Nh7Fvm/UKLOU9tXiewmPN0oYEOVrCBHRwLY39xYgGxFWwFW2yT8wKFxZSmE2ObPLGAAipooIN1YaT9fOeoxYylCwVU0EAHK9jADo6Fhs2wGbYI/vlmGIsJSRd2cCyM4G8xUNEM85lgi6lHFzpYwQZ2cCyMZjixgAJiq9gqtmiGFuMbzTDf9mIxs+hCARU00MEKNrCDY2HH1rH1ZYvJNW0+1GIxjabNSzIWE2bafBTFYsLMhQY6WMEGdnAsjC31xAJiE2yCLVZ3XIeJOS4nxuo+sYACKmhgFCuBY2Gs4xOjmAUKqKCBDlawgR0cC2MjOBFbw9awNWwNW8PWsDVsDVvH1rF1bB1bx9axdWwdW8fWsQ1sA9vANrANbAPbwDawDWxj2WLCzIUFFFBBAx2sYAM7iK1gK9gKtoKtYCvYCraCrWAr2ASbYBNsgk2wCTbBJtgEm2BTbIpNsSk2xabYFJtiU2yKzbAZNsNm2AybYTNshs2wGTbH5tgcm2NzbI7NsTk2x+bYKjaypJIllSypZEklSypZUsmSSpZUsqSSJZUsqWRJJUsqWVLJkkqWVLKkkiWVLKlkSSVLKllSyZJKllSypJIllSypZEklSypZUsmSSpZUsqSSJZUsqWRJJUsqWVLJkkaWNLKkkSWNLGlHlvRABys4FfOlQRaTdk6MADlxKuZLeCwm7Vyo4FTMF/ZYTM9p8xFci+k5F46FERXzJTwW03NOnB3bH/EHs9/6I5Zs9tuFAsbfxj+b/dbjclPMcbmwTiyBDewLPTBGZzbDibMZLiyggAoa6GAFG4itYmvYWvyz+PGtgR2Mfxa/uD/AAgqooIEOVrCBHcQ2sA1sA9vANrANbAPbwDawjWWLb5BdOG3zWVqLNxtdqKCBDlawgR0cC+cGfiG2gq1gK9gKtoKtYCvYCjbBJtgEm2ATbIJNsAk2CVsJHAv1ARYwbBqooIEO1oW2Dk67Gehg/K0HNrCDY6E/wAIKqKCBDmJzbI7NsVVsFVvFVrFVbBVbxVaxVWwVW8PWsDVsDVvD1rA1bA1bw9awdWwdW8fWsXVsHVvH1rF1bB3bwDawDWwD28A2sA1sA9vANpYtJopcWEABFTTQwQo2sIPYCraCrWAr2Aq2gq1gK9gKtoJNsAk2wSbYBJtgE2yCTbAJNsWm2BSbYlNsik2xKTbFptgMm2EzbIbNsBk2smSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJxZMkIrGADp2I+FmMxCebCAk7F/CirxSSYPj9vYDEJ5kIHKzgVcR08JsH0uKAdk2D6vHTt8TqmC6dtXrr2eBlTn9erPd7FdOG0zffze7yJqc8HSjym0ZwY+TCfLfGYOxPL4DF35kIF5z/zEEfPz4dPPObDdI9liJ4/UUAFDXSwgm1hdKyHODr2xArG38bPjI49cSyMjj2xgAIqaKCDFcRm2AybY3Nsjs2xOTbH5tgcm2NzbBVbxVaxVWwVW8VWsVVsFVvF1rA1bA1bw9awNWwNW8PWsDVsHVvH1rF1bB1bx9axdWwdW8c2sA1sA9vANrANbAPbwDawjWWLSTAXFlBABQ10sIIN7CC2gq1gK9gKtoKtYCvYCraCrWATbIJNsAk2wSbYBJtgE2yCTbEpNsWm2BSbYlNsZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVClghZImSJkCVKlihZomSJkiVKluiRJT2wgg2civkwncfbqi4s4Do70GKgg7Pu/ICVx7ygCzs4FkZqnFhAARU00EFsgk2wCTbFptgUm2JTbIpNsSk2xabYDJthM2yGzbAZNsNm2AybYXNsjs2xOTbH5tgcm2NzbI6tYqvYKraKrWKr2Cq2iq1iq9gatoatYWvYGraGrWFr2Bq2hq1j69g6to6tY+vYOraOrWPr2Aa2gW1gG9gGtoFtYBvYBraxbPGKqgsLKKCCBjpYwQZ2EFvBVrAVbAVbwVawkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkSVGlhhZYmSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4keW1IlHlhxYwDgcL4EGOljBBnZwLDxOYQ4soIDYBraBbWAb2Aa2sWz18QALKKCCBjpYwQZ2EFvBVrAVbAVbwVawcTulFmwFW8Em2ASbYBNsgk2wCTbBJtgEm2JTbIpNsSk2xabYFJtiU2yGzbAZNsNm2AybYTNshs2wOTbH5tgcm2NzbI7NsTk2x1axVWwVW8VWsVVs9boz6DEJ8cIOTtuceu8xCfHCAs66Lf42ouLECjawg2NhRMWJBRRQQWwdW8fWsXVsHdvANrANbAPbwDawDWwD21i2mDfY59R7j3mDF1Yw/lkP7OBcyDkZ3mMK4YUFnAs5Jw55TCG80EAHK9jADo6F0f4nFhCbYBNsgk2wCbZo//k+BY/3fp0Y7X9iAQVU0EAHK9hAbIrNsBk2w2bYDJthM2yGzbAZNsfm2BxbtH+PrSTa/0QHKxi22GCi/U8cC6P9Tyxg/LMW2MGxMPq4j8ACCqiggQ5WsIEdHAs7to6tY+vYOraOrWPr2Dq2jm1gG9gGtoFtYBvYBraBbWAby3ZMuzyxgAIqaKCDFWxgB7EVbAVbwVawFWwFW8FWsBVsBZtgE2yCTbAJNsEm2ASbYBNsik2xKTbFptgUm2JTbIpNsRk2w2bYDJthM2yGzbAZNsPm2BybY3Nsjs2xOTbH5tgcW8VWsVVsFVvFVrFVbBVbxVaxkSWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWHBM358tQ/Ji4eeJYGAEyn3LwY7bmiQpOxXxxih+zNU+sYCha4FMx5ifAPGZrnjgD5MICCqiggQ5WsIHYFJthM2yGzbAZNsNm2AybYTNsjs2xOTbH5tgcm2PzsMVq8Q6OhfUBhi1WQBVQQQOjbqzNFhViZbUCCqhgVOiBsbyxRc1QGCWWd4bChR0cC2coXFhAARU00EFsPWwS2MGxcDzAAgqooIEOVhDbwDYuW43JmGM+mlNjMuaFAipooIMVbGAHx8KCrWArYdNABQ10sIIN7OBYKA+wgNgk6lpgVKiBUaFNjJ4/sYACxvL2QAMdrGADOzgWRs+fWEABsRk2w2bYDJthi56fj/HUmO954bRJDEn0/IkKTpvEQEXPn1jBaZMYvuj5E8fC6PkTCyigggY6WEFsFVvF1rA1bA1bw9awNWwNW+SDxPBFPmhstJEPB0Y+nFhAARU00MEKNhBbxzawDWwD28A2sA1sA9vANrCNZYv5nhcWUEAFDXSwgg3sILaCrWAr2Aq2gi3yYU5arzHf88JQaOBYGKEwX95SY5LnhQIqaKCDoaiBDezgWBgBcmIBBVTQQAexRVTMmfU1pnNeWEABo+4INNDBCjawg2Gbm31M57ywgNNmsQIiKk400MEKNrCDY+FxSfFAAx2sYAM7OBa2B1hAAbE1bA1bw9awNWwNW8fWsXVsHVvH1rF1bB1bx9axDWwD28A2sA1sA9vANrANbGPZztmaBxZQQAUNdLCCDewgtoKtYCvYCraCrWAr2Aq2gq1gE2yCTbAJNsEm2ASbYBNsgk2xKTbFptgUm2JTbIpNsSk2w2bYDJthM2yGzbAZNsNm2BybY3Nsjs2xOTbH5tgcm2OLSxHzNkI9ZmueKGBcaj/+1kAHI5g0MCJoRnzMy7xwBt58AqnGvMwLI/BGoIEz8OZtjxrzMi9s4Ay8+dhRjXmZJ8bxw4kFFFBBAx0MW/yKOH44sYNjYRw/ePy2OH44UUAF7cKYVTnmm61qzKq8UEEDHaxgAzs4Fsbe/0RsBVvBVrAVbAVbwVawFWyCTbDFXnpO/awxEfJCBad4Tv2sMRHywgo2sINjYey7TyyggApiM2yGzbAZNsPm2BybY3Nsjs2xOTbH5tgcW8VWsVVsFVvFVrFVbBVbxVaxNWwNW8PWsDVsDVvD1rA1bA1bx9axdWwdW8fWsXVsHVvH1rENbAPbwDawDWwD28A2sA1sY9liIuSFBRRQQQMdrGADO4itYCvYCraCrWAr2Aq2gq1gK9gEm2ATbIJNsAk2wSbYBJtgU2yKTbEpNrLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEyBIjS4wsMbLEjiyxwAo2MBTz3NSPADmwgKEYgQoa6GAFGzh/0PzgRI3ZjydGgJxYwGlrIY4AOdHAaZtTIWrMfhzzjnmN2Y8XdnDaetSNADmxgAIqaKCDFWxgB7EpNsWm2BSbYosAmbffa8x+HD2GLwLkxA6OhREgJxZQQAUNdBCbYTNshs2xOTbH5tgcm2NzbI7NsTm2iq1iq9gqtoqtYqvYIkDmO7dqzH68cNrmK/9rzH68sIACTtuIlRUBMmJlRYCcWMEGdnAsjAA5MWyxVUeAnDhPd+bbG+ox+/HECjawg2Ph8VaIAwsooILYBraBbWAb2MayHbMfTyyggAoa6GAFG9hBbAVbwVawFWwFW8FWsBVsBVvBJtgEm2ATbIJNsAk2wSbYBJtiU2yKTbEpNsWm2BSbYlNshs2wGTbDZtgMm2EzbIbNsDk2x+bYHJtjc2yOzbE5NsdWsVVsFVvFVrHF5YW4/sDsx8rsx3rMfozrD8x+rMx+rMfsx7heHa9gvFDBCJAR+Kz7vExfgnviAc+0WFwSS2JNbIk9cU2cvD15e/KO5B3JO5J3JO9I3pG8I3kH3mMeZFyuPuZBnjgHPa7pHPMgT5yDHldvjnmQB5ZjCeMvSkksiY8ltGBL7Ilr4pa4Jx6wPBIfXg+WxJrYEh/eWH6piVvinnjAevxND+6JB2yxbHFvNqY0LpbEmtgSe+KauCXuiQfsyevJ68nryevJ68nryevJ68nryVuTtyZvTd6avDV5a/LW5K3JW5O3Jm9L3pa8LXlb8rbkbcnbkrclb0velrw9eXvy9uTtyduTtydvT96evD15e/KO5B3JO5J3JO9I3pG8I3lH8o7kHXhjEuXiklgSa2JL7Ilr4pa4J07ekrwleUvyluQtyVuStyRvSd6SvCV5JXkleSV5JXkleSV5JXkleSV5JXk1eTV5NXk1eTV5NXk1eTV5NXk1eVNe9ZRXPeVVT3nVU171lFc95VVPedVTXvWUVz3lVU951VNe9ZRXPeVVT3nVU171lFc95VVPedVTXvWUVz3lVU951VNe9ZRXPeVVT3nVU171lFc95VVPedVTXvWUVz3lVU951VNe9ZRXPeVVT3nVU171lFc95VVPedVTXvUzryy4Jm6JD9e8RNDPjDq4JD5cLVgTW+LD1YNr4pa4Jx6Lx5lRB5fEklgTW2JPfHhHcNSf76Kt48ii+a7ZOo4sOlkSa2JL7Ilr4pa4Jz6889hpHFl0ckksiTWxJfbENXFL3BMnryavJq8mryavJq8mryavJq8mryavJa8lryWvJa8lryWvJa8lryWvJa8nryevJ68nryevJ68nryevJ68nb03emrw1eWvy1uStyVuTtyZvTd6avC15W/K25G3J25K3JW9L3pa8LXlb8vbk7cnbk7cnb0/enrw9eXvy9uTtyTuSdyTvSN6RvCN5R/KO5B3JO5J3LG97PB6JS2JJrIktsSeuiVvinjh5S/KW5C3JW5K3JG9J3pK8JXlL8pbkleSV5JXkleSV5JXkleSV5JXkleTV5NXk1eTV5NXk1eTV5NXk1eTV5LXkteS15LXkteS15LXkteS15LXk9eT15PXk9eT15PXk9eT15PXk9eStyVuTtyZvTd6avDV5z7xqwS1xh8+M6sElsSTWxJbYE9fELXFPHL9xTodsjyOjTi6JJbEmtsSeuCZuiXvi5B3JO5J3JO9I3pG8I3lH8o7kHck78JbHI3FJLIk1sSX2xDVxS9wTJ29J3pK8JXlL8pbkLclbkrckb0nekrySvJK8krySvJK8krySvJK8krySvJq8mryavJq8mryavJq8mryavJq8lryWvJa8lryWvJa8lryWvJa8lryevJ68nryevJ68nryevJ68nryevDV5a/LW5K3JW5O3Jm9N3pq8NXlr8rbkbcnbkrclb0velrwteVvytuRNeVVSXpWUVyXlVUl5VVJelZRXJeVVSXlVUl6VlFcl5VVJeVVSXpWUVyXlVUl5VVJelZRXJeVVSXklKa8k5ZWkvJKUV5LySlJeScorSXklKa8k5ZWkvJKUV5LySlJeScorSXklKa8k5ZWkvJKUV5LySlJeScorSXklKa8k5ZWkvJKUV5LySlJeScorSXklKa8k5ZWkvJKUV5LySlJeScorSXklKa8k5ZWkvJKUV5LySlJeScorSXklKa8k5ZWkvJKUV5LySlJeScorSXklKa8k5ZWkvJKUV5LySlJeScorSXklKa8k5ZWkvJKUV5LySlJeScorSXklKa8k5ZWkvJKUV5LySlJeScorSXklKa8k5ZWkvJKUV5LySlJeScorSXklKa8k5ZWkvJKUV5LySlJeScorSXklKa8k5ZWkvJKUV5rySlNeacorTXmlZ15ZsCeuicM178w1PTJqTrduemTUySWxJNbEltgT18QtcU+cvJK8krySvJK8krxHFlmdfGTLyZrYEh/L2YNr4pa4Jx7wkS0nl8SSWBNb4uS15LXkteS15D2yZX61o+mRLSdL4sM7gi2xJw6vH3/fEvfEAz6y5eSSWBJrYkvsiZO3Jm9N3pq8LXlb8rbkbcnbkrclb0velrwteVvy9uTtyduTtydvT96evD15e/L25O3JO5J3JO9I3pG8I3mPbJlPIjQ9suXkI1vmNh8TjOMLwS0mGF8o4FFcgy2xJ66JW+LjR3nwgI8wObkklsSa2BJ74pq4JU7ekrySvJK8krySvJK8krySvJK8krySvJq8mryavJq8mryavJq8mryavJq8lryWvJa8lryWvJa8lryWvJa8lryevJ68nryevJ68nryevJ68nryevDV5a/LW5K3JW5O3Jm9N3pq8NXlr8rbkbcnbkrclb0velrwteVvytuRtyduTtydvT96evGfIROOfYRI9fhxg+Agei/04wDi5JI7686P1zY98ONkSx++ab4dsfuTDyS1xTzzgIx9OLokPrwZrYkvsiQ/XPPjxo8fn/OjmR4+fbIk98bHMNbgl7omPZZ47Yj96/OSSWBJrYkt8eGNsjx5vscxHj7cYz6PHW4zD0b8tfuPRvydbYk981IzfdfTpnJjd/OiRFr8lPkrssTjxUeITD2sLHvCxxZ9cEktiTWyJPfFRM1zH1txiFI6t+WRJrIktsSeOX9tjBI9d7Mk98YCPXezJJbEk1sRHzVgrR+ecPBbXo3Pmy/BaPTrnZEmsiS2xJ66JG3x0xZwR3+rRFSdr4qOmBXvimrgl7okHfOw1Ty6Jj5oeXBO3xEfNGjzgo1tOLoklsSa2xIe3BR/eHtwS98QDPvaIJ5fEh3cEa2JL7Ilr4pa4Jx7wsYc7xsTTuHkat2MPd/xGT+PmadxqGreaxq2mcatp3I493DFWxx7u+L01jVtN41bTuNU0bi2N29Hvx+9qadxaGreWxq2lcWtp3Foat5bG7ejxOY+/nRNeR/TU0eMn18QtcdQZ0SNHjx989PjJJbEk1sSHN/roOIw+uSZuiXvisbgdOXDy4bXgw+vBmtgSe+KauCU+vDV4wMce9OSSWBJrYkvsiftaF+c02Rjnc5rsySWxJGY8z2myJ3vimrgl7onTeGoazyM3TpbEmtgSe+LKutA0nkdunDzgIzdOLonTerQ0npbG09J4Hrlxckuc1qOl9ehpPR5HzPMpknZOsT151n/ebAuuiVvinnjAkScXl+AYn8iTizWxJfbENXFL3OF21Ikxb8ffx7j1wxu/sUtiTXx4W7AnrokPb4xJ74kHPB6JS2JJrIkP7wj2xDVxS9zX7zqmrpb5drF2TF292BPXxC1xTxzLX6Jm9PXFJbEkPrw9OLwiwZ64Jm6Je+IBR79fXBJLYk2cvJK8krxyeC24Jx6wPhKXxJJYEx/eGAf1xIe3BodXY2y1p//7gKPfi8ZyRr9fLIk1sSX2xDVxg6OXS5xFHNNPL/bENXFL3BMP+Ojlk0tiSZy8NXlr8sY+vcSZxjFt9OL4+zijOKaNXlwTx3LG2cUxbfTiAcdx/sUlsSTWxJbYE9fEyduTtyfv0ctxtnNM/SxxDnJM/bx4LD6mfl58LGcPlsSa2BLHcsb5wjH18+KWuCcObxy3H1NCLy6JJbEmtsSH14Jr4pa4Jz68c0yOKaEXl8SSWBNb4sMbY3X0+MktcU98eGdmHlNCLy6JJbEmtsThjeOTY0roxS1xTxzeOD45poReXBKHN44TjimhFxt89GYcPxxTKsuI33X018mW2BPXxC3xsZyx/dQBt0fiknh6Jfbdx5TKiy2xB8fvij69uCXuiQccfXpxSXx4JVgTW2JPfPzGWF9Hf80rUP2YwnhxSSyJNbEl9sQ1cUvcEydvSd6jR+ZVsH5MKyzzukc/phWWebWrH9MKL7bEnvjI6kdwS9wTD/jY5k8uiY+sLsFHVkvwkdUafGS1BdfEDT62bYvfdWzbJ0tiTWyJPXFN3BLH77IYqzheLRbj4MfYxm/xYzzjt7gk1sSW2BPXxC1xTzzgY993cvLW5K3JW5O3Jm9N3pq8NXlr8rbkbcnbkrclb0velrwteY99qMd6P/ahBx/7RI9t4Ogpj3Xd07L1tGwjLdtIyzbSso20bCMt20jLNtKyjTQmI3kH3vJ4JC6JJbEmtsSeuCZuiXvi5C3JW5K3JO+x34zxPKb9XTzW2Jaz3y04LZukZZO0bJKWTdKySVo2Tcumadk0LZumMdHk1eTV5NXk1eTV5LXkteS15LXkteS15LXkteQ1ts9jit7JZ1/HeJ49G+OZerakni2pZ0vq2ZJ6tqSeLalnS+rZknq2pJ4tqWdL6tmSerakni2pZ0vq2ZJ6tqSeLS15W/K25O3J25P3OO49xq2n7fPs6xjDs2djDFPPltSzJfVsST1bUs+W1LMl9ayknpXUs5J6VlLPSupZST0rqWcl9ayknpXUs5J6VlLPSupZKclbkvc41o2xknM/HnzuxzXY17hJ6llJPSupZyX1rKSeldSzknpWUs9K6llJPSupZyX1rKSeldSzknpWUs9K6llJPSupZyX1rKSeFWOfIqlnxdmniLNPkbSfldSzknpWUs9K6llJPSupZyX1rKSeldSzknpWUs9K6llJPSupZyX1rKSeldSzknpWUs9K2s9KI8eOKWLn+HRyTNJ+VtJ+VtJ+VtJ+VlLPSupZST0rqWcl9ayknpXUs5p6VlPPaupZTT2rqWc19aymntXUs/pgTPTBmGhhTI5pW8eYaEnLJmnZJC2bpGWTtGxpP6tpP6upZzX1rKae1dSzmnpWU89q6llNPaupZzX1rKaeVaV3VNOYGL2jRu+opWWztGyeli0dG2s6NtZ0bKzp2FjTsbGmY2NNx8aaelZTz2rqWU09q6lnNfWspp7VSsZqJWO1kbHayFhN/aWpvzTtEzXtEzXtEzXtE7WnZetp2Xpatp7GpCdvT950bKypZzX1rKae1cG+WIcmZl9sD/bFlvrLUn9Z6i9L/WWpvyztEy3tEy3tEy3tEy3tEy3tEy3tE60kb0nekryFbdgKfW1CX5vQ15b6y1J/WeovS/1lqb8s9Zel/rLUX5b2iZb2iZb2iZb2iZb2iZb2iWasLzNLzLG9Ocf2lvrLUn9Z6i9L/WWpvyz1l6X+stRflvrLUn9Z6i9L+0RL+0SrZI7VtL4amWONzLHUX5b6y1J/WeovS/1lqb8s9Zel/rLUX5b6y1J/WeovO/srlvnsr4PrWn4/918WzLJ52n956i9P/eWpvzz1l6f+8tRfnvrLU3956i8v9L6n80Qv9L4Lve9p/+Vp/+Vp/+Vp/+Vp/+Vp/+Wpvzz1l6f+8tRfrmnZ1BKznbuxnXs6PvR0fOjp+NDTOZ2n/Zen/Zen/Zen/Zen/Zd7WjZPy+Zp2WpattQLnnrBUy94Oj70dHzo6fjQ0/Ghp+NDb2mdtrRsLa3TntZp6gVPveCpFzz1gqde8NQLnnrBUy946gVPvVBTL9TUCzX1Qk29UFMv1NQLNfVCfZAhNR3L1UKG1EKG1MLy13QsV9OxXE3HcjUdy1VhbKtYYtZ7VdZ7TfuFmvYLNe0Xatov1HTcVZV9VjX2WdXYZ9W03da03da03VZn26hpu63OtlEr20ZNGV7TdlvTMVJNx0g1HSPVdIxU0zFSTdf6ajoHqelaX03X+mrPf5PGYTAOx3ySogcf9yUt2BPXxC1xTxz157dV+jFvpMwp4/2YN3KxJfbENXFL3BMP+NjG5idS+jGf5GJJrIktsSeuiVvinnjAmryavEfezu+p9GM+ycWW2BPXxC1xTzzg8/7ywSVx8p73lEewJ66JW+KeeMDH9n9ySSyJNXHyevJ68h7HRfO7MP2cW3LygI/jopNLYkmsiS2xJ66J07ZU07ZU07Z07AtOLonTNtzSNnz043xUph+vaXteHZ18HDudfCx/9NSxvzhZEx/LH71z7C9Orolb4p54wMf+4uTkHck7kvfo/ZM9cU3cEvfEY/HxOraLZY3JOY8lxuGcr3JyS3/fE6eahd9yzlc5WRJrYkvsiWvi5C3JW5JX0m+RklgSa2JL7Ilr4s6YHBlyjMORFSenmppqaqqp6bdoS9wTsz2cc1FOTmNoaQwteS15LXkt/RZLY2hpDC2Noacx9DSGnsbQk8uTy5PLk+vMiho84DMrDi6JJbEmtsSH14Nr4pa4Jx7wkRUnl8RPV51vD+sx7eVCByvYJvbADo6FM0guLBNHoIAKGuhgBRvYwbFwPEBsA9vANrANbAPbwDawjWWLSTIXFnDWnS846zGzpc73j/WY2HJhAQWcSzYnh/WY1HKhgxVsYAfDNje1mM5yYQEFVNBAB8Om//M/f/jtL3/71z/+489/++s//+Pvf/rTb//03+v/8J+//dP/+u/f/uOPf//TX//x2z/99b/+8pc//Pb//PEv/xV/9J//8ce/xn//8ce/P/+/z/H401//z/O/z4L/9ue//GnS//yBf/14/U9nUpz/em6Rq8DzZusPJcrrEjZntkUFs7YKtB//vbz+9+rX8j+v5rEAbdz+DfFt2ajwXHvt5W+wzTLonA5xLMTzetgqMcbdCiU+kRAVnuhUaD9UqK8r1LUmak3j0MfdAm1OMzpWZamrwPNS7g8F+uY31Pmgy/EbnkfXL0uM1yUknmWJEs97bY+XJcpmfT5vrl1D+byHNl7W2KyN+WbpazCfx7uMptQfF2OzXToltLxcH7uFaGvLnu8Tfr0Quw2zzrm3x4Y5I2O1l/9Ywjdr1eZ0mmOtPq/bvSyxXQoraymsviqxqTCfEjkrzMn/r8dis3nW+KbtMZ4jZ5XrjzU22+fzxtVq9Ed9+Ut2i9Hi4cbjp5RSXi6GlN93MWRtGfMNKq8XQzebRiuyGj4lp/+4jctmxcY3lI/s7Tm96/0Kq8/Ko/jrEnWXGEZiOIth5ccSbTMUD1lD8fDyejE2q+R5xe+q8bywN9JiyI81Nhvo/Hz2tZE/UoD+XEN3AWrXlvG8B06Fx/jahjFebhj77VP72j79dZtsa/g6tpiPCL6sobYbDLsGVJ6X918G+XY5Kr+lphX7y3LU92P47mI0+dqQ1vEgiDdDOt484rPHu4d825/Rqq6fkQ+XfvoZu11SkzWaz2tlL3dJpm/vns3e3i72S/Hu7nlO/LmOHa1sxqLtjqH74Bg6H3P1H2v0t3dINt7dIW0r3NsheXl7h+Ty/g7J9f0dktv7OyT3d3dItzeM1zuk29un+Ovtc1tDjRrtZQ0fb/+UXQltzQjQ9vJks7x/rlfl/ZO9qt9wsrdbK22dOuvzau3LtVJ9d/Lc19nz41HTDuXHlq317fSq7d302la4l151vJ1e7fF+erXyfno1eT+9mr6bXrc3jNctv9s+e3zX4dw+fzicLvdr+LgWY96xflmjtVvXueTxsNfXqXbL0fpajuednNfL8f6J/C42ntvANaTP45XXO4Re3j962y7GOkGx0l4fN/X3T+T72yfy/f0T+f7+iXz/hhP5/g0n8v0bTuTH2yfy/f0T+dtt0uqXjpssHgs+asjm3GC8fyl0vH8pdPyul0LnBKEr/drj9WXhsd1A11n8c1T6ywQdu+PQso5ly3NsXyb5bjnmt9+v5bDxejnK4/2Lodvl8LIu1tdH2yyHvr8c262j1rV1pJb9VIlOiWEvrxM9tjG67og9E1W+WGNtps8D8/66xu6s7Xih3bGNzde1vEzBeM3J6zLilJF05euXMrv7Sr7yw9P18p/TNF6O8l4g312KdFvplxL78dDHSvVnF/fNeOyCaKzreM+b8HlQf7r3u7+7JKOtTNWU7b8uy25rq2uPKzVtsfUzS+KNJfHhmyXZbbPSdMXiY7ed3F6WWnbLsi3DFd/J46tlOv1jverXyzhlhny5jCplfLPF7G4bFe1rhHXo19bT3YO0sr37dC8UtiXWiZlsf8p2u+1pu9WvbrfV03Zb7auruD3WsYU9b4O/LqPlG9aOyttrZ1vi5trZDyyrx9puT6i77bW1uqYUpGWpnyjRZR2ydRtfK9HWjfjeXpbY78JsXbObc+PKZjx2d6L0Ohj/scRnDlGee1AOUaS+XhDbXwcgYdvrvcYHR36cWozXR1y7W0Fpb2wq8vJEq+xuSUlbu0Bpvby8+2v+9hWJmGr53iWJfYl71yTK7t7DzYsSZXdP6e5ViXjFzbuXJYp/R6j6+6F6ewPZTDHYb6hrVtFzQ9Wv1ei9r3R/PF7W8N3UPV83Qqqnc7bP1fBxp8b+t6wb68991ua3vH3/dF/ibtPd/imvN4/d/amxTrWGbNp2F6eq69qset3E6bbIilNzfX3xq+yumd+85Ve2tyFu3vMru/tLt2d41v7+Xb/9uPbVMf4om5Wzu1F1bxvZVbi7Zna3qW6vme19qrtrptnvvGb8YY+1ZnZt0+rv2b0u60TTn1ezNoux2VRVypo2IOqvDnb3JdbVWtVHf1WiP25ehNeXh9zb0SDL/JlIr0ej73b8dR1fSj5GrfdLPI/X1o7/2berhNj4RBFfVzifByryxSImgyK6KbI7dX+0dWb35FG/tG7qWOum62OzbvpuG1nT8jT/mJ8nGI63L8Ntl2K1vqVDw1+WYuxOph6c5s6Pb7w8z90X6ekwZKQreZ/5MWs5/LEZ0t1Z3fxWSufH+Mve/aDIzRGxbxiR7Zba6zr31zwl9zNHRNVWyzzv3Dy+WKSvCHheW7EvFmmPay9TR3m9i5DdDax74bwtcfMgQnb3r+4eRMjD3j+IkIf/zgcRdXChavhu1exmA8wv0a1BMbGXK2f74MmaOTi/s7ZZku2cvbqOI37YXH+6RSm7m0elrhPv55H+yxvYUrbP662jItNHeXnbR3YPRynzr5+/RjZFthusEkjVyuuLEbJ/OonZ5PmCtX5mSeI563NJStPNkuwOWeu6tjJqeX0p8YNNVltZm6ym62+fiOlW1xSr+dGW15vs9mGpsu6qa0kHWT8/HiSPt68Dyu5pqZvPGG1L3HzISPTt64CyvWt19zEj8fevA8rultPd64Cye2rq5pNGtzeQ19cBP9hQmZRTqn6thvt1YPPcTdUv1lhT+b5eo6U4q+OLNWxNiM5HnD/X2D03dfOa5gc1bl3T3P+WLmvaV7f2fg0vX6tR1xG49t147O4C9La29WGb7t8tiJV18GwlzXL45aHN8v7K3dd4f+VaWY/0mvjj9XLsIlV8XQqQFCCfG1RZXfc8gd0M6iZRbU2ysLZZt9snGR7rVvNz57s5CrHt5aa1ICq1b4rsrgToOg1weX1QtR2PdTri9ng9Hh8dvks6fH+8Onzf3ay6eXq2Oz78lsNdr+u3eN1MlJLto1T31sv+JKJzSpQehPrMfebq69JZrZtJweK7uwDrCCTPCTb5zCWNoVwXGda/dl1kOAdlo77cQurb1wA+Wg7R9GPG1y573f0x9v6PKe//mP0zL+u8e35V4/Up8/Z+1b3JDFLffyxV6tv3Vfclbp7EtPefTJX2DY+mSvuGZ1OlfcPDqdLefjr1/gayOYnZb6i3JjPsa9ybzCC7J6vuHhvua9w7Ntz/lluTGaTL2023LXH39SS3f8rrzaP7m7dDt2mqq0K3/Ljbz2m6e7rqeeV+TUD0dDf0efb8U5FNtwxdF92HprtMvxbZheFjvbJgPG9mvC6ye8BKjcM6BlXqT+t2t6N73jLjjmgakU8V0cGVtryv/LXIbj5ETFM4T6byQzD9Mwuyrj0+8fWCbDc0cza0Lq83tFHfv9I92jdc6d49WnT70H/3rNXdQ399PN4+9N+P6q1D//1DxOv2/Xzl+su1u39hya3HpPYlbj0mpfvbVLcek/qgxq3HpHR7lvsoygFVqePlRqa721R3n+fR7cTs28/z6PYdfrcmEnywJHef59Hdnaq7z/N8Yll2z/N8UObu8zwflLn7PM+HZe49z/NRmZvP8+j2+ZWbz/Nsl+V2C+zuSNx+BZu8/aTgvsStx062P+UT3by7a3Wzm/dLcrubd3et7j7l9EGRm5Fw/wdtI2Ff5nYk7MvcjoSPytyMhA/K3I0E1e+IhP3OlSrPdn68DgXdvzrg1gM+Hxyz3HnAR3X7rqNbE4W2NVpb57TPS2yv34770YZ781HBD8rcfVRQ7RuealF7+6mWfYnvyOy7jwqqvf2o4L7ErUcFPyhx51HBjw6a7m5o+zK3NzT/joMDf//gwN8/OPhgYO9uaNsXBN7b0LYl7m1o+xK3nkndXZWSwRW2kd8Ad//tqkPXgdLzypa+rKE+3j8t3de4d1q6fUXg7bd36O4prPtv79DdiwLvvb1Dq73ddjeXYvP2jg/G4+7bO3R3Tfn2qc7uvsXtNNu+LvDmsPZvOU9p5e3zlP2S3D5P2d3dun2KcX9ZtqcY+zK3TzH2ZW6fYnxU5uYpxgdl7p5i7G5U3T7F2DbAvX3xB+vo7kHOvsztg5zdW+Nux0J/P223Jb5lYO8e5Gzve907yNmWuHeQsy9x62h6v/e5++IN3d0nuvXijQ+OLu6+eEN3N73unpfvj9rWcc7Q5q+P2nbvFrw5z0TH+y8Q1vH2G4T3Je7d8tbx/juE7fENLxG2xze8RTgmGr4biPZ4+z3C9zeQsdlA/O15Jvsa9+aZ2O7C3M15Jh/UuDXP5IPfcmueiZXHu023L3G36W7/lNdve93NUr332P0uTX19V2P45tMc2xpVeZCq+hdrrO1r1PH6aylWdpdb7z0CZeUbPmpR3v+qRXl/9qDJ+7MHTb5h9qDJN8weNPmG2YMm73/borw/e/CDDfXWI1D7Gvcegfqgxq1HoPY17j0C9UGNW49A2e69f3f3UPsat/ZQ+99y7xGo+zVePwK1r3HvESjb3Xu6+wjUdkFuPgJlOr5h5Y7fd+XefATKbDvH5d4jUPsFufcIlO2exbr3CJTt7hjdfQTKdo8e3X0EynYPY92bb7cfj1uPQG33DQ++gfdk2xzH+Nuvudovh3P84JuzZNt+1eretE7z7TzXNfXvh48J/Hzl23b3iwpPybi+Xrnb5bg5vdT87oSWUjZLUrc7zFtzVG33NNbdOarbIvdfpGB1t7n6WJO7c7B+clnuvl7CdlfM7r1eYl8iHRONTQn7XUvczLO6fyvjVaLXzbb6DfOprX7Htrq7bH93SMf7QzreHtL6ew/pJzp390TW7c6t39O5uzcI3uzcbYl728j27X/vl7i5mW1L3Ozc7XtMCy9D3W1m23fu3d7fbY8ibj3GsN9Qb76r534R3bTM7g2Ct8Nsd2vo5lbW3z/e7e39MHt8w3q5XWS3XoZ8w3rZ3Z+6uV52JW6ul22JW+tl/znvdd7epL/+brSN95/FtvEdnwj+hm8Ef8NHgh/f8JXgx3d8JvjxHd8JfnzHh4If719NHd9wNXW8/yz2vsa9e2T+eP8i1Qc17l2kGu8/i+3l7Wex9yVu3sK4/1Nef365vPss9j5N1y9pKq/nmvrugt3Naym+WxC3NTXMbdf55RuebnV5++nWDwbk3ottditGnRXjmxuP738EsLz/EUCX959u/aDGrWnELt/ydGvcOH5V5u5813gx0ctluT3P1PXtp1s/WJK780xdv+Hp1k8sy26e6Qdl7s4z/aDM3XmmH5a5N8/0ozI355m6fsPTrdtlud0C9g0PsLi9/QDLvsStuZ3bn/KJbra3n279YElud7N9w9OtHxS5GQn3f9A2Euxbnm79oMztSPiozM1IsG95utVdvyMSvuXpVvdveLq1vP/5Ovf9HOl1vtP99bext0XaY90Nb480S/rXIrubA7c++/JBiTufffH33yq4H9KxHmtru4d9verby1G3r9C89eCy7949c/cLB163H2y594UD377R6+YXDvYbqqyp+M/La32zasb2VHJt7d7r14rc/SaPt+1M6/V8Q5o+Itbvl6jrnZFVxusS259y88tAH4zHvS8D+fa9gje/DPTBNnJz9W6HdQVirfrFNWO879W+WmJlu9XXJfb7B74+M+omzPr731rZ13g81vTCfBT9S43tM4JcztL0NOkvGdK/4Xst3r/hey0fHevdfITtgzJ3H2Hz/g1Ptnp/+8nWfYnvOM25+wib725n3XuEbV/i1iNsH5S48wjbR9cZ7m5o8i0vhPDd9eTbG9runsXNDW1b4t6GJt/yQoi6u611b0Pbl7i1oX1Q4s6GtrvI9+AeUHnkfU27XaI86irxw4ejbpcoQ1Y0l3xB+qcS9dHe3lvta9zba9btG0duHr/X7asFb+7xainv7/G2K7evEqqvt49abt7bT9kh9yuorkN3tfQFuzF+qrE9Ur3xIv7d10nH+kxiKS+P7O4VkC8VuHfu8Xj3zOPx7jH2490j7Me7x9fbzlp3zp/nK+lcQ396y/T2C1etr+f/npxeb/I8yP1EmV7K+gpaL+lu3q9ldt8gufOc+ge/Z6xzjtIfZWwWZLd7vvXh3G2Juyfp+yI3T48/WJJ7p8d1d+vq7unxB5vJYz3n9eRaXq+d3Yeq7l3t+6DEnat9Veu7V9k+7D6nbbxtxmM3Z9VX3zxviPvLxtk9HHWv9bZLYSvV1R+va+xuM5XuHOU/r9VvBmT7Xr/Cjrrkt7x7/WqR8Q1FzL5axMsqkqaO/FpkdyE1JredBy95jvbj54HdHVYOPos6etkU2Z/7rAOYYfrVIhwSjjwV5nNFjCWpj+8o4psiu7XDFBJp+e0qPxfZ3aPytq4+Pi+H2ddWsdV2RZK1ol8s8ihXFjz/3fjimPja2MTHbkx2S9If64HNXsYXB5b3Cng+iflUkecB3zrFNXt8w8+R3Sq+nSebUNo9JXVzOmyt22+0ru/ePk+t2mZBNjvR5uP6NS3PZys/ndjtblU9z8UKp2XpoPHn5ajb03bltN1e19jdIC6Pdd7+5B8eDv7EsGpjWNtup3N/V+z19a64Pd4/Nmnvvr5qvxQ3j022LwnslY+T95omEvw6ILtjPp5zKlbS+daon1qWsY7pe7448+uybD8wolzieR4evjyob7ubq7cm5HywHNaZHGvj5SH9dkxGWR8qerJtNti+u4QXLxY/7/Okua1znuuPRd5+teUHy7G+D1S0b5ZjPyayLs0+uW9Oh3e3rVzXRbxnDz82RXx3TLAuND/TdrPF7p6+Kr3zQoq0JOPnlbN7YdrND1rV7Vexbn7QqvbtM613PmhVx35y660PWm2L3P2gVR3bD7fe+qDVBwty84NW2w2tGBva2Fxj2L2c6+6Gtnv/2+0Nbft6v7sb2vazWDc3tPEdG9p4f0Nrj/ING9r4vTc07geYbK5VtN2DWC7rztfzdt/Lw9f22H49gIl4Le/42md+zDpEsjwR9dcf077hx/Tf+cfoOjl5on9xh8VhtOXD6M/tOm3d/Xa312HUdk9S2Vg3C573XvSrRdY95yd+sYjzAOMTv1xkPdT1RNkcu24PbXS9Q23y+GoZS0eNVvSrZXydmE/+8tLUQpnaXx/DNnn7/tq2xL07bNsf87xBZeuZyud20zc/ZjvzmjcIFZXHqykK7f1vYn2wHMIrkJ/3Hexlkd0hQVnnkKOku6/1M8MqXL55qDw2w/rBq6quX/MY+RHP8tVlMd0Egr5/et50d8r1MOcGlY1N62zvcz2PKHiI7rE5Y/qgTFlPnT55c0O0vX+nq71/p6u9f6frM+Oh/vVh5apj2e1PPyizThGevLm21XZT/W6unX2JW2vH5PdeO3k8av362tFUpn1tJ/hjqLhsWnB3+8B4vtjaQ16Gyvalgg/n+fNHfch3/KKqsvlF27e098Hlcn35i3avFrx1LfWDpbh14b/5djbBYFznSzFeD8j2vsy945ztXZlbxzn7H5N2pc8OKJvjnO27BUdRS9cv26tO3hfhGfDJ/e0jjCK2ORncPlF179J/q29vrtuluHlssb3X9dyBd+YClM1uZ3df5vsPucrzTG6zLP4NK+fd6Vr7pbi7cvr+biYrx3enx9s3+5V1R2UeEqTr7V8tIo8vFmmPNBdgU6TJ2+tmn/NrWOWHu8Sf+S3KulHdjOr20ax7J2/75ViXYURr++KP+WFCwlc3kbru/0ltm2Ft787W2s6GXgVEf4iQnzaQ3U0ub+tNIT7q6wmou+Uw1qz/cFLw83Lo71zk5qT7trtgePcRsda/4YHX1r/hgdf9G36UzrXNqG5f3Xbj1UvbjUxlNe48V3q9GLvvX91bjF0F596/5xcjPC8E/VRE39/bje1729ZVz/r44fqgfKIId1Ce1xvLpkh9++x3X+LW2e/uztbNs9+b67b+eJXyx9Hoj/cvYfXtQ1B8GOB5MrJbkM2Ov5V1r+CJuyKbLfXmnKr+2L4D+9acqv7Yfl7g1pyq/tidEt2dU/XBsA7eqPnD7bHPrBtRivxwoPq5ImvdSG9fLrK2Ehm+SYCbjaNFXi9JkbcvavSibx4OfbAUty5q9N1zWVXXzNnnUerYDEf9nYvcffak716ud+8Jpw9K3HnGaf9Tbj4B88F43HsCpss3PAGzP2Ye6wSxlvL6cKbvbmZ9S5GbB7xd6vsHvF3a+we8ffvA1s0D3v2xJr2n2l+fFXV999st+8XgjrSa2ddOzp53j7mYmJ5K+Hn16ruxuv8pLmnikW1GdJOrfb2pavxwdvf4qcT2wwBr81DLX8OxzxQZ61FJzc+t/Fqkv3vU/EGJO0fNfXfb6d5R83Y07LHu9dgjHzX/PBq7e1c3R2Nf4t5o2O87GmW9VPfHya2/jEZ9fzTq+6Px/hnVtu3Hg2l++TXnn0kwk/ViXtNH/WIRXslt+fsEn7vQxfMyXtoXf46PdcTtwzcXMnbf47i70/ZvuErV/RuuUnX/hqtU+3GliEvX17sY/12vU9lw3qrww1nZT4tR371Ota1wdwOp3/Cmq16/4U1XvX7Dm662RzFtXcroKQB+XY7tq8rvvQmlb+9T3R6R8Tu3jCmf5PO6OX/Yvj+wNi6aUUJ+OqPa3aPSnqal//Dw+08niO3tc//9YgwearbdYuyuVNV1sSt9jKt9YjSMZ7FM89zpXxajvX0IsV0OW28kfh41j81y7G5QeU373S8WuX0Zo7/9KsQPSty6jNG+4T2XH4zHzcsY/Rvec7lt/t75tEf3TfeX7XXZNdVZfnh78M+/pv/ORe7uNHdPLt3eaY7yDbuIId+w09ytHL7Kk99G8Muo7m4y3TuY2W5lawJCb4/NQuzOy9bXdCy9srd9YjPlRWq9bbav7TeOOm+9GWmOdPt5re56/+bs8/HYXptanyR4rp1XEyn2v2XoyqD8VYOffsvYfwWr8Z75R/7ee/1Ukcanll+/ufCDIj19pGg87CtDIsSHPFKe/jIkuyupj8LngR6l5gDxT5VJyVzG+HqZtbE9JD0U88kyoqwiqa8fXhy7VwgWbgI+kVWkP31I6oMi64G/kmf1/1Lkgx9U0w9qXx5eXZdYnqzy5TJpZWu6Yfzr8PrvXkbKOpiXH7bfX9bS/oSPeejpOu3niigvV7XH6yJ9N4PG6QCXfBTsP+7Axu4hqpvf/BqyvQx277vlY3fv6u43h4fo71zk/oeLx+5TV3e/O/rBstz9cPHY3cC69+Hi7ZLc/SbbkLc/b/3BBnvrm2wfxRIvfH7kyZa/5Im+fWvggxJ3LoYPffvWwEfjYey/1Osm7beHKiPtTIf1rx3vjDwFvb78QdrfH5P9coimH/Oluwz2WEeRJvb62v7Yv+YoveUoT2KV/lOR7RUkttWeH622cr+ItQcvXstPdf5S5O0HBvfL0df0c+vp/b6/Lkf9fZeDd0XYyDNhflmO/rsuhz/y647t9XLsHrt6XvO5Vq7/8Kz6Z4rcvR62L3LzStQHS3LvSlS8pPHdK1H71su3GvOjV78M7LsPsoz9J/Z4LtV/+IpV/0SRumZMSsvTA38u4uN3LnLzitjY3Yq6e0VsbJ+8unlFbOxfM3jvith+5ZTG1wHyRPSfx7W++yni4dvrL5yBjvby+9Bjezvr3kfZx+5u1r3vQ+9L3Ps+9Ni92O/mvM2xvRB986PsY3fX5O5H2cfuXtbdr5OM3QsG732d5P4G8vqj7NsNVZim/FxJLz/KPnZ3s25+DH2/HKXy5FfZLMf+btY6MttsH7vX+d0+jd9/C+vmGXiX37nIJ07jd29Hun0av1+W26fxuwevbp7Gb0use436QwT8XKK/fRK/3VrXfWRPrxn+ZWvdNg0zBJ6X0L7YePmQKMXqzzW27xS813jbh64e62qglrLZTsf2tIr3nkuXrxZZv+ZZr2+K1Le3j+2g3to+9lNhVdZ0h/xGwc/Np1XmXfzw4q2fijwv+r/7hoAP5m4OXuNXfbcc8v4Z3r7K3VO8D6rcPMf7aFnuneQ9q9T3z/K2U8DLo/INuR9ev/D4RBHj/RqeP+Cqv6zn8XtXuXmC9Tww/oYzrPIo33CKVR7lG86xPljNxn2xH16w/fPYlndPsp6rp3/D6nlsj4DZAf74no7HZ6o4n/tyrV+soqWzA/vhlXGfqiLrJEd/fOHpp6o8+Aaa1LKpsrulVZrxOvZm8urW/b7Kze/kPYvsXul+c3ros4p/Rx/uHsm624cfbv8Ptn//6qbb13QTfeiuAXa3te6vou/IW/2WvNVvyVvV3309C2Mr24jaxvbtVvzgmHI9XlV1t83p9sOXHKn3/NoK/zn/d7e4bt64n9Ml3j/lP/Z6756ul8f2Ntftc+RnHXn3JPmjZbl77eBZ5xsuHny08Sozg5r28nrj/aAFJLXA42WV7WeTbt1Z3Y/u92wvdycklIc/3j1Z/agVb01J2L9zydY3PZ7Xi9NZ1ade3ETIPYvIyyLzyHV78MM+MZ0MfbJK4RCqbN7N9UEVTvDU9MsvxeJ+U35X5//PovQ3j9k/WD28ei1/3+7X5di9b/De17A/qHHrc9gf1bjzPeyPNpLB9abH1ze1dSnwWdB34+rv3of/qMad6TzHpYJ3E3Y7Ilzpef6WL4+rKCPiX46TvCxvVKlUSfvjz1YZnfXz9WUZ5Ruq6JrnpFq//Iu084v662z76JWsLX+D6eWbsravqb31vep9iVsPQn1Q4s6DUB+8AN9X0pf6+l3+2xJ3nmLYf93g3ljI29/v/uA7GHxW64f3wX7uYxrr0qg/WvtikaI8vWzy1SIrW59FvvptkLJuPfv+K2G7L7cYX26x1r+hSJcvFvF13cFcyleXZPC87sO+uiTGjRL76sC6U6R+9bs6vo7Gn0uyWzvbGWjriPG5webDkp9PUMbbj8t+VOPeYcnu6a6b3xK/PSD2eD0g5bF9m8KtDziVsrtxdPsLTvu5jut6hdX68ud8UGS9OqjYKF8tMtItue3A+tsnFvsa904sPqhx58Tig691OjPRq/vLy32lvP0Kog8XpKQF6a8XZHcjoTe+tPkcktcvVC9lfwesNl6Y3TYfxyrxEZPXdZR3iKdZD0M+VYSLFc9l2RTZHWjJupT0PG59/Ujis8ruSar1aVfPz5YN/8yS3PyS4rPK7i0vNz+lWIps3/R651uKzxr778Pe+pjivsrdryk+q+xeoHHvc4ofLcq97yl+2EJ13G2hbR1eTf5k29XZPdl18zW4zyLbb2/eeg/us8j+/tWdF+E+R2W3J7v9dfEPUrdwK8HlVeq+nf3b59QefLda0h3X9okSfD4wnwR+pkTnCfTevrYUvMpTHulNC58oIZwAPrF/aSnaus5R+uNrP6TzQFfXL/2QZ8Cs4cxzFD5TQtMB3+NrJWydEjxPYuVrJTg+MhtfK7FO+UqepfdziRKvDXgz2nc7u/ReI00HI/bQ+yWYepLfa/TlEv1LJeyRJhs+vlTC107lifq1Ety38fq1H8KcePV0MfEzJfjIqFb70hopw9PrZevLEqXsX0VovL2nvjxR3C5H59rq+NJqlQef23k82tdKrKvw8tD6xRLMktT2dgn76lKs46b8KMynSjhjkadKf3Ep+pca7eZb5Z8nHdsPQL/5lZ17DyeVsn0W5+bTSc8q26+9FqVMqeP1vICyu8vax7r23kffzC4obbt3c26JWP6U0i/zC8r2yS1pvBPpkYNsfHlpatkuzQcPxVJHd7MmSnv7W8UfLUvlFUuWv1jz2d/UnWOZXvWNOlyefG5FX6+zJlXNmtsx3r5Oi/2GDv3iljM4jR+19003bF8vePOpv2eV3bTCW4/9fVCDF+d8eUw+8Wv8G36N/76/xmy9us3M++7X9G/4Nf3/4q/JS/LLr/lgX0LzPFfxY7Pdj+3zJUa0tK+nd/WU3tW+nCyNN4FY892WO/w7tv/tY143t5htjW/YYp4jypvgniO0y//dDa67tz+2NW7e/tjXeHn7438//5c//uuf//7Pf/nbv/7xH3/+21//8/nv/meW+vuf//gvf/nT+b/+23/99V/T//cf/+9/XP+ff/n7n//ylz//+z//x9//9q9/+j//9fc/zUrz//fb4/wf/0vmdy7lOQD/+w+/lef/3sdzb9aH+fN/1+f/ri72h+fJpc3/fzn+gTz/QbP//T9zCf8/"
     }
   ],
   "outputs": {
@@ -3267,149 +3263,149 @@
       "function_locations": [
         {
           "name": "encode_message",
-          "start": 4119
+          "start": 4136
         },
         {
           "name": "decode_message",
-          "start": 5577
+          "start": 5594
         },
         {
           "name": "to_expanded_metadata",
-          "start": 6600
+          "start": 6617
         },
         {
           "name": "from_expanded_metadata",
-          "start": 7114
+          "start": 7131
         },
         {
           "name": "tests::encode_decode_empty_message",
-          "start": 7877
+          "start": 7894
         },
         {
           "name": "tests::encode_decode_short_message",
-          "start": 8427
+          "start": 8444
         },
         {
           "name": "tests::encode_decode_full_message",
-          "start": 9073
+          "start": 9090
         },
         {
           "name": "tests::to_expanded_metadata_packing",
-          "start": 9611
+          "start": 9628
         },
         {
           "name": "tests::from_expanded_metadata_packing",
-          "start": 10696
+          "start": 10713
         },
         {
           "name": "tests::to_from_expanded_metadata",
-          "start": 11753
+          "start": 11770
         },
         {
           "name": "tests::encode_decode_max_size_message",
-          "start": 12134
+          "start": 12151
         },
         {
           "name": "tests::encode_oversized_message_fails",
-          "start": 12917
+          "start": 12934
         },
         {
           "name": "tests::decode_empty_message_returns_none",
-          "start": 13106
+          "start": 13123
         },
         {
           "name": "tests::decode_message_with_oversized_metadata_returns_none",
-          "start": 13263
+          "start": 13280
         }
       ],
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encoding.nr",
-      "source": "// TODO(#12750): don't make these values assume we're using AES.\nuse crate::protocol::constants::PRIVATE_LOG_CIPHERTEXT_LEN;\nuse crate::utils::array;\n\n// We reassign to the constant here to communicate the distinction between a log and a message. In Aztec.nr, unlike in\n// protocol circuits, we have a concept of a message that can be emitted either as a private log or as an offchain\n// message. Message is a piece of data that is to be eventually delivered to a contract via the `process_message(...)`\n// utility function function that is injected by the #[aztec] macro. Note: PRIVATE_LOG_CIPHERTEXT_LEN is an amount of\n// fields, so MESSAGE_CIPHERTEXT_LEN is the size of the message in fields.\npub global MESSAGE_CIPHERTEXT_LEN: u32 = PRIVATE_LOG_CIPHERTEXT_LEN;\n\n// TODO(#12750): The global variables below should not be here as they are AES128 specific.\n// The header plaintext is 2 bytes (ciphertext length), padded to the 16-byte AES block size by PKCS#7.\npub(crate) global HEADER_CIPHERTEXT_SIZE_IN_BYTES: u32 = 16;\n// AES PKCS#7 always adds at least one byte of padding. Since each plaintext field is 32 bytes (a multiple of the\n// 16-byte AES block size), a full 16-byte padding block is always appended.\npub(crate) global AES128_PKCS7_EXPANSION_IN_BYTES: u32 = 16;\n\npub global EPH_PK_X_SIZE_IN_FIELDS: u32 = 1;\n\n// (15 - 1) * 31 - 16 - 16 = 402. Note: We multiply by 31 because ciphertext bytes are stored in fields using\n// bytes_to_fields, which packs 31 bytes per field (since a Field is ~254 bits and can safely store 31 whole bytes).\npub(crate) global MESSAGE_PLAINTEXT_SIZE_IN_BYTES: u32 = (MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31\n    - HEADER_CIPHERTEXT_SIZE_IN_BYTES\n    - AES128_PKCS7_EXPANSION_IN_BYTES;\n// The plaintext bytes represent Field values that were originally serialized using fields_to_bytes, which converts\n// each Field to 32 bytes. To convert the plaintext bytes back to fields, we divide by 32. 402 / 32 = 12\npub global MESSAGE_PLAINTEXT_LEN: u32 = MESSAGE_PLAINTEXT_SIZE_IN_BYTES / 32;\n\npub global MESSAGE_EXPANDED_METADATA_LEN: u32 = 1;\n\n// The standard message layout is composed of:\n//  - an initial field called the 'expanded metadata'\n//  - an arbitrary number of fields following that called the 'message content'\n//\n// ```\n// message: [ msg_expanded_metadata, ...msg_content ]\n// ```\n//\n// The expanded metadata itself is interpreted as a u128, of which:\n//  - the upper 64 bits are the message type id\n//  - the lower 64 bits are called the 'message metadata'\n//\n// ```\n// msg_expanded_metadata: [  msg_type_id    |  msg_metadata  ]\n//                        <---  64 bits --->|<--- 64 bits --->\n// ```\n//\n// The meaning of the message metadata and message content depend on the value of the message type id. Note that there\n// is nothing special about the message metadata, it _can_ be considered part of the content. It just has a different\n// name to make it distinct from the message content given that it is not a full field.\n\n/// The maximum length of a message's content, i.e. not including the expanded message metadata.\npub global MAX_MESSAGE_CONTENT_LEN: u32 = MESSAGE_PLAINTEXT_LEN - MESSAGE_EXPANDED_METADATA_LEN;\n\n/// Encodes a message following aztec-nr's standard message encoding. This message can later be decoded with\n/// `decode_message` to retrieve the original values.\n///\n/// - The `msg_type` is an identifier that groups types of messages that are all processed the same way, e.g. private\n/// notes or events. Possible values are defined in `aztec::messages::msg_type`.\n/// - The `msg_metadata` and `msg_content` are the values stored in the message, whose meaning depends on the\n/// `msg_type`. The only special thing about `msg_metadata` that separates it from `msg_content` is that it is a u64\n/// instead of a full Field (due to details of how messages are encoded), allowing applications that can fit values\n/// into this smaller variable to achieve higher data efficiency.\npub fn encode_message<let N: u32>(\n    msg_type: u64,\n    msg_metadata: u64,\n    msg_content: [Field; N],\n) -> [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] {\n    std::static_assert(\n        msg_content.len() <= MAX_MESSAGE_CONTENT_LEN,\n        \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\",\n    );\n\n    // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring of the\n    // message encoding below must be updated as well.\n    std::static_assert(\n        MESSAGE_EXPANDED_METADATA_LEN == 1,\n        \"unexpected value for MESSAGE_EXPANDED_METADATA_LEN\",\n    );\n    let mut message: [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] = std::mem::zeroed();\n\n    message[0] = to_expanded_metadata(msg_type, msg_metadata);\n    for i in 0..msg_content.len() {\n        message[MESSAGE_EXPANDED_METADATA_LEN + i] = msg_content[i];\n    }\n\n    message\n}\n\n/// Decodes a standard aztec-nr message, i.e. one created via `encode_message`, returning the original encoded values.\n///\n/// Returns `None` if the message is empty or has invalid (>128 bit) expanded metadata.\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) -> Option<(u64, u64, BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>)> {\n    Option::some(message)\n        .and_then(|message| {\n            // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring\n            // 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            if message.len() < MESSAGE_EXPANDED_METADATA_LEN {\n                Option::none()\n            } else {\n                Option::some(message.get(0))\n            }\n        })\n        .and_then(|msg_expanded_metadata| from_expanded_metadata(msg_expanded_metadata))\n        .map(|(msg_type_id, msg_metadata)| {\n            let msg_content = array::subbvec(message, MESSAGE_EXPANDED_METADATA_LEN);\n            (msg_type_id, msg_metadata, msg_content)\n        })\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\nglobal TWO_POW_128: Field = 2.pow_32(128);\n\n/// Unpacks expanded metadata into (msg_type, msg_metadata). Returns `None` if `input >= 2^128`.\nfn from_expanded_metadata(input: Field) -> Option<(u64, u64)> {\n    if input.lt(TWO_POW_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        Option::some((msg_type, msg_metadata))\n    } else {\n        Option::none()\n    }\n}\n\nmod tests {\n    use crate::utils::array::subarray::subarray;\n    use super::{\n        decode_message, encode_message, from_expanded_metadata, MAX_MESSAGE_CONTENT_LEN, to_expanded_metadata,\n        TWO_POW_128,\n    };\n\n    global U64_MAX: u64 = (2.pow_32(64) - 1) as u64;\n    global U128_MAX: Field = (2.pow_32(128) - 1);\n\n    #[test]\n    unconstrained fn encode_decode_empty_message(msg_type: u64, msg_metadata: u64) {\n        let encoded = encode_message(msg_type, msg_metadata, []);\n        let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n            decode_message(BoundedVec::from_array(encoded)).unwrap();\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)).unwrap();\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)).unwrap();\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).unwrap();\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).unwrap();\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).unwrap();\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).unwrap();\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).unwrap();\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).unwrap();\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).unwrap();\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).unwrap();\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).unwrap();\n\n        assert_eq(original_msg_type, unpacked_msg_type);\n        assert_eq(original_msg_metadata, unpacked_msg_metadata);\n    }\n\n    #[test]\n    unconstrained fn encode_decode_max_size_message() {\n        let msg_type_id: u64 = 42;\n        let msg_metadata: u64 = 99;\n        let mut msg_content = [0; MAX_MESSAGE_CONTENT_LEN];\n        for i in 0..MAX_MESSAGE_CONTENT_LEN {\n            msg_content[i] = i as Field;\n        }\n\n        let encoded = encode_message(msg_type_id, msg_metadata, msg_content);\n        let (decoded_type_id, decoded_metadata, decoded_content) =\n            decode_message(BoundedVec::from_array(encoded)).unwrap();\n\n        assert_eq(decoded_type_id, msg_type_id);\n        assert_eq(decoded_metadata, msg_metadata);\n        assert_eq(decoded_content, BoundedVec::from_array(msg_content));\n    }\n\n    #[test(should_fail_with = \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\")]\n    fn encode_oversized_message_fails() {\n        let msg_content = [0; MAX_MESSAGE_CONTENT_LEN + 1];\n        let _ = encode_message(0, 0, msg_content);\n    }\n\n    #[test]\n    unconstrained fn decode_empty_message_returns_none() {\n        assert(decode_message(BoundedVec::new()).is_none());\n    }\n\n    #[test]\n    unconstrained fn decode_message_with_oversized_metadata_returns_none() {\n        let message = BoundedVec::from_array([TWO_POW_128]);\n        assert(decode_message(message).is_none());\n    }\n}\n"
+      "source": "// TODO(#12750): don't make these values assume we're using AES.\nuse crate::protocol::constants::PRIVATE_LOG_CIPHERTEXT_LEN;\nuse crate::utils::array;\n\n// We reassign to the constant here to communicate the distinction between a log and a message. In Aztec.nr, unlike in\n// protocol circuits, we have a concept of a message that can be emitted either as a private log or as an offchain\n// message. Message is a piece of data that is to be eventually delivered to a contract via the `process_message(...)`\n// utility function function that is injected by the #[aztec] macro. Note: PRIVATE_LOG_CIPHERTEXT_LEN is an amount of\n// fields, so MESSAGE_CIPHERTEXT_LEN is the size of the message in fields.\npub global MESSAGE_CIPHERTEXT_LEN: u32 = PRIVATE_LOG_CIPHERTEXT_LEN;\n\n// TODO(#12750): The global variables below should not be here as they are AES128 specific.\n// The header plaintext is 2 bytes (ciphertext length), padded to the 16-byte AES block size by PKCS#7.\npub(crate) global HEADER_CIPHERTEXT_SIZE_IN_BYTES: u32 = 16;\n// AES PKCS#7 always adds at least one byte of padding. Since each plaintext field is 32 bytes (a multiple of the\n// 16-byte AES block size), a full 16-byte padding block is always appended.\npub(crate) global AES128_PKCS7_EXPANSION_IN_BYTES: u32 = 16;\n\npub global EPH_PK_X_SIZE_IN_FIELDS: u32 = 1;\n\n// (15 - 1) * 31 - 16 - 16 = 402. Note: We multiply by 31 because ciphertext bytes are stored in fields using\n// encode_bytes_as_fields, which packs 31 bytes per field (since a Field is ~254 bits and can safely store 31 whole\n// bytes).\npub(crate) global MESSAGE_PLAINTEXT_SIZE_IN_BYTES: u32 = (MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31\n    - HEADER_CIPHERTEXT_SIZE_IN_BYTES\n    - AES128_PKCS7_EXPANSION_IN_BYTES;\n// The plaintext bytes represent Field values that were originally serialized using encode_fields_as_bytes, which\n// converts each Field to 32 bytes. To convert the plaintext bytes back to fields, we divide by 32. 402 / 32 = 12\npub global MESSAGE_PLAINTEXT_LEN: u32 = MESSAGE_PLAINTEXT_SIZE_IN_BYTES / 32;\n\npub global MESSAGE_EXPANDED_METADATA_LEN: u32 = 1;\n\n// The standard message layout is composed of:\n//  - an initial field called the 'expanded metadata'\n//  - an arbitrary number of fields following that called the 'message content'\n//\n// ```\n// message: [ msg_expanded_metadata, ...msg_content ]\n// ```\n//\n// The expanded metadata itself is interpreted as a u128, of which:\n//  - the upper 64 bits are the message type id\n//  - the lower 64 bits are called the 'message metadata'\n//\n// ```\n// msg_expanded_metadata: [  msg_type_id    |  msg_metadata  ]\n//                        <---  64 bits --->|<--- 64 bits --->\n// ```\n//\n// The meaning of the message metadata and message content depend on the value of the message type id. Note that there\n// is nothing special about the message metadata, it _can_ be considered part of the content. It just has a different\n// name to make it distinct from the message content given that it is not a full field.\n\n/// The maximum length of a message's content, i.e. not including the expanded message metadata.\npub global MAX_MESSAGE_CONTENT_LEN: u32 = MESSAGE_PLAINTEXT_LEN - MESSAGE_EXPANDED_METADATA_LEN;\n\n/// Encodes a message following aztec-nr's standard message encoding. This message can later be decoded with\n/// `decode_message` to retrieve the original values.\n///\n/// - The `msg_type` is an identifier that groups types of messages that are all processed the same way, e.g. private\n/// notes or events. Possible values are defined in `aztec::messages::msg_type`.\n/// - The `msg_metadata` and `msg_content` are the values stored in the message, whose meaning depends on the\n/// `msg_type`. The only special thing about `msg_metadata` that separates it from `msg_content` is that it is a u64\n/// instead of a full Field (due to details of how messages are encoded), allowing applications that can fit values\n/// into this smaller variable to achieve higher data efficiency.\npub fn encode_message<let N: u32>(\n    msg_type: u64,\n    msg_metadata: u64,\n    msg_content: [Field; N],\n) -> [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] {\n    std::static_assert(\n        msg_content.len() <= MAX_MESSAGE_CONTENT_LEN,\n        \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\",\n    );\n\n    // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring of the\n    // message encoding below must be updated as well.\n    std::static_assert(\n        MESSAGE_EXPANDED_METADATA_LEN == 1,\n        \"unexpected value for MESSAGE_EXPANDED_METADATA_LEN\",\n    );\n    let mut message: [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] = std::mem::zeroed();\n\n    message[0] = to_expanded_metadata(msg_type, msg_metadata);\n    for i in 0..msg_content.len() {\n        message[MESSAGE_EXPANDED_METADATA_LEN + i] = msg_content[i];\n    }\n\n    message\n}\n\n/// Decodes a standard aztec-nr message, i.e. one created via `encode_message`, returning the original encoded values.\n///\n/// Returns `None` if the message is empty or has invalid (>128 bit) expanded metadata.\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) -> Option<(u64, u64, BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>)> {\n    Option::some(message)\n        .and_then(|message| {\n            // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring\n            // 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            if message.len() < MESSAGE_EXPANDED_METADATA_LEN {\n                Option::none()\n            } else {\n                Option::some(message.get(0))\n            }\n        })\n        .and_then(|msg_expanded_metadata| from_expanded_metadata(msg_expanded_metadata))\n        .map(|(msg_type_id, msg_metadata)| {\n            let msg_content = array::subbvec(message, MESSAGE_EXPANDED_METADATA_LEN);\n            (msg_type_id, msg_metadata, msg_content)\n        })\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\nglobal TWO_POW_128: Field = 2.pow_32(128);\n\n/// Unpacks expanded metadata into (msg_type, msg_metadata). Returns `None` if `input >= 2^128`.\nfn from_expanded_metadata(input: Field) -> Option<(u64, u64)> {\n    if input.lt(TWO_POW_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        Option::some((msg_type, msg_metadata))\n    } else {\n        Option::none()\n    }\n}\n\nmod tests {\n    use crate::utils::array::subarray::subarray;\n    use super::{\n        decode_message, encode_message, from_expanded_metadata, MAX_MESSAGE_CONTENT_LEN, to_expanded_metadata,\n        TWO_POW_128,\n    };\n\n    global U64_MAX: u64 = (2.pow_32(64) - 1) as u64;\n    global U128_MAX: Field = (2.pow_32(128) - 1);\n\n    #[test]\n    unconstrained fn encode_decode_empty_message(msg_type: u64, msg_metadata: u64) {\n        let encoded = encode_message(msg_type, msg_metadata, []);\n        let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n            decode_message(BoundedVec::from_array(encoded)).unwrap();\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)).unwrap();\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)).unwrap();\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).unwrap();\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).unwrap();\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).unwrap();\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).unwrap();\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).unwrap();\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).unwrap();\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).unwrap();\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).unwrap();\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).unwrap();\n\n        assert_eq(original_msg_type, unpacked_msg_type);\n        assert_eq(original_msg_metadata, unpacked_msg_metadata);\n    }\n\n    #[test]\n    unconstrained fn encode_decode_max_size_message() {\n        let msg_type_id: u64 = 42;\n        let msg_metadata: u64 = 99;\n        let mut msg_content = [0; MAX_MESSAGE_CONTENT_LEN];\n        for i in 0..MAX_MESSAGE_CONTENT_LEN {\n            msg_content[i] = i as Field;\n        }\n\n        let encoded = encode_message(msg_type_id, msg_metadata, msg_content);\n        let (decoded_type_id, decoded_metadata, decoded_content) =\n            decode_message(BoundedVec::from_array(encoded)).unwrap();\n\n        assert_eq(decoded_type_id, msg_type_id);\n        assert_eq(decoded_metadata, msg_metadata);\n        assert_eq(decoded_content, BoundedVec::from_array(msg_content));\n    }\n\n    #[test(should_fail_with = \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\")]\n    fn encode_oversized_message_fails() {\n        let msg_content = [0; MAX_MESSAGE_CONTENT_LEN + 1];\n        let _ = encode_message(0, 0, msg_content);\n    }\n\n    #[test]\n    unconstrained fn decode_empty_message_returns_none() {\n        assert(decode_message(BoundedVec::new()).is_none());\n    }\n\n    #[test]\n    unconstrained fn decode_message_with_oversized_metadata_returns_none() {\n        let message = BoundedVec::from_array([TWO_POW_128]);\n        assert(decode_message(message).is_none());\n    }\n}\n"
     },
     "133": {
       "function_locations": [
         {
           "name": "extract_many_close_to_uniformly_random_256_bits_using_poseidon2",
-          "start": 1736
+          "start": 1764
         },
         {
           "name": "derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits",
-          "start": 4755
+          "start": 4783
         },
         {
           "name": "derive_aes_symmetric_key_and_iv_from_shared_secret",
-          "start": 5304
+          "start": 5332
         },
         {
           "name": "<impl MessageEncryption for AES128>::encrypt",
-          "start": 10337
+          "start": 10365
         },
         {
           "name": "<impl MessageEncryption for AES128>::decrypt",
-          "start": 17660
+          "start": 17702
         },
         {
           "name": "encode_header",
-          "start": 21676
+          "start": 21732
         },
         {
           "name": "extract_ciphertext_length",
-          "start": 22007
+          "start": 22063
         },
         {
           "name": "unmask_field",
-          "start": 22592
+          "start": 22648
         },
         {
           "name": "random_address_point",
-          "start": 23005
+          "start": 23061
         },
         {
           "name": "test::encrypt_decrypt_deterministic",
-          "start": 24172
+          "start": 24228
         },
         {
           "name": "test::encrypt_decrypt_random",
-          "start": 26650
+          "start": 26706
         },
         {
           "name": "test::encrypt_to_invalid_address",
-          "start": 27496
+          "start": 27552
         },
         {
           "name": "test::pkcs7_padding_always_adds_at_least_one_byte",
-          "start": 27946
+          "start": 28002
         },
         {
           "name": "test::encrypt_decrypt_max_size_plaintext",
-          "start": 28510
+          "start": 28566
         },
         {
           "name": "test::encrypt_oversized_plaintext",
-          "start": 29409
+          "start": 29465
         },
         {
           "name": "test::random_address_point_produces_valid_points",
-          "start": 29767
+          "start": 29823
         },
         {
           "name": "test::decrypt_invalid_ephemeral_public_key",
-          "start": 30218
+          "start": 30274
         },
         {
           "name": "test::decrypt_returns_none_on_empty_ciphertext",
-          "start": 31063
+          "start": 31119
         },
         {
           "name": "test::decrypt_returns_none_on_empty_header",
-          "start": 31617
+          "start": 31673
         },
         {
           "name": "test::decrypt_returns_none_on_oversized_ciphertext_length",
-          "start": 32543
+          "start": 32599
         }
       ],
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encryption/aes128.nr",
-      "source": "use crate::protocol::{address::AztecAddress, public_keys::AddressPoint, traits::ToField};\n\nuse crate::{\n    keys::{\n        ecdh_shared_secret::{\n            compute_app_siloed_shared_secret, derive_ecdh_shared_secret, derive_shared_secret_field_mask,\n            derive_shared_secret_subkey,\n        },\n        ephemeral::generate_positive_ephemeral_key_pair,\n    },\n    logging::aztecnr_warn_log_format,\n    messages::{\n        encoding::{\n            EPH_PK_X_SIZE_IN_FIELDS, HEADER_CIPHERTEXT_SIZE_IN_BYTES, MESSAGE_CIPHERTEXT_LEN, MESSAGE_PLAINTEXT_LEN,\n            MESSAGE_PLAINTEXT_SIZE_IN_BYTES,\n        },\n        encryption::message_encryption::MessageEncryption,\n        logs::arithmetic_generics_utils::{\n            get_arr_of_size__message_bytes__from_PT, get_arr_of_size__message_bytes_padding__from_PT,\n        },\n    },\n    oracle::{aes128_decrypt::try_aes128_decrypt, 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_to_bytes, try_fields_from_bytes},\n        },\n        point::point_from_x_coord_and_sign,\n    },\n};\n\nuse std::aes128::aes128_encrypt;\n\n/// Computes N close-to-uniformly-random 256 bits from a given app-siloed shared secret.\n///\n/// NEVER re-use the same iv and sym_key. DO NOT call this function more than once with the same s_app.\n///\n/// This function is only known to be safe if s_app is derived from combining a random ephemeral key with an\n/// address point and a contract address. See big comment within the body of the function.\nfn extract_many_close_to_uniformly_random_256_bits_using_poseidon2<let N: u32>(s_app: Field) -> [[u8; 32]; N] {\n    /*\n     * Unsafe because of https://eprint.iacr.org/2010/264.pdf Page 13, Lemma 2 (and the two paragraphs below it).\n    *\n    * If you call this function, you need to be careful and aware of how the arg `s_app` has been derived.\n    *\n    * The paper says that the way you derive aes keys and IVs should be fine with poseidon2 (modelled as a RO),\n    * as long as you _don't_ use Poseidon2 as a PRG to generate the two exponents x & y which multiply to the\n    * 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 which can be public and\n    * compute Hash(x) as poseidon(K,x)).\n    * In that lemma, k would be 2*254=508, and m would be the number of points on the grumpkin curve (which is\n    * close to r according to the Hasse bound).\n    *\n    * Our shared secret S is [esk * address_sk] * G, and the question is: Can we compute hash(S) using poseidon2\n    * 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 discussion about whether address_sk is\n    * independent of poseidon2. 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, in order to derive a\n    * symmetric key.\n    *\n    * If you're calling this function for a differently-derived `s_app`, be careful.\n    */\n    \n\n    /* The output of this function needs to be 32 random bytes.\n     * A single field won't give us 32 bytes of entropy. So we compute two \"random\" fields, by poseidon-hashing\n    * with two different indices. 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 be careful not to take bytes\n    * from the \"big end\", because the \"big\" byte is not uniformly random over the byte: it only has < 6 bits of\n    * randomness, because 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    std::static_assert(N < 256, \"N too large\");\n    for k in 0..N {\n        let rand1: Field = derive_shared_secret_subkey(s_app, 2 * k);\n        let rand2: Field = derive_shared_secret_subkey(s_app, 2 * k + 1);\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_shared_secret<let N: u32>(s_app: Field) -> [([u8; 16], [u8; 16]); N] {\n    let many_random_256_bits: [[u8; 32]; N] = extract_many_close_to_uniformly_random_256_bits_using_poseidon2(s_app);\n\n    derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits(many_random_256_bits)\n}\n\npub struct AES128 {}\n\nimpl MessageEncryption for AES128 {\n\n    /// AES128-CBC encryption for Aztec protocol messages.\n    ///\n    /// ## Overview\n    ///\n    /// The plaintext is an array of up to `MESSAGE_PLAINTEXT_LEN` (12) fields. The output is always exactly\n    /// `MESSAGE_CIPHERTEXT_LEN` (15) fields, regardless of plaintext size. All output fields except the\n    /// ephemeral public key are uniformly random `Field` values to any observer without knowledge of the\n    /// shared secret, making all encrypted messages indistinguishable by size or content.\n    ///\n    /// ## PKCS#7 Padding\n    ///\n    /// AES operates on 16-byte blocks, so the plaintext must be padded to a multiple of 16. PKCS#7 padding always\n    /// adds at least 1 byte (so the receiver can always detect and strip it), which means:\n    /// - 1 B plaintext  -> 15 B padding -> 16 B total\n    /// - 15 B plaintext ->  1 B padding -> 16 B total\n    /// - 16 B plaintext -> 16 B padding -> 32 B total (full extra block)\n    ///\n    /// In general: if the plaintext is already a multiple of 16, a full 16-byte padding block is appended.\n    ///\n    /// ## Encryption Steps\n    ///\n    /// **1. Body encryption.** The plaintext fields are serialized to bytes (32 bytes per field) and AES-128-CBC\n    /// encrypted. Since 32 is a multiple of 16, PKCS#7 always adds a full 16-byte padding block (see above):\n    ///\n    /// ```text\n    /// +---------------------------------------------+\n    /// |                   body ct                    |\n    /// |            PlaintextLen*32 + 16 B            |\n    /// +-------------------------------+--------------+\n    /// | encrypted plaintext fields    | PKCS#7 (16B) |\n    /// | (serialized at 32 B each)     |              |\n    /// +-------------------------------+--------------+\n    /// ```\n    ///\n    /// **2. Header encryption.** The byte length of `body_ct` is stored as a 2-byte big-endian integer. This 2-byte\n    /// header plaintext is then AES-encrypted; PKCS#7 pads the remaining 14 bytes to fill one 16-byte AES block,\n    /// producing a 16-byte header ciphertext:\n    ///\n    /// ```text\n    /// +---------------------------+\n    /// |         header ct         |\n    /// |            16 B           |\n    /// +--------+------------------+\n    /// | body ct| PKCS#7 (14B)     |\n    /// | length |                  |\n    /// | (2 B)  |                  |\n    /// +--------+------------------+\n    /// ```\n    ///\n    /// ## Wire Format\n    ///\n    /// Messages are transmitted as fields, not bytes. A field is ~254 bits and can safely store 31 whole bytes, so\n    /// we need to pack our byte data into 31-byte chunks. This packing drives the wire format.\n    ///\n    /// **Step 1 -- Assemble bytes.** The ciphertexts are laid out in a byte array, padded with zero bytes to a\n    /// multiple of 31 so it divides evenly into fields:\n    ///\n    /// ```text\n    /// +------------+-------------------------+---------+\n    /// | header ct  |        body ct          | byte pad|\n    /// |   16 B     | PlaintextLen*32 + 16 B  | (zeros) |\n    /// +------------+-------------------------+---------+\n    /// |<-------- padded to a multiple of 31 B -------->|\n    /// ```\n    ///\n    /// **Step 2 -- Pack and mask.** The byte array is split into 31-byte chunks, each stored in one field. A\n    /// Poseidon2-derived mask (see `derive_shared_secret_field_mask`) is added to each so that the resulting\n    /// fields appear as uniformly random `Field` values to any observer without knowledge of the shared secret,\n    /// hiding the fact that the underlying ciphertext consists of 128-bit AES blocks.\n    ///\n    /// **Step 3 -- Assemble ciphertext.** The ephemeral public key x-coordinate is prepended and random field padding\n    /// is appended to fill to 15 fields:\n    ///\n    /// ```text\n    /// +----------+-------------------------+-------------------+\n    /// | eph_pk.x |  masked message fields   | random field pad  |\n    /// |          | (packed 31 B per field)  |  (fills to 15)    |\n    /// +----------+-------------------------+-------------------+\n    /// |<---------- MESSAGE_CIPHERTEXT_LEN = 15 fields -------->|\n    /// ```\n    ///\n    /// ## Key Derivation\n    ///\n    /// The raw ECDH shared secret point is first app-siloed into a scalar `s_app` by hashing with the contract\n    /// address (see\n    /// [`compute_app_siloed_shared_secret`](crate::keys::ecdh_shared_secret::compute_app_siloed_shared_secret)).\n    /// Two (key, IV) pairs are then derived from `s_app` via indexed Poseidon2 hashing: one pair for the body\n    /// ciphertext and one for the header ciphertext.\n    fn encrypt<let PlaintextLen: u32>(\n        plaintext: [Field; PlaintextLen],\n        recipient: AztecAddress,\n        contract_address: AztecAddress,\n    ) -> [Field; MESSAGE_CIPHERTEXT_LEN] {\n        std::static_assert(\n            PlaintextLen <= MESSAGE_PLAINTEXT_LEN,\n            \"Plaintext length exceeds MESSAGE_PLAINTEXT_LEN\",\n        );\n\n        // AES 128 operates on bytes, not fields, so we need to convert the fields to bytes. (This process is then\n        // reversed when processing the message in `process_message_ciphertext`)\n        let plaintext_bytes = fields_to_bytes(plaintext);\n\n        // Derive ECDH shared secret with recipient using a fresh ephemeral keypair.\n        let (eph_sk, eph_pk) = generate_positive_ephemeral_key_pair();\n\n        let raw_shared_secret = derive_ecdh_shared_secret(\n            eph_sk,\n            recipient\n                .to_address_point()\n                .unwrap_or_else(|| {\n                    aztecnr_warn_log_format!(\n                        \"Attempted to encrypt message for an invalid recipient ({0})\",\n                    )(\n                        [recipient.to_field()],\n                    );\n\n                    // Safety: if the recipient is an invalid address, then it is not possible to encrypt a message for\n                    // them because we cannot establish a shared secret. This is never expected to occur during normal\n                    // operation. However, it is technically possible for us to receive an invalid address, and we must\n                    // therefore handle it. We could simply fail, but that'd introduce a potential security issue in\n                    // which an attacker forces a contract to encrypt a message for an invalid address, resulting in an\n                    // impossible transaction - this is sometimes called a 'king of the hill' attack. We choose instead\n                    // to not fail and encrypt the plaintext regardless using the shared secret that results from a\n                    // random valid address. The sender is free to choose this address and hence shared secret, but\n                    // this has no security implications as they already know not only the full plaintext but also the\n                    // ephemeral private key anyway.\n                    unsafe {\n                        random_address_point()\n                    }\n                })\n                .inner,\n        );\n\n        let s_app = compute_app_siloed_shared_secret(raw_shared_secret, contract_address);\n\n        // It is safe to derive AES keys from `s_app` using Poseidon2 because `s_app` was derived from an ECDH shared\n        // secret using an AztecAddress (the recipient). See the block comment in\n        // `extract_many_close_to_uniformly_random_256_bits_using_poseidon2` for more info.\n        let pairs = derive_aes_symmetric_key_and_iv_from_shared_secret::<2>(s_app);\n        let (body_sym_key, body_iv) = pairs[0];\n        let (header_sym_key, header_iv) = pairs[1];\n\n        let ciphertext_bytes = aes128_encrypt(plaintext_bytes, body_iv, body_sym_key);\n\n        // Each plaintext field is 32 bytes (a multiple of the 16-byte AES block\n        // size), so PKCS#7 always appends a full 16-byte padding block:\n        //   |ciphertext| = PlaintextLen*32 + 16 = 16 * (1 + PlaintextLen*32 / 16)\n        std::static_assert(\n            ciphertext_bytes.len() == 16 * (1 + (PlaintextLen * 32) / 16),\n            \"unexpected ciphertext length\",\n        );\n\n        // Encrypt a 2-byte header containing the body ciphertext length.\n        let header_plaintext = encode_header(ciphertext_bytes.len());\n\n        // Note: the aes128_encrypt builtin fn automatically appends bytes to the input, according to pkcs#7; hence why\n        // the output `header_ciphertext_bytes` is 16 bytes larger than the input in this case.\n        let header_ciphertext_bytes = aes128_encrypt(header_plaintext, header_iv, header_sym_key);\n        // Verify expected header ciphertext size at compile time.\n        std::static_assert(\n            header_ciphertext_bytes.len() == HEADER_CIPHERTEXT_SIZE_IN_BYTES,\n            \"unexpected ciphertext header length\",\n        );\n\n        // Assemble the message byte array:\n        //  [header_ct (16B)] [body_ct] [padding to mult of 31]\n        let message_bytes_padding_to_mult_31 = get_arr_of_size__message_bytes_padding__from_PT::<PlaintextLen * 32>();\n\n        let mut message_bytes = get_arr_of_size__message_bytes__from_PT::<PlaintextLen * 32>();\n\n        std::static_assert(\n            message_bytes.len() % 31 == 0,\n            \"Unexpected error: message_bytes.len() should be divisible by 31, by construction.\",\n        );\n\n        let mut offset = 0;\n        for i in 0..header_ciphertext_bytes.len() {\n            message_bytes[offset + i] = header_ciphertext_bytes[i];\n        }\n        offset += header_ciphertext_bytes.len();\n\n        for i in 0..ciphertext_bytes.len() {\n            message_bytes[offset + i] = ciphertext_bytes[i];\n        }\n        offset += ciphertext_bytes.len();\n\n        for i in 0..message_bytes_padding_to_mult_31.len() {\n            message_bytes[offset + i] = message_bytes_padding_to_mult_31[i];\n        }\n        offset += message_bytes_padding_to_mult_31.len();\n\n        // Ideally we would be able to have a static assert where we check that the offset would be such that we've\n        // written to the entire log_bytes array, but we cannot since Noir does not treat the offset as a comptime\n        // value (despite the values that it goes through being known at each stage). We instead check that the\n        // computation used to obtain the offset computes the expected value (which we _can_ do in a static check), and\n        // then add a cheap runtime check to also validate that the offset matches this.\n        std::static_assert(\n            header_ciphertext_bytes.len() + ciphertext_bytes.len() + message_bytes_padding_to_mult_31.len()\n                == message_bytes.len(),\n            \"unexpected message length\",\n        );\n        assert(offset == message_bytes.len(), \"unexpected encrypted message length\");\n\n        // Pack message bytes into fields (31 bytes per field) and prepend eph_pk.x.\n        let message_bytes_as_fields = bytes_to_fields(message_bytes);\n\n        let mut ciphertext: [Field; MESSAGE_CIPHERTEXT_LEN] = [0; MESSAGE_CIPHERTEXT_LEN];\n\n        ciphertext[0] = eph_pk.x;\n\n        // Mask each content field with a Poseidon2-derived value, so that they appear as uniformly random `Field`\n        // values\n        let mut offset = 1;\n        for i in 0..message_bytes_as_fields.len() {\n            let mask = derive_shared_secret_field_mask(s_app, i as u32);\n            ciphertext[offset + i] = message_bytes_as_fields[i] + mask;\n        }\n        offset += message_bytes_as_fields.len();\n\n        // Pad with random fields so that padding is indistinguishable from masked data fields.\n        for i in offset..MESSAGE_CIPHERTEXT_LEN {\n            // Safety: we assume that the sender wants for the message to be private - a malicious one could simply\n            // reveal its contents publicly. It is therefore fine to trust the sender to provide random padding.\n            ciphertext[i] = unsafe { random() };\n        }\n\n        ciphertext\n    }\n\n    unconstrained fn decrypt(\n        ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n        recipient: AztecAddress,\n        contract_address: AztecAddress,\n    ) -> Option<BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>> {\n        // Extract the ephemeral public key x-coordinate and masked fields, returning None for empty ciphertext.\n        if ciphertext.len() > 0 {\n            let masked_fields: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS> =\n                array::subbvec(ciphertext, EPH_PK_X_SIZE_IN_FIELDS);\n            Option::some((ciphertext.get(0), masked_fields))\n        } else {\n            Option::none()\n        }\n            .and_then(|(eph_pk_x, masked_fields)| {\n                // With the x-coordinate of the ephemeral public key we can reconstruct the point as we know that the\n                // y-coordinate must be positive. This may fail however, as not all x-coordinates are on the curve. In\n                // that case, we simply return `Option::none`.\n                point_from_x_coord_and_sign(eph_pk_x, true).and_then(|eph_pk| {\n                    let s_app = get_shared_secret(recipient, eph_pk, contract_address);\n\n                    let unmasked_fields = masked_fields.mapi(|i, field| {\n                        let unmasked = unmask_field(s_app, i, field);\n                        // If we failed to unmask the field, we are dealing with the random padding. We'll ignore it\n                        // later, so we can simply set it to 0\n                        unmasked.unwrap_or(0)\n                    });\n                    let ciphertext_without_eph_pk_x = bytes_from_fields(unmasked_fields);\n\n                    // Derive symmetric keys:\n                    let pairs = derive_aes_symmetric_key_and_iv_from_shared_secret::<2>(s_app);\n                    let (body_sym_key, body_iv) = pairs[0];\n                    let (header_sym_key, header_iv) = pairs[1];\n\n                    // Extract the header ciphertext\n                    let header_start = 0;\n                    let header_ciphertext: [u8; HEADER_CIPHERTEXT_SIZE_IN_BYTES] =\n                        array::subarray(ciphertext_without_eph_pk_x.storage(), header_start);\n                    // We need to convert the array to a BoundedVec because the oracle expects a BoundedVec as it's\n                    // designed to work with messages with unknown length at compile time. This would not be necessary\n                    // here as the header ciphertext length is fixed. But we do it anyway to not have to have duplicate\n                    // oracles.\n                    let header_ciphertext_bvec =\n                        BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::from_array(header_ciphertext);\n\n                    try_aes128_decrypt(header_ciphertext_bvec, header_iv, header_sym_key)\n                    // Extract ciphertext length from header (2 bytes, big-endian)\n                    .and_then(|header_plaintext| extract_ciphertext_length(header_plaintext))\n                        .filter(|ciphertext_length| ciphertext_length <= MESSAGE_PLAINTEXT_SIZE_IN_BYTES)\n                        .map(|ciphertext_length| {\n                            // Extract and decrypt main ciphertext\n                            let ciphertext_start = header_start + HEADER_CIPHERTEXT_SIZE_IN_BYTES;\n                            let ciphertext_with_padding: [u8; MESSAGE_PLAINTEXT_SIZE_IN_BYTES] =\n                                array::subarray(ciphertext_without_eph_pk_x.storage(), ciphertext_start);\n                            BoundedVec::from_parts(ciphertext_with_padding, ciphertext_length)\n                        })\n                        // Decrypt main ciphertext and return it\n                        .and_then(|ciphertext| try_aes128_decrypt(ciphertext, body_iv, body_sym_key))\n                        // Convert bytes back to fields (32 bytes per field). Returns None if the actual bytes are\n                        // not valid.\n                        .and_then(|plaintext_bytes| try_fields_from_bytes(plaintext_bytes))\n                })\n            })\n    }\n}\n\n/// Encodes the body ciphertext length into a 2-byte big-endian header.\nfn encode_header(ciphertext_length: u32) -> [u8; 2] {\n    [(ciphertext_length >> 8) as u8, ciphertext_length as u8]\n}\n\n/// Extracts the body ciphertext length from a decrypted header as a 2-byte big-endian integer.\n///\n/// Returns `Option::none()` if the header has fewer than 2 bytes.\nunconstrained fn extract_ciphertext_length<let N: u32>(header: BoundedVec<u8, N>) -> Option<u32> {\n    if header.len() >= 2 {\n        Option::some(((header.get(0) as u32) << 8) | (header.get(1) as u32))\n    } else {\n        Option::none()\n    }\n}\n\n/// 2^248: upper bound for values that fit in 31 bytes\nglobal TWO_POW_248: Field = 2.pow_32(248);\n\n/// Removes the Poseidon2-derived mask from a ciphertext field. Returns the unmasked value if it fits in 31 bytes\n/// (a content field), or `None` if it doesn't (random padding). Unconstrained to prevent accidental use in\n/// constrained context.\nunconstrained fn unmask_field(s_app: Field, index: u32, masked: Field) -> Option<Field> {\n    let unmasked = masked - derive_shared_secret_field_mask(s_app, index);\n    if unmasked.lt(TWO_POW_248) {\n        Option::some(unmasked)\n    } else {\n        Option::none()\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::{compute_app_siloed_shared_secret, derive_ecdh_shared_secret},\n        messages::{\n            encoding::{HEADER_CIPHERTEXT_SIZE_IN_BYTES, MESSAGE_PLAINTEXT_LEN, MESSAGE_PLAINTEXT_SIZE_IN_BYTES},\n            encryption::message_encryption::MessageEncryption,\n        },\n        test::helpers::test_environment::TestEnvironment,\n    };\n    use crate::protocol::{address::AztecAddress, traits::FromField};\n    use super::{AES128, encode_header, 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(|context| {\n            let contract_address = context.this_address();\n            let plaintext = [1, 2, 3];\n\n            let recipient = AztecAddress::from_field(\n                0x25afb798ea6d0b8c1618e50fdeafa463059415013d3b7c75d46abf5e242be70c,\n            );\n\n            // Mock random values for deterministic test\n            let eph_sk = 0x1358d15019d4639393d62b97e1588c095957ce74a1c32d6ec7d62fe6705d9538;\n            let _ = OracleMock::mock(\"aztec_utl_getRandomField\").returns(eph_sk).times(1);\n\n            let randomness = 0x0101010101010101010101010101010101010101010101010101010101010101;\n            let _ = OracleMock::mock(\"aztec_utl_getRandomField\").returns(randomness).times(1000000);\n\n            let _ = OracleMock::mock(\"aztec_prv_getNextAppTagAsSender\").returns(42);\n\n            // Encrypt the message\n            let encrypted_message = BoundedVec::from_array(AES128::encrypt(plaintext, recipient, contract_address));\n\n            // Compute the same app-siloed shared secret that the oracle would return\n            let raw_shared_secret = derive_ecdh_shared_secret(\n                EmbeddedCurveScalar::from_field(eph_sk),\n                recipient.to_address_point().unwrap().inner,\n            );\n            let s_app = compute_app_siloed_shared_secret(raw_shared_secret, contract_address);\n\n            let _ = OracleMock::mock(\"aztec_utl_getSharedSecret\").returns(s_app);\n\n            // Decrypt the message\n            let decrypted = AES128::decrypt(encrypted_message, recipient, contract_address).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(|context| {\n            let contract_address = context.this_address();\n            let plaintext = [1, 2, 3];\n            let ciphertext = AES128::encrypt(plaintext, recipient, contract_address);\n\n            assert_eq(\n                AES128::decrypt(\n                    BoundedVec::from_array(ciphertext),\n                    recipient,\n                    contract_address,\n                )\n                    .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        let contract_address = AztecAddress { inner: 42 };\n\n        let _ = AES128::encrypt([1, 2, 3, 4], invalid_address, contract_address);\n    }\n\n    // Documents the PKCS#7 padding behavior that `encrypt` relies on (see its static_assert).\n    #[test]\n    fn pkcs7_padding_always_adds_at_least_one_byte() {\n        let key = [0 as u8; 16];\n        let iv = [0 as u8; 16];\n\n        // 1 byte input + 15 bytes padding = 16 bytes\n        assert_eq(std::aes128::aes128_encrypt([0; 1], iv, key).len(), 16);\n\n        // 15 bytes input + 1 byte padding = 16 bytes\n        assert_eq(std::aes128::aes128_encrypt([0; 15], iv, key).len(), 16);\n\n        // 16 bytes input (block-aligned) + full 16-byte padding block = 32 bytes\n        assert_eq(std::aes128::aes128_encrypt([0; 16], iv, key).len(), 32);\n    }\n\n    #[test]\n    unconstrained fn encrypt_decrypt_max_size_plaintext() {\n        let mut env = TestEnvironment::new();\n        let recipient = env.create_light_account();\n\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let mut plaintext = [0; MESSAGE_PLAINTEXT_LEN];\n            for i in 0..MESSAGE_PLAINTEXT_LEN {\n                plaintext[i] = i as Field;\n            }\n            let ciphertext = AES128::encrypt(plaintext, recipient, contract_address);\n\n            assert_eq(\n                AES128::decrypt(\n                    BoundedVec::from_array(ciphertext),\n                    recipient,\n                    contract_address,\n                )\n                    .unwrap(),\n                BoundedVec::from_array(plaintext),\n            );\n        });\n    }\n\n    #[test(should_fail_with = \"Plaintext length exceeds MESSAGE_PLAINTEXT_LEN\")]\n    unconstrained fn encrypt_oversized_plaintext() {\n        let address = AztecAddress { inner: 3 };\n        let contract_address = AztecAddress { inner: 42 };\n        let plaintext: [Field; MESSAGE_PLAINTEXT_LEN + 1] = [0; MESSAGE_PLAINTEXT_LEN + 1];\n        let _ = AES128::encrypt(plaintext, address, contract_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(|context| {\n            let contract_address = context.this_address();\n            let plaintext = [1, 2, 3, 4];\n            let ciphertext = AES128::encrypt(plaintext, recipient, contract_address);\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, contract_address).is_none());\n        });\n    }\n\n    #[test]\n    unconstrained fn decrypt_returns_none_on_empty_ciphertext() {\n        let mut env = TestEnvironment::new();\n        let recipient = env.create_light_account();\n\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            assert(AES128::decrypt(BoundedVec::new(), recipient, contract_address).is_none());\n        });\n    }\n\n    // Mocks the header AES decrypt oracle to return an empty result. The TS oracle never throws on invalid\n    // input: it decrypts to garbage bytes or returns empty\n    #[test]\n    unconstrained fn decrypt_returns_none_on_empty_header() {\n        let mut env = TestEnvironment::new();\n        let recipient = env.create_light_account();\n\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let plaintext = [1, 2, 3];\n            let ciphertext = BoundedVec::from_array(AES128::encrypt(plaintext, recipient, contract_address));\n\n            let empty_header = BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::new();\n            let _ = OracleMock::mock(\"aztec_utl_decryptAes128\").returns(Option::some(empty_header)).times(1);\n\n            assert(AES128::decrypt(ciphertext, recipient, contract_address).is_none());\n        });\n    }\n\n    // Mocks the header oracle to return a 2-byte header that decodes to a ciphertext_length one past the maximum\n    // allowed value, verifying the edge case is handled correctly.\n    #[test]\n    unconstrained fn decrypt_returns_none_on_oversized_ciphertext_length() {\n        let mut env = TestEnvironment::new();\n        let recipient = env.create_light_account();\n\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let plaintext = [1, 2, 3];\n            let ciphertext = BoundedVec::from_array(AES128::encrypt(plaintext, recipient, contract_address));\n\n            let bad_header = BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::from_array(encode_header(\n                MESSAGE_PLAINTEXT_SIZE_IN_BYTES + 1,\n            ));\n            let _ = OracleMock::mock(\"aztec_utl_decryptAes128\").returns(Option::some(bad_header)).times(1);\n\n            assert(AES128::decrypt(ciphertext, recipient, contract_address).is_none());\n        });\n    }\n\n}\n"
+      "source": "use crate::protocol::{address::AztecAddress, public_keys::AddressPoint, traits::ToField};\n\nuse crate::{\n    keys::{\n        ecdh_shared_secret::{\n            compute_app_siloed_shared_secret, derive_ecdh_shared_secret, derive_shared_secret_field_mask,\n            derive_shared_secret_subkey,\n        },\n        ephemeral::generate_positive_ephemeral_key_pair,\n    },\n    logging::aztecnr_warn_log_format,\n    messages::{\n        encoding::{\n            EPH_PK_X_SIZE_IN_FIELDS, HEADER_CIPHERTEXT_SIZE_IN_BYTES, MESSAGE_CIPHERTEXT_LEN, MESSAGE_PLAINTEXT_LEN,\n            MESSAGE_PLAINTEXT_SIZE_IN_BYTES,\n        },\n        encryption::message_encryption::MessageEncryption,\n        logs::arithmetic_generics_utils::{\n            get_arr_of_size__message_bytes__from_PT, get_arr_of_size__message_bytes_padding__from_PT,\n        },\n    },\n    oracle::{aes128_decrypt::try_aes128_decrypt, random::random, shared_secret::get_shared_secret},\n    utils::{\n        array,\n        conversion::{\n            bytes_as_fields::{decode_bytes_from_fields, encode_bytes_as_fields},\n            fields_as_bytes::{encode_fields_as_bytes, try_decode_fields_from_bytes},\n        },\n        point::point_from_x_coord_and_sign,\n    },\n};\n\nuse std::aes128::aes128_encrypt;\n\n/// Computes N close-to-uniformly-random 256 bits from a given app-siloed shared secret.\n///\n/// NEVER re-use the same iv and sym_key. DO NOT call this function more than once with the same s_app.\n///\n/// This function is only known to be safe if s_app is derived from combining a random ephemeral key with an\n/// address point and a contract address. See big comment within the body of the function.\nfn extract_many_close_to_uniformly_random_256_bits_using_poseidon2<let N: u32>(s_app: Field) -> [[u8; 32]; N] {\n    /*\n     * Unsafe because of https://eprint.iacr.org/2010/264.pdf Page 13, Lemma 2 (and the two paragraphs below it).\n    *\n    * If you call this function, you need to be careful and aware of how the arg `s_app` has been derived.\n    *\n    * The paper says that the way you derive aes keys and IVs should be fine with poseidon2 (modelled as a RO),\n    * as long as you _don't_ use Poseidon2 as a PRG to generate the two exponents x & y which multiply to the\n    * 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 which can be public and\n    * compute Hash(x) as poseidon(K,x)).\n    * In that lemma, k would be 2*254=508, and m would be the number of points on the grumpkin curve (which is\n    * close to r according to the Hasse bound).\n    *\n    * Our shared secret S is [esk * address_sk] * G, and the question is: Can we compute hash(S) using poseidon2\n    * 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 discussion about whether address_sk is\n    * independent of poseidon2. 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, in order to derive a\n    * symmetric key.\n    *\n    * If you're calling this function for a differently-derived `s_app`, be careful.\n    */\n    \n\n    /* The output of this function needs to be 32 random bytes.\n     * A single field won't give us 32 bytes of entropy. So we compute two \"random\" fields, by poseidon-hashing\n    * with two different indices. 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 be careful not to take bytes\n    * from the \"big end\", because the \"big\" byte is not uniformly random over the byte: it only has < 6 bits of\n    * randomness, because 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    std::static_assert(N < 256, \"N too large\");\n    for k in 0..N {\n        let rand1: Field = derive_shared_secret_subkey(s_app, 2 * k);\n        let rand2: Field = derive_shared_secret_subkey(s_app, 2 * k + 1);\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_shared_secret<let N: u32>(s_app: Field) -> [([u8; 16], [u8; 16]); N] {\n    let many_random_256_bits: [[u8; 32]; N] = extract_many_close_to_uniformly_random_256_bits_using_poseidon2(s_app);\n\n    derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits(many_random_256_bits)\n}\n\npub struct AES128 {}\n\nimpl MessageEncryption for AES128 {\n\n    /// AES128-CBC encryption for Aztec protocol messages.\n    ///\n    /// ## Overview\n    ///\n    /// The plaintext is an array of up to `MESSAGE_PLAINTEXT_LEN` (12) fields. The output is always exactly\n    /// `MESSAGE_CIPHERTEXT_LEN` (15) fields, regardless of plaintext size. All output fields except the\n    /// ephemeral public key are uniformly random `Field` values to any observer without knowledge of the\n    /// shared secret, making all encrypted messages indistinguishable by size or content.\n    ///\n    /// ## PKCS#7 Padding\n    ///\n    /// AES operates on 16-byte blocks, so the plaintext must be padded to a multiple of 16. PKCS#7 padding always\n    /// adds at least 1 byte (so the receiver can always detect and strip it), which means:\n    /// - 1 B plaintext  -> 15 B padding -> 16 B total\n    /// - 15 B plaintext ->  1 B padding -> 16 B total\n    /// - 16 B plaintext -> 16 B padding -> 32 B total (full extra block)\n    ///\n    /// In general: if the plaintext is already a multiple of 16, a full 16-byte padding block is appended.\n    ///\n    /// ## Encryption Steps\n    ///\n    /// **1. Body encryption.** The plaintext fields are serialized to bytes (32 bytes per field) and AES-128-CBC\n    /// encrypted. Since 32 is a multiple of 16, PKCS#7 always adds a full 16-byte padding block (see above):\n    ///\n    /// ```text\n    /// +---------------------------------------------+\n    /// |                   body ct                    |\n    /// |            PlaintextLen*32 + 16 B            |\n    /// +-------------------------------+--------------+\n    /// | encrypted plaintext fields    | PKCS#7 (16B) |\n    /// | (serialized at 32 B each)     |              |\n    /// +-------------------------------+--------------+\n    /// ```\n    ///\n    /// **2. Header encryption.** The byte length of `body_ct` is stored as a 2-byte big-endian integer. This 2-byte\n    /// header plaintext is then AES-encrypted; PKCS#7 pads the remaining 14 bytes to fill one 16-byte AES block,\n    /// producing a 16-byte header ciphertext:\n    ///\n    /// ```text\n    /// +---------------------------+\n    /// |         header ct         |\n    /// |            16 B           |\n    /// +--------+------------------+\n    /// | body ct| PKCS#7 (14B)     |\n    /// | length |                  |\n    /// | (2 B)  |                  |\n    /// +--------+------------------+\n    /// ```\n    ///\n    /// ## Wire Format\n    ///\n    /// Messages are transmitted as fields, not bytes. A field is ~254 bits and can safely store 31 whole bytes, so\n    /// we need to pack our byte data into 31-byte chunks. This packing drives the wire format.\n    ///\n    /// **Step 1 -- Assemble bytes.** The ciphertexts are laid out in a byte array, padded with zero bytes to a\n    /// multiple of 31 so it divides evenly into fields:\n    ///\n    /// ```text\n    /// +------------+-------------------------+---------+\n    /// | header ct  |        body ct          | byte pad|\n    /// |   16 B     | PlaintextLen*32 + 16 B  | (zeros) |\n    /// +------------+-------------------------+---------+\n    /// |<-------- padded to a multiple of 31 B -------->|\n    /// ```\n    ///\n    /// **Step 2 -- Pack and mask.** The byte array is split into 31-byte chunks, each stored in one field. A\n    /// Poseidon2-derived mask (see `derive_shared_secret_field_mask`) is added to each so that the resulting\n    /// fields appear as uniformly random `Field` values to any observer without knowledge of the shared secret,\n    /// hiding the fact that the underlying ciphertext consists of 128-bit AES blocks.\n    ///\n    /// **Step 3 -- Assemble ciphertext.** The ephemeral public key x-coordinate is prepended and random field padding\n    /// is appended to fill to 15 fields:\n    ///\n    /// ```text\n    /// +----------+-------------------------+-------------------+\n    /// | eph_pk.x |  masked message fields   | random field pad  |\n    /// |          | (packed 31 B per field)  |  (fills to 15)    |\n    /// +----------+-------------------------+-------------------+\n    /// |<---------- MESSAGE_CIPHERTEXT_LEN = 15 fields -------->|\n    /// ```\n    ///\n    /// ## Key Derivation\n    ///\n    /// The raw ECDH shared secret point is first app-siloed into a scalar `s_app` by hashing with the contract\n    /// address (see\n    /// [`compute_app_siloed_shared_secret`](crate::keys::ecdh_shared_secret::compute_app_siloed_shared_secret)).\n    /// Two (key, IV) pairs are then derived from `s_app` via indexed Poseidon2 hashing: one pair for the body\n    /// ciphertext and one for the header ciphertext.\n    fn encrypt<let PlaintextLen: u32>(\n        plaintext: [Field; PlaintextLen],\n        recipient: AztecAddress,\n        contract_address: AztecAddress,\n    ) -> [Field; MESSAGE_CIPHERTEXT_LEN] {\n        std::static_assert(\n            PlaintextLen <= MESSAGE_PLAINTEXT_LEN,\n            \"Plaintext length exceeds MESSAGE_PLAINTEXT_LEN\",\n        );\n\n        // AES 128 operates on bytes, not fields, so we need to convert the fields to bytes. (This process is then\n        // reversed when processing the message in `process_message_ciphertext`)\n        let plaintext_bytes = encode_fields_as_bytes(plaintext);\n\n        // Derive ECDH shared secret with recipient using a fresh ephemeral keypair.\n        let (eph_sk, eph_pk) = generate_positive_ephemeral_key_pair();\n\n        let raw_shared_secret = derive_ecdh_shared_secret(\n            eph_sk,\n            recipient\n                .to_address_point()\n                .unwrap_or_else(|| {\n                    aztecnr_warn_log_format!(\n                        \"Attempted to encrypt message for an invalid recipient ({0})\",\n                    )(\n                        [recipient.to_field()],\n                    );\n\n                    // Safety: if the recipient is an invalid address, then it is not possible to encrypt a message for\n                    // them because we cannot establish a shared secret. This is never expected to occur during normal\n                    // operation. However, it is technically possible for us to receive an invalid address, and we must\n                    // therefore handle it. We could simply fail, but that'd introduce a potential security issue in\n                    // which an attacker forces a contract to encrypt a message for an invalid address, resulting in an\n                    // impossible transaction - this is sometimes called a 'king of the hill' attack. We choose instead\n                    // to not fail and encrypt the plaintext regardless using the shared secret that results from a\n                    // random valid address. The sender is free to choose this address and hence shared secret, but\n                    // this has no security implications as they already know not only the full plaintext but also the\n                    // ephemeral private key anyway.\n                    unsafe {\n                        random_address_point()\n                    }\n                })\n                .inner,\n        );\n\n        let s_app = compute_app_siloed_shared_secret(raw_shared_secret, contract_address);\n\n        // It is safe to derive AES keys from `s_app` using Poseidon2 because `s_app` was derived from an ECDH shared\n        // secret using an AztecAddress (the recipient). See the block comment in\n        // `extract_many_close_to_uniformly_random_256_bits_using_poseidon2` for more info.\n        let pairs = derive_aes_symmetric_key_and_iv_from_shared_secret::<2>(s_app);\n        let (body_sym_key, body_iv) = pairs[0];\n        let (header_sym_key, header_iv) = pairs[1];\n\n        let ciphertext_bytes = aes128_encrypt(plaintext_bytes, body_iv, body_sym_key);\n\n        // Each plaintext field is 32 bytes (a multiple of the 16-byte AES block\n        // size), so PKCS#7 always appends a full 16-byte padding block:\n        //   |ciphertext| = PlaintextLen*32 + 16 = 16 * (1 + PlaintextLen*32 / 16)\n        std::static_assert(\n            ciphertext_bytes.len() == 16 * (1 + (PlaintextLen * 32) / 16),\n            \"unexpected ciphertext length\",\n        );\n\n        // Encrypt a 2-byte header containing the body ciphertext length.\n        let header_plaintext = encode_header(ciphertext_bytes.len());\n\n        // Note: the aes128_encrypt builtin fn automatically appends bytes to the input, according to pkcs#7; hence why\n        // the output `header_ciphertext_bytes` is 16 bytes larger than the input in this case.\n        let header_ciphertext_bytes = aes128_encrypt(header_plaintext, header_iv, header_sym_key);\n        // Verify expected header ciphertext size at compile time.\n        std::static_assert(\n            header_ciphertext_bytes.len() == HEADER_CIPHERTEXT_SIZE_IN_BYTES,\n            \"unexpected ciphertext header length\",\n        );\n\n        // Assemble the message byte array:\n        //  [header_ct (16B)] [body_ct] [padding to mult of 31]\n        let message_bytes_padding_to_mult_31 = get_arr_of_size__message_bytes_padding__from_PT::<PlaintextLen * 32>();\n\n        let mut message_bytes = get_arr_of_size__message_bytes__from_PT::<PlaintextLen * 32>();\n\n        std::static_assert(\n            message_bytes.len() % 31 == 0,\n            \"Unexpected error: message_bytes.len() should be divisible by 31, by construction.\",\n        );\n\n        let mut offset = 0;\n        for i in 0..header_ciphertext_bytes.len() {\n            message_bytes[offset + i] = header_ciphertext_bytes[i];\n        }\n        offset += header_ciphertext_bytes.len();\n\n        for i in 0..ciphertext_bytes.len() {\n            message_bytes[offset + i] = ciphertext_bytes[i];\n        }\n        offset += ciphertext_bytes.len();\n\n        for i in 0..message_bytes_padding_to_mult_31.len() {\n            message_bytes[offset + i] = message_bytes_padding_to_mult_31[i];\n        }\n        offset += message_bytes_padding_to_mult_31.len();\n\n        // Ideally we would be able to have a static assert where we check that the offset would be such that we've\n        // written to the entire log_bytes array, but we cannot since Noir does not treat the offset as a comptime\n        // value (despite the values that it goes through being known at each stage). We instead check that the\n        // computation used to obtain the offset computes the expected value (which we _can_ do in a static check), and\n        // then add a cheap runtime check to also validate that the offset matches this.\n        std::static_assert(\n            header_ciphertext_bytes.len() + ciphertext_bytes.len() + message_bytes_padding_to_mult_31.len()\n                == message_bytes.len(),\n            \"unexpected message length\",\n        );\n        assert(offset == message_bytes.len(), \"unexpected encrypted message length\");\n\n        // Pack message bytes into fields (31 bytes per field) and prepend eph_pk.x.\n        let message_bytes_as_fields = encode_bytes_as_fields(message_bytes);\n\n        let mut ciphertext: [Field; MESSAGE_CIPHERTEXT_LEN] = [0; MESSAGE_CIPHERTEXT_LEN];\n\n        ciphertext[0] = eph_pk.x;\n\n        // Mask each content field with a Poseidon2-derived value, so that they appear as uniformly random `Field`\n        // values\n        let mut offset = 1;\n        for i in 0..message_bytes_as_fields.len() {\n            let mask = derive_shared_secret_field_mask(s_app, i as u32);\n            ciphertext[offset + i] = message_bytes_as_fields[i] + mask;\n        }\n        offset += message_bytes_as_fields.len();\n\n        // Pad with random fields so that padding is indistinguishable from masked data fields.\n        for i in offset..MESSAGE_CIPHERTEXT_LEN {\n            // Safety: we assume that the sender wants for the message to be private - a malicious one could simply\n            // reveal its contents publicly. It is therefore fine to trust the sender to provide random padding.\n            ciphertext[i] = unsafe { random() };\n        }\n\n        ciphertext\n    }\n\n    unconstrained fn decrypt(\n        ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n        recipient: AztecAddress,\n        contract_address: AztecAddress,\n    ) -> Option<BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>> {\n        // Extract the ephemeral public key x-coordinate and masked fields, returning None for empty ciphertext.\n        if ciphertext.len() > 0 {\n            let masked_fields: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS> =\n                array::subbvec(ciphertext, EPH_PK_X_SIZE_IN_FIELDS);\n            Option::some((ciphertext.get(0), masked_fields))\n        } else {\n            Option::none()\n        }\n            .and_then(|(eph_pk_x, masked_fields)| {\n                // With the x-coordinate of the ephemeral public key we can reconstruct the point as we know that the\n                // y-coordinate must be positive. This may fail however, as not all x-coordinates are on the curve. In\n                // that case, we simply return `Option::none`.\n                point_from_x_coord_and_sign(eph_pk_x, true).and_then(|eph_pk| {\n                    let s_app = get_shared_secret(recipient, eph_pk, contract_address);\n\n                    let unmasked_fields = masked_fields.mapi(|i, field| {\n                        let unmasked = unmask_field(s_app, i, field);\n                        // If we failed to unmask the field, we are dealing with the random padding. We'll ignore it\n                        // later, so we can simply set it to 0\n                        unmasked.unwrap_or(0)\n                    });\n                    let ciphertext_without_eph_pk_x = decode_bytes_from_fields(unmasked_fields);\n\n                    // Derive symmetric keys:\n                    let pairs = derive_aes_symmetric_key_and_iv_from_shared_secret::<2>(s_app);\n                    let (body_sym_key, body_iv) = pairs[0];\n                    let (header_sym_key, header_iv) = pairs[1];\n\n                    // Extract the header ciphertext\n                    let header_start = 0;\n                    let header_ciphertext: [u8; HEADER_CIPHERTEXT_SIZE_IN_BYTES] =\n                        array::subarray(ciphertext_without_eph_pk_x.storage(), header_start);\n                    // We need to convert the array to a BoundedVec because the oracle expects a BoundedVec as it's\n                    // designed to work with messages with unknown length at compile time. This would not be necessary\n                    // here as the header ciphertext length is fixed. But we do it anyway to not have to have duplicate\n                    // oracles.\n                    let header_ciphertext_bvec =\n                        BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::from_array(header_ciphertext);\n\n                    try_aes128_decrypt(header_ciphertext_bvec, header_iv, header_sym_key)\n                    // Extract ciphertext length from header (2 bytes, big-endian)\n                    .and_then(|header_plaintext| extract_ciphertext_length(header_plaintext))\n                        .filter(|ciphertext_length| ciphertext_length <= MESSAGE_PLAINTEXT_SIZE_IN_BYTES)\n                        .map(|ciphertext_length| {\n                            // Extract and decrypt main ciphertext\n                            let ciphertext_start = header_start + HEADER_CIPHERTEXT_SIZE_IN_BYTES;\n                            let ciphertext_with_padding: [u8; MESSAGE_PLAINTEXT_SIZE_IN_BYTES] =\n                                array::subarray(ciphertext_without_eph_pk_x.storage(), ciphertext_start);\n                            BoundedVec::from_parts(ciphertext_with_padding, ciphertext_length)\n                        })\n                        // Decrypt main ciphertext and return it\n                        .and_then(|ciphertext| try_aes128_decrypt(ciphertext, body_iv, body_sym_key))\n                        // Convert bytes back to fields (32 bytes per field). Returns None if the actual bytes are\n                        // not valid.\n                        .and_then(|plaintext_bytes| try_decode_fields_from_bytes(plaintext_bytes))\n                })\n            })\n    }\n}\n\n/// Encodes the body ciphertext length into a 2-byte big-endian header.\nfn encode_header(ciphertext_length: u32) -> [u8; 2] {\n    [(ciphertext_length >> 8) as u8, ciphertext_length as u8]\n}\n\n/// Extracts the body ciphertext length from a decrypted header as a 2-byte big-endian integer.\n///\n/// Returns `Option::none()` if the header has fewer than 2 bytes.\nunconstrained fn extract_ciphertext_length<let N: u32>(header: BoundedVec<u8, N>) -> Option<u32> {\n    if header.len() >= 2 {\n        Option::some(((header.get(0) as u32) << 8) | (header.get(1) as u32))\n    } else {\n        Option::none()\n    }\n}\n\n/// 2^248: upper bound for values that fit in 31 bytes\nglobal TWO_POW_248: Field = 2.pow_32(248);\n\n/// Removes the Poseidon2-derived mask from a ciphertext field. Returns the unmasked value if it fits in 31 bytes\n/// (a content field), or `None` if it doesn't (random padding). Unconstrained to prevent accidental use in\n/// constrained context.\nunconstrained fn unmask_field(s_app: Field, index: u32, masked: Field) -> Option<Field> {\n    let unmasked = masked - derive_shared_secret_field_mask(s_app, index);\n    if unmasked.lt(TWO_POW_248) {\n        Option::some(unmasked)\n    } else {\n        Option::none()\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::{compute_app_siloed_shared_secret, derive_ecdh_shared_secret},\n        messages::{\n            encoding::{HEADER_CIPHERTEXT_SIZE_IN_BYTES, MESSAGE_PLAINTEXT_LEN, MESSAGE_PLAINTEXT_SIZE_IN_BYTES},\n            encryption::message_encryption::MessageEncryption,\n        },\n        test::helpers::test_environment::TestEnvironment,\n    };\n    use crate::protocol::{address::AztecAddress, traits::FromField};\n    use super::{AES128, encode_header, 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(|context| {\n            let contract_address = context.this_address();\n            let plaintext = [1, 2, 3];\n\n            let recipient = AztecAddress::from_field(\n                0x25afb798ea6d0b8c1618e50fdeafa463059415013d3b7c75d46abf5e242be70c,\n            );\n\n            // Mock random values for deterministic test\n            let eph_sk = 0x1358d15019d4639393d62b97e1588c095957ce74a1c32d6ec7d62fe6705d9538;\n            let _ = OracleMock::mock(\"aztec_utl_getRandomField\").returns(eph_sk).times(1);\n\n            let randomness = 0x0101010101010101010101010101010101010101010101010101010101010101;\n            let _ = OracleMock::mock(\"aztec_utl_getRandomField\").returns(randomness).times(1000000);\n\n            let _ = OracleMock::mock(\"aztec_prv_getNextAppTagAsSender\").returns(42);\n\n            // Encrypt the message\n            let encrypted_message = BoundedVec::from_array(AES128::encrypt(plaintext, recipient, contract_address));\n\n            // Compute the same app-siloed shared secret that the oracle would return\n            let raw_shared_secret = derive_ecdh_shared_secret(\n                EmbeddedCurveScalar::from_field(eph_sk),\n                recipient.to_address_point().unwrap().inner,\n            );\n            let s_app = compute_app_siloed_shared_secret(raw_shared_secret, contract_address);\n\n            let _ = OracleMock::mock(\"aztec_utl_getSharedSecret\").returns(s_app);\n\n            // Decrypt the message\n            let decrypted = AES128::decrypt(encrypted_message, recipient, contract_address).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(|context| {\n            let contract_address = context.this_address();\n            let plaintext = [1, 2, 3];\n            let ciphertext = AES128::encrypt(plaintext, recipient, contract_address);\n\n            assert_eq(\n                AES128::decrypt(\n                    BoundedVec::from_array(ciphertext),\n                    recipient,\n                    contract_address,\n                )\n                    .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        let contract_address = AztecAddress { inner: 42 };\n\n        let _ = AES128::encrypt([1, 2, 3, 4], invalid_address, contract_address);\n    }\n\n    // Documents the PKCS#7 padding behavior that `encrypt` relies on (see its static_assert).\n    #[test]\n    fn pkcs7_padding_always_adds_at_least_one_byte() {\n        let key = [0 as u8; 16];\n        let iv = [0 as u8; 16];\n\n        // 1 byte input + 15 bytes padding = 16 bytes\n        assert_eq(std::aes128::aes128_encrypt([0; 1], iv, key).len(), 16);\n\n        // 15 bytes input + 1 byte padding = 16 bytes\n        assert_eq(std::aes128::aes128_encrypt([0; 15], iv, key).len(), 16);\n\n        // 16 bytes input (block-aligned) + full 16-byte padding block = 32 bytes\n        assert_eq(std::aes128::aes128_encrypt([0; 16], iv, key).len(), 32);\n    }\n\n    #[test]\n    unconstrained fn encrypt_decrypt_max_size_plaintext() {\n        let mut env = TestEnvironment::new();\n        let recipient = env.create_light_account();\n\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let mut plaintext = [0; MESSAGE_PLAINTEXT_LEN];\n            for i in 0..MESSAGE_PLAINTEXT_LEN {\n                plaintext[i] = i as Field;\n            }\n            let ciphertext = AES128::encrypt(plaintext, recipient, contract_address);\n\n            assert_eq(\n                AES128::decrypt(\n                    BoundedVec::from_array(ciphertext),\n                    recipient,\n                    contract_address,\n                )\n                    .unwrap(),\n                BoundedVec::from_array(plaintext),\n            );\n        });\n    }\n\n    #[test(should_fail_with = \"Plaintext length exceeds MESSAGE_PLAINTEXT_LEN\")]\n    unconstrained fn encrypt_oversized_plaintext() {\n        let address = AztecAddress { inner: 3 };\n        let contract_address = AztecAddress { inner: 42 };\n        let plaintext: [Field; MESSAGE_PLAINTEXT_LEN + 1] = [0; MESSAGE_PLAINTEXT_LEN + 1];\n        let _ = AES128::encrypt(plaintext, address, contract_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(|context| {\n            let contract_address = context.this_address();\n            let plaintext = [1, 2, 3, 4];\n            let ciphertext = AES128::encrypt(plaintext, recipient, contract_address);\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, contract_address).is_none());\n        });\n    }\n\n    #[test]\n    unconstrained fn decrypt_returns_none_on_empty_ciphertext() {\n        let mut env = TestEnvironment::new();\n        let recipient = env.create_light_account();\n\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            assert(AES128::decrypt(BoundedVec::new(), recipient, contract_address).is_none());\n        });\n    }\n\n    // Mocks the header AES decrypt oracle to return an empty result. The TS oracle never throws on invalid\n    // input: it decrypts to garbage bytes or returns empty\n    #[test]\n    unconstrained fn decrypt_returns_none_on_empty_header() {\n        let mut env = TestEnvironment::new();\n        let recipient = env.create_light_account();\n\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let plaintext = [1, 2, 3];\n            let ciphertext = BoundedVec::from_array(AES128::encrypt(plaintext, recipient, contract_address));\n\n            let empty_header = BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::new();\n            let _ = OracleMock::mock(\"aztec_utl_decryptAes128\").returns(Option::some(empty_header)).times(1);\n\n            assert(AES128::decrypt(ciphertext, recipient, contract_address).is_none());\n        });\n    }\n\n    // Mocks the header oracle to return a 2-byte header that decodes to a ciphertext_length one past the maximum\n    // allowed value, verifying the edge case is handled correctly.\n    #[test]\n    unconstrained fn decrypt_returns_none_on_oversized_ciphertext_length() {\n        let mut env = TestEnvironment::new();\n        let recipient = env.create_light_account();\n\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let plaintext = [1, 2, 3];\n            let ciphertext = BoundedVec::from_array(AES128::encrypt(plaintext, recipient, contract_address));\n\n            let bad_header = BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::from_array(encode_header(\n                MESSAGE_PLAINTEXT_SIZE_IN_BYTES + 1,\n            ));\n            let _ = OracleMock::mock(\"aztec_utl_decryptAes128\").returns(Option::some(bad_header)).times(1);\n\n            assert(AES128::decrypt(ciphertext, recipient, contract_address).is_none());\n        });\n    }\n\n}\n"
     },
     "138": {
       "function_locations": [
@@ -4301,127 +4297,123 @@
         },
         {
           "name": "pedersen_hash",
-          "start": 2460
+          "start": 2380
         },
         {
           "name": "pedersen_hash_with_separator",
-          "start": 2617
+          "start": 2537
         },
         {
           "name": "derive_generators",
-          "start": 3597
+          "start": 3531
         },
         {
           "name": "__derive_generators",
-          "start": 3956
-        },
-        {
-          "name": "from_field_unsafe",
-          "start": 4271
+          "start": 3890
         },
         {
           "name": "poseidon2_permutation",
-          "start": 4912
+          "start": 3968
         },
         {
           "name": "poseidon2_permutation_internal",
-          "start": 5268
+          "start": 4324
         },
         {
           "name": "poseidon2_config_state_size",
-          "start": 5361
+          "start": 4417
         },
         {
           "name": "derive_hash",
-          "start": 5672
+          "start": 4728
         },
         {
           "name": "<impl BuildHasher for BuildHasherDefault<H>>::build_hasher",
-          "start": 6897
+          "start": 5953
         },
         {
           "name": "<impl Default for BuildHasherDefault<H>>::default",
-          "start": 7029
+          "start": 6085
         },
         {
           "name": "<impl Hash for Field>::hash",
-          "start": 7161
+          "start": 6217
         },
         {
           "name": "<impl Hash for u8>::hash",
-          "start": 7291
+          "start": 6347
         },
         {
           "name": "<impl Hash for u16>::hash",
-          "start": 7431
+          "start": 6487
         },
         {
           "name": "<impl Hash for u32>::hash",
-          "start": 7571
+          "start": 6627
         },
         {
           "name": "<impl Hash for u64>::hash",
-          "start": 7711
+          "start": 6767
         },
         {
           "name": "<impl Hash for u128>::hash",
-          "start": 7852
+          "start": 6908
         },
         {
           "name": "<impl Hash for i8>::hash",
-          "start": 7991
+          "start": 7047
         },
         {
           "name": "<impl Hash for i16>::hash",
-          "start": 8137
+          "start": 7193
         },
         {
           "name": "<impl Hash for i32>::hash",
-          "start": 8284
+          "start": 7340
         },
         {
           "name": "<impl Hash for i64>::hash",
-          "start": 8431
+          "start": 7487
         },
         {
           "name": "<impl Hash for bool>::hash",
-          "start": 8579
+          "start": 7635
         },
         {
           "name": "<impl Hash for ()>::hash",
-          "start": 8726
+          "start": 7782
         },
         {
           "name": "<impl Hash for [T; N]>::hash",
-          "start": 8858
+          "start": 7914
         },
         {
           "name": "<impl Hash for [T]>::hash",
-          "start": 9047
+          "start": 8103
         },
         {
           "name": "<impl Hash for (A, B)>::hash",
-          "start": 9287
+          "start": 8343
         },
         {
           "name": "<impl Hash for (A, B, C)>::hash",
-          "start": 9503
+          "start": 8559
         },
         {
           "name": "<impl Hash for (A, B, C, D)>::hash",
-          "start": 9766
+          "start": 8822
         },
         {
           "name": "<impl Hash for (A, B, C, D, E)>::hash",
-          "start": 10076
+          "start": 9132
         },
         {
           "name": "assert_pedersen",
-          "start": 10472
+          "start": 9528
         }
       ],
       "path": "std/hash/mod.nr",
-      "source": "// Exposed only for usage in `std::meta`\npub(crate) mod poseidon2;\n\nuse crate::default::Default;\nuse crate::embedded_curve_ops::{\n    EmbeddedCurvePoint, EmbeddedCurveScalar, multi_scalar_mul, multi_scalar_mul_array_return,\n};\nuse crate::meta::derive_via;\nuse crate::static_assert;\n\n/// The size of the state accepted by the backend in `poseidon2_permutation`.\nglobal POSEIDON2_CONFIG_STATE_SIZE: u32 = poseidon2_config_state_size();\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]) -> [Field; N] {\n    static_assert(\n        N == POSEIDON2_CONFIG_STATE_SIZE,\n        f\"the input length must equal the state size in the Poseidon2 config; expected {POSEIDON2_CONFIG_STATE_SIZE}, got {N}\",\n    );\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#[foreign(poseidon2_config_state_size)]\ncomptime fn poseidon2_config_state_size() -> u32 {}\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    /// Returns the hash value without consuming the hasher.\n    /// Override this for more efficient implementations that avoid copying.\n    /// TODO: deprecate finish() and replace it\n    fn finish_ref(&self) -> Field {\n        (*self).finish()\n    }\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 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        },\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        },\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        },\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        },\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        },\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        },\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        },\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        },\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        },\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        },\n    );\n}\n"
+      "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;\nuse crate::static_assert;\n\n/// The size of the state accepted by the backend in `poseidon2_permutation`.\nglobal POSEIDON2_CONFIG_STATE_SIZE: u32 = poseidon2_config_state_size();\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        points[i] = EmbeddedCurveScalar::from_field(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] = EmbeddedCurveScalar::from_field(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\npub fn poseidon2_permutation<let N: u32>(input: [Field; N]) -> [Field; N] {\n    static_assert(\n        N == POSEIDON2_CONFIG_STATE_SIZE,\n        f\"the input length must equal the state size in the Poseidon2 config; expected {POSEIDON2_CONFIG_STATE_SIZE}, got {N}\",\n    );\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#[foreign(poseidon2_config_state_size)]\ncomptime fn poseidon2_config_state_size() -> u32 {}\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    /// Returns the hash value without consuming the hasher.\n    /// Override this for more efficient implementations that avoid copying.\n    /// TODO: deprecate finish() and replace it\n    fn finish_ref(&self) -> Field {\n        (*self).finish()\n    }\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 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        },\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        },\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        },\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        },\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        },\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        },\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        },\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        },\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        },\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        },\n    );\n}\n"
     },
     "180": {
       "function_locations": [
@@ -4774,74 +4766,78 @@
     "252": {
       "function_locations": [
         {
-          "name": "bytes_to_fields",
-          "start": 1015
+          "name": "encode_bytes_as_fields",
+          "start": 662
         },
         {
-          "name": "bytes_from_fields",
-          "start": 2146
+          "name": "decode_bytes_from_fields",
+          "start": 1313
         },
         {
-          "name": "tests::random_bytes_to_fields_and_back",
-          "start": 2784
+          "name": "tests::round_trips_bytes",
+          "start": 1719
         },
         {
-          "name": "tests::bytes_to_fields_input_length_not_multiple_of_31",
-          "start": 3545
+          "name": "tests::encode_rejects_length_not_multiple_of_31",
+          "start": 2252
+        },
+        {
+          "name": "tests::decode_rejects_oversized_field",
+          "start": 2454
         }
       ],
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/bytes_to_fields.nr",
-      "source": "use std::static_assert;\n\n// These functions are used to facilitate the conversion of log ciphertext between byte and field representations.\n//\n// `bytes_to_fields` uses fixed-size arrays since encryption contexts have compile-time size information.\n// `bytes_from_fields` uses BoundedVec for flexibility in unconstrained contexts where sizes are dynamic.\n//\n// Together they provide bidirectional conversion between bytes and fields when processing encrypted logs.\n\n/// Converts the input bytes into an array of fields. A Field is ~254 bits meaning that each field can store 31 whole\n/// bytes. Use `bytes_from_fields` to obtain the original bytes array.\n///\n/// The input bytes are chunked into chunks of 31 bytes. Each 31-byte chunk is viewed as big-endian, and is converted\n/// into a Field. For example, [1, 10, 3, ..., 0] (31 bytes) is encoded as [1 * 256^30 + 10 * 256^29 + 3 * 256^28 + ...\n/// + 0] Note: N must be a multiple of 31 bytes\npub fn bytes_to_fields<let N: u32>(bytes: [u8; N]) -> [Field; N / 31] {\n    // Assert that N is a multiple of 31\n    static_assert(N % 31 == 0, \"N must be a multiple of 31\");\n\n    let mut fields = [0; N / 31];\n\n    // Since N is a multiple of 31, we can simply process all chunks fully\n    for i in 0..N / 31 {\n        let mut field = 0;\n        for j in 0..31 {\n            // Shift the existing value left by 8 bits and add the new byte\n            field = field * 256 + bytes[i * 31 + j] as Field;\n        }\n        fields[i] = field;\n    }\n\n    fields\n}\n\n/// Converts an input BoundedVec of fields into a BoundedVec of bytes in big-endian order. Arbitrary Field arrays are\n/// not allowed: this is assumed to be an array obtained via `bytes_to_fields`, i.e. one that actually represents\n/// bytes. To convert a Field array into bytes, use `fields_to_bytes`.\n///\n/// Each input field must contain at most 31 bytes (this is constrained to be so). Each field is converted into 31\n/// big-endian bytes, and the resulting 31-byte chunks are concatenated back together in the order of the original\n/// fields.\npub fn bytes_from_fields<let N: u32>(fields: BoundedVec<Field, N>) -> BoundedVec<u8, N * 31> {\n    let mut bytes = BoundedVec::new();\n\n    for i in 0..fields.len() {\n        let field = fields.get(i);\n\n        // We expect that the field contains at most 31 bytes of information.\n        field.assert_max_bit_size::<248>();\n\n        // Now we can safely convert the field to 31 bytes.\n        let field_as_bytes: [u8; 31] = field.to_be_bytes();\n\n        for j in 0..31 {\n            bytes.push(field_as_bytes[j]);\n        }\n    }\n\n    bytes\n}\n\nmod tests {\n    use crate::utils::array::subarray;\n    use super::{bytes_from_fields, bytes_to_fields};\n\n    #[test]\n    unconstrained fn random_bytes_to_fields_and_back(input: [u8; 93]) {\n        let fields = bytes_to_fields(input);\n\n        // At this point in production, the log flies through the system and we get a BoundedVec on the other end. So\n        // we need to convert the field array to a BoundedVec to be able to feed it to the `bytes_from_fields`\n        // function.\n        let fields_as_bounded_vec = BoundedVec::<_, 6>::from_array(fields);\n\n        let bytes_back = bytes_from_fields(fields_as_bounded_vec);\n\n        // Compare the original input with the round-tripped result\n        assert_eq(bytes_back.len(), input.len());\n        assert_eq(subarray(bytes_back.storage(), 0), input);\n    }\n\n    #[test(should_fail_with = \"N must be a multiple of 31\")]\n    unconstrained fn bytes_to_fields_input_length_not_multiple_of_31() {\n        // Try to convert 32 bytes (not a multiple of 31) to fields\n        let _fields = bytes_to_fields([0; 32]);\n    }\n\n}\n"
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/bytes_as_fields.nr",
+      "source": "use std::static_assert;\n\n/// Encodes an array of bytes as fields.\n///\n/// Use\n/// [`decode_bytes_from_fields`](crate::utils::conversion::bytes_as_fields::decode_bytes_from_fields) to recover\n/// the original bytes.\n///\n/// The `bytes` array length must be a multiple of 31. If padding is added, it will need to be manually removed\n/// after decoding.\n///\n/// ## Encoding\n///\n/// Each 31-byte chunk is interpreted as a big-endian integer and stored in a `Field`. For input `[1, 10, 3, ..., 0]`\n/// (31 bytes), the resulting `Field` is `1 * 256^30 + 10 * 256^29 + 3 * 256^28 + ... + 0`.\npub fn encode_bytes_as_fields<let N: u32>(bytes: [u8; N]) -> [Field; N / 31] {\n    static_assert(N % 31 == 0, \"N must be a multiple of 31\");\n\n    let mut fields = [0; N / 31];\n    for i in 0..N / 31 {\n        let mut field = 0;\n        for j in 0..31 {\n            field = field * 256 + bytes[i * 31 + j] as Field;\n        }\n        fields[i] = field;\n    }\n\n    fields\n}\n\n/// Decodes fields back into bytes.\n///\n/// Inverse of\n/// [`encode_bytes_as_fields`](crate::utils::conversion::bytes_as_fields::encode_bytes_as_fields).\n/// Each input `Field` must fit in 248 bits; `Field::to_be_bytes::<31>()` fails the proof otherwise.\npub fn decode_bytes_from_fields<let N: u32>(fields: BoundedVec<Field, N>) -> BoundedVec<u8, N * 31> {\n    let mut bytes = BoundedVec::new();\n    for i in 0..fields.len() {\n        let chunk: [u8; 31] = fields.get(i).to_be_bytes();\n        for j in 0..31 {\n            bytes.push(chunk[j]);\n        }\n    }\n    bytes\n}\n\nmod tests {\n    use crate::utils::array::subarray;\n    use super::{decode_bytes_from_fields, encode_bytes_as_fields};\n\n    #[test]\n    unconstrained fn round_trips_bytes(input: [u8; 93]) {\n        let fields = encode_bytes_as_fields(input);\n\n        // In production the fields fly through the system and arrive as a BoundedVec on the other end.\n        let fields_bvec = BoundedVec::<_, 6>::from_array(fields);\n        let bytes_back = decode_bytes_from_fields(fields_bvec);\n\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 encode_rejects_length_not_multiple_of_31() {\n        let _fields = encode_bytes_as_fields([0; 32]);\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 31 limbs\")]\n    unconstrained fn decode_rejects_oversized_field() {\n        // `Field::to_be_bytes::<31>()` fails the proof when a field has any bit above position 247 set.\n        let oversized: Field = (1 as Field) * 2.pow_32(249);\n        let input = BoundedVec::<_, 1>::from_array([oversized]);\n        let _bytes = decode_bytes_from_fields(input);\n    }\n}\n"
     },
     "253": {
       "function_locations": [
         {
-          "name": "fields_to_bytes",
-          "start": 1237
+          "name": "encode_fields_as_bytes",
+          "start": 1007
         },
         {
-          "name": "fields_from_bytes",
-          "start": 2217
+          "name": "decode_fields_from_bytes",
+          "start": 1603
         },
         {
-          "name": "try_field_from_be_bytes",
-          "start": 2679
+          "name": "try_decode_fields_from_bytes",
+          "start": 2190
         },
         {
-          "name": "try_fields_from_bytes",
-          "start": 3812
+          "name": "try_decode_field_from_bytes",
+          "start": 2829
         },
         {
-          "name": "tests::random_fields_to_bytes_and_back",
-          "start": 4522
+          "name": "tests::round_trips_fields",
+          "start": 3733
         },
         {
-          "name": "tests::to_fields_assert",
-          "start": 5401
+          "name": "tests::try_decode_returns_none_on_length_not_multiple_of_32",
+          "start": 4320
         },
         {
-          "name": "tests::fields_from_bytes_max_value",
-          "start": 5862
+          "name": "tests::try_decode_accepts_max_field",
+          "start": 4528
         },
         {
-          "name": "tests::fields_from_bytes_overflow",
-          "start": 6490
+          "name": "tests::try_decode_returns_none_on_chunk_above_modulus",
+          "start": 5063
         },
         {
-          "name": "tests::try_fields_from_bytes_returns_none_on_unaligned_length",
-          "start": 7485
+          "name": "tests::try_decode_returns_none_on_chunk_equal_to_modulus",
+          "start": 5718
         },
         {
-          "name": "tests::try_fields_from_bytes_returns_none_on_field_modulus",
-          "start": 7709
+          "name": "tests::decode_asserts_length_multiple_of_32",
+          "start": 6128
         },
         {
-          "name": "tests::try_fields_from_bytes_round_trips",
-          "start": 8066
+          "name": "tests::decode_panics_on_chunk_above_modulus",
+          "start": 6544
         }
       ],
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/fields_to_bytes.nr",
-      "source": "// These functions are used to facilitate the conversion of log plaintext represented as fields into bytes and back.\n//\n// `fields_to_bytes` uses fixed-size arrays since encryption contexts have compile-time size information.\n// `fields_from_bytes` uses BoundedVec for flexibility in unconstrained contexts where sizes are dynamic.\n//\n// Together they provide bidirectional conversion between fields and bytes.\n\n/// Converts an input array of fields into a single array of bytes. Use `fields_from_bytes` to obtain the original\n/// field array. Each field is converted to a 32-byte big-endian array.\n///\n/// For example, if you have a field array [123, 456], it will be converted to a 64-byte array:\n/// [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,123,  // First field (32 bytes)\n/// 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,200]  // Second field (32 bytes)\n///\n/// Since a field is ~254 bits, you'll end up with a subtle 2-bit \"gap\" at the big end, every 32 bytes. Be careful that\n/// such a gap doesn't leak information! This could happen if you for example expected the output to be\n/// indistinguishable from random bytes.\npub fn fields_to_bytes<let N: u32>(fields: [Field; N]) -> [u8; 32 * N] {\n    let mut bytes = [0; 32 * N];\n\n    for i in 0..N {\n        let field_as_bytes: [u8; 32] = fields[i].to_be_bytes();\n\n        for j in 0..32 {\n            bytes[i * 32 + j] = field_as_bytes[j];\n        }\n    }\n\n    bytes\n}\n\n/// Converts an input BoundedVec of bytes into a BoundedVec of fields. Arbitrary byte arrays are not allowed: this is\n/// assumed to be an array obtained via `fields_to_bytes`, i.e. one that actually represents fields. To convert a byte\n/// array into Fields, use `bytes_to_fields`.\n///\n/// The input bytes are chunked into chunks of 32 bytes. Each 32-byte chunk is viewed as big-endian, and is converted\n/// into a Field. For example, [1, 10, 3, ..., 0] (32 bytes) is encoded as [1 * 256^31 + 10 * 256^30 + 3 * 256^29 + ...\n/// + 0] Note 1: N must be a multiple of 32 bytes Note 2: The max value check code was taken from\n/// std::field::to_be_bytes function.\npub fn fields_from_bytes<let N: u32>(bytes: BoundedVec<u8, N>) -> BoundedVec<Field, N / 32> {\n    // Assert that input length is a multiple of 32\n    assert(bytes.len() % 32 == 0, \"Input length must be a multiple of 32\");\n\n    try_fields_from_bytes(bytes).expect(f\"Value does not fit in field\")\n}\n\n/// Converts a single 32-byte big-endian chunk (starting at `offset`) into a Field, returning\n/// `Option::none()` if the chunk's value is >= the field modulus.\nfn try_field_from_be_bytes<let N: u32>(bytes: BoundedVec<u8, N>, offset: u32) -> Option<Field> {\n    let p = std::field::modulus_be_bytes();\n    let mut field = 0;\n    // Field arithmetic silently wraps values >= the modulus, so we compare each 32-byte chunk against\n    // the modulus byte-by-byte (big-endian, most significant first). The first byte that differs\n    // determines the result: if our byte is smaller we're valid, if larger we've overflowed.\n    // cmp tracks the result: 0 = equal so far, 1 = less than modulus, 2 = exceeds modulus.\n    let mut cmp: u8 = 0;\n    for j in 0..32 {\n        let byte = bytes.get(offset + j);\n        field = field * 256 + byte as Field;\n\n        if cmp == 0 {\n            if byte < p[j] {\n                cmp = 1;\n            } else if byte > p[j] {\n                cmp = 2;\n            }\n        }\n    }\n    if cmp == 1 {\n        Option::some(field)\n    } else {\n        Option::none()\n    }\n}\n\n/// Non-panicking version of `fields_from_bytes`. Returns `Option::none()` if the input\n/// length is not a multiple of 32 or if any 32-byte chunk exceeds the field modulus.\npub(crate) fn try_fields_from_bytes<let N: u32>(bytes: BoundedVec<u8, N>) -> Option<BoundedVec<Field, N / 32>> {\n    if bytes.len() % 32 == 0 {\n        let mut fields = BoundedVec::new();\n        let num_chunks = bytes.len() / 32;\n        for i in 0..num_chunks {\n            let field = try_field_from_be_bytes(bytes, i * 32);\n            if field.is_some() {\n                fields.push(field.unwrap());\n            }\n        }\n        if fields.len() as u32 == num_chunks {\n            Option::some(fields)\n        } else {\n            Option::none()\n        }\n    } else {\n        Option::none()\n    }\n}\n\nmod tests {\n    use crate::utils::array::subarray;\n    use super::{fields_from_bytes, fields_to_bytes, try_fields_from_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    #[test]\n    unconstrained fn try_fields_from_bytes_returns_none_on_unaligned_length() {\n        let input = BoundedVec::<_, 64>::from_parts([0 as u8; 64], 33);\n        assert(try_fields_from_bytes(input).is_none());\n    }\n\n    #[test]\n    unconstrained fn try_fields_from_bytes_returns_none_on_field_modulus() {\n        // The field modulus itself is not a valid field value (it wraps to 0).\n        let p: [u8; 32] = std::field::modulus_be_bytes().as_array();\n        let input = BoundedVec::<u8, 32>::from_array(p);\n        assert(try_fields_from_bytes(input).is_none());\n    }\n\n    #[test]\n    unconstrained fn try_fields_from_bytes_round_trips(input: [Field; 3]) {\n        let bytes = BoundedVec::<_, 113>::from_array(fields_to_bytes(input));\n        let fields = try_fields_from_bytes(bytes).unwrap();\n\n        assert_eq(fields.len(), input.len());\n        assert_eq(subarray(fields.storage(), 0), input);\n    }\n}\n"
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/fields_as_bytes.nr",
+      "source": "/// Encodes an array of fields as bytes.\n///\n/// Losslessly preserves any field value; use\n/// [`try_decode_fields_from_bytes`](crate::utils::conversion::fields_as_bytes::try_decode_fields_from_bytes) to\n/// recover the original fields.\n///\n/// ## Encoding\n///\n/// Each field is written as 32 big-endian bytes and the chunks are concatenated. The field array `[5, 42]` becomes:\n///\n/// ```text\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,5,  // 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,0,42] // Second field (32 bytes)\n/// ```\n///\n/// ## Privacy\n///\n/// The BN254 modulus is `< 2^254`, so every 32-byte chunk has its top bit at zero and the next bit biased. The output\n/// is therefore distinguishable from uniform random bytes; take this into account when feeding it into anything that\n/// assumes uniform randomness (e.g. ciphertexts meant to look random).\npub fn encode_fields_as_bytes<let N: u32>(fields: [Field; N]) -> [u8; 32 * N] {\n    let mut bytes = [0; 32 * N];\n    for i in 0..N {\n        let chunk: [u8; 32] = fields[i].to_be_bytes();\n        for j in 0..32 {\n            bytes[i * 32 + j] = chunk[j];\n        }\n    }\n    bytes\n}\n\n/// Decodes bytes back into fields.\n///\n/// Panics if the input length is not a multiple of 32 or if any chunk exceeds the BN254 field modulus. See\n/// [`try_decode_fields_from_bytes`](crate::utils::conversion::fields_as_bytes::try_decode_fields_from_bytes)\n/// for a non-panicking variant.\npub fn decode_fields_from_bytes<let N: u32>(bytes: BoundedVec<u8, N>) -> BoundedVec<Field, N / 32> {\n    assert(bytes.len() % 32 == 0, \"Input length must be a multiple of 32\");\n    try_decode_fields_from_bytes(bytes).expect(f\"Value does not fit in field\")\n}\n\n/// Decodes bytes back into fields, returning None on failure.\n///\n/// Inverse of\n/// [`encode_fields_as_bytes`](crate::utils::conversion::fields_as_bytes::encode_fields_as_bytes).\n/// Returns `Option::none()` if the input length is not a multiple of 32, or if any 32-byte chunk is `>=` the BN254\n/// field modulus.\npub fn try_decode_fields_from_bytes<let N: u32>(bytes: BoundedVec<u8, N>) -> Option<BoundedVec<Field, N / 32>> {\n    if bytes.len() % 32 == 0 {\n        let num_chunks = bytes.len() / 32;\n        let mut fields: BoundedVec<Field, N / 32> = BoundedVec::new();\n        for i in 0..num_chunks {\n            let maybe_field = try_decode_field_from_bytes(bytes, i * 32);\n            if maybe_field.is_some() {\n                fields.push(maybe_field.unwrap());\n            }\n        }\n        if fields.len() == num_chunks {\n            Option::some(fields)\n        } else {\n            Option::none()\n        }\n    } else {\n        Option::none()\n    }\n}\n\nfn try_decode_field_from_bytes<let N: u32>(bytes: BoundedVec<u8, N>, offset: u32) -> Option<Field> {\n    // Field arithmetic silently wraps values >= the modulus, so we compare each chunk against the modulus\n    // byte-by-byte (big-endian) while building `field`. cmp: 0 = equal so far, 1 = less than modulus, 2 = exceeds.\n    let p = std::field::modulus_be_bytes();\n    let mut field = 0;\n    let mut cmp: u8 = 0;\n    for j in 0..32 {\n        let byte = bytes.get(offset + j);\n        field = field * 256 + byte as Field;\n        if cmp == 0 {\n            if byte < p[j] {\n                cmp = 1;\n            } else if byte > p[j] {\n                cmp = 2;\n            }\n        }\n    }\n\n    if cmp == 1 {\n        Option::some(field)\n    } else {\n        Option::none()\n    }\n}\n\nmod tests {\n    use crate::utils::array::subarray;\n    use super::{decode_fields_from_bytes, encode_fields_as_bytes, try_decode_fields_from_bytes};\n\n    #[test]\n    unconstrained fn round_trips_fields(input: [Field; 3]) {\n        let bytes = encode_fields_as_bytes(input);\n\n        // In production the bytes fly through the system and arrive as a BoundedVec on the other end. 113 is an\n        // arbitrary max length larger than the input length of 96.\n        let bytes_bvec = BoundedVec::<_, 113>::from_array(bytes);\n        let fields_back = try_decode_fields_from_bytes(bytes_bvec).unwrap();\n\n        assert_eq(fields_back.len(), input.len());\n        assert_eq(subarray(fields_back.storage(), 0), input);\n    }\n\n    #[test]\n    unconstrained fn try_decode_returns_none_on_length_not_multiple_of_32() {\n        let input = BoundedVec::<_, 64>::from_parts([0 as u8; 64], 33);\n        assert(try_decode_fields_from_bytes(input).is_none());\n    }\n\n    #[test]\n    unconstrained fn try_decode_accepts_max_field() {\n        // -1 in field arithmetic wraps to `modulus - 1`, the largest valid field 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 = try_decode_fields_from_bytes(input).unwrap();\n\n        assert_eq(fields.get(0), -1);\n    }\n\n    // Verifies the overflow check: take the max allowed value, bump a random byte, feed it in.\n    #[test]\n    unconstrained fn try_decode_returns_none_on_chunk_above_modulus(random_value: u8) {\n        let index_of_byte_to_bump = random_value % 32;\n        let max_field_value_as_bytes: [u8; 32] = (-1).to_be_bytes();\n        let byte_to_bump = max_field_value_as_bytes[index_of_byte_to_bump as u32];\n\n        // Skip if the selected byte is already 255. Acceptable under fuzz testing.\n        if byte_to_bump != 255 {\n            let mut input = BoundedVec::<_, 32>::from_array(max_field_value_as_bytes);\n            input.set(index_of_byte_to_bump as u32, byte_to_bump + 1);\n\n            assert(try_decode_fields_from_bytes(input).is_none());\n        }\n    }\n\n    #[test]\n    unconstrained fn try_decode_returns_none_on_chunk_equal_to_modulus() {\n        // The field modulus itself is not a valid field value (it wraps to 0).\n        let p: [u8; 32] = std::field::modulus_be_bytes().as_array();\n        let input = BoundedVec::<u8, 32>::from_array(p);\n        assert(try_decode_fields_from_bytes(input).is_none());\n    }\n\n    #[test(should_fail_with = \"Input length must be a multiple of 32\")]\n    unconstrained fn decode_asserts_length_multiple_of_32() {\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        let _fields = decode_fields_from_bytes(input);\n    }\n\n    #[test(should_fail_with = \"Value does not fit in field\")]\n    unconstrained fn decode_panics_on_chunk_above_modulus(random_value: u8) {\n        let index_of_byte_to_bump = random_value % 32;\n        let max_field_value_as_bytes: [u8; 32] = (-1).to_be_bytes();\n        let byte_to_bump = max_field_value_as_bytes[index_of_byte_to_bump as u32];\n\n        if byte_to_bump != 255 {\n            let mut input = BoundedVec::<_, 32>::from_array(max_field_value_as_bytes);\n            input.set(index_of_byte_to_bump as u32, byte_to_bump + 1);\n            let _fields = decode_fields_from_bytes(input);\n        }\n    }\n}\n"
     },
     "256": {
       "function_locations": [
@@ -6645,351 +6641,351 @@
         },
         {
           "name": "BoundedVec<T, MaxLen>::storage",
-          "start": 8407
+          "start": 8406
         },
         {
           "name": "BoundedVec<T, MaxLen>::extend_from_array",
-          "start": 8963
+          "start": 8962
         },
         {
           "name": "BoundedVec<T, MaxLen>::extend_from_vector",
-          "start": 9734
+          "start": 9733
         },
         {
           "name": "BoundedVec<T, MaxLen>::extend_from_bounded_vec",
-          "start": 10679
+          "start": 10678
         },
         {
           "name": "BoundedVec<T, MaxLen>::from_array",
-          "start": 13074
+          "start": 13073
         },
         {
           "name": "BoundedVec<T, MaxLen>::pop",
-          "start": 13817
+          "start": 13816
         },
         {
           "name": "BoundedVec<T, MaxLen>::any",
-          "start": 14440
+          "start": 14439
         },
         {
           "name": "BoundedVec<T, MaxLen>::map",
-          "start": 15356
+          "start": 15355
         },
         {
           "name": "BoundedVec<T, MaxLen>::mapi",
-          "start": 16356
+          "start": 16355
         },
         {
           "name": "BoundedVec<T, MaxLen>::for_each",
-          "start": 17314
+          "start": 17313
         },
         {
           "name": "BoundedVec<T, MaxLen>::for_eachi",
-          "start": 18119
+          "start": 18118
         },
         {
           "name": "BoundedVec<T, MaxLen>::from_parts",
-          "start": 19118
+          "start": 19117
         },
         {
           "name": "BoundedVec<T, MaxLen>::from_parts_unchecked",
-          "start": 20767
+          "start": 20766
         },
         {
           "name": "<impl Eq for BoundedVec<T, MaxLen>>::eq",
-          "start": 20979
+          "start": 20978
         },
         {
           "name": "<impl From<[T; Len]> for BoundedVec<T, MaxLen>>::from",
-          "start": 21550
+          "start": 21549
         },
         {
           "name": "bounded_vec_tests::get::panics_when_reading_elements_past_end_of_vec",
-          "start": 21833
+          "start": 21832
         },
         {
           "name": "bounded_vec_tests::get::panics_when_reading_beyond_length",
-          "start": 22068
+          "start": 22067
         },
         {
           "name": "bounded_vec_tests::get::get_works_within_bounds",
-          "start": 22243
+          "start": 22242
         },
         {
           "name": "bounded_vec_tests::get::get_unchecked_works",
-          "start": 22502
+          "start": 22501
         },
         {
           "name": "bounded_vec_tests::get::get_unchecked_works_past_len",
-          "start": 22746
+          "start": 22745
         },
         {
           "name": "bounded_vec_tests::set::set_updates_values_properly",
-          "start": 23019
+          "start": 23018
         },
         {
           "name": "bounded_vec_tests::set::panics_when_writing_elements_past_end_of_vec",
-          "start": 23657
+          "start": 23656
         },
         {
           "name": "bounded_vec_tests::set::panics_when_setting_beyond_length",
-          "start": 23892
+          "start": 23891
         },
         {
           "name": "bounded_vec_tests::set::set_unchecked_operations",
-          "start": 24067
+          "start": 24066
         },
         {
           "name": "bounded_vec_tests::set::set_unchecked_operations_past_len",
-          "start": 24399
+          "start": 24398
         },
         {
           "name": "bounded_vec_tests::set::set_preserves_other_elements",
-          "start": 24663
+          "start": 24662
         },
         {
           "name": "bounded_vec_tests::any::returns_false_if_predicate_not_satisfied",
-          "start": 25131
+          "start": 25130
         },
         {
           "name": "bounded_vec_tests::any::returns_true_if_predicate_satisfied",
-          "start": 25385
+          "start": 25384
         },
         {
           "name": "bounded_vec_tests::any::returns_false_on_empty_boundedvec",
-          "start": 25634
+          "start": 25633
         },
         {
           "name": "bounded_vec_tests::any::any_with_complex_predicates",
-          "start": 25845
+          "start": 25844
         },
         {
           "name": "bounded_vec_tests::any::any_with_partial_vector",
-          "start": 26208
+          "start": 26207
         },
         {
           "name": "bounded_vec_tests::map::applies_function_correctly",
-          "start": 26595
+          "start": 26594
         },
         {
           "name": "bounded_vec_tests::map::applies_function_that_changes_return_type",
-          "start": 27017
+          "start": 27016
         },
         {
           "name": "bounded_vec_tests::map::does_not_apply_function_past_len",
-          "start": 27365
+          "start": 27364
         },
         {
           "name": "bounded_vec_tests::map::map_with_conditional_logic",
-          "start": 27738
+          "start": 27737
         },
         {
           "name": "bounded_vec_tests::map::map_preserves_length",
-          "start": 28062
+          "start": 28061
         },
         {
           "name": "bounded_vec_tests::map::map_on_empty_vector",
-          "start": 28354
+          "start": 28353
         },
         {
           "name": "bounded_vec_tests::mapi::applies_function_correctly",
-          "start": 28728
+          "start": 28727
         },
         {
           "name": "bounded_vec_tests::mapi::applies_function_that_changes_return_type",
-          "start": 29161
+          "start": 29160
         },
         {
           "name": "bounded_vec_tests::mapi::does_not_apply_function_past_len",
-          "start": 29518
+          "start": 29517
         },
         {
           "name": "bounded_vec_tests::mapi::mapi_with_index_branching_logic",
-          "start": 29900
+          "start": 29899
         },
         {
           "name": "bounded_vec_tests::for_each::for_each_map",
-          "start": 30459
+          "start": 30458
         },
         {
           "name": "bounded_vec_tests::for_each::smoke_test",
-          "start": 30689
+          "start": 30688
         },
         {
           "name": "bounded_vec_tests::for_each::applies_function_correctly",
-          "start": 31097
+          "start": 31096
         },
         {
           "name": "bounded_vec_tests::for_each::applies_function_that_changes_return_type",
-          "start": 31431
+          "start": 31430
         },
         {
           "name": "bounded_vec_tests::for_each::does_not_apply_function_past_len",
-          "start": 31789
+          "start": 31788
         },
         {
           "name": "bounded_vec_tests::for_each::for_each_on_empty_vector",
-          "start": 32170
+          "start": 32169
         },
         {
           "name": "bounded_vec_tests::for_each::for_each_with_side_effects",
-          "start": 32456
+          "start": 32455
         },
         {
           "name": "bounded_vec_tests::for_eachi::for_eachi_mapi",
-          "start": 33013
+          "start": 33012
         },
         {
           "name": "bounded_vec_tests::for_eachi::smoke_test",
-          "start": 33250
+          "start": 33249
         },
         {
           "name": "bounded_vec_tests::for_eachi::applies_function_correctly",
-          "start": 33706
+          "start": 33705
         },
         {
           "name": "bounded_vec_tests::for_eachi::applies_function_that_changes_return_type",
-          "start": 34050
+          "start": 34049
         },
         {
           "name": "bounded_vec_tests::for_eachi::does_not_apply_function_past_len",
-          "start": 34418
+          "start": 34417
         },
         {
           "name": "bounded_vec_tests::for_eachi::for_eachi_on_empty_vector",
-          "start": 34805
+          "start": 34804
         },
         {
           "name": "bounded_vec_tests::for_eachi::for_eachi_with_index_tracking",
-          "start": 35098
+          "start": 35097
         },
         {
           "name": "bounded_vec_tests::from_array::empty",
-          "start": 35575
+          "start": 35574
         },
         {
           "name": "bounded_vec_tests::from_array::equal_len",
-          "start": 35885
+          "start": 35884
         },
         {
           "name": "bounded_vec_tests::from_array::max_len_greater_then_array_len",
-          "start": 36202
+          "start": 36201
         },
         {
           "name": "bounded_vec_tests::from_array::max_len_lower_then_array_len",
-          "start": 36673
+          "start": 36672
         },
         {
           "name": "bounded_vec_tests::from_array::from_array_preserves_order",
-          "start": 36816
+          "start": 36815
         },
         {
           "name": "bounded_vec_tests::from_array::from_array_with_different_types",
-          "start": 37105
+          "start": 37104
         },
         {
           "name": "bounded_vec_tests::trait_from::simple",
-          "start": 37542
+          "start": 37541
         },
         {
           "name": "bounded_vec_tests::trait_eq::empty_equality",
-          "start": 37980
+          "start": 37979
         },
         {
           "name": "bounded_vec_tests::trait_eq::inequality",
-          "start": 38229
+          "start": 38228
         },
         {
           "name": "bounded_vec_tests::from_parts::from_parts",
-          "start": 38638
+          "start": 38637
         },
         {
           "name": "bounded_vec_tests::from_parts::from_parts_unchecked",
-          "start": 39228
+          "start": 39227
         },
         {
           "name": "bounded_vec_tests::push_pop::push_and_pop_operations",
-          "start": 40010
+          "start": 40009
         },
         {
           "name": "bounded_vec_tests::push_pop::push_to_full_vector",
-          "start": 40636
+          "start": 40635
         },
         {
           "name": "bounded_vec_tests::push_pop::pop_from_empty_vector",
-          "start": 40910
+          "start": 40909
         },
         {
           "name": "bounded_vec_tests::push_pop::push_pop_cycle",
-          "start": 41079
+          "start": 41078
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_array",
-          "start": 41725
+          "start": 41724
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_vector",
-          "start": 42071
+          "start": 42070
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_bounded_vec",
-          "start": 42435
+          "start": 42434
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_bounded_vec_limit",
-          "start": 43056
+          "start": 43055
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_bounded_vec_full_and_empty",
-          "start": 43570
+          "start": 43569
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_bounded_vec_zero_len",
-          "start": 44074
+          "start": 44073
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_bounded_vec_last_zeroed",
-          "start": 44368
+          "start": 44367
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_bounded_vec_empty_self",
-          "start": 44793
+          "start": 44792
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_bounded_vec_equal_capacity",
-          "start": 45360
+          "start": 45359
         },
         {
           "name": "bounded_vec_tests::extend::extend_array_beyond_max_len",
-          "start": 45947
+          "start": 45946
         },
         {
           "name": "bounded_vec_tests::extend::extend_vector_beyond_max_len",
-          "start": 46225
+          "start": 46224
         },
         {
           "name": "bounded_vec_tests::extend::extend_bounded_vec_beyond_max_len",
-          "start": 46528
+          "start": 46527
         },
         {
           "name": "bounded_vec_tests::extend::extend_with_empty_collections",
-          "start": 46814
+          "start": 46813
         },
         {
           "name": "bounded_vec_tests::storage::storage_consistency",
-          "start": 47414
+          "start": 47413
         },
         {
           "name": "bounded_vec_tests::storage::storage_after_pop",
-          "start": 47916
+          "start": 47915
         },
         {
           "name": "bounded_vec_tests::storage::vector_immutable",
-          "start": 48234
+          "start": 48233
         }
       ],
       "path": "std/collections/bounded_vec.nr",
-      "source": "use crate::{cmp::Eq, convert::From, runtime::is_unconstrained, static_assert};\n\n/// A `BoundedVec<T, MaxLen>` is a growable storage similar to a built-in vector except that it\n/// is bounded with a maximum possible length. `BoundedVec` is also not\n/// subject to the same restrictions vectors are (notably, nested vectors are disallowed).\n///\n/// Since a BoundedVec is backed by a normal array under the hood, growing the BoundedVec by\n/// pushing an additional element is also more efficient - the length only needs to be increased\n/// by one.\n///\n/// For these reasons `BoundedVec<T, N>` should generally be preferred over vectors when there\n/// is a reasonable maximum bound that can be placed on the vector.\n///\n/// Example:\n///\n/// ```noir\n/// let mut vector: BoundedVec<Field, 10> = BoundedVec::new();\n/// for i in 0..5 {\n///     vector.push(i);\n/// }\n/// assert(vector.len() == 5);\n/// assert(vector.max_len() == 10);\n/// ```\npub struct BoundedVec<T, let MaxLen: u32> {\n    storage: [T; MaxLen],\n    len: u32,\n}\n\nimpl<T, let MaxLen: u32> BoundedVec<T, MaxLen> {\n    /// Creates a new, empty vector of length zero.\n    ///\n    /// Since this container is backed by an array internally, it still needs an initial value\n    /// to give each element. To resolve this, each element is zeroed internally. This value\n    /// is guaranteed to be inaccessible unless `get_unchecked` is used.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let empty_vector: BoundedVec<Field, 10> = BoundedVec::new();\n    /// assert(empty_vector.len() == 0);\n    /// ```\n    ///\n    /// Note that whenever calling `new` the maximum length of the vector should always be specified\n    /// via a type signature:\n    ///\n    /// ```noir\n    /// fn good() -> BoundedVec<Field, 10> {\n    ///     // Ok! MaxLen is specified with a type annotation\n    ///     let v1: BoundedVec<Field, 3> = BoundedVec::new();\n    ///     let v2 = BoundedVec::new();\n    ///\n    ///     // Ok! MaxLen is known from the type of `good`'s return value\n    ///     v2\n    /// }\n    ///\n    /// fn bad() {\n    ///     // Error: Type annotation needed\n    ///     // The compiler can't infer `MaxLen` from the following code:\n    ///     let mut v3 = BoundedVec::new();\n    ///     v3.push(5);\n    /// }\n    /// ```\n    ///\n    /// This defaulting of `MaxLen` (and numeric generics in general) to zero may change in future noir versions\n    /// but for now make sure to use type annotations when using bounded vectors. Otherwise, you will receive a\n    /// constraint failure at runtime when the vec is pushed to.\n    pub fn new() -> Self {\n        let zeroed = crate::mem::zeroed();\n        BoundedVec { storage: [zeroed; MaxLen], len: 0 }\n    }\n\n    /// Retrieves an element from the vector at the given index, starting from zero.\n    ///\n    /// If the given index is equal to or greater than the length of the vector, this\n    /// will issue a constraint failure.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n    ///     let first = v.get(0);\n    ///     let last = v.get(v.len() - 1);\n    ///     assert(first != last);\n    /// }\n    /// ```\n    pub fn get(&self, index: u32) -> T {\n        assert(index < self.len, \"Attempted to read past end of BoundedVec\");\n        self.get_unchecked(index)\n    }\n\n    /// Retrieves an element from the vector at the given index, starting from zero, without\n    /// performing a bounds check.\n    ///\n    /// Since this function does not perform a bounds check on length before accessing the element,\n    /// it is unsafe! Use at your own risk!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn sum_of_first_three<let N: u32>(v: BoundedVec<u32, N>) -> u32 {\n    ///     // Always ensure the length is larger than the largest\n    ///     // index passed to get_unchecked\n    ///     assert(v.len() > 2);\n    ///     let first = v.get_unchecked(0);\n    ///     let second = v.get_unchecked(1);\n    ///     let third = v.get_unchecked(2);\n    ///     first + second + third\n    /// }\n    /// ```\n    pub fn get_unchecked(&self, index: u32) -> T {\n        self.storage[index]\n    }\n\n    /// Writes an element to the vector at the given index, starting from zero.\n    ///\n    /// If the given index is equal to or greater than the length of the vector, this will issue a constraint failure.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n    ///     let first = v.get(0);\n    ///     assert(first != 42);\n    ///     v.set(0, 42);\n    ///     let new_first = v.get(0);\n    ///     assert(new_first == 42);\n    /// }\n    /// ```\n    pub fn set(&mut self, index: u32, value: T) {\n        assert(index < self.len, \"Attempted to write past end of BoundedVec\");\n        self.set_unchecked(index, value)\n    }\n\n    /// Writes an element to the vector at the given index, starting from zero, without performing a bounds check.\n    ///\n    /// Since this function does not perform a bounds check on length before accessing the element, it is unsafe! Use at your own risk!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn set_unchecked_example() {\n    ///     let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n    ///     vec.extend_from_array([1, 2]);\n    ///\n    ///     // Here we're safely writing within the valid range of `vec`\n    ///     // `vec` now has the value [42, 2]\n    ///     vec.set_unchecked(0, 42);\n    ///\n    ///     // We can then safely read this value back out of `vec`.\n    ///     // Notice that we use the checked version of `get` which would prevent reading unsafe values.\n    ///     assert_eq(vec.get(0), 42);\n    ///\n    ///     // We've now written past the end of `vec`.\n    ///     // As this index is still within the maximum potential length of `v`,\n    ///     // it won't cause a constraint failure.\n    ///     vec.set_unchecked(2, 42);\n    ///     println(vec);\n    ///\n    ///     // This will write past the end of the maximum potential length of `vec`,\n    ///     // it will then trigger a constraint failure.\n    ///     vec.set_unchecked(5, 42);\n    ///     println(vec);\n    /// }\n    /// ```\n    pub fn set_unchecked(&mut self, index: u32, value: T) {\n        self.storage[index] = value;\n    }\n\n    /// Pushes an element to the end of the vector. This increases the length\n    /// of the vector by one.\n    ///\n    /// Panics if the new length of the vector will be greater than the max length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n    ///\n    /// v.push(1);\n    /// v.push(2);\n    ///\n    /// // Panics with failed assertion \"push out of bounds\"\n    /// v.push(3);\n    /// ```\n    pub fn push(&mut self, elem: T) {\n        assert(self.len < MaxLen, \"push out of bounds\");\n\n        self.storage[self.len] = elem;\n        self.len += 1;\n    }\n\n    /// Returns the current length of this vector\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 4> = BoundedVec::new();\n    /// assert(v.len() == 0);\n    ///\n    /// v.push(100);\n    /// assert(v.len() == 1);\n    ///\n    /// v.push(200);\n    /// v.push(300);\n    /// v.push(400);\n    /// assert(v.len() == 4);\n    ///\n    /// let _ = v.pop();\n    /// let _ = v.pop();\n    /// assert(v.len() == 2);\n    /// ```\n    pub fn len(&self) -> u32 {\n        self.len\n    }\n\n    /// Returns the maximum length of this vector. This is always\n    /// equal to the `MaxLen` parameter this vector was initialized with.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n    ///\n    /// assert(v.max_len() == 5);\n    /// v.push(10);\n    /// assert(v.max_len() == 5);\n    /// ```\n    pub fn max_len(_self: &BoundedVec<T, MaxLen>) -> u32 {\n        MaxLen\n    }\n\n    /// Returns the internal array within this vector.\n    ///\n    /// Since arrays in Noir are immutable, mutating the returned storage array will not mutate\n    /// the storage held internally by this vector.\n    ///\n    /// Note that uninitialized elements may be zeroed out!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n    ///\n    /// assert(v.storage() == [0, 0, 0, 0, 0]);\n    ///\n    /// v.push(57);\n    /// assert(v.storage() == [57, 0, 0, 0, 0]);\n    /// ```\n    pub fn storage(&self) -> [T; MaxLen] {\n        self.storage\n    }\n\n    /// Pushes each element from the given array to this vector.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n    /// vec.extend_from_array([2, 4]);\n    ///\n    /// assert(vec.len == 2);\n    /// assert(vec.get(0) == 2);\n    /// assert(vec.get(1) == 4);\n    /// ```\n    pub fn extend_from_array<let Len: u32>(&mut self, array: [T; Len]) {\n        let new_len = self.len + array.len();\n        assert(new_len <= MaxLen, \"extend_from_array out of bounds\");\n        for i in 0..array.len() {\n            self.storage[self.len + i] = array[i];\n        }\n        self.len = new_len;\n    }\n\n    /// Pushes each element from the given vector to this vector.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n    /// vec.extend_from_vector([2, 4].as_vector());\n    ///\n    /// assert(vec.len == 2);\n    /// assert(vec.get(0) == 2);\n    /// assert(vec.get(1) == 4);\n    /// ```\n    pub fn extend_from_vector(&mut self, vector: [T]) {\n        let new_len = self.len + vector.len();\n        assert(new_len <= MaxLen, \"extend_from_vector out of bounds\");\n        for i in 0..vector.len() {\n            self.storage[self.len + i] = vector[i];\n        }\n        self.len = new_len;\n    }\n\n    /// Pushes each element from the other vector to this vector. The length of\n    /// the other vector is left unchanged.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// ```noir\n    /// let mut v1: BoundedVec<Field, 5> = BoundedVec::new();\n    /// let mut v2: BoundedVec<Field, 7> = BoundedVec::new();\n    ///\n    /// v2.extend_from_array([1, 2, 3]);\n    /// v1.extend_from_bounded_vec(v2);\n    ///\n    /// assert(v1.storage() == [1, 2, 3, 0, 0]);\n    /// assert(v2.storage() == [1, 2, 3, 0, 0, 0, 0]);\n    /// ```\n    pub fn extend_from_bounded_vec<let Len: u32>(&mut self, vec: BoundedVec<T, Len>) {\n        let append_len = vec.len();\n        let new_len = self.len + append_len;\n        assert(new_len <= MaxLen, \"extend_from_bounded_vec out of bounds\");\n\n        if is_unconstrained() {\n            for i in 0..append_len {\n                self.storage[self.len + i] = vec.get_unchecked(i);\n            }\n        } else {\n            // The source vector can be longer than the destination, or vice versa;\n            // regardless we will only ever be able to read or write whichever is\n            // the shorter max length of the two. We asserted that the actual content fits,\n            // but the capacity of the source vector could be higher.\n            let max = crate::cmp::min(Len, MaxLen);\n\n            // Save the last item in case we have to do a fixup on an already full array.\n            let last = if MaxLen > 0 {\n                self.storage[MaxLen - 1]\n            } else {\n                crate::mem::zeroed()\n            };\n\n            for src in 0..max {\n                // Since we are iterating to the static capacity of the arrays,\n                // the destination could be out of bounds. If that's the case,\n                // overwrite the last item, which we'll fixup in the end.\n                // NB using cmp::min resulted in more opcodes here.\n                let mut dst = self.len + src;\n                if dst >= MaxLen { dst = MaxLen - 1; };\n                // Assigning the source or zeroed to avoid having to merge arrays in SSA.\n                self.storage[dst] = if src < append_len {\n                    vec.get_unchecked(src)\n                } else {\n                    last\n                }\n            }\n\n            // Fixup the last item if we have to.\n            if MaxLen > 0 {\n                self.storage[MaxLen - 1] = if (self.len + append_len == MaxLen) & (append_len > 0) {\n                    vec.get_unchecked(append_len - 1)\n                } else {\n                    last\n                }\n            }\n        }\n        self.len = new_len;\n    }\n\n    /// Creates a new vector, populating it with values derived from an array input.\n    /// The maximum length of the vector is determined based on the type signature.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array([1, 2, 3])\n    /// ```\n    pub fn from_array<let Len: u32>(array: [T; Len]) -> Self {\n        static_assert(Len <= MaxLen, \"from array out of bounds\");\n        let mut vec: BoundedVec<T, MaxLen> = BoundedVec::new();\n        vec.extend_from_array(array);\n        vec\n    }\n\n    /// Pops the element at the end of the vector. This will decrease the length\n    /// of the vector by one.\n    ///\n    /// Panics if the vector is empty.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n    /// v.push(1);\n    /// v.push(2);\n    ///\n    /// let two = v.pop();\n    /// let one = v.pop();\n    ///\n    /// assert(two == 2);\n    /// assert(one == 1);\n    ///\n    /// // error: cannot pop from an empty vector\n    /// let _ = v.pop();\n    /// ```\n    pub fn pop(&mut self) -> T {\n        assert(self.len > 0, \"cannot pop from an empty vector\");\n        self.len -= 1;\n\n        let elem = self.storage[self.len];\n        self.storage[self.len] = crate::mem::zeroed();\n        elem\n    }\n\n    /// Returns true if the given predicate returns true for any element\n    /// in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<u32, 3> = BoundedVec::new();\n    /// v.extend_from_array([2, 4, 6]);\n    ///\n    /// let all_even = !v.any(|elem: u32| elem % 2 != 0);\n    /// assert(all_even);\n    /// ```\n    pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = false;\n        if is_unconstrained() {\n            for i in 0..self.len {\n                ret |= predicate(self.storage[i]);\n            }\n        } else {\n            let mut exceeded_len = false;\n            for i in 0..MaxLen {\n                exceeded_len |= i == self.len;\n                if !exceeded_len {\n                    ret |= predicate(self.storage[i]);\n                }\n            }\n        }\n        ret\n    }\n\n    /// Creates a new vector of equal size by calling a closure on each element in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let result = vec.map(|value| value * 2);\n    ///\n    /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn map<U, Env>(&self, f: fn[Env](T) -> U) -> BoundedVec<U, MaxLen> {\n        let mut ret = BoundedVec::new();\n        ret.len = self.len();\n\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                ret.storage[i] = f(self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                ret.storage[i] = if i < self.len() {\n                    f(self.get_unchecked(i))\n                } else {\n                    crate::mem::zeroed()\n                }\n            }\n        }\n\n        ret\n    }\n\n    /// Creates a new vector of equal size by calling a closure on each element\n    /// in this vector, along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let result = vec.mapi(|i, value| i + value * 2);\n    ///\n    /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn mapi<U, Env>(&self, f: fn[Env](u32, T) -> U) -> BoundedVec<U, MaxLen> {\n        let mut ret = BoundedVec::new();\n        ret.len = self.len();\n\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                ret.storage[i] = f(i, self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                ret.storage[i] = if i < self.len() {\n                    f(i, self.get_unchecked(i))\n                } else {\n                    crate::mem::zeroed()\n                }\n            }\n        }\n\n        ret\n    }\n\n    /// Calls a closure on each element in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let mut result = BoundedVec::<u32, 4>::new();\n    /// vec.for_each(|value| result.push(value * 2));\n    ///\n    /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn for_each<Env>(&self, f: fn[Env](T) -> ()) {\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                f(self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    f(self.get_unchecked(i));\n                }\n            }\n        }\n    }\n\n    /// Calls a closure on each element in this vector, along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let mut result = BoundedVec::<u32, 4>::new();\n    /// vec.for_eachi(|i, value| result.push(i + value * 2));\n    ///\n    /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn for_eachi<Env>(&self, f: fn[Env](u32, T) -> ()) {\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                f(i, self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    f(i, self.get_unchecked(i));\n                }\n            }\n        }\n    }\n\n    /// Creates a new BoundedVec from the given array and length.\n    /// The given length must be less than or equal to the length of the array.\n    ///\n    /// This function will zero out any elements at or past index `len` of `array`.\n    /// This incurs an extra runtime cost of O(MaxLen). If you are sure your array is\n    /// zeroed after that index, you can use [`from_parts_unchecked`][Self::from_parts_unchecked] to remove the extra loop.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n    /// assert_eq(vec.len(), 3);\n    /// ```\n    pub fn from_parts(mut array: [T; MaxLen], len: u32) -> Self {\n        assert(len <= MaxLen);\n        let zeroed = crate::mem::zeroed();\n\n        if is_unconstrained() {\n            for i in len..MaxLen {\n                array[i] = zeroed;\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i >= len {\n                    array[i] = zeroed;\n                }\n            }\n        }\n\n        BoundedVec { storage: array, len }\n    }\n\n    /// Creates a new BoundedVec from the given array and length.\n    /// The given length must be less than or equal to the length of the array.\n    ///\n    /// This function is unsafe because it expects all elements past the `len` index\n    /// of `array` to be zeroed, but does not check for this internally. Use `from_parts`\n    /// for a safe version of this function which does zero out any indices past the\n    /// given length. Invalidating this assumption can notably cause `BoundedVec::eq`\n    /// to give incorrect results since it will check even elements past `len`.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n    /// assert_eq(vec.len(), 3);\n    ///\n    /// // invalid use!\n    /// let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n    /// let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n    ///\n    /// // both vecs have length 3 so we'd expect them to be equal, but this\n    /// // fails because elements past the length are still checked in eq\n    /// assert_eq(vec1, vec2); // fails\n    /// ```\n    pub fn from_parts_unchecked(array: [T; MaxLen], len: u32) -> Self {\n        assert(len <= MaxLen);\n        BoundedVec { storage: array, len }\n    }\n}\n\nimpl<T, let MaxLen: u32> Eq for BoundedVec<T, MaxLen>\nwhere\n    T: Eq,\n{\n    fn eq(self, other: BoundedVec<T, MaxLen>) -> bool {\n        // TODO: https://github.com/noir-lang/noir/issues/4837\n        //\n        // We make the assumption that the user has used the proper interface for working with `BoundedVec`s\n        // rather than directly manipulating the internal fields as this can result in an inconsistent internal state.\n        if self.len == other.len {\n            self.storage == other.storage\n        } else {\n            false\n        }\n    }\n}\n\nimpl<T, let MaxLen: u32, let Len: u32> From<[T; Len]> for BoundedVec<T, MaxLen> {\n    fn from(array: [T; Len]) -> BoundedVec<T, MaxLen> {\n        BoundedVec::from_array(array)\n    }\n}\n\nmod bounded_vec_tests {\n\n    mod get {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn panics_when_reading_elements_past_end_of_vec() {\n            let vec: BoundedVec<Field, 5> = BoundedVec::new();\n\n            let _ = vec.get(0);\n        }\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn panics_when_reading_beyond_length() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            let _ = vec.get(3);\n        }\n\n        #[test]\n        fn get_works_within_bounds() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(2), 3);\n            assert_eq(vec.get(4), 5);\n        }\n\n        #[test]\n        fn get_unchecked_works() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            assert_eq(vec.get_unchecked(0), 1);\n            assert_eq(vec.get_unchecked(2), 3);\n        }\n\n        #[test]\n        fn get_unchecked_works_past_len() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            assert_eq(vec.get_unchecked(4), 0);\n        }\n    }\n\n    mod set {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn set_updates_values_properly() {\n            let mut vec = BoundedVec::from_array([0, 0, 0, 0, 0]);\n\n            vec.set(0, 42);\n            assert_eq(vec.storage, [42, 0, 0, 0, 0]);\n\n            vec.set(1, 43);\n            assert_eq(vec.storage, [42, 43, 0, 0, 0]);\n\n            vec.set(2, 44);\n            assert_eq(vec.storage, [42, 43, 44, 0, 0]);\n\n            vec.set(1, 10);\n            assert_eq(vec.storage, [42, 10, 44, 0, 0]);\n\n            vec.set(0, 0);\n            assert_eq(vec.storage, [0, 10, 44, 0, 0]);\n        }\n\n        #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n        fn panics_when_writing_elements_past_end_of_vec() {\n            let mut vec: BoundedVec<Field, 5> = BoundedVec::new();\n            vec.set(0, 42);\n        }\n\n        #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n        fn panics_when_setting_beyond_length() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            vec.set(3, 4);\n        }\n\n        #[test]\n        fn set_unchecked_operations() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            vec.set_unchecked(0, 10);\n            assert_eq(vec.get(0), 10);\n        }\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn set_unchecked_operations_past_len() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            vec.set_unchecked(3, 40);\n            assert_eq(vec.get(3), 40);\n        }\n\n        #[test]\n        fn set_preserves_other_elements() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n            vec.set(2, 30);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 30);\n            assert_eq(vec.get(3), 4);\n            assert_eq(vec.get(4), 5);\n        }\n    }\n\n    mod any {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn returns_false_if_predicate_not_satisfied() {\n            let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, false, false]);\n            let result = vec.any(|value| value);\n\n            assert(!result);\n        }\n\n        #[test]\n        fn returns_true_if_predicate_satisfied() {\n            let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, true, true]);\n            let result = vec.any(|value| value);\n\n            assert(result);\n        }\n\n        #[test]\n        fn returns_false_on_empty_boundedvec() {\n            let vec: BoundedVec<bool, 0> = BoundedVec::new();\n            let result = vec.any(|value| value);\n\n            assert(!result);\n        }\n\n        #[test]\n        fn any_with_complex_predicates() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n            assert(vec.any(|x| x > 3));\n            assert(!vec.any(|x| x > 10));\n            assert(vec.any(|x| x % 2 == 0)); // has a even number\n            assert(vec.any(|x| x == 3)); // has a specific value\n        }\n\n        #[test]\n        fn any_with_partial_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            assert(vec.any(|x| x == 1));\n            assert(vec.any(|x| x == 2));\n            assert(!vec.any(|x| x == 3));\n        }\n    }\n\n    mod map {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn applies_function_correctly() {\n            // docs:start:bounded-vec-map-example\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|value| value * 2);\n            // docs:end:bounded-vec-map-example\n            let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|value| (value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = vec.map(|value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn map_with_conditional_logic() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n            let result = vec.map(|x| if x % 2 == 0 { x * 2 } else { x });\n            let expected = BoundedVec::from_array([1, 4, 3, 8]);\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn map_preserves_length() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|x| x * 2);\n\n            assert_eq(result.len(), vec.len());\n            assert_eq(result.max_len(), vec.max_len());\n        }\n\n        #[test]\n        fn map_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let result = vec.map(|x| x * 2);\n            assert_eq(result, vec);\n            assert_eq(result.len(), 0);\n            assert_eq(result.max_len(), 5);\n        }\n    }\n\n    mod mapi {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn applies_function_correctly() {\n            // docs:start:bounded-vec-mapi-example\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.mapi(|i, value| i + value * 2);\n            // docs:end:bounded-vec-mapi-example\n            let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.mapi(|i, value| (i + value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = vec.mapi(|_, value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn mapi_with_index_branching_logic() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n            let result = vec.mapi(|i, x| if i % 2 == 0 { x * 2 } else { x });\n            let expected = BoundedVec::from_array([2, 2, 6, 4]);\n            assert_eq(result, expected);\n        }\n    }\n\n    mod for_each {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        // map in terms of for_each\n        fn for_each_map<T, U, Env, let MaxLen: u32>(\n            input: BoundedVec<T, MaxLen>,\n            f: fn[Env](T) -> U,\n        ) -> BoundedVec<U, MaxLen> {\n            let mut output = BoundedVec::<U, MaxLen>::new();\n            let output_ref = &mut output;\n            input.for_each(|x| output_ref.push(f(x)));\n            output\n        }\n\n        #[test]\n        fn smoke_test() {\n            let mut acc = 0;\n            let acc_ref = &mut acc;\n            // docs:start:bounded-vec-for-each-example\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            vec.for_each(|value| { *acc_ref += value; });\n            // docs:end:bounded-vec-for-each-example\n            assert_eq(acc, 6);\n        }\n\n        #[test]\n        fn applies_function_correctly() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_each_map(vec, |value| value * 2);\n            let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_each_map(vec, |value| (value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = for_each_map(vec, |value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn for_each_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut count = 0;\n            let count_ref = &mut count;\n            vec.for_each(|_| { *count_ref += 1; });\n            assert_eq(count, 0);\n        }\n\n        #[test]\n        fn for_each_with_side_effects() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            let mut seen = BoundedVec::<u32, 3>::new();\n            let seen_ref = &mut seen;\n            vec.for_each(|x| seen_ref.push(x));\n            assert_eq(seen, vec);\n        }\n    }\n\n    mod for_eachi {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        // mapi in terms of for_eachi\n        fn for_eachi_mapi<T, U, Env, let MaxLen: u32>(\n            input: BoundedVec<T, MaxLen>,\n            f: fn[Env](u32, T) -> U,\n        ) -> BoundedVec<U, MaxLen> {\n            let mut output = BoundedVec::<U, MaxLen>::new();\n            let output_ref = &mut output;\n            input.for_eachi(|i, x| output_ref.push(f(i, x)));\n            output\n        }\n\n        #[test]\n        fn smoke_test() {\n            let mut acc = 0;\n            let acc_ref = &mut acc;\n            // docs:start:bounded-vec-for-eachi-example\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            vec.for_eachi(|i, value| { *acc_ref += i * value; });\n            // docs:end:bounded-vec-for-eachi-example\n\n            // 0 * 1 + 1 * 2 + 2 * 3\n            assert_eq(acc, 8);\n        }\n\n        #[test]\n        fn applies_function_correctly() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_eachi_mapi(vec, |i, value| i + value * 2);\n            let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_eachi_mapi(vec, |i, value| (i + value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = for_eachi_mapi(vec, |_, value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn for_eachi_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut count = 0;\n            let count_ref = &mut count;\n            vec.for_eachi(|_, _| { *count_ref += 1; });\n            assert_eq(count, 0);\n        }\n\n        #[test]\n        fn for_eachi_with_index_tracking() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([10, 20, 30]);\n            let mut indices = BoundedVec::<u32, 3>::new();\n            let indices_ref = &mut indices;\n            vec.for_eachi(|i, _| indices_ref.push(i));\n\n            let expected = BoundedVec::from_array([0, 1, 2]);\n            assert_eq(indices, expected);\n        }\n\n    }\n\n    mod from_array {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn empty() {\n            let empty_array: [Field; 0] = [];\n            let bounded_vec = BoundedVec::from_array([]);\n\n            assert_eq(bounded_vec.max_len(), 0);\n            assert_eq(bounded_vec.len(), 0);\n            assert_eq(bounded_vec.storage(), empty_array);\n        }\n\n        #[test]\n        fn equal_len() {\n            let array = [1, 2, 3];\n            let bounded_vec = BoundedVec::from_array(array);\n\n            assert_eq(bounded_vec.max_len(), 3);\n            assert_eq(bounded_vec.len(), 3);\n            assert_eq(bounded_vec.storage(), array);\n        }\n\n        #[test]\n        fn max_len_greater_then_array_len() {\n            let array = [1, 2, 3];\n            let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array(array);\n\n            assert_eq(bounded_vec.max_len(), 10);\n            assert_eq(bounded_vec.len(), 3);\n            assert_eq(bounded_vec.get(0), 1);\n            assert_eq(bounded_vec.get(1), 2);\n            assert_eq(bounded_vec.get(2), 3);\n        }\n\n        #[test(should_fail_with = \"from array out of bounds\")]\n        fn max_len_lower_then_array_len() {\n            let _: BoundedVec<Field, 2> = BoundedVec::from_array([0; 3]);\n        }\n\n        #[test]\n        fn from_array_preserves_order() {\n            let array = [5, 3, 1, 4, 2];\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array(array);\n            for i in 0..array.len() {\n                assert_eq(vec.get(i), array[i]);\n            }\n        }\n\n        #[test]\n        fn from_array_with_different_types() {\n            let bool_array = [true, false, true];\n            let bool_vec: BoundedVec<bool, 3> = BoundedVec::from_array(bool_array);\n            assert_eq(bool_vec.len(), 3);\n            assert_eq(bool_vec.get(0), true);\n            assert_eq(bool_vec.get(1), false);\n        }\n    }\n\n    mod trait_from {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::convert::From;\n\n        #[test]\n        fn simple() {\n            let array = [1, 2];\n            let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from(array);\n\n            assert_eq(bounded_vec.max_len(), 10);\n            assert_eq(bounded_vec.len(), 2);\n            assert_eq(bounded_vec.get(0), 1);\n            assert_eq(bounded_vec.get(1), 2);\n        }\n    }\n\n    mod trait_eq {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn empty_equality() {\n            let bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n            let bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n\n            assert_eq(bounded_vec1, bounded_vec2);\n        }\n\n        #[test]\n        fn inequality() {\n            let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n            let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n            bounded_vec1.push(1);\n            bounded_vec2.push(2);\n\n            assert(bounded_vec1 != bounded_vec2);\n        }\n    }\n\n    mod from_parts {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn from_parts() {\n            // docs:start:from-parts\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n            assert_eq(vec.len(), 3);\n\n            // Any elements past the given length are zeroed out, so these\n            // two BoundedVecs will be completely equal\n            let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 1], 3);\n            let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 2], 3);\n            assert_eq(vec1, vec2);\n            // docs:end:from-parts\n        }\n\n        #[test]\n        fn from_parts_unchecked() {\n            // docs:start:from-parts-unchecked\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n            assert_eq(vec.len(), 3);\n\n            // invalid use!\n            let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n            let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n\n            // both vecs have length 3 so we'd expect them to be equal, but this\n            // fails because elements past the length are still checked in eq\n            assert(vec1 != vec2);\n            // docs:end:from-parts-unchecked\n        }\n    }\n\n    mod push_pop {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn push_and_pop_operations() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n            assert_eq(vec.len(), 0);\n\n            vec.push(1);\n            assert_eq(vec.len(), 1);\n            assert_eq(vec.get(0), 1);\n\n            vec.push(2);\n            assert_eq(vec.len(), 2);\n            assert_eq(vec.get(1), 2);\n\n            let popped = vec.pop();\n            assert_eq(popped, 2);\n            assert_eq(vec.len(), 1);\n\n            let popped2 = vec.pop();\n            assert_eq(popped2, 1);\n            assert_eq(vec.len(), 0);\n        }\n\n        #[test(should_fail_with = \"push out of bounds\")]\n        fn push_to_full_vector() {\n            let mut vec: BoundedVec<u32, 2> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n            vec.push(3); // should panic\n        }\n\n        #[test(should_fail_with = \"cannot pop from an empty vector\")]\n        fn pop_from_empty_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let _ = vec.pop(); // should panic\n        }\n\n        #[test]\n        fn push_pop_cycle() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n\n            // push to full\n            vec.push(1);\n            vec.push(2);\n            vec.push(3);\n            assert_eq(vec.len(), 3);\n\n            // pop all\n            assert_eq(vec.pop(), 3);\n            assert_eq(vec.pop(), 2);\n            assert_eq(vec.pop(), 1);\n            assert_eq(vec.len(), 0);\n\n            // push again\n            vec.push(4);\n            assert_eq(vec.len(), 1);\n            assert_eq(vec.get(0), 4);\n        }\n    }\n\n    mod extend {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn extend_from_array() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_array([2, 3]);\n\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_vector([2, 3].as_vector());\n\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec() {\n            // The source deliberately has a higher capacity,\n            // to make sure we are not trying to assign out-of-bounds.\n            let mut vec1: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 9> = BoundedVec::new();\n\n            vec1.push(1);\n            vec2.push(2);\n            vec2.push(3);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_limit() {\n            // Capacity and contents chosen so the last item must be assigned to.\n            let mut vec1: BoundedVec<u32, 2> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 5> = BoundedVec::new();\n\n            vec1.push(1);\n            vec2.push(2);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 2);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_full_and_empty() {\n            // Capacity and contents chosen so the last item must be assigned to.\n            let mut vec1: BoundedVec<u32, 2> = BoundedVec::new();\n            let vec2: BoundedVec<u32, 5> = BoundedVec::new();\n\n            vec1.push(1);\n            vec1.push(2);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 2);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_zero_len() {\n            let mut vec1: BoundedVec<u32, 0> = BoundedVec::new();\n            let vec2: BoundedVec<u32, 0> = BoundedVec::new();\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 0);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_last_zeroed() {\n            let mut vec1: BoundedVec<u32, 4> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 4> = BoundedVec::new();\n\n            vec1.push(1);\n            vec1.push(2);\n            vec2.push(3);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get_unchecked(3), 0);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_empty_self() {\n            // self.len == 0 with Len > MaxLen: the loop doesn't reach\n            // the last storage slot, so the fixup must write it.\n            let mut vec1: BoundedVec<u32, 3> = BoundedVec::new();\n            let vec2: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_equal_capacity() {\n            // Len == MaxLen, fills to capacity.\n            let mut vec1: BoundedVec<u32, 4> = BoundedVec::new();\n            vec1.push(1);\n            let vec2: BoundedVec<u32, 4> = BoundedVec::from_array([2, 3, 4]);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 4);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n            assert_eq(vec1.get(3), 4);\n        }\n\n        #[test(should_fail_with = \"extend_from_array out of bounds\")]\n        fn extend_array_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_array([2, 3, 4]); // should panic\n        }\n\n        #[test(should_fail_with = \"extend_from_vector out of bounds\")]\n        fn extend_vector_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_vector([2, 3, 4].as_vector()); // S]should panic\n        }\n\n        #[test(should_fail_with = \"extend_from_bounded_vec out of bounds\")]\n        fn extend_bounded_vec_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            let other: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            vec.extend_from_bounded_vec(other); // should panic\n        }\n\n        #[test]\n        fn extend_with_empty_collections() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let original_len = vec.len();\n\n            vec.extend_from_array([]);\n            assert_eq(vec.len(), original_len);\n\n            vec.extend_from_vector([].as_vector());\n            assert_eq(vec.len(), original_len);\n\n            let empty: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.extend_from_bounded_vec(empty);\n            assert_eq(vec.len(), original_len);\n        }\n    }\n\n    mod storage {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn storage_consistency() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n            // test initial storage state\n            assert_eq(vec.storage(), [0, 0, 0, 0, 0]);\n\n            vec.push(1);\n            vec.push(2);\n\n            // test storage after modifications\n            assert_eq(vec.storage(), [1, 2, 0, 0, 0]);\n\n            // storage doesn't change length\n            assert_eq(vec.len(), 2);\n            assert_eq(vec.max_len(), 5);\n        }\n\n        #[test]\n        fn storage_after_pop() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n\n            let _ = vec.pop();\n            // after pop, the last element should be zeroed\n            assert_eq(vec.storage(), [1, 2, 0]);\n            assert_eq(vec.len(), 2);\n        }\n\n        #[test]\n        fn vector_immutable() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            let storage = vec.storage();\n\n            assert_eq(storage, [1, 2, 3]);\n\n            // Verify that the original vector is unchanged\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n    }\n}\n"
+      "source": "use crate::{cmp::Eq, convert::From, runtime::is_unconstrained, static_assert};\n\n/// A `BoundedVec<T, MaxLen>` is a growable storage similar to a built-in vector except that it\n/// is bounded with a maximum possible length. `BoundedVec` is also not\n/// subject to the same restrictions vectors are (notably, nested vectors are disallowed).\n///\n/// Since a BoundedVec is backed by a normal array under the hood, growing the BoundedVec by\n/// pushing an additional element is also more efficient - the length only needs to be increased\n/// by one.\n///\n/// For these reasons `BoundedVec<T, N>` should generally be preferred over vectors when there\n/// is a reasonable maximum bound that can be placed on the vector.\n///\n/// Example:\n///\n/// ```noir\n/// let mut vector: BoundedVec<Field, 10> = BoundedVec::new();\n/// for i in 0..5 {\n///     vector.push(i);\n/// }\n/// assert(vector.len() == 5);\n/// assert(vector.max_len() == 10);\n/// ```\npub struct BoundedVec<T, let MaxLen: u32> {\n    storage: [T; MaxLen],\n    len: u32,\n}\n\nimpl<T, let MaxLen: u32> BoundedVec<T, MaxLen> {\n    /// Creates a new, empty vector of length zero.\n    ///\n    /// Since this container is backed by an array internally, it still needs an initial value\n    /// to give each element. To resolve this, each element is zeroed internally. This value\n    /// is guaranteed to be inaccessible unless `get_unchecked` is used.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let empty_vector: BoundedVec<Field, 10> = BoundedVec::new();\n    /// assert(empty_vector.len() == 0);\n    /// ```\n    ///\n    /// Note that whenever calling `new` the maximum length of the vector should always be specified\n    /// via a type signature:\n    ///\n    /// ```noir\n    /// fn good() -> BoundedVec<Field, 10> {\n    ///     // Ok! MaxLen is specified with a type annotation\n    ///     let v1: BoundedVec<Field, 3> = BoundedVec::new();\n    ///     let v2 = BoundedVec::new();\n    ///\n    ///     // Ok! MaxLen is known from the type of `good`'s return value\n    ///     v2\n    /// }\n    ///\n    /// fn bad() {\n    ///     // Error: Type annotation needed\n    ///     // The compiler can't infer `MaxLen` from the following code:\n    ///     let mut v3 = BoundedVec::new();\n    ///     v3.push(5);\n    /// }\n    /// ```\n    ///\n    /// This defaulting of `MaxLen` (and numeric generics in general) to zero may change in future noir versions\n    /// but for now make sure to use type annotations when using bounded vectors. Otherwise, you will receive a\n    /// constraint failure at runtime when the vec is pushed to.\n    pub fn new() -> Self {\n        let zeroed = crate::mem::zeroed();\n        BoundedVec { storage: [zeroed; MaxLen], len: 0 }\n    }\n\n    /// Retrieves an element from the vector at the given index, starting from zero.\n    ///\n    /// If the given index is equal to or greater than the length of the vector, this\n    /// will issue a constraint failure.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n    ///     let first = v.get(0);\n    ///     let last = v.get(v.len() - 1);\n    ///     assert(first != last);\n    /// }\n    /// ```\n    pub fn get(&self, index: u32) -> T {\n        assert(index < self.len, \"Attempted to read past end of BoundedVec\");\n        self.get_unchecked(index)\n    }\n\n    /// Retrieves an element from the vector at the given index, starting from zero, without\n    /// performing a bounds check.\n    ///\n    /// Since this function does not perform a bounds check on length before accessing the element,\n    /// it is unsafe! Use at your own risk!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn sum_of_first_three<let N: u32>(v: BoundedVec<u32, N>) -> u32 {\n    ///     // Always ensure the length is larger than the largest\n    ///     // index passed to get_unchecked\n    ///     assert(v.len() > 2);\n    ///     let first = v.get_unchecked(0);\n    ///     let second = v.get_unchecked(1);\n    ///     let third = v.get_unchecked(2);\n    ///     first + second + third\n    /// }\n    /// ```\n    pub fn get_unchecked(&self, index: u32) -> T {\n        self.storage[index]\n    }\n\n    /// Writes an element to the vector at the given index, starting from zero.\n    ///\n    /// If the given index is equal to or greater than the length of the vector, this will issue a constraint failure.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n    ///     let first = v.get(0);\n    ///     assert(first != 42);\n    ///     v.set(0, 42);\n    ///     let new_first = v.get(0);\n    ///     assert(new_first == 42);\n    /// }\n    /// ```\n    pub fn set(&mut self, index: u32, value: T) {\n        assert(index < self.len, \"Attempted to write past end of BoundedVec\");\n        self.set_unchecked(index, value)\n    }\n\n    /// Writes an element to the vector at the given index, starting from zero, without performing a bounds check.\n    ///\n    /// Since this function does not perform a bounds check on length before accessing the element, it is unsafe! Use at your own risk!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn set_unchecked_example() {\n    ///     let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n    ///     vec.extend_from_array([1, 2]);\n    ///\n    ///     // Here we're safely writing within the valid range of `vec`\n    ///     // `vec` now has the value [42, 2]\n    ///     vec.set_unchecked(0, 42);\n    ///\n    ///     // We can then safely read this value back out of `vec`.\n    ///     // Notice that we use the checked version of `get` which would prevent reading unsafe values.\n    ///     assert_eq(vec.get(0), 42);\n    ///\n    ///     // We've now written past the end of `vec`.\n    ///     // As this index is still within the maximum potential length of `v`,\n    ///     // it won't cause a constraint failure.\n    ///     vec.set_unchecked(2, 42);\n    ///     println(vec);\n    ///\n    ///     // This will write past the end of the maximum potential length of `vec`,\n    ///     // it will then trigger a constraint failure.\n    ///     vec.set_unchecked(5, 42);\n    ///     println(vec);\n    /// }\n    /// ```\n    pub fn set_unchecked(&mut self, index: u32, value: T) {\n        self.storage[index] = value;\n    }\n\n    /// Pushes an element to the end of the vector. This increases the length\n    /// of the vector by one.\n    ///\n    /// Panics if the new length of the vector will be greater than the max length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n    ///\n    /// v.push(1);\n    /// v.push(2);\n    ///\n    /// // Panics with failed assertion \"push out of bounds\"\n    /// v.push(3);\n    /// ```\n    pub fn push(&mut self, elem: T) {\n        assert(self.len < MaxLen, \"push out of bounds\");\n\n        self.storage[self.len] = elem;\n        self.len += 1;\n    }\n\n    /// Returns the current length of this vector\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 4> = BoundedVec::new();\n    /// assert(v.len() == 0);\n    ///\n    /// v.push(100);\n    /// assert(v.len() == 1);\n    ///\n    /// v.push(200);\n    /// v.push(300);\n    /// v.push(400);\n    /// assert(v.len() == 4);\n    ///\n    /// let _ = v.pop();\n    /// let _ = v.pop();\n    /// assert(v.len() == 2);\n    /// ```\n    pub fn len(&self) -> u32 {\n        self.len\n    }\n\n    /// Returns the maximum length of this vector. This is always\n    /// equal to the `MaxLen` parameter this vector was initialized with.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n    ///\n    /// assert(v.max_len() == 5);\n    /// v.push(10);\n    /// assert(v.max_len() == 5);\n    /// ```\n    pub fn max_len(_self: &BoundedVec<T, MaxLen>) -> u32 {\n        MaxLen\n    }\n\n    /// Returns the internal array within this vector.\n    ///\n    /// Since arrays in Noir are immutable, mutating the returned storage array will not mutate\n    /// the storage held internally by this vector.\n    ///\n    /// Note that uninitialized elements may be zeroed out!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n    ///\n    /// assert(v.storage() == [0, 0, 0, 0, 0]);\n    ///\n    /// v.push(57);\n    /// assert(v.storage() == [57, 0, 0, 0, 0]);\n    /// ```\n    pub fn storage(self) -> [T; MaxLen] {\n        self.storage\n    }\n\n    /// Pushes each element from the given array to this vector.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n    /// vec.extend_from_array([2, 4]);\n    ///\n    /// assert(vec.len == 2);\n    /// assert(vec.get(0) == 2);\n    /// assert(vec.get(1) == 4);\n    /// ```\n    pub fn extend_from_array<let Len: u32>(&mut self, array: [T; Len]) {\n        let new_len = self.len + array.len();\n        assert(new_len <= MaxLen, \"extend_from_array out of bounds\");\n        for i in 0..array.len() {\n            self.storage[self.len + i] = array[i];\n        }\n        self.len = new_len;\n    }\n\n    /// Pushes each element from the given vector to this vector.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n    /// vec.extend_from_vector([2, 4].as_vector());\n    ///\n    /// assert(vec.len == 2);\n    /// assert(vec.get(0) == 2);\n    /// assert(vec.get(1) == 4);\n    /// ```\n    pub fn extend_from_vector(&mut self, vector: [T]) {\n        let new_len = self.len + vector.len();\n        assert(new_len <= MaxLen, \"extend_from_vector out of bounds\");\n        for i in 0..vector.len() {\n            self.storage[self.len + i] = vector[i];\n        }\n        self.len = new_len;\n    }\n\n    /// Pushes each element from the other vector to this vector. The length of\n    /// the other vector is left unchanged.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// ```noir\n    /// let mut v1: BoundedVec<Field, 5> = BoundedVec::new();\n    /// let mut v2: BoundedVec<Field, 7> = BoundedVec::new();\n    ///\n    /// v2.extend_from_array([1, 2, 3]);\n    /// v1.extend_from_bounded_vec(v2);\n    ///\n    /// assert(v1.storage() == [1, 2, 3, 0, 0]);\n    /// assert(v2.storage() == [1, 2, 3, 0, 0, 0, 0]);\n    /// ```\n    pub fn extend_from_bounded_vec<let Len: u32>(&mut self, vec: BoundedVec<T, Len>) {\n        let append_len = vec.len();\n        let new_len = self.len + append_len;\n        assert(new_len <= MaxLen, \"extend_from_bounded_vec out of bounds\");\n\n        if is_unconstrained() {\n            for i in 0..append_len {\n                self.storage[self.len + i] = vec.get_unchecked(i);\n            }\n        } else {\n            // The source vector can be longer than the destination, or vice versa;\n            // regardless we will only ever be able to read or write whichever is\n            // the shorter max length of the two. We asserted that the actual content fits,\n            // but the capacity of the source vector could be higher.\n            let max = crate::cmp::min(Len, MaxLen);\n\n            // Save the last item in case we have to do a fixup on an already full array.\n            let last = if MaxLen > 0 {\n                self.storage[MaxLen - 1]\n            } else {\n                crate::mem::zeroed()\n            };\n\n            for src in 0..max {\n                // Since we are iterating to the static capacity of the arrays,\n                // the destination could be out of bounds. If that's the case,\n                // overwrite the last item, which we'll fixup in the end.\n                // NB using cmp::min resulted in more opcodes here.\n                let mut dst = self.len + src;\n                if dst >= MaxLen { dst = MaxLen - 1; };\n                // Assigning the source or zeroed to avoid having to merge arrays in SSA.\n                self.storage[dst] = if src < append_len {\n                    vec.get_unchecked(src)\n                } else {\n                    last\n                }\n            }\n\n            // Fixup the last item if we have to.\n            if MaxLen > 0 {\n                self.storage[MaxLen - 1] = if (self.len + append_len == MaxLen) & (append_len > 0) {\n                    vec.get_unchecked(append_len - 1)\n                } else {\n                    last\n                }\n            }\n        }\n        self.len = new_len;\n    }\n\n    /// Creates a new vector, populating it with values derived from an array input.\n    /// The maximum length of the vector is determined based on the type signature.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array([1, 2, 3])\n    /// ```\n    pub fn from_array<let Len: u32>(array: [T; Len]) -> Self {\n        static_assert(Len <= MaxLen, \"from array out of bounds\");\n        let mut vec: BoundedVec<T, MaxLen> = BoundedVec::new();\n        vec.extend_from_array(array);\n        vec\n    }\n\n    /// Pops the element at the end of the vector. This will decrease the length\n    /// of the vector by one.\n    ///\n    /// Panics if the vector is empty.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n    /// v.push(1);\n    /// v.push(2);\n    ///\n    /// let two = v.pop();\n    /// let one = v.pop();\n    ///\n    /// assert(two == 2);\n    /// assert(one == 1);\n    ///\n    /// // error: cannot pop from an empty vector\n    /// let _ = v.pop();\n    /// ```\n    pub fn pop(&mut self) -> T {\n        assert(self.len > 0, \"cannot pop from an empty vector\");\n        self.len -= 1;\n\n        let elem = self.storage[self.len];\n        self.storage[self.len] = crate::mem::zeroed();\n        elem\n    }\n\n    /// Returns true if the given predicate returns true for any element\n    /// in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<u32, 3> = BoundedVec::new();\n    /// v.extend_from_array([2, 4, 6]);\n    ///\n    /// let all_even = !v.any(|elem: u32| elem % 2 != 0);\n    /// assert(all_even);\n    /// ```\n    pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = false;\n        if is_unconstrained() {\n            for i in 0..self.len {\n                ret |= predicate(self.storage[i]);\n            }\n        } else {\n            let mut exceeded_len = false;\n            for i in 0..MaxLen {\n                exceeded_len |= i == self.len;\n                if !exceeded_len {\n                    ret |= predicate(self.storage[i]);\n                }\n            }\n        }\n        ret\n    }\n\n    /// Creates a new vector of equal size by calling a closure on each element in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let result = vec.map(|value| value * 2);\n    ///\n    /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn map<U, Env>(&self, f: fn[Env](T) -> U) -> BoundedVec<U, MaxLen> {\n        let mut ret = BoundedVec::new();\n        ret.len = self.len();\n\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                ret.storage[i] = f(self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                ret.storage[i] = if i < self.len() {\n                    f(self.get_unchecked(i))\n                } else {\n                    crate::mem::zeroed()\n                }\n            }\n        }\n\n        ret\n    }\n\n    /// Creates a new vector of equal size by calling a closure on each element\n    /// in this vector, along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let result = vec.mapi(|i, value| i + value * 2);\n    ///\n    /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn mapi<U, Env>(&self, f: fn[Env](u32, T) -> U) -> BoundedVec<U, MaxLen> {\n        let mut ret = BoundedVec::new();\n        ret.len = self.len();\n\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                ret.storage[i] = f(i, self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                ret.storage[i] = if i < self.len() {\n                    f(i, self.get_unchecked(i))\n                } else {\n                    crate::mem::zeroed()\n                }\n            }\n        }\n\n        ret\n    }\n\n    /// Calls a closure on each element in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let mut result = BoundedVec::<u32, 4>::new();\n    /// vec.for_each(|value| result.push(value * 2));\n    ///\n    /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn for_each<Env>(&self, f: fn[Env](T) -> ()) {\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                f(self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    f(self.get_unchecked(i));\n                }\n            }\n        }\n    }\n\n    /// Calls a closure on each element in this vector, along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let mut result = BoundedVec::<u32, 4>::new();\n    /// vec.for_eachi(|i, value| result.push(i + value * 2));\n    ///\n    /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn for_eachi<Env>(&self, f: fn[Env](u32, T) -> ()) {\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                f(i, self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    f(i, self.get_unchecked(i));\n                }\n            }\n        }\n    }\n\n    /// Creates a new BoundedVec from the given array and length.\n    /// The given length must be less than or equal to the length of the array.\n    ///\n    /// This function will zero out any elements at or past index `len` of `array`.\n    /// This incurs an extra runtime cost of O(MaxLen). If you are sure your array is\n    /// zeroed after that index, you can use [`from_parts_unchecked`][Self::from_parts_unchecked] to remove the extra loop.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n    /// assert_eq(vec.len(), 3);\n    /// ```\n    pub fn from_parts(mut array: [T; MaxLen], len: u32) -> Self {\n        assert(len <= MaxLen);\n        let zeroed = crate::mem::zeroed();\n\n        if is_unconstrained() {\n            for i in len..MaxLen {\n                array[i] = zeroed;\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i >= len {\n                    array[i] = zeroed;\n                }\n            }\n        }\n\n        BoundedVec { storage: array, len }\n    }\n\n    /// Creates a new BoundedVec from the given array and length.\n    /// The given length must be less than or equal to the length of the array.\n    ///\n    /// This function is unsafe because it expects all elements past the `len` index\n    /// of `array` to be zeroed, but does not check for this internally. Use `from_parts`\n    /// for a safe version of this function which does zero out any indices past the\n    /// given length. Invalidating this assumption can notably cause `BoundedVec::eq`\n    /// to give incorrect results since it will check even elements past `len`.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n    /// assert_eq(vec.len(), 3);\n    ///\n    /// // invalid use!\n    /// let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n    /// let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n    ///\n    /// // both vecs have length 3 so we'd expect them to be equal, but this\n    /// // fails because elements past the length are still checked in eq\n    /// assert_eq(vec1, vec2); // fails\n    /// ```\n    pub fn from_parts_unchecked(array: [T; MaxLen], len: u32) -> Self {\n        assert(len <= MaxLen);\n        BoundedVec { storage: array, len }\n    }\n}\n\nimpl<T, let MaxLen: u32> Eq for BoundedVec<T, MaxLen>\nwhere\n    T: Eq,\n{\n    fn eq(self, other: BoundedVec<T, MaxLen>) -> bool {\n        // TODO: https://github.com/noir-lang/noir/issues/4837\n        //\n        // We make the assumption that the user has used the proper interface for working with `BoundedVec`s\n        // rather than directly manipulating the internal fields as this can result in an inconsistent internal state.\n        if self.len == other.len {\n            self.storage == other.storage\n        } else {\n            false\n        }\n    }\n}\n\nimpl<T, let MaxLen: u32, let Len: u32> From<[T; Len]> for BoundedVec<T, MaxLen> {\n    fn from(array: [T; Len]) -> BoundedVec<T, MaxLen> {\n        BoundedVec::from_array(array)\n    }\n}\n\nmod bounded_vec_tests {\n\n    mod get {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn panics_when_reading_elements_past_end_of_vec() {\n            let vec: BoundedVec<Field, 5> = BoundedVec::new();\n\n            let _ = vec.get(0);\n        }\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn panics_when_reading_beyond_length() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            let _ = vec.get(3);\n        }\n\n        #[test]\n        fn get_works_within_bounds() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(2), 3);\n            assert_eq(vec.get(4), 5);\n        }\n\n        #[test]\n        fn get_unchecked_works() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            assert_eq(vec.get_unchecked(0), 1);\n            assert_eq(vec.get_unchecked(2), 3);\n        }\n\n        #[test]\n        fn get_unchecked_works_past_len() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            assert_eq(vec.get_unchecked(4), 0);\n        }\n    }\n\n    mod set {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn set_updates_values_properly() {\n            let mut vec = BoundedVec::from_array([0, 0, 0, 0, 0]);\n\n            vec.set(0, 42);\n            assert_eq(vec.storage, [42, 0, 0, 0, 0]);\n\n            vec.set(1, 43);\n            assert_eq(vec.storage, [42, 43, 0, 0, 0]);\n\n            vec.set(2, 44);\n            assert_eq(vec.storage, [42, 43, 44, 0, 0]);\n\n            vec.set(1, 10);\n            assert_eq(vec.storage, [42, 10, 44, 0, 0]);\n\n            vec.set(0, 0);\n            assert_eq(vec.storage, [0, 10, 44, 0, 0]);\n        }\n\n        #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n        fn panics_when_writing_elements_past_end_of_vec() {\n            let mut vec: BoundedVec<Field, 5> = BoundedVec::new();\n            vec.set(0, 42);\n        }\n\n        #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n        fn panics_when_setting_beyond_length() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            vec.set(3, 4);\n        }\n\n        #[test]\n        fn set_unchecked_operations() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            vec.set_unchecked(0, 10);\n            assert_eq(vec.get(0), 10);\n        }\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn set_unchecked_operations_past_len() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            vec.set_unchecked(3, 40);\n            assert_eq(vec.get(3), 40);\n        }\n\n        #[test]\n        fn set_preserves_other_elements() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n            vec.set(2, 30);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 30);\n            assert_eq(vec.get(3), 4);\n            assert_eq(vec.get(4), 5);\n        }\n    }\n\n    mod any {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn returns_false_if_predicate_not_satisfied() {\n            let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, false, false]);\n            let result = vec.any(|value| value);\n\n            assert(!result);\n        }\n\n        #[test]\n        fn returns_true_if_predicate_satisfied() {\n            let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, true, true]);\n            let result = vec.any(|value| value);\n\n            assert(result);\n        }\n\n        #[test]\n        fn returns_false_on_empty_boundedvec() {\n            let vec: BoundedVec<bool, 0> = BoundedVec::new();\n            let result = vec.any(|value| value);\n\n            assert(!result);\n        }\n\n        #[test]\n        fn any_with_complex_predicates() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n            assert(vec.any(|x| x > 3));\n            assert(!vec.any(|x| x > 10));\n            assert(vec.any(|x| x % 2 == 0)); // has a even number\n            assert(vec.any(|x| x == 3)); // has a specific value\n        }\n\n        #[test]\n        fn any_with_partial_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            assert(vec.any(|x| x == 1));\n            assert(vec.any(|x| x == 2));\n            assert(!vec.any(|x| x == 3));\n        }\n    }\n\n    mod map {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn applies_function_correctly() {\n            // docs:start:bounded-vec-map-example\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|value| value * 2);\n            // docs:end:bounded-vec-map-example\n            let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|value| (value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = vec.map(|value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn map_with_conditional_logic() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n            let result = vec.map(|x| if x % 2 == 0 { x * 2 } else { x });\n            let expected = BoundedVec::from_array([1, 4, 3, 8]);\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn map_preserves_length() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|x| x * 2);\n\n            assert_eq(result.len(), vec.len());\n            assert_eq(result.max_len(), vec.max_len());\n        }\n\n        #[test]\n        fn map_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let result = vec.map(|x| x * 2);\n            assert_eq(result, vec);\n            assert_eq(result.len(), 0);\n            assert_eq(result.max_len(), 5);\n        }\n    }\n\n    mod mapi {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn applies_function_correctly() {\n            // docs:start:bounded-vec-mapi-example\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.mapi(|i, value| i + value * 2);\n            // docs:end:bounded-vec-mapi-example\n            let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.mapi(|i, value| (i + value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = vec.mapi(|_, value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn mapi_with_index_branching_logic() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n            let result = vec.mapi(|i, x| if i % 2 == 0 { x * 2 } else { x });\n            let expected = BoundedVec::from_array([2, 2, 6, 4]);\n            assert_eq(result, expected);\n        }\n    }\n\n    mod for_each {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        // map in terms of for_each\n        fn for_each_map<T, U, Env, let MaxLen: u32>(\n            input: BoundedVec<T, MaxLen>,\n            f: fn[Env](T) -> U,\n        ) -> BoundedVec<U, MaxLen> {\n            let mut output = BoundedVec::<U, MaxLen>::new();\n            let output_ref = &mut output;\n            input.for_each(|x| output_ref.push(f(x)));\n            output\n        }\n\n        #[test]\n        fn smoke_test() {\n            let mut acc = 0;\n            let acc_ref = &mut acc;\n            // docs:start:bounded-vec-for-each-example\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            vec.for_each(|value| { *acc_ref += value; });\n            // docs:end:bounded-vec-for-each-example\n            assert_eq(acc, 6);\n        }\n\n        #[test]\n        fn applies_function_correctly() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_each_map(vec, |value| value * 2);\n            let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_each_map(vec, |value| (value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = for_each_map(vec, |value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn for_each_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut count = 0;\n            let count_ref = &mut count;\n            vec.for_each(|_| { *count_ref += 1; });\n            assert_eq(count, 0);\n        }\n\n        #[test]\n        fn for_each_with_side_effects() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            let mut seen = BoundedVec::<u32, 3>::new();\n            let seen_ref = &mut seen;\n            vec.for_each(|x| seen_ref.push(x));\n            assert_eq(seen, vec);\n        }\n    }\n\n    mod for_eachi {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        // mapi in terms of for_eachi\n        fn for_eachi_mapi<T, U, Env, let MaxLen: u32>(\n            input: BoundedVec<T, MaxLen>,\n            f: fn[Env](u32, T) -> U,\n        ) -> BoundedVec<U, MaxLen> {\n            let mut output = BoundedVec::<U, MaxLen>::new();\n            let output_ref = &mut output;\n            input.for_eachi(|i, x| output_ref.push(f(i, x)));\n            output\n        }\n\n        #[test]\n        fn smoke_test() {\n            let mut acc = 0;\n            let acc_ref = &mut acc;\n            // docs:start:bounded-vec-for-eachi-example\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            vec.for_eachi(|i, value| { *acc_ref += i * value; });\n            // docs:end:bounded-vec-for-eachi-example\n\n            // 0 * 1 + 1 * 2 + 2 * 3\n            assert_eq(acc, 8);\n        }\n\n        #[test]\n        fn applies_function_correctly() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_eachi_mapi(vec, |i, value| i + value * 2);\n            let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_eachi_mapi(vec, |i, value| (i + value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = for_eachi_mapi(vec, |_, value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn for_eachi_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut count = 0;\n            let count_ref = &mut count;\n            vec.for_eachi(|_, _| { *count_ref += 1; });\n            assert_eq(count, 0);\n        }\n\n        #[test]\n        fn for_eachi_with_index_tracking() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([10, 20, 30]);\n            let mut indices = BoundedVec::<u32, 3>::new();\n            let indices_ref = &mut indices;\n            vec.for_eachi(|i, _| indices_ref.push(i));\n\n            let expected = BoundedVec::from_array([0, 1, 2]);\n            assert_eq(indices, expected);\n        }\n\n    }\n\n    mod from_array {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn empty() {\n            let empty_array: [Field; 0] = [];\n            let bounded_vec = BoundedVec::from_array([]);\n\n            assert_eq(bounded_vec.max_len(), 0);\n            assert_eq(bounded_vec.len(), 0);\n            assert_eq(bounded_vec.storage(), empty_array);\n        }\n\n        #[test]\n        fn equal_len() {\n            let array = [1, 2, 3];\n            let bounded_vec = BoundedVec::from_array(array);\n\n            assert_eq(bounded_vec.max_len(), 3);\n            assert_eq(bounded_vec.len(), 3);\n            assert_eq(bounded_vec.storage(), array);\n        }\n\n        #[test]\n        fn max_len_greater_then_array_len() {\n            let array = [1, 2, 3];\n            let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array(array);\n\n            assert_eq(bounded_vec.max_len(), 10);\n            assert_eq(bounded_vec.len(), 3);\n            assert_eq(bounded_vec.get(0), 1);\n            assert_eq(bounded_vec.get(1), 2);\n            assert_eq(bounded_vec.get(2), 3);\n        }\n\n        #[test(should_fail_with = \"from array out of bounds\")]\n        fn max_len_lower_then_array_len() {\n            let _: BoundedVec<Field, 2> = BoundedVec::from_array([0; 3]);\n        }\n\n        #[test]\n        fn from_array_preserves_order() {\n            let array = [5, 3, 1, 4, 2];\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array(array);\n            for i in 0..array.len() {\n                assert_eq(vec.get(i), array[i]);\n            }\n        }\n\n        #[test]\n        fn from_array_with_different_types() {\n            let bool_array = [true, false, true];\n            let bool_vec: BoundedVec<bool, 3> = BoundedVec::from_array(bool_array);\n            assert_eq(bool_vec.len(), 3);\n            assert_eq(bool_vec.get(0), true);\n            assert_eq(bool_vec.get(1), false);\n        }\n    }\n\n    mod trait_from {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::convert::From;\n\n        #[test]\n        fn simple() {\n            let array = [1, 2];\n            let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from(array);\n\n            assert_eq(bounded_vec.max_len(), 10);\n            assert_eq(bounded_vec.len(), 2);\n            assert_eq(bounded_vec.get(0), 1);\n            assert_eq(bounded_vec.get(1), 2);\n        }\n    }\n\n    mod trait_eq {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn empty_equality() {\n            let bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n            let bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n\n            assert_eq(bounded_vec1, bounded_vec2);\n        }\n\n        #[test]\n        fn inequality() {\n            let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n            let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n            bounded_vec1.push(1);\n            bounded_vec2.push(2);\n\n            assert(bounded_vec1 != bounded_vec2);\n        }\n    }\n\n    mod from_parts {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn from_parts() {\n            // docs:start:from-parts\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n            assert_eq(vec.len(), 3);\n\n            // Any elements past the given length are zeroed out, so these\n            // two BoundedVecs will be completely equal\n            let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 1], 3);\n            let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 2], 3);\n            assert_eq(vec1, vec2);\n            // docs:end:from-parts\n        }\n\n        #[test]\n        fn from_parts_unchecked() {\n            // docs:start:from-parts-unchecked\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n            assert_eq(vec.len(), 3);\n\n            // invalid use!\n            let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n            let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n\n            // both vecs have length 3 so we'd expect them to be equal, but this\n            // fails because elements past the length are still checked in eq\n            assert(vec1 != vec2);\n            // docs:end:from-parts-unchecked\n        }\n    }\n\n    mod push_pop {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn push_and_pop_operations() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n            assert_eq(vec.len(), 0);\n\n            vec.push(1);\n            assert_eq(vec.len(), 1);\n            assert_eq(vec.get(0), 1);\n\n            vec.push(2);\n            assert_eq(vec.len(), 2);\n            assert_eq(vec.get(1), 2);\n\n            let popped = vec.pop();\n            assert_eq(popped, 2);\n            assert_eq(vec.len(), 1);\n\n            let popped2 = vec.pop();\n            assert_eq(popped2, 1);\n            assert_eq(vec.len(), 0);\n        }\n\n        #[test(should_fail_with = \"push out of bounds\")]\n        fn push_to_full_vector() {\n            let mut vec: BoundedVec<u32, 2> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n            vec.push(3); // should panic\n        }\n\n        #[test(should_fail_with = \"cannot pop from an empty vector\")]\n        fn pop_from_empty_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let _ = vec.pop(); // should panic\n        }\n\n        #[test]\n        fn push_pop_cycle() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n\n            // push to full\n            vec.push(1);\n            vec.push(2);\n            vec.push(3);\n            assert_eq(vec.len(), 3);\n\n            // pop all\n            assert_eq(vec.pop(), 3);\n            assert_eq(vec.pop(), 2);\n            assert_eq(vec.pop(), 1);\n            assert_eq(vec.len(), 0);\n\n            // push again\n            vec.push(4);\n            assert_eq(vec.len(), 1);\n            assert_eq(vec.get(0), 4);\n        }\n    }\n\n    mod extend {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn extend_from_array() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_array([2, 3]);\n\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_vector([2, 3].as_vector());\n\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec() {\n            // The source deliberately has a higher capacity,\n            // to make sure we are not trying to assign out-of-bounds.\n            let mut vec1: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 9> = BoundedVec::new();\n\n            vec1.push(1);\n            vec2.push(2);\n            vec2.push(3);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_limit() {\n            // Capacity and contents chosen so the last item must be assigned to.\n            let mut vec1: BoundedVec<u32, 2> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 5> = BoundedVec::new();\n\n            vec1.push(1);\n            vec2.push(2);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 2);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_full_and_empty() {\n            // Capacity and contents chosen so the last item must be assigned to.\n            let mut vec1: BoundedVec<u32, 2> = BoundedVec::new();\n            let vec2: BoundedVec<u32, 5> = BoundedVec::new();\n\n            vec1.push(1);\n            vec1.push(2);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 2);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_zero_len() {\n            let mut vec1: BoundedVec<u32, 0> = BoundedVec::new();\n            let vec2: BoundedVec<u32, 0> = BoundedVec::new();\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 0);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_last_zeroed() {\n            let mut vec1: BoundedVec<u32, 4> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 4> = BoundedVec::new();\n\n            vec1.push(1);\n            vec1.push(2);\n            vec2.push(3);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get_unchecked(3), 0);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_empty_self() {\n            // self.len == 0 with Len > MaxLen: the loop doesn't reach\n            // the last storage slot, so the fixup must write it.\n            let mut vec1: BoundedVec<u32, 3> = BoundedVec::new();\n            let vec2: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_equal_capacity() {\n            // Len == MaxLen, fills to capacity.\n            let mut vec1: BoundedVec<u32, 4> = BoundedVec::new();\n            vec1.push(1);\n            let vec2: BoundedVec<u32, 4> = BoundedVec::from_array([2, 3, 4]);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 4);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n            assert_eq(vec1.get(3), 4);\n        }\n\n        #[test(should_fail_with = \"extend_from_array out of bounds\")]\n        fn extend_array_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_array([2, 3, 4]); // should panic\n        }\n\n        #[test(should_fail_with = \"extend_from_vector out of bounds\")]\n        fn extend_vector_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_vector([2, 3, 4].as_vector()); // S]should panic\n        }\n\n        #[test(should_fail_with = \"extend_from_bounded_vec out of bounds\")]\n        fn extend_bounded_vec_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            let other: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            vec.extend_from_bounded_vec(other); // should panic\n        }\n\n        #[test]\n        fn extend_with_empty_collections() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let original_len = vec.len();\n\n            vec.extend_from_array([]);\n            assert_eq(vec.len(), original_len);\n\n            vec.extend_from_vector([].as_vector());\n            assert_eq(vec.len(), original_len);\n\n            let empty: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.extend_from_bounded_vec(empty);\n            assert_eq(vec.len(), original_len);\n        }\n    }\n\n    mod storage {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn storage_consistency() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n            // test initial storage state\n            assert_eq(vec.storage(), [0, 0, 0, 0, 0]);\n\n            vec.push(1);\n            vec.push(2);\n\n            // test storage after modifications\n            assert_eq(vec.storage(), [1, 2, 0, 0, 0]);\n\n            // storage doesn't change length\n            assert_eq(vec.len(), 2);\n            assert_eq(vec.max_len(), 5);\n        }\n\n        #[test]\n        fn storage_after_pop() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n\n            let _ = vec.pop();\n            // after pop, the last element should be zeroed\n            assert_eq(vec.storage(), [1, 2, 0]);\n            assert_eq(vec.len(), 2);\n        }\n\n        #[test]\n        fn vector_immutable() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            let storage = vec.storage();\n\n            assert_eq(storage, [1, 2, 3]);\n\n            // Verify that the original vector is unchanged\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n    }\n}\n"
     },
     "67": {
       "function_locations": [
@@ -7067,107 +7063,115 @@
         },
         {
           "name": "PrivateContext::set_expiration_timestamp",
-          "start": 33219
+          "start": 33755
         },
         {
           "name": "PrivateContext::assert_note_exists",
-          "start": 34614
+          "start": 35150
         },
         {
           "name": "PrivateContext::assert_nullifier_exists",
-          "start": 37250
+          "start": 37786
         },
         {
           "name": "PrivateContext::request_nhk_app",
-          "start": 39347
+          "start": 39883
         },
         {
           "name": "PrivateContext::request_ovsk_app",
-          "start": 40993
+          "start": 41529
         },
         {
           "name": "PrivateContext::request_sk_app",
-          "start": 42407
+          "start": 42943
         },
         {
           "name": "PrivateContext::message_portal",
-          "start": 45625
+          "start": 46161
         },
         {
           "name": "PrivateContext::consume_l1_to_l2_message",
-          "start": 47507
+          "start": 48043
         },
         {
           "name": "PrivateContext::emit_private_log_unsafe",
-          "start": 51919
+          "start": 52601
+        },
+        {
+          "name": "PrivateContext::emit_private_log_vec_unsafe",
+          "start": 53321
         },
         {
           "name": "PrivateContext::emit_raw_note_log_unsafe",
-          "start": 53508
+          "start": 54884
+        },
+        {
+          "name": "PrivateContext::emit_raw_note_log_vec_unsafe",
+          "start": 55706
         },
         {
           "name": "PrivateContext::emit_contract_class_log",
-          "start": 54103
+          "start": 56314
         },
         {
           "name": "PrivateContext::call_private_function",
-          "start": 58662
+          "start": 60873
         },
         {
           "name": "PrivateContext::static_call_private_function",
-          "start": 59864
+          "start": 62075
         },
         {
           "name": "PrivateContext::call_private_function_no_args",
-          "start": 60879
+          "start": 63090
         },
         {
           "name": "PrivateContext::static_call_private_function_no_args",
-          "start": 61732
+          "start": 63943
         },
         {
           "name": "PrivateContext::call_private_function_with_args_hash",
-          "start": 62710
+          "start": 64921
         },
         {
           "name": "PrivateContext::call_public_function",
-          "start": 66870
+          "start": 68820
         },
         {
           "name": "PrivateContext::static_call_public_function",
-          "start": 68137
+          "start": 70087
         },
         {
           "name": "PrivateContext::call_public_function_no_args",
-          "start": 69156
+          "start": 71106
         },
         {
           "name": "PrivateContext::static_call_public_function_no_args",
-          "start": 70055
+          "start": 72005
         },
         {
           "name": "PrivateContext::call_public_function_with_calldata_hash",
-          "start": 71244
+          "start": 73194
         },
         {
           "name": "PrivateContext::set_public_teardown_function",
-          "start": 73772
+          "start": 75722
         },
         {
           "name": "PrivateContext::set_public_teardown_function_with_calldata_hash",
-          "start": 75043
+          "start": 76993
         },
         {
           "name": "PrivateContext::next_counter",
-          "start": 80447
+          "start": 82397
         },
         {
           "name": "<impl Empty for PrivateContext>::empty",
-          "start": 80616
+          "start": 82566
         }
       ],
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/private_context.nr",
-      "source": "use crate::{\n    context::{inputs::PrivateContextInputs, NoteExistenceRequest, NullifierExistenceRequest, ReturnsHash},\n    hash::{hash_args, hash_calldata_array},\n    keys::constants::{NULLIFIER_INDEX, NUM_KEY_TYPES, OUTGOING_INDEX, public_key_domain_separators},\n    messaging::process_l1_to_l2_message,\n    oracle::{\n        block_header::get_block_header_at,\n        call_private_function::call_private_function_internal,\n        execution_cache,\n        key_validation_request::get_key_validation_request,\n        logs::notify_created_contract_class_log,\n        notes::notify_nullified_note,\n        nullifiers::notify_created_nullifier,\n        public_call::assert_valid_public_call_data,\n        tx_phase::{is_execution_in_revertible_phase, notify_revertible_phase_start},\n    },\n};\nuse crate::logging::aztecnr_trace_log_format;\nuse crate::protocol::{\n    abis::{\n        block_header::BlockHeader,\n        call_context::CallContext,\n        function_selector::FunctionSelector,\n        gas_settings::GasSettings,\n        log_hash::LogHash,\n        note_hash::NoteHash,\n        nullifier::Nullifier,\n        private_call_request::PrivateCallRequest,\n        private_circuit_public_inputs::PrivateCircuitPublicInputs,\n        private_log::{PrivateLog, PrivateLogData},\n        public_call_request::PublicCallRequest,\n        validation_requests::{KeyValidationRequest, KeyValidationRequestAndSeparator},\n    },\n    address::{AztecAddress, EthAddress},\n    constants::{\n        CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, MAX_CONTRACT_CLASS_LOGS_PER_CALL, MAX_ENQUEUED_CALLS_PER_CALL,\n        MAX_KEY_VALIDATION_REQUESTS_PER_CALL, MAX_L2_TO_L1_MSGS_PER_CALL, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL,\n        MAX_NOTE_HASHES_PER_CALL, MAX_NULLIFIER_READ_REQUESTS_PER_CALL, MAX_NULLIFIERS_PER_CALL,\n        MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL, MAX_PRIVATE_LOGS_PER_CALL, MAX_TX_LIFETIME,\n        NULL_MSG_SENDER_CONTRACT_ADDRESS, PRIVATE_LOG_CIPHERTEXT_LEN,\n    },\n    hash::compute_contract_class_log_hash,\n    messaging::l2_to_l1_message::L2ToL1Message,\n    side_effect::{Counted, scoped::Scoped},\n    traits::{Empty, Hash, ToField},\n    utils::arrays::{ClaimedLengthArray, trimmed_array_length_hint},\n};\n\n/// # PrivateContext\n///\n/// The **main interface** between an #[external(\"private\")] function and the Aztec blockchain.\n///\n/// An instance of the PrivateContext is initialized automatically at the outset of every private function, within the\n/// #[external(\"private\")] macro, so you'll never need to consciously instantiate this yourself.\n///\n/// The instance is always named `context`, and it is always be available within the body of every\n/// #[external(\"private\")] function in your smart contract.\n///\n/// > For those used to \"vanilla\" Noir, it might be jarring to have access to > `context` without seeing a declaration\n/// `let context = PrivateContext::new(...)` > within the body of your function. This is just a consequence of using >\n/// macros to tidy-up verbose boilerplate. You can use `nargo expand` to > expand all macros, if you dare.\n///\n/// Typical usage for a smart contract developer will be to call getter methods of the PrivateContext.\n///\n/// _Pushing_ data and requests to the context is mostly handled within aztec-nr's own functions, so typically a smart\n/// contract developer won't need to call any setter methods directly.\n///\n/// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n/// find yourself doing this, please > open an issue on GitHub to describe your use case: it might be that > new\n/// functionality should be added to aztec-nr.\n///\n/// ## Responsibilities\n/// - Exposes contextual data to a private function:\n/// - Data relating to how this private function was called.\n/// - msg_sender\n/// - this_address - (the contract address of the private function being executed)\n/// - See `CallContext` for more data.\n/// - Data relating to the transaction in which this private function is being executed.\n/// - chain_id\n/// - version\n/// - gas_settings\n/// - Provides state access:\n/// - Access to the \"Anchor block\" header. Recall, a private function cannot read from the \"current\" block header, but\n/// must read from some historical block header, because as soon as private function execution begins (asynchronously,\n/// on a user's device), the public state of the chain (the \"current state\") will have progressed forward. We call this\n/// reference the \"Anchor block\". See `BlockHeader`.\n///   - Enables consumption of L1->L2 messages.\n/// - Enables calls to functions of other smart contracts:\n/// - Private function calls\n/// - Enqueueing of public function call requests (Since public functions are executed at a later time, by a block\n/// proposer, we say they are \"enqueued\").\n/// - Writes data to the blockchain:\n/// - New notes\n/// - New nullifiers\n/// - Private logs (for sending encrypted note contents or encrypted events)\n///   - New L2->L1 messages.\n/// - Provides args to the private function (handled by the #[external(\"private\")] macro).\n/// - Returns the return values of this private function (handled by the\n///   #[external(\"private\")] macro).\n/// - Makes Key Validation Requests.\n/// - Private functions are not allowed to see master secret keys, because we do not trust them. They are instead given\n/// \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then request validation of\n/// this claim, by making a \"key validation request\" to the protocol's kernel circuits (which _are_ allowed to see\n/// certain master secret keys).\n///\n/// ## Advanced Responsibilities\n///\n/// - Ultimately, the PrivateContext is responsible for constructing the PrivateCircuitPublicInputs of the private\n/// function being executed. All private functions on Aztec must have public inputs which adhere to the rigid layout of\n/// the PrivateCircuitPublicInputs, in order to be compatible with the protocol's kernel circuits. A well-known\n/// misnomer:\n/// - \"public inputs\" contain both inputs and outputs of this function.\n/// - By \"outputs\" we mean a lot more side-effects than just the \"return values\" of the function.\n/// - Most of the so-called \"public inputs\" are kept _private_, and never leak to the outside world, because they are\n/// 'swallowed' by the protocol's kernel circuits before the tx is sent to the network. Only the following are exposed\n/// to the outside world:\n/// - New note_hashes\n/// - New nullifiers\n/// - New private logs\n///     - New L2->L1 messages\n/// - New enqueued public function call requests All the above-listed arrays of side-effects can be padded by the\n/// user's wallet (through instructions to the kernel circuits, via the PXE) to obscure their true lengths.\n///\n/// ## Syntax Justification\n///\n/// Both user-defined functions _and_ most functions in aztec-nr need access to the PrivateContext instance to\n/// read/write data. This is why you'll see the arguably-ugly pervasiveness of the \"context\" throughout your smart\n/// contract and the aztec-nr library. For example, `&mut context` is prevalent. In some languages, you can access and\n/// mutate a global variable (such as a PrivateContext instance) from a function without polluting the function's\n/// parameters. With Noir, a function must explicitly pass control of a mutable variable to another function, by\n/// reference. Since many functions in aztec-nr need to be able to push new data to the PrivateContext, they need to be\n/// handed a mutable reference _to_ the context as a parameter. For example, `Context` is prevalent as a generic\n/// parameter, to give better type safety at compile time. Many `aztec-nr` functions don't make sense if they're called\n/// in a particular runtime (private, public or utility), and so are intentionally only implemented over certain\n/// [Private|Public|Utility]Context structs. This gives smart contract developers a much faster feedback loop if\n/// they're making a mistake, as an error will be thrown by the LSP or when they compile their contract.\n///\n#[derive(Eq)]\npub struct PrivateContext {\n    // docs:start:private-context\n    pub inputs: PrivateContextInputs,\n    pub side_effect_counter: u32,\n\n    pub min_revertible_side_effect_counter: u32,\n    pub is_fee_payer: bool,\n\n    pub args_hash: Field,\n    pub return_hash: Field,\n\n    pub expiration_timestamp: u64,\n\n    pub(crate) note_hash_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>,\n    pub(crate) nullifier_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n    key_validation_requests_and_separators: BoundedVec<KeyValidationRequestAndSeparator, MAX_KEY_VALIDATION_REQUESTS_PER_CALL>,\n\n    pub note_hashes: BoundedVec<Counted<NoteHash>, MAX_NOTE_HASHES_PER_CALL>,\n    pub nullifiers: BoundedVec<Counted<Nullifier>, MAX_NULLIFIERS_PER_CALL>,\n\n    pub private_call_requests: BoundedVec<PrivateCallRequest, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL>,\n    pub public_call_requests: BoundedVec<Counted<PublicCallRequest>, MAX_ENQUEUED_CALLS_PER_CALL>,\n    pub public_teardown_call_request: PublicCallRequest,\n    pub l2_to_l1_msgs: BoundedVec<Counted<L2ToL1Message>, MAX_L2_TO_L1_MSGS_PER_CALL>,\n    // docs:end:private-context\n\n    // Header of a block whose state is used during private execution (not the block the transaction is included in).\n    pub anchor_block_header: BlockHeader,\n\n    pub private_logs: BoundedVec<Counted<PrivateLogData>, MAX_PRIVATE_LOGS_PER_CALL>,\n    pub contract_class_logs_hashes: BoundedVec<Counted<LogHash>, MAX_CONTRACT_CLASS_LOGS_PER_CALL>,\n\n    // Contains the last key validation request for each key type. This is used to cache the last request and avoid\n    // fetching the same request multiple times. The index of the array corresponds to the key type (0 nullifier, 1\n    // incoming, 2 outgoing, 3 tagging).\n    pub last_key_validation_requests: [Option<KeyValidationRequest>; NUM_KEY_TYPES],\n\n    pub expected_non_revertible_side_effect_counter: u32,\n    pub expected_revertible_side_effect_counter: u32,\n}\n\nimpl PrivateContext {\n    pub fn new(inputs: PrivateContextInputs, args_hash: Field) -> PrivateContext {\n        PrivateContext {\n            inputs,\n            side_effect_counter: inputs.start_side_effect_counter + 1,\n            min_revertible_side_effect_counter: 0,\n            is_fee_payer: false,\n            args_hash,\n            return_hash: 0,\n            expiration_timestamp: inputs.anchor_block_header.timestamp() + MAX_TX_LIFETIME,\n            note_hash_read_requests: BoundedVec::new(),\n            nullifier_read_requests: BoundedVec::new(),\n            key_validation_requests_and_separators: BoundedVec::new(),\n            note_hashes: BoundedVec::new(),\n            nullifiers: BoundedVec::new(),\n            anchor_block_header: inputs.anchor_block_header,\n            private_call_requests: BoundedVec::new(),\n            public_call_requests: BoundedVec::new(),\n            public_teardown_call_request: PublicCallRequest::empty(),\n            l2_to_l1_msgs: BoundedVec::new(),\n            private_logs: BoundedVec::new(),\n            contract_class_logs_hashes: BoundedVec::new(),\n            last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n            expected_non_revertible_side_effect_counter: 0,\n            expected_revertible_side_effect_counter: 0,\n        }\n    }\n\n    /// Returns the contract address that initiated this function call.\n    ///\n    /// This is similar to `msg.sender` in Solidity (hence the name).\n    ///\n    /// Important Note: Since Aztec doesn't have a concept of an EoA (Externally-owned Account), the msg_sender is\n    /// \"none\" for the first function call of every transaction. The first function call of a tx is likely to be a call\n    /// to the user's account contract, so this quirk will most often be handled by account contract developers.\n    ///\n    /// # Returns\n    /// * `Option<AztecAddress>` - The address of the smart contract that called this function (be it an app contract\n    /// or a user's account contract). Returns `Option<AztecAddress>::none` for the first function call of the tx. No\n    /// other _private_ function calls in the tx will have a `none` msg_sender, but _public_ function calls might (see\n    /// the PublicContext).\n    pub fn maybe_msg_sender(self) -> Option<AztecAddress> {\n        let maybe_msg_sender = self.inputs.call_context.msg_sender;\n        if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n            Option::none()\n        } else {\n            Option::some(maybe_msg_sender)\n        }\n    }\n\n    /// Returns the contract address of the current function being executed.\n    ///\n    /// This is equivalent to `address(this)` in Solidity (hence the name). Use this to identify the current contract's\n    /// address, commonly needed for access control or when interacting with other contracts.\n    ///\n    /// # Returns\n    /// * `AztecAddress` - The contract address of the current function being executed.\n    ///\n    pub fn this_address(self) -> AztecAddress {\n        self.inputs.call_context.contract_address\n    }\n\n    /// Returns the chain ID of the current network.\n    ///\n    /// This is similar to `block.chainid` in Solidity. Returns the unique identifier for the blockchain network this\n    /// transaction is executing on.\n    ///\n    /// Helps prevent cross-chain replay attacks. Useful if implementing multi-chain contract logic.\n    ///\n    /// # Returns\n    /// * `Field` - The chain ID as a field element\n    ///\n    pub fn chain_id(self) -> Field {\n        self.inputs.tx_context.chain_id\n    }\n\n    /// Returns the Aztec protocol version that this transaction is executing under. Different versions may have\n    /// different rules, opcodes, or cryptographic primitives.\n    ///\n    /// This is similar to how Ethereum has different EVM versions.\n    ///\n    /// Useful for forward/backward compatibility checks\n    ///\n    /// Not to be confused with contract versions; this is the protocol version.\n    ///\n    /// # Returns\n    /// * `Field` - The protocol version as a field element\n    ///\n    pub fn version(self) -> Field {\n        self.inputs.tx_context.version\n    }\n\n    /// Returns the gas settings for the current transaction.\n    ///\n    /// This provides information about gas limits and pricing for the transaction, similar to `tx.gasprice` and gas\n    /// limits in Ethereum. However, Aztec has a more sophisticated gas model with separate accounting for L2\n    /// computation and data availability (DA) costs.\n    ///\n    /// # Returns\n    /// * `GasSettings` - Struct containing gas limits and fee information\n    ///\n    pub fn gas_settings(self) -> GasSettings {\n        self.inputs.tx_context.gas_settings\n    }\n\n    /// Returns the function selector of the currently executing function.\n    ///\n    /// Low-level function: Ordinarily, smart contract developers will not need to access this.\n    ///\n    /// This is similar to `msg.sig` in Solidity, which returns the first 4 bytes of the function signature. In Aztec,\n    /// the selector uniquely identifies which function within the contract is being called.\n    ///\n    /// # Returns\n    /// * `FunctionSelector` - The 4-byte function identifier\n    ///\n    /// # Advanced\n    /// Only #[external(\"private\")] functions have a function selector as a protocol- enshrined concept. The function\n    /// selectors of private functions are baked into the preimage of the contract address, and are used by the\n    /// protocol's kernel circuits to identify each private function and ensure the correct one is being executed.\n    ///\n    /// Used internally for function dispatch and call verification.\n    ///\n    pub fn selector(self) -> FunctionSelector {\n        self.inputs.call_context.function_selector\n    }\n\n    /// Returns the hash of the arguments passed to the current function.\n    ///\n    /// Very low-level function: You shouldn't need to call this. The #[external(\"private\")] macro calls this, and it\n    /// makes the arguments neatly available to the body of your private function.\n    ///\n    /// # Returns\n    /// * `Field` - Hash of the function arguments\n    ///\n    /// # Advanced\n    /// * Arguments are hashed to reduce proof size and verification time\n    /// * Enables efficient argument passing in recursive function calls\n    /// * The hash can be used to retrieve the original arguments from the PXE.\n    ///\n    pub fn get_args_hash(self) -> Field {\n        self.args_hash\n    }\n\n    /// Pushes a new note_hash to the Aztec blockchain's global Note Hash Tree (a state tree).\n    ///\n    /// A note_hash is a commitment to a piece of private state.\n    ///\n    /// Low-level function: Ordinarily, smart contract developers will not need to manually call this. Aztec-nr's state\n    /// variables (see `../state_vars/`) are designed to understand when to create and push new note hashes.\n    ///\n    /// # Arguments\n    /// * `note_hash` - The new note_hash.\n    ///\n    /// # Advanced\n    /// From here, the protocol's kernel circuits will take over and insert the note_hash into the protocol's \"note\n    /// hash tree\" (in the Base Rollup circuit). Before insertion, the protocol will:\n    /// - \"Silo\" the `note_hash` with the contract address of this function, to yield a `siloed_note_hash`. This\n    /// prevents state collisions between different smart contracts.\n    /// - Ensure uniqueness of the `siloed_note_hash`, to prevent Faerie-Gold attacks, by hashing the\n    /// `siloed_note_hash` with a unique value, to yield a `unique_siloed_note_hash` (see the protocol spec for more).\n    ///\n    /// In addition to calling this function, aztec-nr provides the contents of the newly-created note to the PXE, via\n    /// the `notify_created_note` oracle.\n    ///\n    /// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n    /// find yourself doing this, > please open an issue on GitHub to describe your use case: it might be > that new\n    /// functionality should be added to aztec-nr.\n    ///\n    pub fn push_note_hash(&mut self, note_hash: Field) {\n        self.note_hashes.push(Counted::new(note_hash, self.next_counter()));\n    }\n\n    /// Creates a new [nullifier](crate::nullifier).\n    ///\n    /// ## Safety\n    ///\n    /// This is a low-level function that must be used with great care to avoid subtle corruption of contract state.\n    /// Instead of calling this function, consider using the higher-level [`crate::state_vars::SingleUseClaim`].\n    ///\n    /// In particular, callers must ensure all nullifiers created by a contract are properly domain-separated, so that\n    /// unrelated components don't interfere with one another (e.g. a transaction nullifier accidentally marking a\n    /// variable as initialized). Only [`PrivateContext::push_nullifier_for_note_hash`] should be used for note\n    /// nullifiers, never this one.\n    ///\n    /// ## Advanced\n    ///\n    /// The raw `nullifier` is not what is inserted into the Aztec state tree: it will be first siloed by contract\n    /// address via [`crate::protocol::hash::compute_siloed_nullifier`] in order to prevent accidental or malicious\n    /// interference of nullifiers from different contracts.\n    pub fn push_nullifier(&mut self, nullifier: Field) {\n        notify_created_nullifier(nullifier);\n        self.nullifiers.push(Nullifier { value: nullifier, note_hash: 0 }.count(self.next_counter()));\n    }\n\n    /// Creates a new [nullifier](crate::nullifier) associated with a note.\n    ///\n    /// This is a variant of [`PrivateContext::push_nullifier`] that is used for note nullifiers, i.e. nullifiers that\n    /// correspond to a note. If a note and its nullifier are created in the same transaction, then the private kernels\n    /// will 'squash' these values, deleting them both as if they never existed and reducing transaction fees.\n    ///\n    /// The `nullification_note_hash` must be the result of calling\n    /// [`crate::note::utils::compute_confirmed_note_hash_for_nullification`] for pending notes, and `0` for settled\n    /// notes (which cannot be squashed).\n    ///\n    /// ## Safety\n    ///\n    /// This is a low-level function that must be used with great care to avoid subtle corruption of contract state.\n    /// Instead of calling this function, consider using the higher-level [`crate::note::lifecycle::destroy_note`].\n    ///\n    /// The precautions listed for [`PrivateContext::push_nullifier`] apply here as well, and callers should\n    /// additionally ensure `nullification_note_hash` corresponds to a note emitted by this contract, with its hash\n    /// computed in the same transaction execution phase as the call to this function. Finally, only this function\n    /// should be used for note nullifiers, never [`PrivateContext::push_nullifier`].\n    ///\n    /// Failure to do these things can result in unprovable contexts, accidental deletion of notes, or double-spend\n    /// attacks.\n    pub fn push_nullifier_for_note_hash(&mut self, nullifier: Field, nullification_note_hash: Field) {\n        let nullifier_counter = self.next_counter();\n        notify_nullified_note(nullifier, nullification_note_hash, nullifier_counter);\n        self.nullifiers.push(Nullifier { value: nullifier, note_hash: nullification_note_hash }.count(\n            nullifier_counter,\n        ));\n    }\n\n    /// Returns the anchor block header - the historical block header that this private function is reading from.\n    ///\n    /// A private function CANNOT read from the \"current\" block header, but must read from some older block header,\n    /// because as soon as private function execution begins (asynchronously, on a user's device), the public state of\n    /// the chain (the \"current state\") will have progressed forward.\n    ///\n    /// # Returns\n    /// * `BlockHeader` - The anchor block header.\n    ///\n    /// # Advanced\n    /// * All private functions of a tx read from the same anchor block header.\n    /// * The protocol asserts that the `expiration_timestamp` of every tx is at most 24 hours beyond the timestamp of\n    /// the tx's chosen anchor block header. This enables the network's nodes to safely prune old txs from the mempool.\n    /// Therefore, the chosen block header _must_ be one from within the last 24 hours.\n    ///\n    pub fn get_anchor_block_header(self) -> BlockHeader {\n        self.anchor_block_header\n    }\n\n    /// Returns the header of any historical block at or before the anchor block.\n    ///\n    /// This enables private contracts to access information from even older blocks than the anchor block header.\n    ///\n    /// Useful for time-based contract logic that needs to compare against multiple historical points.\n    ///\n    /// # Arguments\n    /// * `block_number` - The block number to retrieve (must be <= anchor block number)\n    ///\n    /// # Returns\n    /// * `BlockHeader` - The header of the requested historical block\n    ///\n    /// # Advanced\n    /// This function uses an oracle to fetch block header data from the user's PXE. Depending on how much blockchain\n    /// data the user's PXE has been set up to store, this might require a query from the PXE to another Aztec node to\n    /// get the data. > This is generally true of all oracle getters (see `../oracle`).\n    ///\n    /// Each block header gets hashed and stored as a leaf in the protocol's Archive Tree. In fact, the i-th block\n    /// header gets stored at the i-th leaf index of the Archive Tree. Behind the scenes, this `get_block_header_at`\n    /// function will add Archive Tree merkle-membership constraints (~3k) to your smart contract function's circuit,\n    /// to prove existence of the block header in the Archive Tree.\n    ///\n    /// Note: we don't do any caching, so avoid making duplicate calls for the same block header, because each call\n    /// will add duplicate constraints.\n    ///\n    /// Calling this function is more expensive (constraint-wise) than getting the anchor block header (via\n    /// `get_block_header`). This is because the anchor block's merkle membership proof is handled by Aztec's protocol\n    /// circuits, and is only performed once for the entire tx because all private functions of a tx share a common\n    /// anchor block header. Therefore, the cost (constraint-wise) of calling `get_block_header` is effectively free.\n    ///\n    pub fn get_block_header_at(self, block_number: u32) -> BlockHeader {\n        get_block_header_at(block_number, self)\n    }\n\n    /// Sets the hash of the return values for this private function.\n    ///\n    /// Very low-level function: this is called by the #[external(\"private\")] macro.\n    ///\n    /// # Arguments\n    /// * `serialized_return_values` - The serialized return values as a field array\n    ///\n    pub fn set_return_hash<let N: u32>(&mut self, serialized_return_values: [Field; N]) {\n        let return_hash = hash_args(serialized_return_values);\n        self.return_hash = return_hash;\n        execution_cache::store(serialized_return_values, return_hash);\n    }\n\n    /// Builds the PrivateCircuitPublicInputs for this private function, to ensure compatibility with the protocol's\n    /// kernel circuits.\n    ///\n    /// Very low-level function: This function is automatically called by the #[external(\"private\")] macro.\n    pub fn finish(self) -> PrivateCircuitPublicInputs {\n        PrivateCircuitPublicInputs {\n            call_context: self.inputs.call_context,\n            args_hash: self.args_hash,\n            returns_hash: self.return_hash,\n            min_revertible_side_effect_counter: self.min_revertible_side_effect_counter,\n            is_fee_payer: self.is_fee_payer,\n            expiration_timestamp: self.expiration_timestamp,\n            note_hash_read_requests: ClaimedLengthArray::from_bounded_vec(self.note_hash_read_requests),\n            nullifier_read_requests: ClaimedLengthArray::from_bounded_vec(self.nullifier_read_requests),\n            key_validation_requests_and_separators: ClaimedLengthArray::from_bounded_vec(\n                self.key_validation_requests_and_separators,\n            ),\n            note_hashes: ClaimedLengthArray::from_bounded_vec(self.note_hashes),\n            nullifiers: ClaimedLengthArray::from_bounded_vec(self.nullifiers),\n            private_call_requests: ClaimedLengthArray::from_bounded_vec(self.private_call_requests),\n            public_call_requests: ClaimedLengthArray::from_bounded_vec(self.public_call_requests),\n            public_teardown_call_request: self.public_teardown_call_request,\n            l2_to_l1_msgs: ClaimedLengthArray::from_bounded_vec(self.l2_to_l1_msgs),\n            start_side_effect_counter: self.inputs.start_side_effect_counter,\n            end_side_effect_counter: self.side_effect_counter,\n            private_logs: ClaimedLengthArray::from_bounded_vec(self.private_logs),\n            contract_class_logs_hashes: ClaimedLengthArray::from_bounded_vec(self.contract_class_logs_hashes),\n            anchor_block_header: self.anchor_block_header,\n            tx_context: self.inputs.tx_context,\n            expected_non_revertible_side_effect_counter: self.expected_non_revertible_side_effect_counter,\n            expected_revertible_side_effect_counter: self.expected_revertible_side_effect_counter,\n        }\n    }\n\n    /// Designates this contract as the fee payer for the transaction.\n    ///\n    /// Unlike Ethereum, where the transaction sender always pays fees, Aztec allows any contract to voluntarily pay\n    /// transaction fees. This enables patterns like sponsored transactions or fee abstraction where users don't need\n    /// to hold fee-juice themselves. (Fee juice is a fee-paying asset for Aztec).\n    ///\n    /// Only one contract per transaction can declare itself as the fee payer, and it must have sufficient fee-juice\n    /// balance (>= the gas limits specified in the TxContext) by the time we reach the public setup phase of the tx.\n    ///\n    pub fn set_as_fee_payer(&mut self) {\n        aztecnr_trace_log_format!(\"Setting {0} as fee payer\")([self.this_address().to_field()]);\n        self.is_fee_payer = true;\n    }\n\n    pub fn in_revertible_phase(&mut self) -> bool {\n        let current_counter = self.side_effect_counter;\n\n        // Safety: Kernel will validate that the claim is correct by validating the expected counters.\n        let is_revertible = unsafe { is_execution_in_revertible_phase(current_counter) };\n\n        if is_revertible {\n            if (self.expected_revertible_side_effect_counter == 0)\n                | (current_counter < self.expected_revertible_side_effect_counter) {\n                self.expected_revertible_side_effect_counter = current_counter;\n            }\n        } else if current_counter > self.expected_non_revertible_side_effect_counter {\n            self.expected_non_revertible_side_effect_counter = current_counter;\n        }\n\n        is_revertible\n    }\n\n    /// Declares the end of the \"setup phase\" of this tx.\n    ///\n    /// Only one function per tx can declare the end of the setup phase.\n    ///\n    /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n    /// to make use of this function.\n    ///\n    /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n    /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n    /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n    /// phase enables such a payment to be made, because the setup phase _cannot revert_: a reverting function within\n    /// the setup phase would result in an invalid block which cannot be proven. Any side-effects generated during that\n    /// phase are guaranteed to be inserted into Aztec's state trees (except for squashed notes & nullifiers, of\n    /// course).\n    ///\n    /// Even though the end of the setup phase is declared within a private function, you might have noticed that\n    /// _public_ functions can also execute within the setup phase. This is because any public function calls which\n    /// were enqueued _within the setup phase_ by a private function are considered part of the setup phase.\n    ///\n    /// # Advanced\n    /// * Sets the minimum revertible side effect counter of this tx to be the PrivateContext's _current_ side effect\n    /// counter.\n    ///\n    pub fn end_setup(&mut self) {\n        // Incrementing the side effect counter when ending setup ensures non ambiguity for the counter where we change\n        // phases.\n        self.side_effect_counter += 1;\n        aztecnr_trace_log_format!(\"Ending setup at counter {0}\")([self.side_effect_counter as Field]);\n        self.min_revertible_side_effect_counter = self.next_counter();\n        notify_revertible_phase_start(self.min_revertible_side_effect_counter);\n    }\n\n    /// Sets a deadline (an \"include-by timestamp\") for when this transaction must be included in a block.\n    ///\n    /// Other functions in this tx might call this setter with differing values for the include-by timestamp. To ensure\n    /// that all functions' deadlines are met, the _minimum_ of all these include-by timestamps will be exposed when\n    /// this tx is submitted to the network.\n    ///\n    /// If the transaction is not included in a block by its include-by timestamp, it becomes invalid and it will never\n    /// be included.\n    ///\n    /// This expiry timestamp is publicly visible. See the \"Advanced\" section for privacy concerns.\n    ///\n    /// # Arguments\n    /// * `expiration_timestamp` - Unix timestamp (seconds) deadline for inclusion. The include-by timestamp of this tx\n    /// will be _at most_ the timestamp specified.\n    ///\n    /// # Advanced\n    /// * If multiple functions set differing `expiration_timestamp`s, the kernel circuits will set it to be the\n    /// _minimum_ of the two. This ensures the tx expiry requirements of all functions in the tx are met.\n    /// * Rollup circuits will reject expired txs.\n    /// * The protocol enforces that all transactions must be included within 24 hours of their chosen anchor block's\n    /// timestamp, to enable safe mempool pruning.\n    /// * The DelayedPublicMutable design makes heavy use of this functionality, to enable private functions to read\n    /// public state.\n    /// * A sophisticated Wallet should cleverly set an include-by timestamp to improve the privacy of the user and the\n    /// network as a whole. For example, if a contract interaction sets include-by to some publicly-known value (e.g.\n    /// the time when a contract upgrades), then the wallet might wish to set an even lower one to avoid revealing that\n    /// this tx is interacting with said contract. Ideally, all wallets should standardize on an approach in order to\n    ///   provide users with a large privacy set -- although the exact approach\n    /// will need to be discussed. Wallets that deviate from a standard might accidentally reveal which wallet each\n    /// transaction originates from.\n    ///\n    // docs:start:expiration-timestamp\n    pub fn set_expiration_timestamp(&mut self, expiration_timestamp: u64) {\n        // docs:end:expiration-timestamp\n        self.expiration_timestamp = std::cmp::min(self.expiration_timestamp, expiration_timestamp);\n    }\n\n    /// Asserts that a note has been created.\n    ///\n    /// This function will cause the transaction to fail unless the requested note exists. This is the preferred\n    /// mechanism for performing this check, and the only one that works for pending notes.\n    ///\n    /// ## Pending Notes\n    ///\n    /// Both settled notes (created in prior transactions) and pending notes (created in the current transaction) will\n    /// be considered by this function. Pending notes must have been created **before** this call is made for the check\n    /// to pass.\n    ///\n    /// ## Historical Notes\n    ///\n    /// If you need to assert that a note existed _by some specific block in the past_, instead of simply proving that\n    /// it exists by the current anchor block, use [`crate::history::note::assert_note_existed_by`] instead.\n    ///\n    /// ## Cost\n    ///\n    /// This uses up one of the call's kernel note hash read requests, which are limited. Like all kernel requests,\n    /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n    /// an additional invocation of the kernel reset circuit.\n    pub fn assert_note_exists(&mut self, note_existence_request: NoteExistenceRequest) {\n        // Note that the `note_hash_read_requests` array does not hold `NoteExistenceRequest` objects, but rather a\n        // custom kernel type. We convert from the aztec-nr type into it.\n\n        let note_hash = note_existence_request.note_hash();\n        let contract_address = note_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n        let side_effect = Scoped::new(\n            Counted::new(note_hash, self.next_counter()),\n            contract_address,\n        );\n\n        self.note_hash_read_requests.push(side_effect);\n    }\n\n    /// Asserts that a nullifier has been emitted.\n    ///\n    /// This function will cause the transaction to fail unless the requested nullifier exists. This is the preferred\n    /// mechanism for performing this check, and the only one that works for pending nullifiers.\n    ///\n    /// ## Pending Nullifiers\n    ///\n    /// Both settled nullifiers (emitted in prior transactions) and pending nullifiers (emitted in the current\n    /// transaction) will be considered by this function. Pending nullifiers must have been emitted **before** this\n    /// call is made for the check to pass.\n    ///\n    /// ## Historical Nullifiers\n    ///\n    /// If you need to assert that a nullifier existed _by some specific block in the past_, instead of simply proving\n    /// that it exists by the current anchor block, use [`crate::history::nullifier::assert_nullifier_existed_by`]\n    /// instead.\n    ///\n    /// ## Public vs Private\n    ///\n    /// In general, it is unsafe to check for nullifier non-existence in private, as that will not consider the\n    /// possibility of the nullifier having been emitted in any transaction between the anchor block and the inclusion\n    /// block. Private functions instead prove existence via this function and 'prove' non-existence by _emitting_ the\n    /// nullifer, which would cause the transaction to fail if the nullifier existed.\n    ///\n    /// This is not the case in public functions, which do have access to the tip of the blockchain and so can reliably\n    /// prove whether a nullifier exists or not via\n    /// [`crate::context::public_context::PublicContext::nullifier_exists_unsafe`].\n    ///\n    /// ## Cost\n    ///\n    /// This uses up one of the call's kernel nullifier read requests, which are limited. Like all kernel requests,\n    /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n    /// an additional invocation of the kernel reset circuit.\n    pub fn assert_nullifier_exists(&mut self, nullifier_existence_request: NullifierExistenceRequest) {\n        let nullifier = nullifier_existence_request.nullifier();\n        let contract_address = nullifier_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n        let request = Scoped::new(\n            Counted::new(nullifier, self.next_counter()),\n            contract_address,\n        );\n\n        self.nullifier_read_requests.push(request);\n    }\n\n    /// Requests the app-siloed nullifier hiding key (nhk_app) for the given (hashed) master nullifier public key\n    /// (npk_m), from the user's PXE.\n    ///\n    /// Advanced function: Only needed if you're designing your own notes and/or nullifiers.\n    ///\n    /// Contracts are not allowed to compute nullifiers for other contracts, as that would let them read parts of their\n    /// private state. Because of this, a contract is only given an \"app-siloed key\", which is constructed by\n    /// hashing the user's master nullifier hiding key with the contract's address. However, because contracts cannot\n    /// be trusted with a user's master nullifier hiding key (because we don't know which contracts are honest or\n    /// malicious), the PXE refuses to provide any master secret keys to any app smart contract function. This means\n    /// app functions are unable to prove that the derivation of an app-siloed nullifier hiding key has been computed\n    /// correctly. Instead, an app function can request to the kernel (via `request_nhk_app`) that it validates the\n    /// siloed derivation, since the kernel has been vetted to not leak any master secret keys.\n    ///\n    /// A common nullification scheme is to inject a nullifier hiding key into the preimage of a nullifier, to make the\n    /// nullifier deterministic but random-looking. This function enables that flow.\n    ///\n    /// # Arguments\n    /// * `npk_m_hash` - A hash of the master nullifier public key of the user whose PXE is executing this function.\n    ///\n    /// # Returns\n    /// * The app-siloed nullifier hiding key that corresponds to the given `npk_m_hash`.\n    ///\n    pub fn request_nhk_app(&mut self, npk_m_hash: Field) -> Field {\n        self.request_sk_app(npk_m_hash, NULLIFIER_INDEX)\n    }\n\n    /// Requests the app-siloed outgoing viewing secret key (ovsk_app) for the given (hashed) master outgoing\n    /// viewing public key (ovpk_m), from the user's PXE.\n    ///\n    /// See `request_nhk_app` and `request_sk_app` for more info.\n    ///\n    /// The intention of the \"outgoing\" keypair is to provide a second secret key for all of a user's outgoing activity\n    /// (i.e. for notes that a user creates, as opposed to notes that a user receives from others). The separation of\n    /// incoming and outgoing data was a distinction made by zcash, with the intention of enabling a user to optionally\n    /// share with a 3rd party a controlled view of only incoming or outgoing notes. Similar functionality of sharing\n    /// select data can be achieved with offchain zero-knowledge proofs. It is up to an app developer whether they\n    /// choose to make use of a user's outgoing keypair within their application logic, or instead simply use the same\n    /// keypair (the address keypair (which is effectively the same as the \"incoming\" keypair)) for all incoming &\n    /// outgoing messages to a user.\n    ///\n    /// Currently, all of the exposed encryption functions in aztec-nr ignore the outgoing viewing keys, and instead\n    /// encrypt all note logs and event logs to a user's address public key.\n    ///\n    /// # Arguments\n    /// * `ovpk_m_hash` - Hash of the outgoing viewing public key master\n    ///\n    /// # Returns\n    /// * The application-specific outgoing viewing secret key\n    ///\n    pub fn request_ovsk_app(&mut self, ovpk_m_hash: Field) -> Field {\n        self.request_sk_app(ovpk_m_hash, OUTGOING_INDEX)\n    }\n\n    /// Pushes a Key Validation Request to the kernel.\n    ///\n    /// Private functions are not allowed to see a user's master secret keys, because we do not trust them. They are\n    /// instead given \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then\n    /// request validation of this claim, by making a \"key validation request\" to the protocol's kernel circuits (which\n    /// _are_ allowed to see certain master secret keys).\n    ///\n    /// When a Key Validation Request tuple of (sk_app, Pk_m, app_address) is submitted to the kernel, it will perform\n    /// the following derivations to validate the relationship between the claimed sk_app and the user's Pk_m:\n    ///\n    ///       (sk_m) ----> * G ----> Pk_m\n    ///         |                     |\n    ///         v                       We use the kernel to prove this\n    ///  h(sk_m, app_address)         | sk_app-Pk_m relationship, because app\n    ///         |                       circuits must not be trusted to see sk_m.\n    ///         v                     |\n    /// sk_app - -  - - - - - - -\n    ///\n    /// The function is named \"request_\" instead of \"get_\" to remind the user that a Key Validation Request will be\n    /// emitted to the kernel.\n    ///\n    fn request_sk_app(&mut self, pk_m_hash: Field, key_index: Field) -> Field {\n        let cached_request =\n            self.last_key_validation_requests[key_index as u32].unwrap_or(KeyValidationRequest::empty());\n\n        if cached_request.pk_m.hash() == pk_m_hash {\n            // We get a match so the cached request is the latest one\n            cached_request.sk_app\n        } else {\n            // We didn't get a match meaning the cached result is stale Typically we'd validate keys by showing that\n            // they are the preimage of `pk_m_hash`, but that'd require the oracle returning the master secret keys,\n            // which could cause malicious contracts to leak it or learn about secrets from other contracts. We\n            // therefore silo secret keys, and rely on the private kernel to validate that we siloed secret key\n            // corresponds to correct siloing of the master secret key that hashes to `pk_m_hash`.\n\n            // Safety: Kernels verify that the key validation request is valid and below we verify that a request for\n            // the correct public key has been received.\n            let request = unsafe { get_key_validation_request(pk_m_hash, key_index) };\n            assert(!request.pk_m.is_infinite, \"Infinite public key points are not allowed\");\n            assert_eq(request.pk_m.hash(), pk_m_hash, \"Obtained invalid key validation request\");\n\n            self.key_validation_requests_and_separators.push(\n                KeyValidationRequestAndSeparator {\n                    request,\n                    key_type_domain_separator: public_key_domain_separators[key_index as u32],\n                },\n            );\n            self.last_key_validation_requests[key_index as u32] = Option::some(request);\n            request.sk_app\n        }\n    }\n\n    /// Sends an \"L2 -> L1 message\" from this function (Aztec, L2) to a smart contract on Ethereum (L1). L1 contracts\n    /// which are designed to send/receive messages to/from Aztec are called \"Portal Contracts\".\n    ///\n    /// Common use cases include withdrawals, cross-chain asset transfers, and triggering L1 actions based on L2 state\n    /// changes.\n    ///\n    /// The message will be inserted into an Aztec \"Outbox\" contract on L1, when this transaction's block is proposed\n    /// to L1. Sending the message will not result in any immediate state changes in the target portal contract. The\n    /// message will need to be manually consumed from the Outbox through a separate Ethereum transaction: a user will\n    /// need to call a function of the portal contract -- a function specifically designed to make a call to the Outbox\n    /// to consume the message. The message will only be available for consumption once the _epoch_ proof has been\n    /// submitted. Given that there are multiple Aztec blocks within an epoch, it might take some time for this epoch\n    /// proof to be submitted -- especially if the block was near the start of an epoch.\n    ///\n    /// # Arguments\n    /// * `recipient` - Ethereum address that will receive the message\n    /// * `content` - Message content (32 bytes as a Field element). This content has a very\n    /// specific layout. docs:start:context_message_portal\n    pub fn message_portal(&mut self, recipient: EthAddress, content: Field) {\n        let message = L2ToL1Message { recipient, content };\n        self.l2_to_l1_msgs.push(message.count(self.next_counter()));\n    }\n\n    /// Consumes a message sent from Ethereum (L1) to Aztec (L2).\n    ///\n    /// Common use cases include token bridging, cross-chain governance, and triggering L2 actions based on L1 events.\n    ///\n    /// Use this function if you only want the message to ever be \"referred to\" once. Once consumed using this method,\n    /// the message cannot be consumed again, because a nullifier is emitted. If your use case wants for the message to\n    /// be read unlimited times, then you can always read any historic message from the L1-to-L2 messages tree;\n    /// messages never technically get deleted from that tree.\n    ///\n    /// The message will first be inserted into an Aztec \"Inbox\" smart contract on L1. Sending the message will not\n    /// result in any immediate state changes in the target L2 contract. The message will need to be manually consumed\n    /// by the target contract through a separate Aztec transaction. The message will not be available for consumption\n    /// immediately. Messages get copied over from the L1 Inbox to L2 by the next Proposer in batches. So you will need\n    /// to wait until the messages are copied before you can consume them.\n    ///\n    /// # Arguments\n    /// * `content` - The message content that was sent from L1\n    /// * `secret` - Secret value used for message privacy (if needed)\n    /// * `sender` - Ethereum address that sent the message\n    /// * `leaf_index` - Index of the message in the L1-to-L2 message tree\n    ///\n    /// # Advanced\n    /// Validates message existence in the L1-to-L2 message tree and nullifies the message to prevent\n    /// double-consumption.\n    pub fn consume_l1_to_l2_message(&mut self, content: Field, secret: Field, sender: EthAddress, leaf_index: Field) {\n        let nullifier = process_l1_to_l2_message(\n            self.anchor_block_header.state.l1_to_l2_message_tree.root,\n            self.this_address(),\n            sender,\n            self.chain_id(),\n            self.version(),\n            content,\n            secret,\n            leaf_index,\n        );\n\n        // Push nullifier (and the \"commitment\" corresponding to this can be \"empty\")\n        self.push_nullifier(nullifier)\n    }\n\n    /// Emits a private log (an array of Fields) that will be published to an Ethereum blob.\n    ///\n    /// Private logs are intended for the broadcasting of ciphertexts: that is, encrypted events or encrypted note\n    /// contents. Since the data in the logs is meant to be _encrypted_, private_logs are broadcast to publicly-visible\n    /// Ethereum blobs. The intended recipients of such encrypted messages can then discover and decrypt these\n    /// encrypted logs using their viewing secret key. (See `../messages/discovery` for more details).\n    ///\n    /// Important note: This function DOES NOT _do_ any encryption of the input `log` fields. This function blindly\n    /// publishes whatever input `log` data is fed into it, so the caller of this function should have already\n    /// performed the encryption, and the `log` should be the result of that encryption.\n    ///\n    /// The protocol does not dictate what encryption scheme should be used: a smart contract developer can choose\n    /// whatever encryption scheme they like. Aztec-nr includes some off-the-shelf encryption libraries that developers\n    /// might wish to use, for convenience. These libraries not only encrypt a plaintext (to produce a ciphertext);\n    /// they also prepend the ciphertext with a `tag` and `ephemeral public key` for easier message discovery. This is\n    /// a very dense topic, and we will be writing more libraries and docs soon.\n    ///\n    /// > Currently, AES128 CBC encryption is the main scheme included in > aztec.nr. > We are currently making\n    /// significant changes to the interfaces of the > encryption library.\n    ///\n    /// In some niche use cases, an app might be tempted to publish _un-encrypted_ data via a private log, because\n    /// _public logs_ are not available to private functions. Be warned that emitting public data via private logs is\n    /// strongly discouraged, and is considered a \"privacy anti-pattern\", because it reveals identifiable information\n    /// about _which_ function has been executed. A tx which leaks such information does not contribute to the privacy\n    /// set of the network.\n    ///\n    /// * Unlike `emit_raw_note_log_unsafe`, this log is not tied to any specific note\n    ///\n    /// # Arguments\n    /// * `tag` - A tag placed at `fields[0]` of the emitted log. Used by recipients and nodes to identify and\n    /// filter for relevant logs without scanning all of them.\n    /// * `log` - The log data that will be publicly broadcast (so make sure it's already been encrypted before you\n    /// call this function). Private logs are bounded in size (`PRIVATE_LOG_CIPHERTEXT_LEN`), to encourage all logs\n    /// from all smart contracts look identical.\n    /// * `length` - The actual length of `log` (measured in number of Fields). Although the input log has a max\n    /// size of `PRIVATE_LOG_CIPHERTEXT_LEN`, the latter values of the array might all be 0's for small logs. This\n    /// `length` should reflect the trimmed length of the array. The protocol's kernel circuits can then append\n    /// random fields as \"padding\" after the `length`, so that the logs of this smart contract look\n    /// indistinguishable from (the same length as) the logs of all other applications. It's up to wallets how much\n    /// padding to apply, so ideally all wallets should agree on standards for this.\n    ///\n    /// ## Safety\n    ///\n    /// The `tag` should be domain-separated (e.g. via [`crate::protocol::hash::compute_log_tag`]) to prevent\n    /// collisions between logs from different sources. Without domain separation, two unrelated log types that\n    /// happen to share a raw tag value become indistinguishable. Prefer the higher-level APIs\n    /// ([`crate::messages::message_delivery::MessageDelivery`] for messages, `self.emit(event)` for events) which\n    /// handle tagging automatically.\n    pub fn emit_private_log_unsafe(&mut self, tag: Field, log: [Field; PRIVATE_LOG_CIPHERTEXT_LEN], length: u32) {\n        let counter = self.next_counter();\n        let full_log = [tag].concat(log);\n        self.private_logs.push(PrivateLogData { log: PrivateLog::new(full_log, length + 1), note_hash_counter: 0 }\n            .count(counter));\n    }\n\n    // TODO: rename.\n    /// Emits a private log that is explicitly tied to a newly-emitted note_hash, to convey to the kernel: \"this log\n    /// relates to this note\".\n    ///\n    /// This linkage is important in case the note gets squashed (due to being read later in this same tx), since we\n    /// can then squash the log as well.\n    ///\n    /// See `emit_private_log_unsafe` for more info about private log emission.\n    ///\n    /// # Arguments\n    /// * `tag` - A tag placed at `fields[0]`. See `emit_private_log_unsafe`.\n    /// * `log` - The log data as an array of Field elements\n    /// * `length` - The actual length of the `log` (measured in number of Fields).\n    /// * `note_hash_counter` - The side-effect counter that was assigned to the new note_hash when it was pushed to\n    /// this `PrivateContext`.\n    ///\n    /// Important: If your application logic requires the log to always be emitted regardless of note squashing,\n    /// consider using `emit_private_log_unsafe` instead, or emitting additional events.\n    ///\n    /// ## Safety\n    ///\n    /// Same as [`PrivateContext::emit_private_log_unsafe`]: the `tag` should be domain-separated.\n    pub fn emit_raw_note_log_unsafe(\n        &mut self,\n        tag: Field,\n        log: [Field; PRIVATE_LOG_CIPHERTEXT_LEN],\n        length: u32,\n        note_hash_counter: u32,\n    ) {\n        let counter = self.next_counter();\n        let full_log = [tag].concat(log);\n        let private_log = PrivateLogData { log: PrivateLog::new(full_log, length + 1), note_hash_counter };\n        self.private_logs.push(private_log.count(counter));\n    }\n\n    /// Emits large data blobs.\n    ///\n    /// This reuses the Contract Class Log channel to emit blobs of up to [`CONTRACT_CLASS_LOG_SIZE_IN_FIELDS`].\n    ///\n    /// ## Privacy\n    ///\n    /// The address of the contract emitting these blobs is revelead.\n    pub fn emit_contract_class_log<let N: u32>(&mut self, log: [Field; N]) {\n        let contract_address = self.this_address();\n        let counter = self.next_counter();\n\n        let log_to_emit: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS] =\n            log.concat([0; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS - N]);\n        // Note: the length is not always N, it is the number of fields we want to broadcast, omitting trailing zeros\n        // to save blob space.\n        // Safety: The below length is constrained in the base rollup, which will make sure that all the fields beyond\n        // length are zero. However, it won't be able to check that we didn't add extra padding (trailing zeroes) or\n        // that we cut trailing zeroes from the end.\n        let length = unsafe { trimmed_array_length_hint(log) };\n        // We hash the entire padded log to ensure a user cannot pass a shorter length and so emit incorrect shorter\n        // bytecode.\n        let log_hash = compute_contract_class_log_hash(log_to_emit);\n        // Safety: the below only exists to broadcast the raw log, so we can provide it to the base rollup later to be\n        // constrained.\n        unsafe {\n            notify_created_contract_class_log(contract_address, log_to_emit, length, counter);\n        }\n\n        self.contract_class_logs_hashes.push(LogHash { value: log_hash, length: length }.count(counter));\n    }\n\n    /// Calls a private function on another contract (or the same contract).\n    ///\n    /// Very low-level function.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the called function\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    /// This enables contracts to interact with each other while maintaining privacy. This \"composability\" of private\n    /// contract functions is a key feature of the Aztec network.\n    ///\n    /// If a user's transaction includes multiple private function calls, then by the design of Aztec, the following\n    /// information will remain private[1]:\n    /// - The function selectors and contract addresses of all private function calls will remain private, so an\n    /// observer of the public mempool will not be able to look at a tx and deduce which private functions have been\n    /// executed.\n    /// - The arguments and return values of all private function calls will remain private.\n    /// - The person who initiated the tx will remain private.\n    /// - The notes and nullifiers and private logs that are emitted by all private function calls will (if designed\n    /// well) not leak any user secrets, nor leak which functions have been executed.\n    ///\n    /// [1] Caveats: Some of these privacy guarantees depend on how app developers design their smart contracts. Some\n    /// actions _can_ leak information, such as:\n    /// - Calling an internal public function.\n    /// - Calling a public function and not setting msg_sender to Option::none (feature not built yet - see github).\n    /// - Calling any public function will always leak details about the nature of the transaction, so devs should be\n    /// careful in their contract designs. If it can be done in a private function, then that will give the best\n    /// privacy.\n    /// - Not padding the side-effects of a tx to some standardized, uniform size. The kernel circuits can take hints\n    /// to pad side-effects, so a wallet should be able to request for a particular amount of padding. Wallets should\n    /// ideally agree on some standard.\n    /// - Padding should include:\n    /// - Padding the lengths of note & nullifier arrays\n    /// - Padding private logs with random fields, up to some standardized size. See also:\n    /// https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n    ///\n    /// # Advanced\n    /// * The call is added to the private call stack and executed by kernel circuits after this function completes\n    /// * The called function can modify its own contract's private state\n    /// * Side effects from the called function are included in this transaction\n    /// * The call inherits the current transaction's context and gas limits\n    ///\n    pub fn call_private_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n    ) -> ReturnsHash {\n        let args_hash = hash_args(args);\n        execution_cache::store(args, args_hash);\n        self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, false)\n    }\n\n    /// Makes a read-only call to a private function on another contract.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function cannot modify state, emit L2->L2 messages, nor\n    /// emit events. Any nested calls are constrained to also be staticcalls.\n    ///\n    /// See `call_private_function` for more general info on private function calls.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract to call\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the called function\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn static_call_private_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n    ) -> ReturnsHash {\n        let args_hash = hash_args(args);\n        execution_cache::store(args, args_hash);\n        self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, true)\n    }\n\n    /// Calls a private function that takes no arguments.\n    ///\n    /// This is a convenience function for calling private functions that don't require any input parameters. It's\n    /// equivalent to `call_private_function` but slightly more efficient to use when no arguments are needed.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn call_private_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n    ) -> ReturnsHash {\n        self.call_private_function_with_args_hash(contract_address, function_selector, 0, false)\n    }\n\n    /// Makes a read-only call to a private function which takes no arguments.\n    ///\n    /// This combines the optimisation of `call_private_function_no_args` with the safety of\n    /// `static_call_private_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn static_call_private_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n    ) -> ReturnsHash {\n        self.call_private_function_with_args_hash(contract_address, function_selector, 0, true)\n    }\n\n    /// Low-level private function call.\n    ///\n    /// This is the underlying implementation used by all other private function call methods. Instead of taking raw\n    /// arguments, it accepts a hash of the arguments.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args_hash` - Pre-computed hash of the function arguments\n    /// * `is_static_call` - Whether this should be a read-only call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values\n    ///\n    pub fn call_private_function_with_args_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args_hash: Field,\n        is_static_call: bool,\n    ) -> ReturnsHash {\n        let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n        let start_side_effect_counter = self.side_effect_counter;\n\n        // Safety: The oracle simulates the private call and returns the value of the side effects counter after\n        // execution of the call (which means that end_side_effect_counter - start_side_effect_counter is the number of\n        // side effects that took place), along with the hash of the return values. We validate these by requesting a\n        // private kernel iteration in which the return values are constrained to hash to `returns_hash` and the side\n        // effects counter to increment from start to end.\n        let (end_side_effect_counter, returns_hash) = unsafe {\n            call_private_function_internal(\n                contract_address,\n                function_selector,\n                args_hash,\n                start_side_effect_counter,\n                is_static_call,\n            )\n        };\n\n        self.private_call_requests.push(\n            PrivateCallRequest {\n                call_context: CallContext {\n                    msg_sender: self.this_address(),\n                    contract_address,\n                    function_selector,\n                    is_static_call,\n                },\n                args_hash,\n                returns_hash,\n                start_side_effect_counter,\n                end_side_effect_counter,\n            },\n        );\n\n        // TODO (fees) figure out why this crashes the prover and enable it we need this in order to pay fees inside\n        // child call contexts assert(\n        //     (item.public_inputs.min_revertible_side_effect_counter == 0 as u32)\n        //     | (item.public_inputs.min_revertible_side_effect_counter\n        //         > self.min_revertible_side_effect_counter)\n        // ); if item.public_inputs.min_revertible_side_effect_counter\n        //     > self.min_revertible_side_effect_counter { self.min_revertible_side_effect_counter =\n        // item.public_inputs.min_revertible_side_effect_counter; }\n        self.side_effect_counter = end_side_effect_counter + 1; // TODO: call `next_counter`\n        // instead, for consistency\n        ReturnsHash::new(returns_hash)\n    }\n\n    /// Enqueues a call to a public function to be executed later.\n    ///\n    /// Unlike private functions which execute immediately on the user's device, public function calls are \"enqueued\"\n    /// and executed some time later by a block proposer.\n    ///\n    /// This means a public function cannot return any values back to a private function, because by the time the\n    /// public function is being executed, the private function which called it has already completed execution. (In\n    /// fact, the private function has been executed and proven, along with all other private function calls of the\n    /// user's tx. A single proof of the tx has been submitted to the Aztec network, and some time later a proposer has\n    /// picked the tx up from the mempool and begun executing all of the enqueued public functions).\n    ///\n    /// # Privacy warning Enqueueing a public function call is an inherently leaky action. Many interesting applications will require some interaction with public state, but smart contract developers should try to use public function calls sparingly, and carefully. _Internal_ public function calls are especially leaky, because they completely leak which private contract made the call. See also: https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the public function\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Enqueues a read-only call to a public function.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function cannot modify state or emit events. Any nested\n    /// calls are constrained to also be staticcalls.\n    ///\n    /// See also `call_public_function` for more important information about making private -> public function calls.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the public function\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn static_call_public_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n    }\n\n    /// Enqueues a call to a public function that takes no arguments.\n    ///\n    /// This is an optimisation for calling public functions that don't take any input parameters. It's otherwise\n    /// equivalent to `call_public_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        hide_msg_sender: bool,\n    ) {\n        let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Enqueues a read-only call to a public function with no arguments.\n    ///\n    /// This combines the optimisation of `call_public_function_no_args` with the safety of\n    /// `static_call_public_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn static_call_public_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        hide_msg_sender: bool,\n    ) {\n        let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n    }\n\n    /// Low-level public function call.\n    ///\n    /// This is the underlying implementation used by all other public function call methods. Instead of taking raw\n    /// arguments, it accepts a hash of the arguments.\n    ///\n    /// Advanced function: Most developers should use `call_public_function` or `static_call_public_function` instead.\n    /// This function is exposed for performance optimization and advanced use cases.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `calldata_hash` - Hash of the function calldata\n    /// * `is_static_call` - Whether this should be a read-only call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function_with_calldata_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        calldata_hash: Field,\n        is_static_call: bool,\n        hide_msg_sender: bool,\n    ) {\n        let counter = self.next_counter();\n\n        let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n        assert_valid_public_call_data(calldata_hash);\n\n        let msg_sender = if hide_msg_sender {\n            NULL_MSG_SENDER_CONTRACT_ADDRESS\n        } else {\n            self.this_address()\n        };\n\n        let call_request = PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n\n        self.public_call_requests.push(Counted::new(call_request, counter));\n    }\n\n    /// Enqueues a public function call, and designates it to be the teardown function for this tx. Only one teardown\n    /// function call can be made by a tx.\n    ///\n    /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n    /// to make use of this function.\n    ///\n    /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n    /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n    /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n    /// phase ensures the fee payer has sufficient balance to pay the proposer their fees. The teardown phase is\n    /// primarily intended to: calculate exactly how much the user owes, based on gas consumption, and refund the user\n    /// any change.\n    ///\n    /// Note: in some cases, the cost of refunding the user (i.e. DA costs of tx side-effects) might exceed the refund\n    /// amount. For app logic with fairly stable and predictable gas consumption, a material refund amount is unlikely.\n    /// For app logic with unpredictable gas consumption, a refund might be important to the user (e.g. if a hefty\n    /// function reverts very early). Wallet/FPC/Paymaster developers should be mindful of this.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the teardown function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - An array of fields to pass to the function.\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    pub fn set_public_teardown_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.set_public_teardown_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Low-level function to set the public teardown function.\n    ///\n    /// This is the underlying implementation for setting the teardown function call that will execute at the end of\n    /// the transaction. Instead of taking raw arguments, it accepts a hash of the arguments.\n    ///\n    /// Advanced function: Most developers should use `set_public_teardown_function` instead.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the teardown function\n    /// * `calldata_hash` - Hash of the function calldata\n    /// * `is_static_call` - Whether this should be a read-only call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn set_public_teardown_function_with_calldata_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        calldata_hash: Field,\n        is_static_call: bool,\n        hide_msg_sender: bool,\n    ) {\n        let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n        assert_valid_public_call_data(calldata_hash);\n\n        let msg_sender = if hide_msg_sender {\n            NULL_MSG_SENDER_CONTRACT_ADDRESS\n        } else {\n            self.this_address()\n        };\n\n        self.public_teardown_call_request =\n            PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n    }\n\n    /// Increments the side-effect counter.\n    ///\n    /// Very low-level function.\n    ///\n    /// # Advanced\n    ///\n    /// Every side-effect of a private function is given a \"side-effect counter\", based on when it is created. This\n    /// PrivateContext is in charge of assigning the counters.\n    ///\n    /// The reason we have side-effect counters is complicated. Consider this illustrative pseudocode of inter-contract\n    /// function calls:\n    /// ```\n    /// contract A {\n    ///    let x = 5; // pseudocode for storage var x.\n    ///    fn a1 {\n    ///        read x; // value: 5, counter: 1.\n    ///        x = x + 1;\n    ///        write x; // value: 6, counter: 2.\n    ///\n    ///        B.b(); // start_counter: 2, end_counter: 4\n    ///\n    ///        read x; // value: 36, counter: 5.\n    ///        x = x + 1;\n    ///        write x; // value: 37, counter: 6.\n    ///    }\n    ///\n    ///    fn a2 {\n    ///        read x; // value: 6, counter: 3.\n    ///        x = x * x;\n    ///        write x; // value: 36, counter: 4.\n    ///    }\n    /// }\n    ///\n    /// contract B {\n    ///     fn b() {\n    ///         A.a2();\n    ///     }\n    /// }\n    /// ```\n    ///\n    /// Suppose a1 is the first function called. The comments show the execution counter of each side-effect, and what\n    /// the new value of `x` is.\n    ///\n    /// These (private) functions are processed by Aztec's kernel circuits in an order that is different from execution\n    /// order: All of A.a1 is proven before B.b is proven, before A.a2 is proven. So when we're in the 2nd execution\n    /// frame of A.a1 (after the call to B.b), the circuit needs to justify why x went from being `6` to `36`. But the\n    /// circuit doesn't know why, and given the order of proving, the kernel hasn't _seen_ a value of 36 get written\n    /// yet. The kernel needs to track big arrays of all side-effects of all private functions in a tx. Then, as it\n    /// recurses and processes B.b(), it will eventually see a value of 36 get written.\n    ///\n    /// Suppose side-effect counters weren't exposed: The kernel would only see this ordering (in order of proof\n    /// verification): [ A.a1.read, A.a1.write, A.a1.read, A.a1.write, A.a2.read, A.a2.write ]\n    /// [         5,          6,        36,         37,         6,         36 ]\n    /// The kernel wouldn't know _when_ B.b() was called within A.a1(), because it can't see what's going on within an\n    /// app circuit. So the kernel wouldn't know that the ordering of reads and writes should actually be: [ A.a1.read,\n    /// A.a1.write, A.a2.read, A.a2.write, A.a1.read, A.a1.write ]\n    /// [         5,          6,        6,         36,         36,         37 ]\n    ///\n    /// And so, we introduced side-effect counters: every private function must assign side-effect counters alongside\n    /// every side-effect that it emits, and also expose to the kernel the counters that it started and ended with.\n    /// This gives the kernel enough information to arrange all side-effects in the correct order. It can then catch\n    /// (for example) if a function tries to read state before it has been written (e.g. if A.a2() maliciously tried to\n    /// read a value of x=37) (e.g. if A.a1() maliciously tried to read x=6).\n    ///\n    /// If a malicious app contract _lies_ and does not count correctly:\n    /// - It cannot lie about its start and end counters because the kernel will catch this.\n    /// - It _could_ lie about its intermediate counters:\n    /// - 1. It could not increment its side-effects correctly\n    /// - 2. It could label its side-effects with counters outside of its start and end counters' range. The kernel\n    /// will catch 2. The kernel will not catch 1., but this would only cause corruption to the private state of the\n    /// malicious contract, and not any other contracts (because a contract can only modify its own state). If a \"good\"\n    /// contract is given _read access_ to a maliciously-counting contract (via an external getter function, or by\n    /// reading historic state from the archive tree directly), and they then make state changes to their _own_ state\n    /// accordingly, that could be dangerous. Developers should be mindful not to trust the claimed innards of external\n    /// contracts unless they have audited/vetted the contracts including vetting the side-effect counter\n    /// incrementation. This is a similar paradigm to Ethereum smart contract development: you must vet external\n    /// contracts that your contract relies upon, and you must not make any presumptions about their claimed behaviour.\n    /// (Hopefully if a contract imports a version of aztec-nr, we will get contract verification tooling that can\n    /// validate the authenticity of the imported aztec-nr package, and hence infer that the side- effect counting will\n    /// be correct, without having to re-audit such logic for every contract).\n    ///\n    fn next_counter(&mut self) -> u32 {\n        let counter = self.side_effect_counter;\n        self.side_effect_counter += 1;\n        counter\n    }\n}\n\nimpl Empty for PrivateContext {\n    fn empty() -> Self {\n        PrivateContext {\n            inputs: PrivateContextInputs::empty(),\n            side_effect_counter: 0 as u32,\n            min_revertible_side_effect_counter: 0 as u32,\n            is_fee_payer: false,\n            args_hash: 0,\n            return_hash: 0,\n            expiration_timestamp: 0,\n            note_hash_read_requests: BoundedVec::new(),\n            nullifier_read_requests: BoundedVec::new(),\n            key_validation_requests_and_separators: BoundedVec::new(),\n            note_hashes: BoundedVec::new(),\n            nullifiers: BoundedVec::new(),\n            private_call_requests: BoundedVec::new(),\n            public_call_requests: BoundedVec::new(),\n            public_teardown_call_request: PublicCallRequest::empty(),\n            l2_to_l1_msgs: BoundedVec::new(),\n            anchor_block_header: BlockHeader::empty(),\n            private_logs: BoundedVec::new(),\n            contract_class_logs_hashes: BoundedVec::new(),\n            last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n            expected_non_revertible_side_effect_counter: 0,\n            expected_revertible_side_effect_counter: 0,\n        }\n    }\n}\n"
+      "source": "use crate::{\n    context::{inputs::PrivateContextInputs, NoteExistenceRequest, NullifierExistenceRequest, ReturnsHash},\n    hash::{hash_args, hash_calldata_array},\n    keys::constants::{NULLIFIER_INDEX, NUM_KEY_TYPES, OUTGOING_INDEX, public_key_domain_separators},\n    messaging::process_l1_to_l2_message,\n    oracle::{\n        block_header::get_block_header_at,\n        call_private_function::call_private_function_internal,\n        execution_cache,\n        key_validation_request::get_key_validation_request,\n        logs::notify_created_contract_class_log,\n        notes::notify_nullified_note,\n        nullifiers::notify_created_nullifier,\n        public_call::assert_valid_public_call_data,\n        tx_phase::{is_execution_in_revertible_phase, notify_revertible_phase_start},\n    },\n};\nuse crate::logging::aztecnr_trace_log_format;\nuse crate::protocol::{\n    abis::{\n        block_header::BlockHeader,\n        call_context::CallContext,\n        function_selector::FunctionSelector,\n        gas_settings::GasSettings,\n        log_hash::LogHash,\n        note_hash::NoteHash,\n        nullifier::Nullifier,\n        private_call_request::PrivateCallRequest,\n        private_circuit_public_inputs::PrivateCircuitPublicInputs,\n        private_log::{PrivateLog, PrivateLogData},\n        public_call_request::PublicCallRequest,\n        validation_requests::{KeyValidationRequest, KeyValidationRequestAndSeparator},\n    },\n    address::{AztecAddress, EthAddress},\n    constants::{\n        CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, MAX_CONTRACT_CLASS_LOGS_PER_CALL, MAX_ENQUEUED_CALLS_PER_CALL,\n        MAX_KEY_VALIDATION_REQUESTS_PER_CALL, MAX_L2_TO_L1_MSGS_PER_CALL, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL,\n        MAX_NOTE_HASHES_PER_CALL, MAX_NULLIFIER_READ_REQUESTS_PER_CALL, MAX_NULLIFIERS_PER_CALL,\n        MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL, MAX_PRIVATE_LOGS_PER_CALL, MAX_TX_LIFETIME,\n        NULL_MSG_SENDER_CONTRACT_ADDRESS, PRIVATE_LOG_CIPHERTEXT_LEN,\n    },\n    hash::compute_contract_class_log_hash,\n    messaging::l2_to_l1_message::L2ToL1Message,\n    side_effect::{Counted, scoped::Scoped},\n    traits::{Empty, Hash, ToField},\n    utils::arrays::{ClaimedLengthArray, trimmed_array_length_hint},\n};\n\n/// # PrivateContext\n///\n/// The **main interface** between an #[external(\"private\")] function and the Aztec blockchain.\n///\n/// An instance of the PrivateContext is initialized automatically at the outset of every private function, within the\n/// #[external(\"private\")] macro, so you'll never need to consciously instantiate this yourself.\n///\n/// The instance is always named `context`, and it is always be available within the body of every\n/// #[external(\"private\")] function in your smart contract.\n///\n/// > For those used to \"vanilla\" Noir, it might be jarring to have access to > `context` without seeing a declaration\n/// `let context = PrivateContext::new(...)` > within the body of your function. This is just a consequence of using >\n/// macros to tidy-up verbose boilerplate. You can use `nargo expand` to > expand all macros, if you dare.\n///\n/// Typical usage for a smart contract developer will be to call getter methods of the PrivateContext.\n///\n/// _Pushing_ data and requests to the context is mostly handled within aztec-nr's own functions, so typically a smart\n/// contract developer won't need to call any setter methods directly.\n///\n/// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n/// find yourself doing this, please > open an issue on GitHub to describe your use case: it might be that > new\n/// functionality should be added to aztec-nr.\n///\n/// ## Responsibilities\n/// - Exposes contextual data to a private function:\n/// - Data relating to how this private function was called.\n/// - msg_sender\n/// - this_address - (the contract address of the private function being executed)\n/// - See `CallContext` for more data.\n/// - Data relating to the transaction in which this private function is being executed.\n/// - chain_id\n/// - version\n/// - gas_settings\n/// - Provides state access:\n/// - Access to the \"Anchor block\" header. Recall, a private function cannot read from the \"current\" block header, but\n/// must read from some historical block header, because as soon as private function execution begins (asynchronously,\n/// on a user's device), the public state of the chain (the \"current state\") will have progressed forward. We call this\n/// reference the \"Anchor block\". See `BlockHeader`.\n///   - Enables consumption of L1->L2 messages.\n/// - Enables calls to functions of other smart contracts:\n/// - Private function calls\n/// - Enqueueing of public function call requests (Since public functions are executed at a later time, by a block\n/// proposer, we say they are \"enqueued\").\n/// - Writes data to the blockchain:\n/// - New notes\n/// - New nullifiers\n/// - Private logs (for sending encrypted note contents or encrypted events)\n///   - New L2->L1 messages.\n/// - Provides args to the private function (handled by the #[external(\"private\")] macro).\n/// - Returns the return values of this private function (handled by the\n///   #[external(\"private\")] macro).\n/// - Makes Key Validation Requests.\n/// - Private functions are not allowed to see master secret keys, because we do not trust them. They are instead given\n/// \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then request validation of\n/// this claim, by making a \"key validation request\" to the protocol's kernel circuits (which _are_ allowed to see\n/// certain master secret keys).\n///\n/// ## Advanced Responsibilities\n///\n/// - Ultimately, the PrivateContext is responsible for constructing the PrivateCircuitPublicInputs of the private\n/// function being executed. All private functions on Aztec must have public inputs which adhere to the rigid layout of\n/// the PrivateCircuitPublicInputs, in order to be compatible with the protocol's kernel circuits. A well-known\n/// misnomer:\n/// - \"public inputs\" contain both inputs and outputs of this function.\n/// - By \"outputs\" we mean a lot more side-effects than just the \"return values\" of the function.\n/// - Most of the so-called \"public inputs\" are kept _private_, and never leak to the outside world, because they are\n/// 'swallowed' by the protocol's kernel circuits before the tx is sent to the network. Only the following are exposed\n/// to the outside world:\n/// - New note_hashes\n/// - New nullifiers\n/// - New private logs\n///     - New L2->L1 messages\n/// - New enqueued public function call requests All the above-listed arrays of side-effects can be padded by the\n/// user's wallet (through instructions to the kernel circuits, via the PXE) to obscure their true lengths.\n///\n/// ## Syntax Justification\n///\n/// Both user-defined functions _and_ most functions in aztec-nr need access to the PrivateContext instance to\n/// read/write data. This is why you'll see the arguably-ugly pervasiveness of the \"context\" throughout your smart\n/// contract and the aztec-nr library. For example, `&mut context` is prevalent. In some languages, you can access and\n/// mutate a global variable (such as a PrivateContext instance) from a function without polluting the function's\n/// parameters. With Noir, a function must explicitly pass control of a mutable variable to another function, by\n/// reference. Since many functions in aztec-nr need to be able to push new data to the PrivateContext, they need to be\n/// handed a mutable reference _to_ the context as a parameter. For example, `Context` is prevalent as a generic\n/// parameter, to give better type safety at compile time. Many `aztec-nr` functions don't make sense if they're called\n/// in a particular runtime (private, public or utility), and so are intentionally only implemented over certain\n/// [Private|Public|Utility]Context structs. This gives smart contract developers a much faster feedback loop if\n/// they're making a mistake, as an error will be thrown by the LSP or when they compile their contract.\n///\n#[derive(Eq)]\npub struct PrivateContext {\n    // docs:start:private-context\n    pub inputs: PrivateContextInputs,\n    pub side_effect_counter: u32,\n\n    pub min_revertible_side_effect_counter: u32,\n    pub is_fee_payer: bool,\n\n    pub args_hash: Field,\n    pub return_hash: Field,\n\n    pub expiration_timestamp: u64,\n\n    pub(crate) note_hash_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>,\n    pub(crate) nullifier_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n    key_validation_requests_and_separators: BoundedVec<KeyValidationRequestAndSeparator, MAX_KEY_VALIDATION_REQUESTS_PER_CALL>,\n\n    pub note_hashes: BoundedVec<Counted<NoteHash>, MAX_NOTE_HASHES_PER_CALL>,\n    pub nullifiers: BoundedVec<Counted<Nullifier>, MAX_NULLIFIERS_PER_CALL>,\n\n    pub private_call_requests: BoundedVec<PrivateCallRequest, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL>,\n    pub public_call_requests: BoundedVec<Counted<PublicCallRequest>, MAX_ENQUEUED_CALLS_PER_CALL>,\n    pub public_teardown_call_request: PublicCallRequest,\n    pub l2_to_l1_msgs: BoundedVec<Counted<L2ToL1Message>, MAX_L2_TO_L1_MSGS_PER_CALL>,\n    // docs:end:private-context\n\n    // Header of a block whose state is used during private execution (not the block the transaction is included in).\n    pub anchor_block_header: BlockHeader,\n\n    pub private_logs: BoundedVec<Counted<PrivateLogData>, MAX_PRIVATE_LOGS_PER_CALL>,\n    pub contract_class_logs_hashes: BoundedVec<Counted<LogHash>, MAX_CONTRACT_CLASS_LOGS_PER_CALL>,\n\n    // Contains the last key validation request for each key type. This is used to cache the last request and avoid\n    // fetching the same request multiple times. The index of the array corresponds to the key type (0 nullifier, 1\n    // incoming, 2 outgoing, 3 tagging).\n    pub last_key_validation_requests: [Option<KeyValidationRequest>; NUM_KEY_TYPES],\n\n    pub expected_non_revertible_side_effect_counter: u32,\n    pub expected_revertible_side_effect_counter: u32,\n}\n\nimpl PrivateContext {\n    pub fn new(inputs: PrivateContextInputs, args_hash: Field) -> PrivateContext {\n        PrivateContext {\n            inputs,\n            side_effect_counter: inputs.start_side_effect_counter + 1,\n            min_revertible_side_effect_counter: 0,\n            is_fee_payer: false,\n            args_hash,\n            return_hash: 0,\n            expiration_timestamp: inputs.anchor_block_header.timestamp() + MAX_TX_LIFETIME,\n            note_hash_read_requests: BoundedVec::new(),\n            nullifier_read_requests: BoundedVec::new(),\n            key_validation_requests_and_separators: BoundedVec::new(),\n            note_hashes: BoundedVec::new(),\n            nullifiers: BoundedVec::new(),\n            anchor_block_header: inputs.anchor_block_header,\n            private_call_requests: BoundedVec::new(),\n            public_call_requests: BoundedVec::new(),\n            public_teardown_call_request: PublicCallRequest::empty(),\n            l2_to_l1_msgs: BoundedVec::new(),\n            private_logs: BoundedVec::new(),\n            contract_class_logs_hashes: BoundedVec::new(),\n            last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n            expected_non_revertible_side_effect_counter: 0,\n            expected_revertible_side_effect_counter: 0,\n        }\n    }\n\n    /// Returns the contract address that initiated this function call.\n    ///\n    /// This is similar to `msg.sender` in Solidity (hence the name).\n    ///\n    /// Important Note: Since Aztec doesn't have a concept of an EoA (Externally-owned Account), the msg_sender is\n    /// \"none\" for the first function call of every transaction. The first function call of a tx is likely to be a call\n    /// to the user's account contract, so this quirk will most often be handled by account contract developers.\n    ///\n    /// # Returns\n    /// * `Option<AztecAddress>` - The address of the smart contract that called this function (be it an app contract\n    /// or a user's account contract). Returns `Option<AztecAddress>::none` for the first function call of the tx. No\n    /// other _private_ function calls in the tx will have a `none` msg_sender, but _public_ function calls might (see\n    /// the PublicContext).\n    pub fn maybe_msg_sender(self) -> Option<AztecAddress> {\n        let maybe_msg_sender = self.inputs.call_context.msg_sender;\n        if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n            Option::none()\n        } else {\n            Option::some(maybe_msg_sender)\n        }\n    }\n\n    /// Returns the contract address of the current function being executed.\n    ///\n    /// This is equivalent to `address(this)` in Solidity (hence the name). Use this to identify the current contract's\n    /// address, commonly needed for access control or when interacting with other contracts.\n    ///\n    /// # Returns\n    /// * `AztecAddress` - The contract address of the current function being executed.\n    ///\n    pub fn this_address(self) -> AztecAddress {\n        self.inputs.call_context.contract_address\n    }\n\n    /// Returns the chain ID of the current network.\n    ///\n    /// This is similar to `block.chainid` in Solidity. Returns the unique identifier for the blockchain network this\n    /// transaction is executing on.\n    ///\n    /// Helps prevent cross-chain replay attacks. Useful if implementing multi-chain contract logic.\n    ///\n    /// # Returns\n    /// * `Field` - The chain ID as a field element\n    ///\n    pub fn chain_id(self) -> Field {\n        self.inputs.tx_context.chain_id\n    }\n\n    /// Returns the Aztec protocol version that this transaction is executing under. Different versions may have\n    /// different rules, opcodes, or cryptographic primitives.\n    ///\n    /// This is similar to how Ethereum has different EVM versions.\n    ///\n    /// Useful for forward/backward compatibility checks\n    ///\n    /// Not to be confused with contract versions; this is the protocol version.\n    ///\n    /// # Returns\n    /// * `Field` - The protocol version as a field element\n    ///\n    pub fn version(self) -> Field {\n        self.inputs.tx_context.version\n    }\n\n    /// Returns the gas settings for the current transaction.\n    ///\n    /// This provides information about gas limits and pricing for the transaction, similar to `tx.gasprice` and gas\n    /// limits in Ethereum. However, Aztec has a more sophisticated gas model with separate accounting for L2\n    /// computation and data availability (DA) costs.\n    ///\n    /// # Returns\n    /// * `GasSettings` - Struct containing gas limits and fee information\n    ///\n    pub fn gas_settings(self) -> GasSettings {\n        self.inputs.tx_context.gas_settings\n    }\n\n    /// Returns the function selector of the currently executing function.\n    ///\n    /// Low-level function: Ordinarily, smart contract developers will not need to access this.\n    ///\n    /// This is similar to `msg.sig` in Solidity, which returns the first 4 bytes of the function signature. In Aztec,\n    /// the selector uniquely identifies which function within the contract is being called.\n    ///\n    /// # Returns\n    /// * `FunctionSelector` - The 4-byte function identifier\n    ///\n    /// # Advanced\n    /// Only #[external(\"private\")] functions have a function selector as a protocol- enshrined concept. The function\n    /// selectors of private functions are baked into the preimage of the contract address, and are used by the\n    /// protocol's kernel circuits to identify each private function and ensure the correct one is being executed.\n    ///\n    /// Used internally for function dispatch and call verification.\n    ///\n    pub fn selector(self) -> FunctionSelector {\n        self.inputs.call_context.function_selector\n    }\n\n    /// Returns the hash of the arguments passed to the current function.\n    ///\n    /// Very low-level function: You shouldn't need to call this. The #[external(\"private\")] macro calls this, and it\n    /// makes the arguments neatly available to the body of your private function.\n    ///\n    /// # Returns\n    /// * `Field` - Hash of the function arguments\n    ///\n    /// # Advanced\n    /// * Arguments are hashed to reduce proof size and verification time\n    /// * Enables efficient argument passing in recursive function calls\n    /// * The hash can be used to retrieve the original arguments from the PXE.\n    ///\n    pub fn get_args_hash(self) -> Field {\n        self.args_hash\n    }\n\n    /// Pushes a new note_hash to the Aztec blockchain's global Note Hash Tree (a state tree).\n    ///\n    /// A note_hash is a commitment to a piece of private state.\n    ///\n    /// Low-level function: Ordinarily, smart contract developers will not need to manually call this. Aztec-nr's state\n    /// variables (see `../state_vars/`) are designed to understand when to create and push new note hashes.\n    ///\n    /// # Arguments\n    /// * `note_hash` - The new note_hash.\n    ///\n    /// # Advanced\n    /// From here, the protocol's kernel circuits will take over and insert the note_hash into the protocol's \"note\n    /// hash tree\" (in the Base Rollup circuit). Before insertion, the protocol will:\n    /// - \"Silo\" the `note_hash` with the contract address of this function, to yield a `siloed_note_hash`. This\n    /// prevents state collisions between different smart contracts.\n    /// - Ensure uniqueness of the `siloed_note_hash`, to prevent Faerie-Gold attacks, by hashing the\n    /// `siloed_note_hash` with a unique value, to yield a `unique_siloed_note_hash` (see the protocol spec for more).\n    ///\n    /// In addition to calling this function, aztec-nr provides the contents of the newly-created note to the PXE, via\n    /// the `notify_created_note` oracle.\n    ///\n    /// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n    /// find yourself doing this, > please open an issue on GitHub to describe your use case: it might be > that new\n    /// functionality should be added to aztec-nr.\n    ///\n    pub fn push_note_hash(&mut self, note_hash: Field) {\n        self.note_hashes.push(Counted::new(note_hash, self.next_counter()));\n    }\n\n    /// Creates a new [nullifier](crate::nullifier).\n    ///\n    /// ## Safety\n    ///\n    /// This is a low-level function that must be used with great care to avoid subtle corruption of contract state.\n    /// Instead of calling this function, consider using the higher-level [`crate::state_vars::SingleUseClaim`].\n    ///\n    /// In particular, callers must ensure all nullifiers created by a contract are properly domain-separated, so that\n    /// unrelated components don't interfere with one another (e.g. a transaction nullifier accidentally marking a\n    /// variable as initialized). Only [`PrivateContext::push_nullifier_for_note_hash`] should be used for note\n    /// nullifiers, never this one.\n    ///\n    /// ## Advanced\n    ///\n    /// The raw `nullifier` is not what is inserted into the Aztec state tree: it will be first siloed by contract\n    /// address via [`crate::protocol::hash::compute_siloed_nullifier`] in order to prevent accidental or malicious\n    /// interference of nullifiers from different contracts.\n    pub fn push_nullifier(&mut self, nullifier: Field) {\n        notify_created_nullifier(nullifier);\n        self.nullifiers.push(Nullifier { value: nullifier, note_hash: 0 }.count(self.next_counter()));\n    }\n\n    /// Creates a new [nullifier](crate::nullifier) associated with a note.\n    ///\n    /// This is a variant of [`PrivateContext::push_nullifier`] that is used for note nullifiers, i.e. nullifiers that\n    /// correspond to a note. If a note and its nullifier are created in the same transaction, then the private kernels\n    /// will 'squash' these values, deleting them both as if they never existed and reducing transaction fees.\n    ///\n    /// The `nullification_note_hash` must be the result of calling\n    /// [`crate::note::utils::compute_confirmed_note_hash_for_nullification`] for pending notes, and `0` for settled\n    /// notes (which cannot be squashed).\n    ///\n    /// ## Safety\n    ///\n    /// This is a low-level function that must be used with great care to avoid subtle corruption of contract state.\n    /// Instead of calling this function, consider using the higher-level [`crate::note::lifecycle::destroy_note`].\n    ///\n    /// The precautions listed for [`PrivateContext::push_nullifier`] apply here as well, and callers should\n    /// additionally ensure `nullification_note_hash` corresponds to a note emitted by this contract, with its hash\n    /// computed in the same transaction execution phase as the call to this function. Finally, only this function\n    /// should be used for note nullifiers, never [`PrivateContext::push_nullifier`].\n    ///\n    /// Failure to do these things can result in unprovable contexts, accidental deletion of notes, or double-spend\n    /// attacks.\n    pub fn push_nullifier_for_note_hash(&mut self, nullifier: Field, nullification_note_hash: Field) {\n        let nullifier_counter = self.next_counter();\n        notify_nullified_note(nullifier, nullification_note_hash, nullifier_counter);\n        self.nullifiers.push(Nullifier { value: nullifier, note_hash: nullification_note_hash }.count(\n            nullifier_counter,\n        ));\n    }\n\n    /// Returns the anchor block header - the historical block header that this private function is reading from.\n    ///\n    /// A private function CANNOT read from the \"current\" block header, but must read from some older block header,\n    /// because as soon as private function execution begins (asynchronously, on a user's device), the public state of\n    /// the chain (the \"current state\") will have progressed forward.\n    ///\n    /// # Returns\n    /// * `BlockHeader` - The anchor block header.\n    ///\n    /// # Advanced\n    /// * All private functions of a tx read from the same anchor block header.\n    /// * The protocol asserts that the `expiration_timestamp` of every tx is at most 24 hours beyond the timestamp of\n    /// the tx's chosen anchor block header. This enables the network's nodes to safely prune old txs from the mempool.\n    /// Therefore, the chosen block header _must_ be one from within the last 24 hours.\n    ///\n    pub fn get_anchor_block_header(self) -> BlockHeader {\n        self.anchor_block_header\n    }\n\n    /// Returns the header of any historical block at or before the anchor block.\n    ///\n    /// This enables private contracts to access information from even older blocks than the anchor block header.\n    ///\n    /// Useful for time-based contract logic that needs to compare against multiple historical points.\n    ///\n    /// # Arguments\n    /// * `block_number` - The block number to retrieve (must be <= anchor block number)\n    ///\n    /// # Returns\n    /// * `BlockHeader` - The header of the requested historical block\n    ///\n    /// # Advanced\n    /// This function uses an oracle to fetch block header data from the user's PXE. Depending on how much blockchain\n    /// data the user's PXE has been set up to store, this might require a query from the PXE to another Aztec node to\n    /// get the data. > This is generally true of all oracle getters (see `../oracle`).\n    ///\n    /// Each block header gets hashed and stored as a leaf in the protocol's Archive Tree. In fact, the i-th block\n    /// header gets stored at the i-th leaf index of the Archive Tree. Behind the scenes, this `get_block_header_at`\n    /// function will add Archive Tree merkle-membership constraints (~3k) to your smart contract function's circuit,\n    /// to prove existence of the block header in the Archive Tree.\n    ///\n    /// Note: we don't do any caching, so avoid making duplicate calls for the same block header, because each call\n    /// will add duplicate constraints.\n    ///\n    /// Calling this function is more expensive (constraint-wise) than getting the anchor block header (via\n    /// `get_block_header`). This is because the anchor block's merkle membership proof is handled by Aztec's protocol\n    /// circuits, and is only performed once for the entire tx because all private functions of a tx share a common\n    /// anchor block header. Therefore, the cost (constraint-wise) of calling `get_block_header` is effectively free.\n    ///\n    pub fn get_block_header_at(self, block_number: u32) -> BlockHeader {\n        get_block_header_at(block_number, self)\n    }\n\n    /// Sets the hash of the return values for this private function.\n    ///\n    /// Very low-level function: this is called by the #[external(\"private\")] macro.\n    ///\n    /// # Arguments\n    /// * `serialized_return_values` - The serialized return values as a field array\n    ///\n    pub fn set_return_hash<let N: u32>(&mut self, serialized_return_values: [Field; N]) {\n        let return_hash = hash_args(serialized_return_values);\n        self.return_hash = return_hash;\n        execution_cache::store(serialized_return_values, return_hash);\n    }\n\n    /// Builds the PrivateCircuitPublicInputs for this private function, to ensure compatibility with the protocol's\n    /// kernel circuits.\n    ///\n    /// Very low-level function: This function is automatically called by the #[external(\"private\")] macro.\n    pub fn finish(self) -> PrivateCircuitPublicInputs {\n        PrivateCircuitPublicInputs {\n            call_context: self.inputs.call_context,\n            args_hash: self.args_hash,\n            returns_hash: self.return_hash,\n            min_revertible_side_effect_counter: self.min_revertible_side_effect_counter,\n            is_fee_payer: self.is_fee_payer,\n            expiration_timestamp: self.expiration_timestamp,\n            note_hash_read_requests: ClaimedLengthArray::from_bounded_vec(self.note_hash_read_requests),\n            nullifier_read_requests: ClaimedLengthArray::from_bounded_vec(self.nullifier_read_requests),\n            key_validation_requests_and_separators: ClaimedLengthArray::from_bounded_vec(\n                self.key_validation_requests_and_separators,\n            ),\n            note_hashes: ClaimedLengthArray::from_bounded_vec(self.note_hashes),\n            nullifiers: ClaimedLengthArray::from_bounded_vec(self.nullifiers),\n            private_call_requests: ClaimedLengthArray::from_bounded_vec(self.private_call_requests),\n            public_call_requests: ClaimedLengthArray::from_bounded_vec(self.public_call_requests),\n            public_teardown_call_request: self.public_teardown_call_request,\n            l2_to_l1_msgs: ClaimedLengthArray::from_bounded_vec(self.l2_to_l1_msgs),\n            start_side_effect_counter: self.inputs.start_side_effect_counter,\n            end_side_effect_counter: self.side_effect_counter,\n            private_logs: ClaimedLengthArray::from_bounded_vec(self.private_logs),\n            contract_class_logs_hashes: ClaimedLengthArray::from_bounded_vec(self.contract_class_logs_hashes),\n            anchor_block_header: self.anchor_block_header,\n            tx_context: self.inputs.tx_context,\n            expected_non_revertible_side_effect_counter: self.expected_non_revertible_side_effect_counter,\n            expected_revertible_side_effect_counter: self.expected_revertible_side_effect_counter,\n        }\n    }\n\n    /// Designates this contract as the fee payer for the transaction.\n    ///\n    /// Unlike Ethereum, where the transaction sender always pays fees, Aztec allows any contract to voluntarily pay\n    /// transaction fees. This enables patterns like sponsored transactions or fee abstraction where users don't need\n    /// to hold fee-juice themselves. (Fee juice is a fee-paying asset for Aztec).\n    ///\n    /// Only one contract per transaction can declare itself as the fee payer, and it must have sufficient fee-juice\n    /// balance (>= the gas limits specified in the TxContext) by the time we reach the public setup phase of the tx.\n    ///\n    pub fn set_as_fee_payer(&mut self) {\n        aztecnr_trace_log_format!(\"Setting {0} as fee payer\")([self.this_address().to_field()]);\n        self.is_fee_payer = true;\n    }\n\n    pub fn in_revertible_phase(&mut self) -> bool {\n        let current_counter = self.side_effect_counter;\n\n        // Safety: Kernel will validate that the claim is correct by validating the expected counters.\n        let is_revertible = unsafe { is_execution_in_revertible_phase(current_counter) };\n\n        if is_revertible {\n            if (self.expected_revertible_side_effect_counter == 0)\n                | (current_counter < self.expected_revertible_side_effect_counter) {\n                self.expected_revertible_side_effect_counter = current_counter;\n            }\n        } else if current_counter > self.expected_non_revertible_side_effect_counter {\n            self.expected_non_revertible_side_effect_counter = current_counter;\n        }\n\n        is_revertible\n    }\n\n    /// Declares the end of the \"setup phase\" of this tx.\n    ///\n    /// Only one function per tx can declare the end of the setup phase.\n    ///\n    /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n    /// to make use of this function.\n    ///\n    /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n    /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n    /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n    /// phase enables such a payment to be made, because the setup phase _cannot revert_: a reverting function within\n    /// the setup phase would result in an invalid block which cannot be proven. Any side-effects generated during that\n    /// phase are guaranteed to be inserted into Aztec's state trees (except for squashed notes & nullifiers, of\n    /// course).\n    ///\n    /// Even though the end of the setup phase is declared within a private function, you might have noticed that\n    /// _public_ functions can also execute within the setup phase. This is because any public function calls which\n    /// were enqueued _within the setup phase_ by a private function are considered part of the setup phase.\n    ///\n    /// # Advanced\n    /// * Sets the minimum revertible side effect counter of this tx to be the PrivateContext's _current_ side effect\n    /// counter.\n    ///\n    pub fn end_setup(&mut self) {\n        // We bump the counter twice: once so that `min_revertible_side_effect_counter` sits strictly above any\n        // non-revertible side effect counter (including queries made via `in_revertible_phase` before this call), and\n        // once more so that the next revertible side effect counter is strictly greater than\n        // `min_revertible_side_effect_counter`. This ensures `min_revertible_side_effect_counter` occupies a gap that\n        // no side effect takes, which the kernel relies on when validating the phase split.\n        self.side_effect_counter += 1;\n        self.min_revertible_side_effect_counter = self.side_effect_counter;\n        self.side_effect_counter += 1;\n\n        aztecnr_trace_log_format!(\n            \"Ending setup, minimum revertible side effect counter is {0}\",\n        )(\n            [self.min_revertible_side_effect_counter as Field],\n        );\n        notify_revertible_phase_start(self.min_revertible_side_effect_counter);\n    }\n\n    /// Sets a deadline (an \"include-by timestamp\") for when this transaction must be included in a block.\n    ///\n    /// Other functions in this tx might call this setter with differing values for the include-by timestamp. To ensure\n    /// that all functions' deadlines are met, the _minimum_ of all these include-by timestamps will be exposed when\n    /// this tx is submitted to the network.\n    ///\n    /// If the transaction is not included in a block by its include-by timestamp, it becomes invalid and it will never\n    /// be included.\n    ///\n    /// This expiry timestamp is publicly visible. See the \"Advanced\" section for privacy concerns.\n    ///\n    /// # Arguments\n    /// * `expiration_timestamp` - Unix timestamp (seconds) deadline for inclusion. The include-by timestamp of this tx\n    /// will be _at most_ the timestamp specified.\n    ///\n    /// # Advanced\n    /// * If multiple functions set differing `expiration_timestamp`s, the kernel circuits will set it to be the\n    /// _minimum_ of the two. This ensures the tx expiry requirements of all functions in the tx are met.\n    /// * Rollup circuits will reject expired txs.\n    /// * The protocol enforces that all transactions must be included within 24 hours of their chosen anchor block's\n    /// timestamp, to enable safe mempool pruning.\n    /// * The DelayedPublicMutable design makes heavy use of this functionality, to enable private functions to read\n    /// public state.\n    /// * A sophisticated Wallet should cleverly set an include-by timestamp to improve the privacy of the user and the\n    /// network as a whole. For example, if a contract interaction sets include-by to some publicly-known value (e.g.\n    /// the time when a contract upgrades), then the wallet might wish to set an even lower one to avoid revealing that\n    /// this tx is interacting with said contract. Ideally, all wallets should standardize on an approach in order to\n    ///   provide users with a large privacy set -- although the exact approach\n    /// will need to be discussed. Wallets that deviate from a standard might accidentally reveal which wallet each\n    /// transaction originates from.\n    ///\n    // docs:start:expiration-timestamp\n    pub fn set_expiration_timestamp(&mut self, expiration_timestamp: u64) {\n        // docs:end:expiration-timestamp\n        self.expiration_timestamp = std::cmp::min(self.expiration_timestamp, expiration_timestamp);\n    }\n\n    /// Asserts that a note has been created.\n    ///\n    /// This function will cause the transaction to fail unless the requested note exists. This is the preferred\n    /// mechanism for performing this check, and the only one that works for pending notes.\n    ///\n    /// ## Pending Notes\n    ///\n    /// Both settled notes (created in prior transactions) and pending notes (created in the current transaction) will\n    /// be considered by this function. Pending notes must have been created **before** this call is made for the check\n    /// to pass.\n    ///\n    /// ## Historical Notes\n    ///\n    /// If you need to assert that a note existed _by some specific block in the past_, instead of simply proving that\n    /// it exists by the current anchor block, use [`crate::history::note::assert_note_existed_by`] instead.\n    ///\n    /// ## Cost\n    ///\n    /// This uses up one of the call's kernel note hash read requests, which are limited. Like all kernel requests,\n    /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n    /// an additional invocation of the kernel reset circuit.\n    pub fn assert_note_exists(&mut self, note_existence_request: NoteExistenceRequest) {\n        // Note that the `note_hash_read_requests` array does not hold `NoteExistenceRequest` objects, but rather a\n        // custom kernel type. We convert from the aztec-nr type into it.\n\n        let note_hash = note_existence_request.note_hash();\n        let contract_address = note_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n        let side_effect = Scoped::new(\n            Counted::new(note_hash, self.next_counter()),\n            contract_address,\n        );\n\n        self.note_hash_read_requests.push(side_effect);\n    }\n\n    /// Asserts that a nullifier has been emitted.\n    ///\n    /// This function will cause the transaction to fail unless the requested nullifier exists. This is the preferred\n    /// mechanism for performing this check, and the only one that works for pending nullifiers.\n    ///\n    /// ## Pending Nullifiers\n    ///\n    /// Both settled nullifiers (emitted in prior transactions) and pending nullifiers (emitted in the current\n    /// transaction) will be considered by this function. Pending nullifiers must have been emitted **before** this\n    /// call is made for the check to pass.\n    ///\n    /// ## Historical Nullifiers\n    ///\n    /// If you need to assert that a nullifier existed _by some specific block in the past_, instead of simply proving\n    /// that it exists by the current anchor block, use [`crate::history::nullifier::assert_nullifier_existed_by`]\n    /// instead.\n    ///\n    /// ## Public vs Private\n    ///\n    /// In general, it is unsafe to check for nullifier non-existence in private, as that will not consider the\n    /// possibility of the nullifier having been emitted in any transaction between the anchor block and the inclusion\n    /// block. Private functions instead prove existence via this function and 'prove' non-existence by _emitting_ the\n    /// nullifer, which would cause the transaction to fail if the nullifier existed.\n    ///\n    /// This is not the case in public functions, which do have access to the tip of the blockchain and so can reliably\n    /// prove whether a nullifier exists or not via\n    /// [`crate::context::public_context::PublicContext::nullifier_exists_unsafe`].\n    ///\n    /// ## Cost\n    ///\n    /// This uses up one of the call's kernel nullifier read requests, which are limited. Like all kernel requests,\n    /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n    /// an additional invocation of the kernel reset circuit.\n    pub fn assert_nullifier_exists(&mut self, nullifier_existence_request: NullifierExistenceRequest) {\n        let nullifier = nullifier_existence_request.nullifier();\n        let contract_address = nullifier_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n        let request = Scoped::new(\n            Counted::new(nullifier, self.next_counter()),\n            contract_address,\n        );\n\n        self.nullifier_read_requests.push(request);\n    }\n\n    /// Requests the app-siloed nullifier hiding key (nhk_app) for the given (hashed) master nullifier public key\n    /// (npk_m), from the user's PXE.\n    ///\n    /// Advanced function: Only needed if you're designing your own notes and/or nullifiers.\n    ///\n    /// Contracts are not allowed to compute nullifiers for other contracts, as that would let them read parts of their\n    /// private state. Because of this, a contract is only given an \"app-siloed key\", which is constructed by\n    /// hashing the user's master nullifier hiding key with the contract's address. However, because contracts cannot\n    /// be trusted with a user's master nullifier hiding key (because we don't know which contracts are honest or\n    /// malicious), the PXE refuses to provide any master secret keys to any app smart contract function. This means\n    /// app functions are unable to prove that the derivation of an app-siloed nullifier hiding key has been computed\n    /// correctly. Instead, an app function can request to the kernel (via `request_nhk_app`) that it validates the\n    /// siloed derivation, since the kernel has been vetted to not leak any master secret keys.\n    ///\n    /// A common nullification scheme is to inject a nullifier hiding key into the preimage of a nullifier, to make the\n    /// nullifier deterministic but random-looking. This function enables that flow.\n    ///\n    /// # Arguments\n    /// * `npk_m_hash` - A hash of the master nullifier public key of the user whose PXE is executing this function.\n    ///\n    /// # Returns\n    /// * The app-siloed nullifier hiding key that corresponds to the given `npk_m_hash`.\n    ///\n    pub fn request_nhk_app(&mut self, npk_m_hash: Field) -> Field {\n        self.request_sk_app(npk_m_hash, NULLIFIER_INDEX)\n    }\n\n    /// Requests the app-siloed outgoing viewing secret key (ovsk_app) for the given (hashed) master outgoing\n    /// viewing public key (ovpk_m), from the user's PXE.\n    ///\n    /// See `request_nhk_app` and `request_sk_app` for more info.\n    ///\n    /// The intention of the \"outgoing\" keypair is to provide a second secret key for all of a user's outgoing activity\n    /// (i.e. for notes that a user creates, as opposed to notes that a user receives from others). The separation of\n    /// incoming and outgoing data was a distinction made by zcash, with the intention of enabling a user to optionally\n    /// share with a 3rd party a controlled view of only incoming or outgoing notes. Similar functionality of sharing\n    /// select data can be achieved with offchain zero-knowledge proofs. It is up to an app developer whether they\n    /// choose to make use of a user's outgoing keypair within their application logic, or instead simply use the same\n    /// keypair (the address keypair (which is effectively the same as the \"incoming\" keypair)) for all incoming &\n    /// outgoing messages to a user.\n    ///\n    /// Currently, all of the exposed encryption functions in aztec-nr ignore the outgoing viewing keys, and instead\n    /// encrypt all note logs and event logs to a user's address public key.\n    ///\n    /// # Arguments\n    /// * `ovpk_m_hash` - Hash of the outgoing viewing public key master\n    ///\n    /// # Returns\n    /// * The application-specific outgoing viewing secret key\n    ///\n    pub fn request_ovsk_app(&mut self, ovpk_m_hash: Field) -> Field {\n        self.request_sk_app(ovpk_m_hash, OUTGOING_INDEX)\n    }\n\n    /// Pushes a Key Validation Request to the kernel.\n    ///\n    /// Private functions are not allowed to see a user's master secret keys, because we do not trust them. They are\n    /// instead given \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then\n    /// request validation of this claim, by making a \"key validation request\" to the protocol's kernel circuits (which\n    /// _are_ allowed to see certain master secret keys).\n    ///\n    /// When a Key Validation Request tuple of (sk_app, Pk_m, app_address) is submitted to the kernel, it will perform\n    /// the following derivations to validate the relationship between the claimed sk_app and the user's Pk_m:\n    ///\n    ///       (sk_m) ----> * G ----> Pk_m\n    ///         |                     |\n    ///         v                       We use the kernel to prove this\n    ///  h(sk_m, app_address)         | sk_app-Pk_m relationship, because app\n    ///         |                       circuits must not be trusted to see sk_m.\n    ///         v                     |\n    /// sk_app - -  - - - - - - -\n    ///\n    /// The function is named \"request_\" instead of \"get_\" to remind the user that a Key Validation Request will be\n    /// emitted to the kernel.\n    ///\n    fn request_sk_app(&mut self, pk_m_hash: Field, key_index: Field) -> Field {\n        let cached_request =\n            self.last_key_validation_requests[key_index as u32].unwrap_or(KeyValidationRequest::empty());\n\n        if cached_request.pk_m.hash() == pk_m_hash {\n            // We get a match so the cached request is the latest one\n            cached_request.sk_app\n        } else {\n            // We didn't get a match meaning the cached result is stale Typically we'd validate keys by showing that\n            // they are the preimage of `pk_m_hash`, but that'd require the oracle returning the master secret keys,\n            // which could cause malicious contracts to leak it or learn about secrets from other contracts. We\n            // therefore silo secret keys, and rely on the private kernel to validate that we siloed secret key\n            // corresponds to correct siloing of the master secret key that hashes to `pk_m_hash`.\n\n            // Safety: Kernels verify that the key validation request is valid and below we verify that a request for\n            // the correct public key has been received.\n            let request = unsafe { get_key_validation_request(pk_m_hash, key_index) };\n            assert(!request.pk_m.is_infinite, \"Infinite public key points are not allowed\");\n            assert_eq(request.pk_m.hash(), pk_m_hash, \"Obtained invalid key validation request\");\n\n            self.key_validation_requests_and_separators.push(\n                KeyValidationRequestAndSeparator {\n                    request,\n                    key_type_domain_separator: public_key_domain_separators[key_index as u32],\n                },\n            );\n            self.last_key_validation_requests[key_index as u32] = Option::some(request);\n            request.sk_app\n        }\n    }\n\n    /// Sends an \"L2 -> L1 message\" from this function (Aztec, L2) to a smart contract on Ethereum (L1). L1 contracts\n    /// which are designed to send/receive messages to/from Aztec are called \"Portal Contracts\".\n    ///\n    /// Common use cases include withdrawals, cross-chain asset transfers, and triggering L1 actions based on L2 state\n    /// changes.\n    ///\n    /// The message will be inserted into an Aztec \"Outbox\" contract on L1, when this transaction's block is proposed\n    /// to L1. Sending the message will not result in any immediate state changes in the target portal contract. The\n    /// message will need to be manually consumed from the Outbox through a separate Ethereum transaction: a user will\n    /// need to call a function of the portal contract -- a function specifically designed to make a call to the Outbox\n    /// to consume the message. The message will only be available for consumption once the _epoch_ proof has been\n    /// submitted. Given that there are multiple Aztec blocks within an epoch, it might take some time for this epoch\n    /// proof to be submitted -- especially if the block was near the start of an epoch.\n    ///\n    /// # Arguments\n    /// * `recipient` - Ethereum address that will receive the message\n    /// * `content` - Message content (32 bytes as a Field element). This content has a very\n    /// specific layout. docs:start:context_message_portal\n    pub fn message_portal(&mut self, recipient: EthAddress, content: Field) {\n        let message = L2ToL1Message { recipient, content };\n        self.l2_to_l1_msgs.push(message.count(self.next_counter()));\n    }\n\n    /// Consumes a message sent from Ethereum (L1) to Aztec (L2).\n    ///\n    /// Common use cases include token bridging, cross-chain governance, and triggering L2 actions based on L1 events.\n    ///\n    /// Use this function if you only want the message to ever be \"referred to\" once. Once consumed using this method,\n    /// the message cannot be consumed again, because a nullifier is emitted. If your use case wants for the message to\n    /// be read unlimited times, then you can always read any historic message from the L1-to-L2 messages tree;\n    /// messages never technically get deleted from that tree.\n    ///\n    /// The message will first be inserted into an Aztec \"Inbox\" smart contract on L1. Sending the message will not\n    /// result in any immediate state changes in the target L2 contract. The message will need to be manually consumed\n    /// by the target contract through a separate Aztec transaction. The message will not be available for consumption\n    /// immediately. Messages get copied over from the L1 Inbox to L2 by the next Proposer in batches. So you will need\n    /// to wait until the messages are copied before you can consume them.\n    ///\n    /// # Arguments\n    /// * `content` - The message content that was sent from L1\n    /// * `secret` - Secret value used for message privacy (if needed)\n    /// * `sender` - Ethereum address that sent the message\n    /// * `leaf_index` - Index of the message in the L1-to-L2 message tree\n    ///\n    /// # Advanced\n    /// Validates message existence in the L1-to-L2 message tree and nullifies the message to prevent\n    /// double-consumption.\n    pub fn consume_l1_to_l2_message(&mut self, content: Field, secret: Field, sender: EthAddress, leaf_index: Field) {\n        let nullifier = process_l1_to_l2_message(\n            self.anchor_block_header.state.l1_to_l2_message_tree.root,\n            self.this_address(),\n            sender,\n            self.chain_id(),\n            self.version(),\n            content,\n            secret,\n            leaf_index,\n        );\n\n        // Push nullifier (and the \"commitment\" corresponding to this can be \"empty\")\n        self.push_nullifier(nullifier)\n    }\n\n    /// Emits a private log (an array of Fields) that will be published to an Ethereum blob.\n    ///\n    /// Private logs are intended for the broadcasting of ciphertexts: that is, encrypted events or encrypted note\n    /// contents. Since the data in the logs is meant to be _encrypted_, private_logs are broadcast to publicly-visible\n    /// Ethereum blobs. The intended recipients of such encrypted messages can then discover and decrypt these\n    /// encrypted logs using their viewing secret key. (See `../messages/discovery` for more details).\n    ///\n    /// Important note: This function DOES NOT _do_ any encryption of the input `log` fields. This function blindly\n    /// publishes whatever input `log` data is fed into it, so the caller of this function should have already\n    /// performed the encryption, and the `log` should be the result of that encryption.\n    ///\n    /// The protocol does not dictate what encryption scheme should be used: a smart contract developer can choose\n    /// whatever encryption scheme they like. Aztec-nr includes some off-the-shelf encryption libraries that developers\n    /// might wish to use, for convenience. These libraries not only encrypt a plaintext (to produce a ciphertext);\n    /// they also prepend the ciphertext with a `tag` and `ephemeral public key` for easier message discovery. This is\n    /// a very dense topic, and we will be writing more libraries and docs soon.\n    ///\n    /// > Currently, AES128 CBC encryption is the main scheme included in > aztec.nr. > We are currently making\n    /// significant changes to the interfaces of the > encryption library.\n    ///\n    /// In some niche use cases, an app might be tempted to publish _un-encrypted_ data via a private log, because\n    /// _public logs_ are not available to private functions. Be warned that emitting public data via private logs is\n    /// strongly discouraged, and is considered a \"privacy anti-pattern\", because it reveals identifiable information\n    /// about _which_ function has been executed. A tx which leaks such information does not contribute to the privacy\n    /// set of the network.\n    ///\n    /// * Unlike `emit_raw_note_log_unsafe`, this log is not tied to any specific note\n    ///\n    /// # Arguments\n    /// * `tag` - A tag placed at `fields[0]` of the emitted log. Used by recipients and nodes to identify and\n    /// filter for relevant logs without scanning all of them.\n    /// * `log` - The log data that will be publicly broadcast (so make sure it's already been encrypted before you\n    /// call this function). Private logs are bounded in size (`PRIVATE_LOG_CIPHERTEXT_LEN`), to encourage all logs\n    /// from all smart contracts look identical.\n    /// * `length` - The actual length of `log` (measured in number of Fields). Although the input log has a max\n    /// size of `PRIVATE_LOG_CIPHERTEXT_LEN`, the latter values of the array might all be 0's for small logs. This\n    /// `length` should reflect the trimmed length of the array. The protocol's kernel circuits can then append\n    /// random fields as \"padding\" after the `length`, so that the logs of this smart contract look\n    /// indistinguishable from (the same length as) the logs of all other applications. It's up to wallets how much\n    /// padding to apply, so ideally all wallets should agree on standards for this.\n    ///\n    /// ## Safety\n    ///\n    /// The `tag` should be domain-separated (e.g. via [`crate::protocol::hash::compute_log_tag`]) to prevent\n    /// collisions between logs from different sources. Without domain separation, two unrelated log types that\n    /// happen to share a raw tag value become indistinguishable. Prefer the higher-level APIs\n    /// ([`crate::messages::message_delivery::MessageDelivery`] for messages, `self.emit(event)` for events) which\n    /// handle tagging automatically.\n    // TODO(F-555): remove this function in favor of `emit_private_log_vec_unsafe`\n    #[deprecated(\"use `emit_private_log_vec_unsafe` instead\")]\n    pub fn emit_private_log_unsafe(&mut self, tag: Field, log: [Field; PRIVATE_LOG_CIPHERTEXT_LEN], length: u32) {\n        let counter = self.next_counter();\n        let full_log = [tag].concat(log);\n        self.private_logs.push(PrivateLogData { log: PrivateLog::new(full_log, length + 1), note_hash_counter: 0 }\n            .count(counter));\n    }\n\n    /// `BoundedVec`-based variant of [`emit_private_log_unsafe`](PrivateContext::emit_private_log_unsafe).\n    ///\n    /// See [`emit_private_log_unsafe`](PrivateContext::emit_private_log_unsafe) for the full description of private\n    /// log semantics.\n    // TODO(F-555): once `emit_private_log_unsafe` is removed, rename this function to drop the `_vec` suffix.\n    pub fn emit_private_log_vec_unsafe(&mut self, tag: Field, log: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN>) {\n        self.emit_raw_note_log_vec_unsafe(tag, log, 0);\n    }\n\n    // TODO: rename.\n    /// Emits a private log that is explicitly tied to a newly-emitted note_hash, to convey to the kernel: \"this log\n    /// relates to this note\".\n    ///\n    /// This linkage is important in case the note gets squashed (due to being read later in this same tx), since we\n    /// can then squash the log as well.\n    ///\n    /// See `emit_private_log_unsafe` for more info about private log emission.\n    ///\n    /// # Arguments\n    /// * `tag` - A tag placed at `fields[0]`. See `emit_private_log_unsafe`.\n    /// * `log` - The log data as an array of Field elements\n    /// * `length` - The actual length of the `log` (measured in number of Fields).\n    /// * `note_hash_counter` - The side-effect counter that was assigned to the new note_hash when it was pushed to\n    /// this `PrivateContext`.\n    ///\n    /// Important: If your application logic requires the log to always be emitted regardless of note squashing,\n    /// consider using `emit_private_log_unsafe` instead, or emitting additional events.\n    ///\n    /// ## Safety\n    ///\n    /// Same as [`PrivateContext::emit_private_log_unsafe`]: the `tag` should be domain-separated.\n    // TODO(F-555): remove this function in favor of `emit_raw_note_log_vec_unsafe`\n    #[deprecated(\"use `emit_raw_note_log_vec_unsafe` instead\")]\n    pub fn emit_raw_note_log_unsafe(\n        &mut self,\n        tag: Field,\n        log: [Field; PRIVATE_LOG_CIPHERTEXT_LEN],\n        length: u32,\n        note_hash_counter: u32,\n    ) {\n        let counter = self.next_counter();\n        let full_log = [tag].concat(log);\n        let private_log = PrivateLogData { log: PrivateLog::new(full_log, length + 1), note_hash_counter };\n        self.private_logs.push(private_log.count(counter));\n    }\n\n    /// `BoundedVec`-based variant of [`emit_raw_note_log_unsafe`](PrivateContext::emit_raw_note_log_unsafe).\n    ///\n    /// See [`emit_raw_note_log_unsafe`](PrivateContext::emit_raw_note_log_unsafe) for the full description of\n    /// note-tied private log semantics.\n    // TODO(F-555): once `emit_raw_note_log_unsafe` is removed, rename this function to drop the `_vec` suffix.\n    pub fn emit_raw_note_log_vec_unsafe(\n        &mut self,\n        tag: Field,\n        log: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN>,\n        note_hash_counter: u32,\n    ) {\n        let counter = self.next_counter();\n        let full_log = [tag].concat(log.storage());\n        let private_log = PrivateLogData { log: PrivateLog::new(full_log, log.len() + 1), note_hash_counter };\n        self.private_logs.push(private_log.count(counter));\n    }\n\n    /// Emits large data blobs.\n    ///\n    /// This reuses the Contract Class Log channel to emit blobs of up to [`CONTRACT_CLASS_LOG_SIZE_IN_FIELDS`].\n    ///\n    /// ## Privacy\n    ///\n    /// The address of the contract emitting these blobs is revelead.\n    pub fn emit_contract_class_log<let N: u32>(&mut self, log: [Field; N]) {\n        let contract_address = self.this_address();\n        let counter = self.next_counter();\n\n        let log_to_emit: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS] =\n            log.concat([0; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS - N]);\n        // Note: the length is not always N, it is the number of fields we want to broadcast, omitting trailing zeros\n        // to save blob space.\n        // Safety: The below length is constrained in the base rollup, which will make sure that all the fields beyond\n        // length are zero. However, it won't be able to check that we didn't add extra padding (trailing zeroes) or\n        // that we cut trailing zeroes from the end.\n        let length = unsafe { trimmed_array_length_hint(log) };\n        // We hash the entire padded log to ensure a user cannot pass a shorter length and so emit incorrect shorter\n        // bytecode.\n        let log_hash = compute_contract_class_log_hash(log_to_emit);\n        // Safety: the below only exists to broadcast the raw log, so we can provide it to the base rollup later to be\n        // constrained.\n        unsafe {\n            notify_created_contract_class_log(contract_address, log_to_emit, length, counter);\n        }\n\n        self.contract_class_logs_hashes.push(LogHash { value: log_hash, length: length }.count(counter));\n    }\n\n    /// Calls a private function on another contract (or the same contract).\n    ///\n    /// Very low-level function.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the called function\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    /// This enables contracts to interact with each other while maintaining privacy. This \"composability\" of private\n    /// contract functions is a key feature of the Aztec network.\n    ///\n    /// If a user's transaction includes multiple private function calls, then by the design of Aztec, the following\n    /// information will remain private[1]:\n    /// - The function selectors and contract addresses of all private function calls will remain private, so an\n    /// observer of the public mempool will not be able to look at a tx and deduce which private functions have been\n    /// executed.\n    /// - The arguments and return values of all private function calls will remain private.\n    /// - The person who initiated the tx will remain private.\n    /// - The notes and nullifiers and private logs that are emitted by all private function calls will (if designed\n    /// well) not leak any user secrets, nor leak which functions have been executed.\n    ///\n    /// [1] Caveats: Some of these privacy guarantees depend on how app developers design their smart contracts. Some\n    /// actions _can_ leak information, such as:\n    /// - Calling an internal public function.\n    /// - Calling a public function and not setting msg_sender to Option::none (feature not built yet - see github).\n    /// - Calling any public function will always leak details about the nature of the transaction, so devs should be\n    /// careful in their contract designs. If it can be done in a private function, then that will give the best\n    /// privacy.\n    /// - Not padding the side-effects of a tx to some standardized, uniform size. The kernel circuits can take hints\n    /// to pad side-effects, so a wallet should be able to request for a particular amount of padding. Wallets should\n    /// ideally agree on some standard.\n    /// - Padding should include:\n    /// - Padding the lengths of note & nullifier arrays\n    /// - Padding private logs with random fields, up to some standardized size. See also:\n    /// https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n    ///\n    /// # Advanced\n    /// * The call is added to the private call stack and executed by kernel circuits after this function completes\n    /// * The called function can modify its own contract's private state\n    /// * Side effects from the called function are included in this transaction\n    /// * The call inherits the current transaction's context and gas limits\n    ///\n    pub fn call_private_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n    ) -> ReturnsHash {\n        let args_hash = hash_args(args);\n        execution_cache::store(args, args_hash);\n        self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, false)\n    }\n\n    /// Makes a read-only call to a private function on another contract.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function cannot modify state, emit L2->L2 messages, nor\n    /// emit events. Any nested calls are constrained to also be staticcalls.\n    ///\n    /// See `call_private_function` for more general info on private function calls.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract to call\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the called function\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn static_call_private_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n    ) -> ReturnsHash {\n        let args_hash = hash_args(args);\n        execution_cache::store(args, args_hash);\n        self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, true)\n    }\n\n    /// Calls a private function that takes no arguments.\n    ///\n    /// This is a convenience function for calling private functions that don't require any input parameters. It's\n    /// equivalent to `call_private_function` but slightly more efficient to use when no arguments are needed.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn call_private_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n    ) -> ReturnsHash {\n        self.call_private_function_with_args_hash(contract_address, function_selector, 0, false)\n    }\n\n    /// Makes a read-only call to a private function which takes no arguments.\n    ///\n    /// This combines the optimisation of `call_private_function_no_args` with the safety of\n    /// `static_call_private_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn static_call_private_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n    ) -> ReturnsHash {\n        self.call_private_function_with_args_hash(contract_address, function_selector, 0, true)\n    }\n\n    /// Low-level private function call.\n    ///\n    /// This is the underlying implementation used by all other private function call methods. Instead of taking raw\n    /// arguments, it accepts a hash of the arguments.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args_hash` - Pre-computed hash of the function arguments\n    /// * `is_static_call` - Whether this should be a read-only call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values\n    ///\n    pub fn call_private_function_with_args_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args_hash: Field,\n        is_static_call: bool,\n    ) -> ReturnsHash {\n        let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n        let start_side_effect_counter = self.side_effect_counter;\n\n        // Safety: The oracle simulates the private call and returns the value of the side effects counter after\n        // execution of the call (which means that end_side_effect_counter - start_side_effect_counter is the number of\n        // side effects that took place), along with the hash of the return values. We validate these by requesting a\n        // private kernel iteration in which the return values are constrained to hash to `returns_hash` and the side\n        // effects counter to increment from start to end.\n        let (end_side_effect_counter, returns_hash) = unsafe {\n            call_private_function_internal(\n                contract_address,\n                function_selector,\n                args_hash,\n                start_side_effect_counter,\n                is_static_call,\n            )\n        };\n\n        self.private_call_requests.push(\n            PrivateCallRequest {\n                call_context: CallContext {\n                    msg_sender: self.this_address(),\n                    contract_address,\n                    function_selector,\n                    is_static_call,\n                },\n                args_hash,\n                returns_hash,\n                start_side_effect_counter,\n                end_side_effect_counter,\n            },\n        );\n\n        // The kernel circuits ensure that end_side_effect_counter is greater than start_side_effect_counter, and that\n        // all side effects emitted in the child call have counters within the range [start_side_effect_counter,\n        // end_side_effect_counter]. Therefore, we only need to ensure that the next side effect from the current call\n        // starts after the end side effect from the child call.\n        self.side_effect_counter = end_side_effect_counter + 1;\n\n        ReturnsHash::new(returns_hash)\n    }\n\n    /// Enqueues a call to a public function to be executed later.\n    ///\n    /// Unlike private functions which execute immediately on the user's device, public function calls are \"enqueued\"\n    /// and executed some time later by a block proposer.\n    ///\n    /// This means a public function cannot return any values back to a private function, because by the time the\n    /// public function is being executed, the private function which called it has already completed execution. (In\n    /// fact, the private function has been executed and proven, along with all other private function calls of the\n    /// user's tx. A single proof of the tx has been submitted to the Aztec network, and some time later a proposer has\n    /// picked the tx up from the mempool and begun executing all of the enqueued public functions).\n    ///\n    /// # Privacy warning Enqueueing a public function call is an inherently leaky action. Many interesting applications will require some interaction with public state, but smart contract developers should try to use public function calls sparingly, and carefully. _Internal_ public function calls are especially leaky, because they completely leak which private contract made the call. See also: https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the public function\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Enqueues a read-only call to a public function.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function cannot modify state or emit events. Any nested\n    /// calls are constrained to also be staticcalls.\n    ///\n    /// See also `call_public_function` for more important information about making private -> public function calls.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the public function\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn static_call_public_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n    }\n\n    /// Enqueues a call to a public function that takes no arguments.\n    ///\n    /// This is an optimisation for calling public functions that don't take any input parameters. It's otherwise\n    /// equivalent to `call_public_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        hide_msg_sender: bool,\n    ) {\n        let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Enqueues a read-only call to a public function with no arguments.\n    ///\n    /// This combines the optimisation of `call_public_function_no_args` with the safety of\n    /// `static_call_public_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn static_call_public_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        hide_msg_sender: bool,\n    ) {\n        let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n    }\n\n    /// Low-level public function call.\n    ///\n    /// This is the underlying implementation used by all other public function call methods. Instead of taking raw\n    /// arguments, it accepts a hash of the arguments.\n    ///\n    /// Advanced function: Most developers should use `call_public_function` or `static_call_public_function` instead.\n    /// This function is exposed for performance optimization and advanced use cases.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `calldata_hash` - Hash of the function calldata\n    /// * `is_static_call` - Whether this should be a read-only call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function_with_calldata_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        calldata_hash: Field,\n        is_static_call: bool,\n        hide_msg_sender: bool,\n    ) {\n        let counter = self.next_counter();\n\n        let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n        assert_valid_public_call_data(calldata_hash);\n\n        let msg_sender = if hide_msg_sender {\n            NULL_MSG_SENDER_CONTRACT_ADDRESS\n        } else {\n            self.this_address()\n        };\n\n        let call_request = PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n\n        self.public_call_requests.push(Counted::new(call_request, counter));\n    }\n\n    /// Enqueues a public function call, and designates it to be the teardown function for this tx. Only one teardown\n    /// function call can be made by a tx.\n    ///\n    /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n    /// to make use of this function.\n    ///\n    /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n    /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n    /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n    /// phase ensures the fee payer has sufficient balance to pay the proposer their fees. The teardown phase is\n    /// primarily intended to: calculate exactly how much the user owes, based on gas consumption, and refund the user\n    /// any change.\n    ///\n    /// Note: in some cases, the cost of refunding the user (i.e. DA costs of tx side-effects) might exceed the refund\n    /// amount. For app logic with fairly stable and predictable gas consumption, a material refund amount is unlikely.\n    /// For app logic with unpredictable gas consumption, a refund might be important to the user (e.g. if a hefty\n    /// function reverts very early). Wallet/FPC/Paymaster developers should be mindful of this.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the teardown function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - An array of fields to pass to the function.\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    pub fn set_public_teardown_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.set_public_teardown_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Low-level function to set the public teardown function.\n    ///\n    /// This is the underlying implementation for setting the teardown function call that will execute at the end of\n    /// the transaction. Instead of taking raw arguments, it accepts a hash of the arguments.\n    ///\n    /// Advanced function: Most developers should use `set_public_teardown_function` instead.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the teardown function\n    /// * `calldata_hash` - Hash of the function calldata\n    /// * `is_static_call` - Whether this should be a read-only call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn set_public_teardown_function_with_calldata_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        calldata_hash: Field,\n        is_static_call: bool,\n        hide_msg_sender: bool,\n    ) {\n        let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n        assert_valid_public_call_data(calldata_hash);\n\n        let msg_sender = if hide_msg_sender {\n            NULL_MSG_SENDER_CONTRACT_ADDRESS\n        } else {\n            self.this_address()\n        };\n\n        self.public_teardown_call_request =\n            PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n    }\n\n    /// Increments the side-effect counter.\n    ///\n    /// Very low-level function.\n    ///\n    /// # Advanced\n    ///\n    /// Every side-effect of a private function is given a \"side-effect counter\", based on when it is created. This\n    /// PrivateContext is in charge of assigning the counters.\n    ///\n    /// The reason we have side-effect counters is complicated. Consider this illustrative pseudocode of inter-contract\n    /// function calls:\n    /// ```\n    /// contract A {\n    ///    let x = 5; // pseudocode for storage var x.\n    ///    fn a1 {\n    ///        read x; // value: 5, counter: 1.\n    ///        x = x + 1;\n    ///        write x; // value: 6, counter: 2.\n    ///\n    ///        B.b(); // start_counter: 2, end_counter: 4\n    ///\n    ///        read x; // value: 36, counter: 5.\n    ///        x = x + 1;\n    ///        write x; // value: 37, counter: 6.\n    ///    }\n    ///\n    ///    fn a2 {\n    ///        read x; // value: 6, counter: 3.\n    ///        x = x * x;\n    ///        write x; // value: 36, counter: 4.\n    ///    }\n    /// }\n    ///\n    /// contract B {\n    ///     fn b() {\n    ///         A.a2();\n    ///     }\n    /// }\n    /// ```\n    ///\n    /// Suppose a1 is the first function called. The comments show the execution counter of each side-effect, and what\n    /// the new value of `x` is.\n    ///\n    /// These (private) functions are processed by Aztec's kernel circuits in an order that is different from execution\n    /// order: All of A.a1 is proven before B.b is proven, before A.a2 is proven. So when we're in the 2nd execution\n    /// frame of A.a1 (after the call to B.b), the circuit needs to justify why x went from being `6` to `36`. But the\n    /// circuit doesn't know why, and given the order of proving, the kernel hasn't _seen_ a value of 36 get written\n    /// yet. The kernel needs to track big arrays of all side-effects of all private functions in a tx. Then, as it\n    /// recurses and processes B.b(), it will eventually see a value of 36 get written.\n    ///\n    /// Suppose side-effect counters weren't exposed: The kernel would only see this ordering (in order of proof\n    /// verification): [ A.a1.read, A.a1.write, A.a1.read, A.a1.write, A.a2.read, A.a2.write ]\n    /// [         5,          6,        36,         37,         6,         36 ]\n    /// The kernel wouldn't know _when_ B.b() was called within A.a1(), because it can't see what's going on within an\n    /// app circuit. So the kernel wouldn't know that the ordering of reads and writes should actually be: [ A.a1.read,\n    /// A.a1.write, A.a2.read, A.a2.write, A.a1.read, A.a1.write ]\n    /// [         5,          6,        6,         36,         36,         37 ]\n    ///\n    /// And so, we introduced side-effect counters: every private function must assign side-effect counters alongside\n    /// every side-effect that it emits, and also expose to the kernel the counters that it started and ended with.\n    /// This gives the kernel enough information to arrange all side-effects in the correct order. It can then catch\n    /// (for example) if a function tries to read state before it has been written (e.g. if A.a2() maliciously tried to\n    /// read a value of x=37) (e.g. if A.a1() maliciously tried to read x=6).\n    ///\n    /// If a malicious app contract _lies_ and does not count correctly:\n    /// - It cannot lie about its start and end counters because the kernel will catch this.\n    /// - It _could_ lie about its intermediate counters:\n    /// - 1. It could not increment its side-effects correctly\n    /// - 2. It could label its side-effects with counters outside of its start and end counters' range. The kernel\n    /// will catch 2. The kernel will not catch 1., but this would only cause corruption to the private state of the\n    /// malicious contract, and not any other contracts (because a contract can only modify its own state). If a \"good\"\n    /// contract is given _read access_ to a maliciously-counting contract (via an external getter function, or by\n    /// reading historic state from the archive tree directly), and they then make state changes to their _own_ state\n    /// accordingly, that could be dangerous. Developers should be mindful not to trust the claimed innards of external\n    /// contracts unless they have audited/vetted the contracts including vetting the side-effect counter\n    /// incrementation. This is a similar paradigm to Ethereum smart contract development: you must vet external\n    /// contracts that your contract relies upon, and you must not make any presumptions about their claimed behaviour.\n    /// (Hopefully if a contract imports a version of aztec-nr, we will get contract verification tooling that can\n    /// validate the authenticity of the imported aztec-nr package, and hence infer that the side- effect counting will\n    /// be correct, without having to re-audit such logic for every contract).\n    ///\n    fn next_counter(&mut self) -> u32 {\n        let counter = self.side_effect_counter;\n        self.side_effect_counter += 1;\n        counter\n    }\n}\n\nimpl Empty for PrivateContext {\n    fn empty() -> Self {\n        PrivateContext {\n            inputs: PrivateContextInputs::empty(),\n            side_effect_counter: 0 as u32,\n            min_revertible_side_effect_counter: 0 as u32,\n            is_fee_payer: false,\n            args_hash: 0,\n            return_hash: 0,\n            expiration_timestamp: 0,\n            note_hash_read_requests: BoundedVec::new(),\n            nullifier_read_requests: BoundedVec::new(),\n            key_validation_requests_and_separators: BoundedVec::new(),\n            note_hashes: BoundedVec::new(),\n            nullifiers: BoundedVec::new(),\n            private_call_requests: BoundedVec::new(),\n            public_call_requests: BoundedVec::new(),\n            public_teardown_call_request: PublicCallRequest::empty(),\n            l2_to_l1_msgs: BoundedVec::new(),\n            anchor_block_header: BlockHeader::empty(),\n            private_logs: BoundedVec::new(),\n            contract_class_logs_hashes: BoundedVec::new(),\n            last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n            expected_non_revertible_side_effect_counter: 0,\n            expected_revertible_side_effect_counter: 0,\n        }\n    }\n}\n"
     },
     "68": {
       "function_locations": [