@aztec/protocol-contracts 0.75.0 → 0.76.0

package/artifacts/Router.json

@@ -1,6 +1,6 @@
 {
   "transpiled": true,
-  "noir_version": "1.0.0-beta.1+4144a8dce4789d85",
+  "noir_version": "1.0.0-beta.1+3f8376928465907d",
   "name": "Router",
   "functions": [
     {
@@ -1625,7 +1625,7 @@
         }
       },
       "bytecode": "H4sIAAAAAAAA/+XdBXRT99/H8dSA4lYYE2yCQ9IkbYK7uztUUnQwbGPeubs7U+buynxj7r6xDTbcXZ/PdyTjNoSd8/x7s//zPs89533apunN63ebpGly87spnv1L7TSPZ0/q/s9TVFr0o51UP+602Efn5xkJzlchwWmVEpxWJcFp1RKcVkt1jDutXoLz1U9wWoMEpzVMcFqjBKc1VuU8JZeU6MeO0Y9+b04gEMnNjvj8vjxvdjg/FPQGgvk5IV/IFwwFC7NDfn8kFAjlhvPDud6wL+CP+IqCYX+Rd/9SJe3AurylWrILkums+p87/fEnmK26SndYbTvsdWz32OdNHJ9XjZ4n9nPV9HV1VUPVTDtwemxJjdsG3tItvkYubs+sNPdczuusrbe+Yxuleg69uHT52SkJLifF5W3f2L11eZNlbJIEY4nF7Su080pY2it0rSRdoWs5rtCxPzieJF/ZUjzJ/UWWdt254UihT7+ZZG6DamnJ2QZuO7PS/m//rmLOFMc67UFXiSX+hl3aG6Ob8Kae5Gxgt8fs4o3W1wwy5lQXx9wcMuY0F8fc4l8as7d0i6+li9uPcsfeysNweiFOH8SZDXH6Ic4AxBmEOHMgzlyIMwRxhiHO1hBnG4izLcTZDuJsD3F2gDg7QpydIM7OEGcXiLMrxNkN4uwOcfaAOHtCnL0gzt4QZx+Isy/E2Q/i7A9xDoA4B0KcgyDOwRDnEIhzKMQ5DOIcDnGOgDhHQpyjIM7REOcYiHMsxDkO4hwPcU6AOCdCnHkQZz7EWQBxFkKcEYizCOKcBHFOhjinQJxTIc5pEOd0iPN4iHMGxDkT4jwB4pwFcc6GOOdAnHMhznkQ54kQ50kQ53yI82SI8xSI81SI8zSI83SI8wyI80yIsxjiPAviPBviPAfiPBfiPA/iPB/ivADivBDivAjivBjivATivBTivAzivBzivALivBLivArivBrivAbivBbivA7ivB7ivAHivBHivAnivBnivAXivBXivA3ivB3ivAPiXABx3glx3gVx3g1x3gNx3gtx3gdxLoQ474c4H4A4H4Q4H4I4H4Y4H4E4H4U4H4M4H4c4n4A4n4Q4n4I4n4Y4n4E4n4U4n4M4n4c4X4A4X4Q4X4I4X4Y4X4E4X4U4X4M4F0Gcr0Ocb0Ccb0Kcb0Gcb0Oc70Cc70Kc70Gc70OciyHODyDODyHOjyDOjyHOTyDOTyHOzyDOzyHOLyDOLyHOryDOryHObyDObyHO7yDO7yHOHyDOHyHOnyDOnyHOXyDOJRDnrxDnbxDn7xDnUohzGcT5B8T5J8S5HOJcAXGuhDhXQZyrIc41EOdaiHMdxLke4twAcW6EODdBnJshzi0Q51aIcxvEuR3i3AFx7oQ4d0GcuyHOPRDnXohzH8RpKyQ4UyDOVIgzDeJMhzgzIM4yEGdZiLMcxJkJcZaHOCtAnBUhzkoQZ2WIswrEWRXirAZxVoc4a0CcNSHOLIizFsRZG+I8DOKsA3EeDnEeAXEeCXEeBXHWhTjrQZz1Ic4GEGdDiPNoiPMYiPNYiPM4iLMRxNkY4mwCcTaFOJtBnM0hzhYQZ0uIsxXE6YU4fRBnNsTphzgDEGcQ4syBOHMhzhDEGYY4W0OcbZLkTI1z+r05gUAkNzvi8/vyvNnh/FDQGwjm54R8IV8wFCzMDvn9kVAglBvOD+d6w76AP+IrCob9RdF1p7g45rb/D8fcDnJ9bJ9S+u3ny8vPjwSKAsl0dkhx7/f8T9chb+kWX0cXnbXT/p3bjbd0i6+Ti2POSmPcbjpDbt9dIM6uEGc3iLM7xNkD4uwJcfaCOHtDnH0gzr4QZz+Isz/EOQDiHAhxDoI4B0OcQyDOoRDnMIhzOMQ5AuIcCXGOgjhHQ5xjIM6xEOc4iHM8xDkB4pwIceZBnPkQZwHEWQhxRiDOIohzEsQ5GeKcAnFOhTinQZzTIc7jIc4ZEOdMiPMEiHMWxDkb4pwDcc6FOOdBnCdCnCdBnPMhzpMhzlMgzlMhztMgztMhzjMgzjMhzmKI8yyI82yI8xyI81yI8zyI83yI8wKI80KI8yKI82KI8xKI81KI8zKI83KI8wqI80qI8yqI82qI8xqI81qI8zqI83qI8waI80aI8yaI82aI8xaI81aI8zaI83aI8w6IcwHEeSfEeRfEeTfEeQ/EeS/EeR/EuRDivB/ifADifBDifAjifBjifATifBTifAzifBzifALifBLifArifBrifAbifBbifA7ifB7ifAHifBHifAnifBnifAXifBXifA3iXARxvg5xvgFxvglxvgVxvg1xvgNxvgtxvgdxvg9xLoY4P4A4P4Q4P4I4P4Y4P4E4P4U4P4M4P4c4v4A4v4Q4v4I4v4Y4v4E4v4U4v4M4v4c4f4A4f4Q4f4I4f4Y4f4E4l0Ccv0Kcv0Gcv0OcSyHOZRDnHxDnnxDncohzBcS5EuJcBXGuhjjXQJxrIc51EOd6iHMDxLkR4twEcW6GOLdAnFshzm0Q53aIcwfEuRPi3AVx7oY490CceyHOfRCnJ5XhTIE4UyHONIgzHeLMgDjLQJxlIc5yEGcmxFke4qwAcVaEOCtBnJUhzioQZ1WIsxrEWR3irAFx1oQ4syDOWhBnbYjzMIizDsR5OMR5BMR5JMR5FMRZF+KsB3HWhzgbQJwNIc6jIc5jIM5jIc7jIM5GEGdjiLMJxNkU4mwGcTaHOFtAnC0hzlYQpxfi9EGc2RCnH+IMQJxBiDMH4syFOEMQZxjibA1xtoE420Kc7SDO9hBnB4izI8TZCeLsDHF2gTi7QpzdIM7uEGcPiLMnxNkL4uwNcfaBOPtCnP0gzv4Q5wCIcyDEOQjiHAxxDoE4h0KcwyDO4RDnCIhzJMQ5CuIcDXGOgTjHQpzjIM7xEOcEiHMixJkHceZDnAUQZyHEGYE4iyDOSRDnZIhzCsQ5FeKcBnFOhziPhzhnQJwzIc4TIM5ZEOdsiHMOxDkX4pwHcZ4IcZ4Ecc6HOE+GOE+BOE+FOE+DOE+HOM+AOM+EOIshzrMgzrMhznMgznMhzvMgzvMhzgsgzgshzosgzoshzksgzkshzssgzsshzisgzishzqsgzqshzmsgzmshzusgzushzhsgzhshzpsgzpshzlsgzlshztsgztshzjsgzgUQ550Q510Q590Q5z0Q570Q530Q50KI836I8wGI80GI8yGI82GI8xGI81GI8zGI83GI8wmI80mI8ymI82mI8xmI81mI8zmI83mI8wWI80WI8yWI82WI8xWI81WI8zWIcxHE+TrE+QbE+SbE+RbE+TbE+Q7E+S7E+R7E+T7EuRji/ADi/BDi/Aji/Bji/ATi/BTi/Azi/Bzi/ALi/BLi/Ari/Bri/Abi/Bbi/A7i/B7i/AHi/BHi/Ani/Bni/AXiXAJx/gpx/gZx/g5xLoU4l0Gcf0Ccf0KcyyHOFUlypsY5/d6cQCCSmx3x+X153uxwfijoDQTzc0K+kC8YChZmh/z+SCgQyg3nh3O9YV/AH/EVBcP+oui6G7k45pX/0pi9pVt8q1Ld23610hi/53QXt99qyHU7w8Uxr4GMuYyLY14LGXNZF8e8DjLmci6OeT1kzJkujnkDZMzlXRzzRsiYK7g45k2QMVd0ccybIWOu5OKYt0DGXNnFMW+FjLmKi2PeBhlzVRfHvB0y5moujnkHZMzVXRzzTsiYa7g45l2QMdd0ccy7IWPOcnHMeyBjruXimPdCxlzbxTHvg4z5MBfH7IE8B1jHxTGnQMZ8uItjToWM+QgXx5wGGfORLo45HTLmo1wccwZkzHVdHHMZyJjruTjmspAx13dxzOUgY27g4pgzIWNu6OKYy0PGfLSLY64AGfMxLo65ImTMx7o45kqQMR/n4pgruzhmreqvfXyWRQfcVDVTzVUL1VK1sstRPpVt20IFVFDlqFwVUmHVWrVRbVU71V51iI69k+qsuqiuqpvqrnqonqqX6q36qL6qn+qvBqiBapAarIaooWqYGq5GqJFqlBqtxqixapwaryaoiSpP5asCVagiqkhNUpPVFDVVTVPT1fFqhpqpTlCz1Gw1R81V89SJ6iQ1X52sTlGnqtPU6eoMdaYqVmeps9U56lx1njpfXaAuVBepi9Ul6lJ1mbpcXaGuVFepq9U16lp1nbpe3aBuVDepm9Ut6lZ1m7pd3aEWqDvVXepudY+6V92nFqr71QPqQfWQelg9oh5Vj6nH1RPqSfWUelo9o55Vz6nn1QvqRfWSelm9ol5Vr6lF6nX1hnpTvaXeVu+od9V76n21WH2gPlQfqY/VJ+pT9Zn6XH2hvlRfqa/VN+pb9Z36Xv2gflQ/qZ/VL2qJ+lX9pn5XS9Uy9Yf6Uy1XK9RKtUqtVmvUWrVOrVcb1Ea1SW1WW9RWtU1tVzvUTrVL7VZ71F61T9mNLEWlqjSVrjJUGVVWlVOZqryqoCqqSqqyqqKqqmqquqqhaqosVUvVVoepOupwdYQ6Uh2l6qp6qr5qoBqqo9Ux6lh1nGqkGqsmqqlqppqrFqqlaqW8yqeylV8FVFDlqFwVUmHVWrVRbVU71V51UB1VJ9VZdVFdVTfVXfVQPVUv1Vv1UX1VP9VfDVAD1SA1WA1RQ9UwNVyNUCPVKDVajVFj1Tg1Xk1QE1WeylcFqlBFVJGapCarKWqqmqamq+PVDDVTnaBmqdlqjpqr5qkT1UlqvjpZnaJOVaep09UZ6kxVrM5SZ6tz1LnqPHW+ukBdqC5SF6tL1KXqMnW5ukJdqa5SV6tr1LXqOnW9ukHdqG5SN6tb1K3qNnW7ukMtUHequ9Td6h51r7pPLVT3qwfUg+oh9bB6RD2qHlOPqyfUk+op9bR6Rj2rnlPPqxfUi+ol9bJ6Rb2qXlOL1OvqDfWmeku9rd5R76r31PtqsfpAfag+Uh+rT9Sn6jP1ufpCfam+Ul+rb9S36jv1vfpB/ah+Uj+rX9QS9av6Tf2ulqpl6g/1p1quVqiVapVardaotWqdWq82qI1qk9qstqitapvarnaonWqX2q32qL1qn7IHFCkqVaWpdJWhyqiyqpzKVOVVBVVRVVKVVRVVVVVT1VUNVVNlqVqqtjpM1VGHqyPUkeooVVfVU/VVA9VQHa2OUceq41Qj1Vg1UU1VM9VctVAtVSvlVT6VrfwqoIIqR+WqkAqr1qqNaqvaqfaqg+qoOqnOqovqqrqp7qqH6ql6qd6qj+qr+qn+aoAaqAapwWqIGqqGqeFqhBqpRqnRaowaq8ap8WqCmqjyVL4qUIUqoorUJDVZTVFT1TRlx6u3Y8HbcdbtGOZ2fHA79rYd19qOGW3HY7ZjHdtxhO0YvXb8Wzu2rB231Y6JascbtWN52nEy7RiUxcqOnWjHJbRj/tnx9OxYdXYcODvGmh2/zI4NZsfdsmNa2fGi7FhMdpwjO4aQHZ/Hjn1jx5WxY7bY8VDsWCN2HA87RoYdf8KO7WDHTbBjEth8/zaXvs1Tb3PAL1A2d7nNC25zbtt81jZXtM3DbHMc2/zBNjevzXtrc8rafK02F6rNM2pzeNr8mDb3pM3raHMm2nyENtefzaNnc9TZ/G82t5rNW2Zzgtl8WzaXlc0TZXMwLVI2d5DNy2Nz3th8MjZXi82DYnOM2PwdNjeGzTthczrYfAk2F4G9z9/eQ2/vT7f3ftv7qu09y/Z+YHuvrb2P1d4jau+/tPc22vsG7T159n43ey+ZvU/L3gO1RNl7d+x9MfaeE3s/hz3mtfch2D7+tv+87Ztu+2rbftC2L6/t22r7etq+j7YvoO0bZ/uK2b5Tti+R7Vtj+5rYvhe2L4K9Nm+vVdtrt/Zapr22Z6912Ws/9lqIvTZgz5Xbc8f2XKo9t2jPtdlzT/ZcjD03Yf+r2/+u9r+c/W9jj/VT9z988Ni+yrY09RxYoncttvq/vm/79tq+rrbvp+0LafsG2r5ytu+Y7Utl+xbZvja274nti2H7Jthr9fbatb2Wa69t2mt99tqXvRZkr43YawX23Lk9l2zPrdpzjfbcW33VQDVU9r+7/S9r/9vZ/zq2/3xj1cRz8JLq+Lx69GPW0k51Zi1e2M15vqxDfC/286Hox8y401Oi26Nj9Gtv6RZfpmO9bq8/5A3kZnpKLi77/ZmOdSZz/enJWf9f+zHb0rW45Po9cZebFne+RD9TKfp5iufg88TGkYzrkX7PwSRvp+zY+ssk6fcc224Zjm2XlmBMscuv5Cn5u4p9P9FHj6fk79QTd1nlPUm9Dvv+aWxOf+y6UTXu/PHb4FDryvhfruu/+Tt1bmvn7/Sv8xQf+F5q3PfSHd/LiPteRvHBY7S/U/Uc50t0G4ydr6nj82Zx2yiZ98/Jul+wpUYCv/OybClb7Pl7iW2PNMdpse0a287lnOeP+16m43vpxSUvp3z063TH5TjXFXNkxJ0/9ne+SvRjGcfPxH6+aoLLLxN3+SXcCU6L3y6ZCc6fmeD8dv1tGP28QjS7DmU71neo24Hz8Urs8yqeg2/zsZ9N8m02O8Vz8P1S/P2L8/LtcV/ssdScuTNnR3rN6DY/UjBv7pSZM7rkFUyOOO+E41fiSTD42PdSHKcf6o9y/M+kOc7vXCp4DjyQSy8uef6O0dO9pVhyQ15v7DJjN4gMT8mN6Im7/Iy48+dGvy7vGI9zvB3/Q2dRbp6vyJ9XlBfMKywMFORVj1u/x3NgO9p2it1Zwh/45v1bD3yTdEP8+wFd2eSsP+EDX+dYYt+PXYe7FR/Ylt2KS5pi5+nhOE+PQ5ynp+M8PR3nseWfHkDH//F2OhI9GOwe9710z8G22Pecd8wxk92B1/Qc+DzLYbSlV/EB+99/MDxJfZAfTvI/W74ankM/QIr9UasT/bqi4/PIjFnzIvMiA+flT59S0H3ejIL99/7Tp8ff+TuvYM4lI+588T+X6I7e+XV63NcZCdZ7qJ+PP+1QV0ann/AHpW706//2H5T/AZUCAdF4GwIA",
-      "debug_symbols": "7VXbisIwEP2XPPchM5nJxV9ZRKpWKZRWal1YxH/fREy6rlEoewHBl5BJzsyZnJkkR7Guloftom433V7M3o6i6VblUHett44C6Ly235VtMPdD2Q9iBlpjIap2HaYGT4XY1E0lZtpPb8CI2lzAiNYlsLU5sCN7ASuJ8BgMmhSnPIjG2KhlLjigjpkA8Yg2JhddaRWDE8gr9LwQwC9l7iijX8rcUcb8WBmSLoIJ0Caw9wsE9q8JXJZAGZeOrekxASChjGgkViOcM3CVOoFgjAxKhnRQ/kY6Y82QpX6cDjhWKbhj1l8FyjWydS51srvRE+HZD4D/fQCUYNOVlMrBVUbeWPZ109TbxdVHJsNA2d+MIbIz4/cOI57uoqe7mOkudqKLtyAg8xXjdOsNj29ieADmJ2++l31dLpsqaBl2D+0qSuvN4WMXd6L4u75bVetDX4UyjBVQnltBQRDeknB5WRbMKbfzEnKhpGf1zJ8=",
+      "debug_symbols": "7VXbisIwEP2XPPchM5lJE39lEalapVBaqXVhEf99EzHJukah7AUEX0ImOTNncmaSHMW6Xh62i6bb9HsxezuKtl9VY9N3zjoKoPPafld13tyP1TCKGWiNhai7tZ+WeCrEpmlrMdNuegNG1OUFjGhsBBuTA1syF7CSCI/BoElxzIMoxUYNueCAOmQCxAldZqMrrUJwAnmFnhcC+KXMHWX0S5k7ypQ/VoakDWACNBHs/DyB+WsCmyVQpY3H1vSYAJBQBjQSqwTnDFzFTiBIkUFJnw7K30gn1QxZ6sfpgGUVg1tm/VWgXCMba2Mn2xs9EZ79APjfB0AJJl5JqSxcZeSM5dC0bbNdXH1k0g+U/c0YAjszfu8w4ukuerpLOd3FTHRxFnhkvmIcb33J6U30D8D85Mz3amiqZVt7Lf3uoVsFaZ05fuzCThB/N/Sren0Yal+GVAHluBUUBP4t8ZeXZcEcczsvIRdKOlbH/Ak=",
       "brillig_names": [
         "store_in_execution_cache_oracle_wrapper",
         "enqueue_public_function_call_internal"
@@ -1633,117 +1633,65 @@
       "verification_key": "AAAAAAAQAAAAAAAAAAAAFAAAAAAAAAAQAAAAAAADKLEBAAAAAAAAAAEAAAACAAAAAwAAAAQAAAAFAAAABgAAAAcAAAAIAAAACQAAAAoAAAALAAAADAAAAA0AAAAOAAAADwAAAAAAAAAAABzK2NvY9tuTVnnt4Jo9EJ3XlNU9FzhpFlgm9/PkRXUdFqA5oJZ0gYycCfDZhPcPBQWUbHSpMlGIzzxqUOGyxPYb4xy/bffIXhU35FXxWJ+rEf2nko/YCtcYXbi1AVF2PwU9zOPcMIfd5VS2jjE8/TwSFvfN14Qbi3haVrMogSiYA/OsRVQNI2491hd4w+dfGdae28CyvNLoYg3saTfKrK4QpOIBkAeX02dBPBHPGHVThW+n+JN5YiR1WhfmKdZeAyc1DC4nZ4P0Yngu2OefuyKN2X2YbTmJoy+tY8kylMWSDj6sId390rdZrwaFPZVxmsJN4l2+J/WDAtbyBtKTVHEXQOy6PJYUVS9nl18WZlYFn3657yQE+zDARTTYo/3iug7rx6bI+JhCXYdcM6+D+TU/GPlKg6dCfa6X7LhoX36QMCAWfReiqFCGf1sLqEwg7kso34PfwYFIdzSCfP/n+qcp01y4RfGv1neVJCkRhLeaQM1/cSIoV7OnToE3F/b7qgRWu3AbWwtGO7zwxP5xkFUjk9CVM+GyAEvYTp+KU6iPA4D05rswR3a/1Psi4gmHdBVkgemj+PCR0w2xADptqrQpjDMR/JFw+S3pQLBCqrmQ1TxqOyYznNprc9+SCDFBWQewX0CKYShHJZAWuSBK5L83U36xlrBcHZj6UQFqm6y7AgJ5uDGE6e12fv/eVTd2mYfJFM3LNPFCqslkYgTweY8TtZLO3uDL1JuKPblswCShKdCMVXTnmQekNmPfBUN5vBBk5OGP7+7IRgR9oiDFlsToE/wiWhSSkZiibzyPihfyCqOfk8FfVNng68Wd+Qvj1y70uFEIsepMZfO+d1Y0nZ0Aph3qx2s3DKT0L3OmZct1qevcWM1L34r35/z/o21bcS5ZeJ8Nnbs/Fa3lOEt4SQ2x2DN5xzvkESPev8iMn8jWK3KtwTdDjKDTNxRFpXqWkOZE9YS6+kVBJM8BrVvgsTkBGeJB7rvr/1x9fyDcbFrRtq943CBtf3eFPwX95+vTciUhm7OfBEBOm+srJhuxDjZuFhm8rZe+rFI541Pfe+1gEXN/ckhVl8pv3Atq51/WX/UgKopjOn0qehIhmzsjGUMWkEghMrFu/3cPzCy3Whw2swnQ9a2zu42o0xCiFGf/jAlrC4dY5jW7nqr303NqdOfb5LuvB7oFYnThkMZ51i2RDDJdVTODLe7qsjxGyIbOzKWUiIaHbn1mvmGnOK6qVs4jntYhv5QnmFzDd2C/NKQWCabPQzRTf8pbgYUYF9orCQnJ7zKkiRJaqrr8JpOmzknEvWOYNb8Zdxh+BCI1+qSsBlDAmz/YUzED9FaUQ6gMbE7ckPW1Sj/r72uKyRZj0UAeE7OGGvzdUCQknWR48i2yLUnE9n5JB14GySbcUS9g3gZaoi1ZYCcBdTQ8ralufXJ2CDivXFV0Pm1WaJtT9Xn3FeY9ArQLcxkJo+5hg+H4i3F4kgMvQhCDea1oM/Unt2EMrN2fWygEGsvoaTQSFzd/g3DRMSLC2MvW+OdnG0mpGiLZhdEVlD5gdwDvmV43H40O7xfbqQ+IS1OWHRzGlN6YGta9Q4yBpYud3eww9tp0xYNyTCQGg6tSa+TgYJaMfHMXXVUnat18mhkrZ20u/D5VwoRBcCndy93sAmdPwsrzXx+0C0hTD2Jvt2QB4ReA5koyJgHAsd1Hck2yDfGEgK1CL88qW/crhep+2KwFKzMCjlq47WeYd0R9PB2VSHf1oRUwPpzAD88ePxZlHbv1K62UFPw9D4HGWqZOZFkanuAh+QtdvjkV8r/89ttfczy74inWHGncSYENFRFcn9QCQ1OLDfr7K75Qx8EQSpS8w4f4fnTVpmM0yrpg5OYfVnkulIMK3InEjXW1cWNvW760qAb29FliAjAbauTrDrvq3SAzQAZvKBNXSPEZYxw/4H+p1wADTj4nRU75krS/hLl7qnRxLiV4NVHfUMAE7HzR9N2LO2SmbyrEl5tl5WVoxaMbFO0Y92zwzuzLR5jedBrom2ToJY+ER3wbYlZaVZunuziDLi0pn7aGeNAVC8xbFtyCUjU9Q/pw6ZI5wcHGficaDurFFdOsWhmau3STOk78mMWbKBTt580n2u0AwzwShgvEsEYtONbUuh5HY6dOzbEcofNGloDCcOVRUVNEWS9ZGI+nZRLbOeiSgmsyYQ7gglHgBfzpF8DV3KAZR3xS9gdTMrYSAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAiz1doGZ2WH0DPjaOIjG+BV4Y10TSaSfbnCmOq3SkSAiCkYC3Pqk2HCCxL1v2ukS9e02v7zL1S+MObPoc8RzFTIPy7+dPPQCuqPu2l8Knkm1werJWyZMMC3IVObyLXMw3yg+39qJyUgFl/CzRC6XUt751Y/Ckgg2GUJh97Fj/vuvHViqYcZK1SIEPXnEgCIZ5Vuhl1Gt/mw2Mk0/tsLaCYktfBipPD2uWICfqu7GqGp49LO8YfGdbnBpNZu/R+f5Bw=="
     },
     {
-      "name": "sync_notes",
+      "name": "_check_block_number",
       "is_unconstrained": true,
-      "custom_attributes": [],
+      "custom_attributes": [
+        "public",
+        "internal",
+        "view"
+      ],
       "abi": {
         "error_types": {
-          "17843811134343075018": {
+          "10421965853029650238": {
             "error_kind": "string",
-            "string": "Stack too deep"
-          }
-        },
-        "parameters": [],
-        "return_type": null
-      },
-      "bytecode": "H4sIAAAAAAAA/7WTyw7CIBBFqcUo0sTEx39MU0y7dOHafyCtLHVRN+766dZkJkyI0QVwEzJMgMNcHoXwKjBKESGCHDEqjAs2Xs7tjDnEqVbBvin5HRijvvhLWH+jkFnk4QPxM50/rJBzmTyfe6F913PTrF8J/z5y+af7y+l//8OzRq9bzCvh/8P4uvfXx/M2ij/SbJGc0ptoOwAqvkT+EvmhJBvn8w+Yb4Svj6KMqNO1tnaNdfZkh8H0dhfwP+KH/QbzqHp4zgQAAA==",
-      "debug_symbols": "bY9dCoQwDITvkuc+NHUV9CqySNUohdJKrQuLePdNF5Huz0uYCV+GzA4j9dvcGTf5FZp2B+sHHY137PZDQB+MtWbu8jXINLB48+uiXbJr1CFCU5SFAHIjqwr5fjKWoKnUIX5QlCjVCbNW9YXjDf/zNV68QvnB3w+2Dx2M7i2dz0+bG7Iu8bnQV60l+IHGLVAqmHXj2WIplORYjn4B",
-      "brillig_names": [
-        "sync_notes"
-      ]
-    },
-    {
-      "name": "compute_note_hash_and_optionally_a_nullifier",
-      "is_unconstrained": true,
-      "custom_attributes": [],
-      "abi": {
-        "error_types": {
-          "16541607464495309456": {
+            "string": "Function _check_block_number can only be called statically"
+          },
+          "1433889167918961673": {
             "error_kind": "fmtstring",
             "item_types": [],
-            "length": 16
+            "length": 17
           },
           "17843811134343075018": {
             "error_kind": "string",
             "string": "Stack too deep"
+          },
+          "2242946026394210301": {
+            "error_kind": "string",
+            "string": "Block number mismatch."
+          },
+          "8209322232883590150": {
+            "error_kind": "string",
+            "string": "Function _check_block_number can only be called internally"
           }
         },
         "parameters": [
           {
-            "name": "contract_address",
-            "type": {
-              "fields": [
-                {
-                  "name": "inner",
-                  "type": {
-                    "kind": "field"
-                  }
-                }
-              ],
-              "kind": "struct",
-              "path": "aztec::protocol_types::address::aztec_address::AztecAddress"
-            },
-            "visibility": "private"
-          },
-          {
-            "name": "nonce",
-            "type": {
-              "kind": "field"
-            },
-            "visibility": "private"
-          },
-          {
-            "name": "storage_slot",
+            "name": "operation",
             "type": {
-              "kind": "field"
+              "kind": "integer",
+              "sign": "unsigned",
+              "width": 8
             },
             "visibility": "private"
           },
           {
-            "name": "note_type_id",
+            "name": "value",
             "type": {
               "kind": "field"
             },
             "visibility": "private"
-          },
-          {
-            "name": "compute_nullifier",
-            "type": {
-              "kind": "boolean"
-            },
-            "visibility": "private"
-          },
-          {
-            "name": "packed_note_content",
-            "type": {
-              "kind": "array",
-              "length": 0,
-              "type": {
-                "kind": "field"
-              }
-            },
-            "visibility": "private"
           }
         ],
-        "return_type": {
-          "abi_type": {
-            "kind": "array",
-            "length": 4,
-            "type": {
-              "kind": "field"
-            }
-          },
-          "visibility": "public"
-        }
+        "return_type": null
       },
-      "bytecode": "H4sIAAAAAAAA/9VZy67aQAwdSEJIuAEKn3Cl7tomXJ47Fn3c30AFPqHrrLppP7qMGCcH46siYVfFEpoknhyfOXZmJqHjztY//TrhOA5tz10b9dmGtrzPKkWs0pJn50F4dh+EZ/QgPGNFnh2Bp2/peUvc+ZlL3fl5bC7iTT7BEdzk/gYAwX6HNgttF/yKCakyYZBa+Otyvs/cpSnzf8kCZmqDvyD8vg1+Sbw/1y0+joXiRqF9rVstX+Eeb0U4xuIlXPJ1wfeF+SLwfWU+rOFvzId1T5xIN1qYlOtqY50XGlsKY+u80TrXaofXSOvcmdZoRTnPGB/On/gU1Kdu+fSYLwZfxnwJ+Eh/3z5DP577FPp9hONP0IfXZ+Su65n8lH/U3aK+YgP8k82lHPD8xPVlbPRhDmLQ85npY7FuoD4W+nt9pm/wp2Nvae0ai5ieqBFp1sf+zJeBL64v4+ThPIY4iEU8Etb/QzgfhbYH99D9YyF+j8W/4C1cQ404ViRco/7++Xwfjgfh52voJ93jructvc31ci7N4Xr4qwY/s+F/JPzcBn9J+AMb/GZv82SCPysJv7Dh38xBQ5v6afaWIxv+B8Ifm+DPD7QOv3OtNXNEOJ7Adb35u6pu2SNh/JxxtdojTRgfrg+uwd43FbiOBR/P4VSIMxXiSFiZItaTItboPx1jXxFroIg1VMTSzGOqiKWpV66IVShiada9pl6UR2mf5m0b2vJOk/ZpiviVtE/TfJcnram+YkFDHF/C+v9gOg9MeFYzWnPoWacYGLswin3rek3xC4EP8c4F3z0fZw+L9XGzXmxOW7JqOds0+SwYV34N34twPsb+0tov7fsUtS6ld/8h6OotBl/BfAn4iKP07j804n+L/hh/LPj4+n9rLifuej0csHHjN6+typjb74HSt3rj+Wtx67NJ8XN3PV//q++NqA/fS+cC17Hg4/uTXIiTC3EeEYt/s0cNfV2TTnHd+rVyuVq3f3TRXJS4y/8BHIufsP6/wjmOjdp75vzjalcdX3bH3WK338+/7yYM31sXdPoDg5oBSR0fAAA=",
-      "debug_symbols": "tdfBioMwFIXhd8k6C29iksZXGYYSNZZAiBJ1YBDffWLptKVdlrMpjVw/N/7g3Vjv2/VyDmkYZ9Z8bSyOnVvCmMpp2zlrc4gxXM7Pl1l1/Fh1nZ8nl47jvLi8sEYqyZlPffmnqdw/hOhZo8XO30aNuE0acx9UYv/mzGocbXD0CUdbGE1VBbQJaAugLYF2DbQV0NZA2wDtE9AGdknALgnYJQG7JGCXBOySgF0SsEsCdkmfdmn/J8tr8YZbIC4qJE5IXCBxicRrJK6QuEbiBokjCxXIQiWyUAkrdC+nH5eDa6O/7V/DmrqndWz5nfzLZjblsfP9mv2xoz3WsyNGqXitrt8p5UCy5iRteUh50B8=",
+      "bytecode": "JgACBAEnAAABBIBLJgAABAMmAgMEAiYCBAQAHxgABAADgEkdAIBJgEkCLQiASQABLQiASgACJAAAAFIkAAAAfScCAAEEgEsmAgIEADoNAAEAAicAgEMCAAQnAIBEAgAGJwCARQIAAScAgEYCAAInAIBHAgAFJwCASAIAAyUkAAADQR4CAAQBHgIABQAKOAQFBiMCAAYAAACeJAAAA2oeAgAECSYCBQABCjgEBQYjAgAGAAAAuiQAAAN8HgIABAUKOAQCBQw4BAIGCygAAYBFAAImAgQBASMCAAIAAAMqIgAAAOMLKAABgEYABxYMBQgjAgAHAAADGCIAAAD8CygAAYBIAAkjAgAJAAADBiIAAAERCygAAYBDAAojAgAKAAAC7yIAAAEmCygAAYBHAAoWDAYLIwIACgAAAtgiAAABPwsoAAGARAAIIwIACAAAAsYiAAABVCYCAQJ2JgIIAm8mAgoCaSYCCwJlJgIMAiAmAg0CbCYCDgJuJgIPAnQmAhACcCYCEQJkJgISAmEmAhMCSSYCFAJyLAgBFSYCFgQSABABFgEmAxUEAQAoFQIWLAwWFywOExcAKBcCFywODhcAKBcCFywOARcAKBcCFywOEhcAKBcCFywODRcAKBcCFywOChcAKBcCFywOERcAKBcCFywODBcAKBcCFywOCBcAKBcCFywOEBcAKBcCFywOCxcAKBcCFywOFBcAKBcCFywOEhcAKBcCFywODxcAKBcCFywOChcAKBcCFywOCBcAKBcCFywODhcmAgEEACYCCAEACjgIBAojAgAKAAACvSYCCwQTLAgBDCYCDQQTABABDQEsDAwNKQMADQUT5jKZ5RcUCQAoDQINACgVAg4mAg8EES0EAA6AAy0EAA2ABC0EAA+ABSQAAAOOJgIOBBEAOA0ODSwOAQ0AKA0CDTsNDAssDAgGIgAAAs8sDAsGIgAAAs8sDAYFIgAAAuYEOAsIASwMAQUiAAAC5iwMBQkiAAAC/RI4BgUBLAwBCSIAAAL9LAwJByIAAAMPLAwGByIAAAMPLAwHAiIAAAMhLAwIAiIAAAMhLAwCAyIAAAMzLAwFAyIAAAMzIwIAAwAAA0AkAAAD1CUnAIAEBHgADQAAAIAEgAMjAIADAAADaSkBAAEF96Hzr6Wt1Mo7AQECJSkBAAEFce1fE3G+NAY7AQECJSkBAAEFkKJCubMVTz47AQECJQEAgAOABYAHLQCAA4AILQCABIAJCwCACIAHgAojAIAKAAAD0y0BgAiABi0CgAaACQEAgAgAAoAIAQCACQACgAkiAAADoiUpAQABBR8gi4cBmc/9OwEBAiUtABjKGMo=",
+      "debug_symbols": "zVrbTuMwEP2XPPfBY3su5ldWCBUIqFLVol5WWlX8+yZQp6Vpi9rkSH5BCRrnXPCZGMe76rV+3r4/zRZvy3X18GdXzZcv081suWjudp+T6nk1m89n70/Hv65c+4OC+xqw/pgu2vv1ZrraVA8k4idVvXhtL9U3j3ibzevqQZrLXnEUT/vi5jJ1xRrOFFvQ/GQLpsfFj5OGDg+nE6NmOpHlNzqOOzqeTunEW935GsR3DOJwzyAb7JYkl92S5MN1t5Lrnpyc8albco8GsTsG6T1IRvcMkvODQugGcbhuMZtmi9kS/TIhJViekMLp1OJ0QYPng4Z4nU5IGSA660pJ0zeADAaIXjJA8D8AzsyoYDHPqOgO7YDOFQfpwhqEDq6TnStupORiT3q9mMhpJ5BcsmMijS3eDfc9xs73o9K9797rYAAml6dZ0B7Apc56A4C6/LfS4HoA7Icr0Awgrg9wKfQ3ABxiK9IHSBFrUXDDLVLNs9pc6AFQAgNceiGOB8BgAEYrYLQCQSsQtAJFK1C0AkMrMLSChFaQwAqic2gAuAJwu44U0QBoBR6twKMVhIAGUDBA9GgAAQMwoQHQrQL90o+CDpqgg6booKmBAQwdNEO3ioQOWgK3CkavKhi9qmD0qoLRqwomcNDYBzQAOGgcPBoAHbRIaAB00NBbCczooDG6VQg6aIJuFYoOmqJbhQ0PmsW8b2r6c1vzDJn8OUUPm9Dsv5lIKUxSMZ6kUjwRF4thkkphQqEYJlYKE1+MJyOsskZiMsJ3kbGYcClMuBhPuBhPpJT3jkgx2dFi+okW02OtGE+sGE+SL4ZJKdlRP8K/P7F7fP9MhI6wcy4d/2YynQLYzV+Q2kE3v/gfP5u7v9PVbPo8r/enIt+2i5ejQ5Kbfx/1yXnJj9XypX7drur25OTh0GSbTVKakFFDhtrXHHGakMT2tjWMxCakrkFtkP8D",
       "brillig_names": [
-        "compute_note_hash_and_optionally_a_nullifier"
+        "_check_block_number"
       ]
     },
     {
-      "name": "_check_block_number",
+      "name": "_check_timestamp",
       "is_unconstrained": true,
       "custom_attributes": [
         "public",
@@ -1752,9 +1700,13 @@
       ],
       "abi": {
         "error_types": {
-          "10421965853029650238": {
+          "11405868724477732285": {
             "error_kind": "string",
-            "string": "Function _check_block_number can only be called statically"
+            "string": "Function _check_timestamp can only be called internally"
+          },
+          "13418685691864489983": {
+            "error_kind": "string",
+            "string": "Function _check_timestamp can only be called statically"
           },
           "1433889167918961673": {
             "error_kind": "fmtstring",
@@ -1765,13 +1717,9 @@
             "error_kind": "string",
             "string": "Stack too deep"
           },
-          "2242946026394210301": {
-            "error_kind": "string",
-            "string": "Block number mismatch."
-          },
-          "8209322232883590150": {
+          "8443716675528357851": {
             "error_kind": "string",
-            "string": "Function _check_block_number can only be called internally"
+            "string": "Timestamp mismatch."
           }
         },
         "parameters": [
@@ -1787,17 +1735,19 @@
           {
             "name": "value",
             "type": {
-              "kind": "field"
+              "kind": "integer",
+              "sign": "unsigned",
+              "width": 64
             },
             "visibility": "private"
           }
         ],
         "return_type": null
       },
-      "bytecode": "JgACBAEnAAABBIBLJgAABAMmAgMEAiYCBAQAHxgABAADgEkdAIBJgEkCLQiASQABLQiASgACJAAAAFIkAAAAfScCAAEEgEsmAgIEADoNAAEAAicAgEMCAAQnAIBEAgAGJwCARQIAAScAgEYCAAInAIBHAgAFJwCASAIAAyUkAAADQR4CAAQBHgIABQAKOAQFBiMCAAYAAACeJAAAA2oeAgAECSYCBQABCjgEBQYjAgAGAAAAuiQAAAN8HgIABAUKOAQCBQw4BAIGCygAAYBFAAImAgQBASMCAAIAAAMqIgAAAOMLKAABgEYABxYMBQgjAgAHAAADGCIAAAD8CygAAYBIAAkjAgAJAAADBiIAAAERCygAAYBDAAojAgAKAAAC7yIAAAEmCygAAYBHAAoWDAYLIwIACgAAAtgiAAABPwsoAAGARAAIIwIACAAAAsYiAAABVCYCAQJ2JgIIAm8mAgoCaSYCCwJlJgIMAiAmAg0CbCYCDgJuJgIPAnQmAhACcCYCEQJkJgISAmEmAhMCSSYCFAJyLAgBFSYCFgQSABABFgEmAxUEAQAoFQIWLAwWFywOExcAKBcCFywODhcAKBcCFywOARcAKBcCFywOEhcAKBcCFywODRcAKBcCFywOChcAKBcCFywOERcAKBcCFywODBcAKBcCFywOCBcAKBcCFywOEBcAKBcCFywOCxcAKBcCFywOFBcAKBcCFywOEhcAKBcCFywODxcAKBcCFywOChcAKBcCFywOCBcAKBcCFywODhcmAgEEACYCCAEACjgIBAojAgAKAAACvSYCCwQTLAgBDCYCDQQTABABDQEsDAwNKQMADQUT5jKZ5RcUCQAoDQINACgVAg4mAg8EES0EAA6AAy0EAA2ABC0EAA+ABSQAAAOOJgIOBBEAOA0ODSwOAQ0AKA0CDTsNDAssDAgGIgAAAs8sDAsGIgAAAs8sDAYFIgAAAuYEOAsIASwMAQUiAAAC5iwMBQkiAAAC/RI4BgUBLAwBCSIAAAL9LAwJByIAAAMPLAwGByIAAAMPLAwHAiIAAAMhLAwIAiIAAAMhLAwCAyIAAAMzLAwFAyIAAAMzIwIAAwAAA0AkAAAD1CUnAIAEBHgADQAAAIAEgAMjAIADAAADaSkBAAEF96Hzr6Wt1Mo7AQECJSkBAAEFce1fE3G+NAY7AQECJSkBAAEFkKJCubMVTz47AQECJQEAgAOABYAHLQCAA4AILQCABIAJCwCACIAHgAojAIAKAAAD0y0BgAiABi0CgAaACQEAgAgAAoAIAQCACQACgAkiAAADoiUpAQABBR8gi4cBmc/9OwEBAiUtABjKGMo=",
-      "debug_symbols": "zVpbTuMwFN1Lvvvha/s+zFZGCBUIqFLVoj5GGlXsfRKo09K0RW1yJP+gBNk+D3yujeNd9Vo/b9+fZou35bp6+LOr5suX6Wa2XDRvu89J9byazeez96fjX1eu/UHBfXVYf0wX7ft6M11tqgcS8ZOqXry2j+qbId5m87p6kOax1ziKp33j5jF1jTWcaWxB88gWTI8bP04aOjycToya6USW3+g47uh4OqUTb3XnqxPf0YnDPZ1ssFuSXHZLkg/X3UquGzk541O35B4NYnd00nuQjO7pJOc7hdB14nDdYjbNFrMl+mVCSrA8IYXTqcXpggbPBw3xOp2QMkB01jUltW8AGQwQvWSA4H8AnJlRwWKeUdEdygGlc8ylC2sQOrhO50YOjZTc2JNeb0zktBNILtkxkcYW74b7HmPn+1HTve/e62AAJpenWdAewKXKegOAuvy30uB6AOyHK9AMIK4PcCn0NwAcYivSB0gRa1Fwwy1SzbPaXOgBUAIDXFoQxwNgMACjFTBagaAVCFqBohUoWoGhFRhaQUIrSGAF0Tk0AFwBuFxHimgAtAKPVuDRCkJAAygYIHo0gIABmNAA6FKBXvSjoIMm6KApOmhqYABDB83QpSKhg5bApYLRuwpG7yoYvatg9K6CCRw09gENAA4aB48GQActEhoAHTT0UQIzOmiMLhWCDpqgS4Wig6boUmHDg2Yxn5ua/jzWPEMmf07RwyE0+28mUgqTVIwnqRRPxMVimKRSmFAohomVwsQX48kIu6yRmIzwXWQsJlwKEy7GEy7GEyll3REpJjtaTD3RYmqsFeOJFeNJ8sUwKSU76kf49yd2w/fvROgIJ+fS8W8m0ymA3fwFqe1088L/+Nm8/Z2uZtPneb2/Ffm2XbwcXZLc/PuoT+5LfqyWL/XrdlW3NycPlybbbJLShIwaMtQuc8RpQhLb19YwEpuQuga1Qf4P",
+      "bytecode": "JgACBAEnAAABBIBLJgAABAMmAgMEAiYCBAQAHxgABAADgEkdAIBJgEkCHQCASoBKBS0IgEkAAS0IgEoAAiQAAABZJAAAAIQnAgABBIBLJgICBAA6DQABAAInAIBDAgAEJwCARAIABicAgEUCAAEnAIBGAgACJwCARwIABScAgEgCAAMlJAAAA1IeAgAEAR4CAAUACjgEBQYjAgAGAAAApSQAAAN7HgIABAkmAgUAAQo4BAUGIwIABgAAAMEkAAADjR4CAAQGHAwEBQAcDAIEAAo4BQQCDDgFBAYLKAABgEUABCYCBQEBIwIABAAAAzsiAAAA9AsoAAGARgAHFgwCCCMCAAcAAAMpIgAAAQ0LKAABgEgACSMCAAkAAAMXIgAAASILKAABgEMACiMCAAoAAAMAIgAAATcLKAABgEcAChYMBgsjAgAKAAAC6SIAAAFQCygAAYBEAAgjAgAIAAAC1yIAAAFlJgIBAkkmAggCZCYCCgJhJgILAnImAgwCbyYCDQJpJgIOAnYmAg8CZSYCEAIgJgIRAmwmAhICbiYCEwJ0JgIUAnAsCAEVJgIWBBIAEAEWASYDFQQBACgVAhYsDBYXLA4BFwAoFwIXLA4SFwAoFwIXLA4OFwAoFwIXLA4KFwAoFwIXLA4RFwAoFwIXLA4NFwAoFwIXLA4IFwAoFwIXLA4QFwAoFwIXLA4MFwAoFwIXLA4UFwAoFwIXLA4PFwAoFwIXLA4LFwAoFwIXLA4KFwAoFwIXLA4TFwAoFwIXLA4NFwAoFwIXLA4MFwAoFwIXLA4SFyYCAQEAJgIIBAAKOAEFCiMCAAoAAALOJgILBBMsCAEMJgINBBMAEAENASwMDA0pAwANBRPmMpnlFxQJACgNAg0AKBUCDiYCDwQRLQQADoADLQQADYAELQQAD4AFJAAAA58mAg4EEQA4DQ4NLA4IDQAoDQINOw0MCywMAQYiAAAC4CwMCwYiAAAC4CwMBgIiAAAC9wQ4CwgBLAwBAiIAAAL3LAwCCSIAAAMOEjgGAgEsDAEJIgAAAw4sDAkHIgAAAyAsDAYHIgAAAyAsDAcEIgAAAzIsDAgEIgAAAzIsDAQDIgAAA0QsDAIDIgAAA0QjAgADAAADUSQAAAPlJScAgAQEeAANAAAAgASAAyMAgAMAAAN6KQEAAQX3ofOvpa3UyjsBAQIlKQEAAQWeScksjTulvTsBAQIlKQEAAQW6OL+KoDMf/zsBAQIlAQCAA4AFgActAIADgAgtAIAEgAkLAIAIgAeACiMAgAoAAAPkLQGACIAGLQKABoAJAQCACAACgAgBAIAJAAKACSIAAAOzJSkBAAEFdS4blGTo99s7AQECJS0AGMoYyg==",
+      "debug_symbols": "zVrRTuswDP2XPu/BTuzY4VeuEBpQ0KRpQ2Nc6Qrx77dFawdrGdraI+UFtczu8TnLcbMk79Vjff/2fLfaPG1fq5s/79V6+7Dcr7ab5u79Y1Hd71br9er57uu/K2r/cLTPhNeX5aa9f90vd/vqhlMKi6rePLaXFppHPK3WdXWTmstBsKTAh+DmMvfBFkeCPVr3ZI9uX4NvFxVLmF6OiHXliKbfyiHtywk8KOdSddokDVckJbomSSerlTJ1aqUc4nm1MvVPzuR6qpZdw8H0iiS/Bsn9iqQcx5KyxU6HTL8ITJI6gUntl+FoJN1wtBBOBc5+vhgm4hMCgUYJMAXrk2SYNC4VqfdJ2c/zjrmLFTqGsuVPAI6TASR0ukoM3wBGBm70TtcsdPwSeCw4pr4nxMRHS7CPBXPuymj6h50PZibrHs3fGPJBlum6i/S6mwx0F5kMoEyHWI02APih+V0CcPSARRoApDydgUnvyCFApskAKXaOTGkAEJmxEjVDcjqAdaPaKQ4AYgIDqIEBUkADoBkYmoGhGTiagaMZZDSDDGYgFNAAaAaMZsBoBgHNIIDbtURGA6AZCJqBoBkooQEEDQCetkiKaAAHA6Bf+oJ+6YujjeZoo2W00bKiAcBGUxI0ANhoyhENADaaomcVip5VKHpWoRFsNBVCA6CNJuhWoWijKbpVoJcSFL2UoIY2mqFbhaON5uhW4WijZXSryNON5tKtmzYbIR/nl/T7bUQ7LkLr5+5FolhMJcVowsVoEriYSlIplUQqphItpRIpRpMZZlkzVTLDvshMlcww65mrkmI0sWI0sWLeO16Md3Ix/SSX0mONStHEqBxNcimVcCneMZnh54/0jx+eibAZVs5TX3/ywYEjv3gHqU26+MV/+9Hc/V3uVsv7dX04fPn0tnn4chZz/++lPjmW+bLbPtSPb7u6PaB5PJvZztjZZMEuTTHcWpVTWHCy9radRbNr86k1qA3yfw==",
       "brillig_names": [
-        "_check_block_number"
+        "_check_timestamp"
       ]
     },
     {
@@ -3424,73 +3374,13 @@
         }
       },
       "bytecode": "H4sIAAAAAAAA/+XdBXRT99/H8dSA4lYYE2yCQ7RNcHd3h0qKDoZtzDt3d2fK3F2Zb8zdN7bBFHfn+XxHMm5D2DnPvzf7P+/z3HPep22S3rx+N9I0uZLm2TvVzfB4dqfv/T5NZcS+2kkNE06Lf3V+n5XkcpWSnFYlyWnVkpxWI8lpdVTnhNMaJLlcwySnNUpyWuMkpzVJclpTVSHhtGYxi3NKi32Nnx7w5gaD0Tx/1Bfw5Xv9kYJwyBsMFeSGfWFfKBwq8ocDgWg4GM6LFETyvBFfMBD1FYcigWLv3qlaxr55ecs0+QtT6az+nzsDiSeYrabKdFhtOex23Ba7HbdB/PvqscvEf6+Gfq6paqnaGftOj0/pCcvAW7bJ18TF5ZmT4Z7LeZ+1+TZ0LKN0z4Enl67fn5bketJcXvZN3ZuXN1XGZikwlprcvkM774RlvUPXSdEduo7jDh3/I+RJ8Z0tzZPaG7Ks8w6F84v9+VFvKpdBjYzULAO3nTkZ/7dvq7gzzTFPeyFWakp8YJf1wegmvLknNQvY7TG7+KD1tYCMOd3FMbeEjDnDxTG3+pfG7C3b5Gvt4vKjPLG38TCcXojTB3H6Ic4AxBmEOEMQZy7EmQdxhiHOCMTZFuJsB3G2hzg7QJwdIc5OEGdniLMLxNkV4uwGcXaHOHtAnD0hzl4QZ2+Isw/E2Rfi7Adx9oc4B0CcAyHOQRDnYIhzCMQ5FOIcBnEOhzhHQJwjIc5REOdoiHMMxDkW4hwHcY6HOCdAnBMhzkkQ52SIMx/iLIA4CyHOIogzCnEWQ5xTIM6pEOc0iHM6xDkD4pwJcR4Ncc6COGdDnMdAnHMgzrkQ5zyIcz7EuQDiPBbiPA7iXAhxHg9xngBxnghxngRxngxxngJxngpxlkCcp0Gcp0OcZ0CcZ0KcZ0GcZ0Oc50Cc50Kc50Gc50OcF0CcF0KcF0GcF0Ocl0Ccl0Kcl0Gcl0OcV0CcV0KcV0GcV0Oc10Cc10Kc10Gc10OcN0CcN0KcN0GcN0Oct0CciyDOWyHO2yDO2yHOOyDOOyHOuyDOxRDn3RDnPRDnvRDnfRDn/RDnAxDngxDnQxDnwxDnIxDnoxDnYxDn4xDnExDnkxDnUxDn0xDnMxDnsxDncxDn8xDnCxDnixDnSxDnEojzZYjzFYjzVYjzNYjzdYjzDYjzTYjzLYjzbYhzKcT5DsT5LsT5HsT5PsT5AcT5IcT5EcT5McT5CcT5KcT5GcT5OcT5BcT5JcT5FcT5NcT5DcT5LcT5HcT5PcT5A8S5DOL8EeL8CeL8GeJcDnGugDh/gTh/hTh/gzh/hzj/gDj/hDhXQpyrIM7VEOcaiHMtxLkO4lwPcW6AODdCnJsgzs0Q5xaIcyvEuQ3i3A5x7oA4d0KcuyDO3RDnHojTZkhwpkGc6RBnBsSZCXFmQZzlIM7yEGcFiDMb4qwIcVaCOCtDnFUgzqoQZzWIszrEWQPirAlx1oI4a0OcORBnHYizLsR5EMRZD+I8GOI8BOI8FOI8DOKsD3E2gDgbQpyNIM7GEOfhEOcREOeREOdREGcTiLMpxNkM4mwOcbaAOFtCnK0gztYQZxuI0wtx+iBOP8QZgDiDEGcI4syFOPMgzjDEGYE420Kc7VLkTE9wBry5wWA0zx/1BXz5Xn+kIBzyBkMFuWFf2BcKh4r84UAgGg6G8yIFkTxvxBcMRH3FoUigODbvNBfH3P7/4Zg7QO6PHdPKvvx8+QUF0WBxMJXOTmnu3c7/dB/ylm3ydXbRWTfj33nceMs2+bq4OOacDMbjpivk8d0N4uwOcfaAOHtCnL0gzt4QZx+Isy/E2Q/i7A9xDoA4B0KcgyDOwRDnEIhzKMQ5DOIcDnGOgDhHQpyjIM7REOcYiHMsxDkO4hwPcU6AOCdCnJMgzskQZz7EWQBxFkKcRRBnFOIshjinQJxTIc5pEOd0iHMGxDkT4jwa4pwFcc6GOI+BOOdAnHMhznkQ53yIcwHEeSzEeRzEuRDiPB7iPAHiPBHiPAniPBniPAXiPBXiLIE4T4M4T4c4z4A4z4Q4z4I4z4Y4z4E4z4U4z4M4z4c4L4A4L4Q4L4I4L4Y4L4E4L4U4L4M4L4c4r4A4r4Q4r4I4r4Y4r4E4r4U4r4M4r4c4b4A4b4Q4b4I4b4Y4b4E4F0Gct0Kct0Gct0Ocd0Ccd0Kcd0GciyHOuyHOeyDOeyHO+yDO+yHOByDOByHOhyDOhyHORyDORyHOxyDOxyHOJyDOJyHOpyDOpyHOZyDOZyHO5yDO5yHOFyDOFyHOlyDOJRDnyxDnKxDnqxDnaxDn6xDnGxDnmxDnWxDn2xDnUojzHYjzXYjzPYjzfYjzA4jzQ4jzI4jzY4jzE4jzU4jzM4jzc4jzC4jzS4jzK4jza4jzG4jzW4jzO4jze4jzB4hzGcT5I8T5E8T5M8S5HOJcAXH+AnH+CnH+BnH+DnH+AXH+CXGuhDhXQZyrIc41EOdaiHMdxLke4twAcW6EODdBnJshzi0Q51aIcxvEuR3i3AFx7oQ4d0GcuyHOPRCnJ53hTIM40yHODIgzE+LMgjjLQZzlIc4KEGc2xFkR4qwEcVaGOKtAnFUhzmoQZ3WIswbEWRPirAVx1oY4cyDOOhBnXYjzIIizHsR5MMR5CMR5KMR5GMRZH+JsAHE2hDgbQZyNIc7DIc4jIM4jIc6jIM4mEGdTiLMZxNkc4mwBcbaEOFtBnK0hzjYQpxfi9EGcfogzAHEGIc4QxJkLceZBnGGIMwJxtoU420Gc7SHODhBnR4izE8TZGeLsAnF2hTi7QZzdIc4eEGdPiLMXxNkb4uwDcfaFOPtBnP0hzgEQ50CIcxDEORjiHAJxDoU4h0GcwyHOERDnSIhzFMQ5GuIcA3GOhTjHQZzjIc4JEOdEiHMSxDkZ4syHOAsgzkKIswjijEKcxRDnFIhzKsQ5DeKcDnHOgDhnQpxHQ5yzIM7ZEOcxEOcciHMuxDkP4pwPcS6AOI+FOI+DOBdCnMdDnCdAnCdCnCdBnCdDnKdAnKdCnCUQ52kQ5+kQ5xkQ55kQ51kQ59kQ5zkQ57kQ53kQ5/kQ5wUQ54UQ50UQ58UQ5yUQ56UQ52UQ5+UQ5xUQ55UQ51UQ59UQ5zUQ57UQ53UQ5/UQ5w0Q540Q500Q580Q5y0Q5yKI81aI8zaI83aI8w6I806I8y6IczHEeTfEeQ/EeS/EeR/EeT/E+QDE+SDE+RDE+TDE+QjE+SjE+RjE+TjE+QTE+STE+RTE+TTE+QzE+SzE+RzE+TzE+QLE+SLE+RLEuQTifBnifAXifBXifA3ifB3ifAPifBPifAvifBviXApxvgNxvgtxvgdxvg9xfgBxfghxfgRxfgxxfgJxfgpxfgZxfg5xfgFxfglxfgVxfg1xfgNxfgtxfgdxfg9x/gBxLoM4f4Q4f4I4f4Y4l0OcKyDOXyDOXyHO3yDO31PkTE9wBry5wWA0zx/1BXz5Xn+kIBzyBkMFuWFf2BcKh4r84UAgGg6G8yIFkTxvxBcMRH3FoUigODbvJi6O+Y9/aczesk2+P9PdW351Mhi3c6aLy28l5L6d5eKYV0HGXM7FMa+GjLm8i2NeAxlzBRfHvBYy5mwXx7wOMuaKLo55PWTMlVwc8wbImCu7OOaNkDFXcXHMmyBjrurimDdDxlzNxTFvgYy5uotj3goZcw0Xx7wNMuaaLo55O2TMtVwc8w7ImGu7OOadkDHnuDjmXZAx13FxzLshY67r4pj3QMZ8kItj9kDeA6zn4pjTIGM+2MUxp0PGfIiLY86AjPlQF8ecCRnzYS6OOQsy5voujrkcZMwNXBxzeciYG7o45gqQMTdycczZkDE3dnHMFSFjPtzFMVeCjPkIF8dcGTLmI10ccxXImI9yccxVXRyzZvXXOj4rYgNurlqolqqVaq3a2PUon/LbslBBFVK5Kk+FVUS1Ve1Ue9VBdVSdYmPvorqqbqq76qF6ql6qt+qj+qp+qr8aoAaqQWqwGqKGqmFquBqhRqpRarQao8aqcWq8mqAmqklqsspXBapQFamoKlZT1FQ1TU1XM9RMdbSapWarY9QcNVfNU/PVAnWsOk4tVMerE9SJ6iR1sjpFnapK1GnqdHWGOlOdpc5W56hz1XnqfHWBulBdpC5Wl6hL1WXqcnWFulJdpa5W16hr1XXqenWDulHdpG5Wt6hF6lZ1m7pd3aHuVHepxepudY+6V92n7lcPqAfVQ+ph9Yh6VD2mHldPqCfVU+pp9Yx6Vj2nnlcvqBfVS2qJelm9ol5Vr6nX1RvqTfWWelstVe+od9V76n31gfpQfaQ+Vp+oT9Vn6nP1hfpSfaW+Vt+ob9V36nv1g1qmflQ/qZ/VcrVC/aJ+Vb+p39Uf6k+1Uq1Sq9UatVatU+vVBrVRbVKb1Ra1VW1T29UOtVPtUrvVHmUPsjSVrjJUpspS5VR5VUFlq4qqkqqsqqiqqpqqrmqomqqWqq1yVB1VVx2k6qmD1SHqUHWYqq8aqIaqkWqsDldHqCPVUaqJaqqaqeaqhWqpWqnWqo3yKp/yq4AKqpDKVXkqrCKqrWqn2qsOqqPqpDqrLqqr6qa6qx6qp+qleqs+qq/qp/qrAWqgGqQGqyFqqBqmhqsRaqQapUarMWqsGqfGqwlqopqkJqt8VaAKVZGKqmI1RU1V09R0NUPNVEerWWq2OkbNUXPVPDVfLVDHquPUQnW8OkGdqE5SJ6tT1KmqRJ2mTldnqDPVWepsdY46V52nzlcXqAvVRepidYm6VF2mLldXqCvVVepqdY26Vl2nrlc3qBvVTepmdYtapG5Vt6nb1R3qTnWXWqzuVveoe9V96n71gHpQPaQeVo+oR9Vj6nH1hHpSPaWeVs+oZ9Vz6nn1gnpRvaSWqJfVK+pV9Zp6Xb2h3lRvqbfVUvWOele9p95XH6gP1UfqY/WJ+lR9pj5XX6gv1Vfqa/WN+lZ9p75XP6hl6kf1k/pZLVcr1C/qV/Wb+l39of5UK9UqtVqtUWvVOrVebVAb1Sa1WW1RW9U2tV3tUDvVLrVb7VH2giJNpasMlamyVDlVXlVQ2aqiqqQqqyqqqqqmqqsaqqaqpWqrHFVH1VUHqXrqYHWIOlQdpuqrBqqhaqQaq8PVEepIdZRqopqqZqq5aqFaqlaqtWqjvMqn/CqggiqkclWeCquIaqvaqfaqg+qoOqnOqovqqrqp7qqH6ql6qd6qj+qr+qn+aoAaqAapwWqIGqqGqeFqhBqpRqnRaowaq8ap8WqCmqgmqckqXxWoQlWkoqpYTVFT1TQ1Xc1Qdrx6Oxa8HWfdjmFuxwe3Y2/bca3tmNF2PGY71rEdR9iO0WvHv7Vjy9pxW+2YqHa8UTuWpx0n045BWaLs2Il2XEI75p8dT8+OVWfHgbNjrNnxy+zYYHbcLTumlR0vyo7FZMc5smMI2fF57Ng3dlwZO2aLHQ/FjjVix/GwY2TY8Sfs2A523AQ7JoHt79/2pW/7qbd9wC9Stu9y2y+47XPb9mdt+4q2/TDbPo5t/8G2b17b763tU9b212r7QrX9jNo+PG3/mLbvSduvo+0z0fZHaPv6s/3o2T7qbP9vtm8122+Z7RPM9rdl+7Ky/UTZPpiWKNt3kO2Xx/Z5Y/uTsX212H5QbB8jtv8O2zeG7XfC9ulg+0uwfRHYdv62Db1tn27bftt21bbNsm0PbNva2nasto2obX9p2zbadoO2TZ5t72bbktl2WrYN1DJl2+7YdjG2zYltz2GveW07BFvH39aft3XTbV1tWw/a1uW1dVttXU9b99HWBbR142xdMVt3ytYlsnVrbF0TW/fC1kWwz+bts2r77NY+y7TP9uyzLvvsxz4Lsc8G7L1ye+/Y3ku19xbtvTZ778nei7H3Jux/dfvf1f6Xs/9t7LV++t6XDx5bV9mm5p59U+ypxWb/1/m2bq+t62rrftq6kLZuoK0rZ+uO2bpUtm6RrWtj657Yuhi2boJ9Vm+fXdtnufbZpn3WZ5992WdB9tmIfVZg753be8n23qq912jvvTVUjVRjZf+72/+y9r+d/a9j6883Vc08+0/pju9rxb7mLO9Sb87SxT2cl6tzgPPivx+Ofc1OOD0ttjw6x372lm3yZTvm6/b8w95gXran9OSyP5DtmGcq55+Zmvn/tR6zTd1LSs/fk3C9GQmXS/Y7VWLfp3n2v0x8HKm4H+l2DqV4Ofnj8y+Xots5vtyyHMsuI8mY4tdfxVP6toqfn+yrx1P6NvUkXFdFT0rvw75/GpvTH79vVE+4fOIyONC8sv6X8/pv3qbOZe28Tf+6TMm+89ITzst0nJeVcF5Wyf5jtL9TDRyXS/YYjF+uueP7FgnLKJXPz6l6XrCpVhK/87psKl/i+XuKL48Mx2nx5RpfzhWcl084L9txXmZJ6eupGPs503E9znnFHVkJl4//na8W+1rO8Tvx36+e5PrLJVx/KXeS0xKXS3aSy2cnubzdfxvHvq8Uy+5Dfsf8DvQ4cL5eiX9fzbP/Yz7+uyl+zPrTPPs/LyU+vziv31735cS+nzd/9txon1k9FkYLF8yfNntWt/zCqVHnk3DiTDxJBh8/L81x+oH+KCf+Tobj8s6pkmffC7nMktKX7xw73VuGKS/s9cavM/6AyPKUXoiehOvPSrh8Xuznio7xOMfb+T90Fufl+4oD+cX5ofyiomBhfs2E+Xs8+5ajLaf4kyX8hW/+v/XCN0UPxL9f0JVPzfyTvvB1jiV+fvw+3KNk37LsUVLaFL9ML8dleh3gMr0dl+ntuIxN//QCOvGPt9OR7MVgz4TzMj372+LnOZ+Y4yZ7Aq/t2fd9jsNoU5+Sffa//2B4UvoiP5Lif7Z8tTwHfoEU/6NWL/ZzZcf30VlzFkQXRAcvKJg5rbDnglmFe5/9Z85MfPJ33sGcU1bC5RJ/L9kTvfPnzISfs5LM90C/n3jage6MTj/hD0r92M//7T8o/wMgWDyPjBsCAA==",
-      "debug_symbols": "7ZXdisIwEIXfJde9yExm8uOrLCJVqxRKK7UuLOK7byImXdcoFNkFwZvSab6ZOZxM0qNYV8vDdlG3m24vZh9H0XSrcqi71kdHAXz+tt+VbQj3Q9kPYgZaYyGqdh1eDZ4KsambSsy0f72BEbW5wIjWJdjaHOzIXmAlER7DoElx0kE01kYtc8UBdVQCxCNtTK660ioWJ5BX9LwQoN/O3HHGvJ2544x92hmSLsIEaBPs80ID98cNUOYamOSRlfZxeUBCGcUgsRpxzuAqzQEBJRSUPIuB58WM+4Us9WMx4Fi5iDtm/dOc3BBb59IUu1sv8bXlq/+VjxJsOopSObjS44NlXzdNvV1c/cBkeBDlpDLE7sz4e7aIp6fo6SlmeoqdmOIjCGR+3DiddsPjXRgO/vzkw8+yr8tlUwUvw+qhXUVrfTh87eJKNH/Xd6tqfeirsA3jDoRZUVAQhEsq3CEsC+ak7fwJuVDSd/WdvwE=",
+      "debug_symbols": "7ZXdisIwEIXfJde9yExm8uOrLCJVqxRKK7UuLOK7byImXdcoFNkFwZvSab6ZOZxM0qNYV8vDdlG3m24vZh9H0XSrcqi71kdHAXz+tt+VbQj3Q9kPYgZaYyGqdh1eDZ4KsambSsy0f72BEbW5wIjWJdjaHOzIXmAlER7DoElx0kE01kYNueKAOioB4pE22epKq1icQF7R80KAfjtzxxnzduaOM/ZpZ0i6CBOgTbDPCw3cHzdAmWtgkkdW2sflAQllFIPEasQ5g6s0BwSUUFDyLAaeFzPuF7LUj8WAY+Ui7pj1T3NyQ2ydS1Psbr3E15av/lc+SrDpKErl4EqPD5Z93TT1dnH1A5PhQZSTyhC7M+Pv2SKenqKnp5jpKXZiio8gkPlx43TaDY93YTj485MPP8u+LpdNFbwMq4d2Fa314fC1iyvR/F3frar1oa/CNow7EGZFQUEQLqlwh7AsmJO28yfkQknf1Xf+Bg==",
       "brillig_names": [
         "store_in_execution_cache_oracle_wrapper",
         "enqueue_public_function_call_internal"
       ],
       "verification_key": "AAAAAAAQAAAAAAAAAAAAFAAAAAAAAAAQAAAAAAADKLEBAAAAAAAAAAEAAAACAAAAAwAAAAQAAAAFAAAABgAAAAcAAAAIAAAACQAAAAoAAAALAAAADAAAAA0AAAAOAAAADwAAAAAAAAAAAA+Br57uIOtdJnxcGvJbMsL0JgjlPey0S4SunUioKSaBF6ngBiP04+4M9yeoY7XYvTDNmL1Jct9XDGEaPPXjJsguVIpwezHccvXIiY0g9s1gwVevTD61oGnnfZjD8CQtyBzfOOVy5AoCDQKZ+QycSLXH3FsKtlYm+G6pnzXm8G2iAUdyagxbBnr70bGDS1L+4YZzTLH8uwLau0G4j/riA7cRJw+LuOCWxkDQAMKlkOGZ2eKATo6a4+Gb9YDN40YnIh2i83qXimpFuQUAuctyXlYrXKIiLQ/bwJuHB9aQfz9mEYeZlBwrq30Nw7bSNvI9hdGgvvTblI7GRgs3gkRs9EYopzTMkx9aCZnYGhOr1Q9ovAGZPiOoaCpE2JIm+iPWwwhJi4vJqN4eVhxgcsqcBz+js3uDl09YhD8B4pDAWujrFMPGS+pAeiQYWIsgJ63OG66hv3kL8kZfeJ/ADH5nDyYNCE6/UdkrsVzXQRZ03eVTvq1BBwwXJrxc5CvQyCNfXgRWu3AbWwtGO7zwxP5xkFUjk9CVM+GyAEvYTp+KU6iPA4D05rswR3a/1Psi4gmHdBVkgemj+PCR0w2xADptqrQpjDMR/JFw+S3pQLBCqrmQ1TxqOyYznNprc9+SCDFBWQewX0CKYShHJZAWuSBK5L83U36xlrBcHZj6UQFqm6y7Imemwv61DvZKwAqBGRBvkTG8YokL59zhF8N0aLG/w10TiYBeeEDtySW8C3Q7W/jbHAu+e6CgEonzdSL2kobxIgHu65F+SrSJmzi/wYinfz70pncKT72250mL1/4BpTmOENXxuONSaFAD6BvYbmwAmVCd461cFmC9k5VjMkGuTikAph3qx2s3DKT0L3OmZct1qevcWM1L34r35/z/o21bcS5ZeJ8Nnbs/Fa3lOEt4SQ2x2DN5xzvkESPev8iMn8jWK3KtwTdDjKDTNxRFpXqWkOZE9YS6+kVBJM8BrVvgsTkBGeJB7rvr/1x9fyDcbFrRtq943CBtf3eFPwX95+vTciUhm7OfBEBOm+srJhuxDjZuFhm8rZe+rFI541Pfe+1gEXN/ckhVl8pv3Atq51/WX/UgKopjOn0qehIhmzsjGUMWkEghMrFu/3cPzCy3Whw2swnQ9a2zu42o0xCiFGf/jAlrC4dY5jW7nqr303NqdOfb5LuvB7oFYnThkMZ51i2RGbrbH9O7xpZq+KMYBjj0wWQsgdA4iZ7dVR3cTyghmgoMObHhW50pItjDjb1HEsVtYtoj0Xcy1l5S8GSbuF5qvyGWqxw21iL+saPG2NeW6ac8iE9WrKlPfaRgL27+7qjZD3YD6vQG0QZKJGjgI/WBKqou4w63zDLXxH8SzgjpkPcq72E/7XDTQMQ7F4ZL2RQMdxT2Be50pZoaj4NiX8U3XRH/uxj2oOYkYi035M8p903o1l5TShOJ/5oQ2o7vW5R/KlTj+dSXN69u7WyggQIbhk+NGBigseUxk+iAP+9O9VwT0d81euosn08EansP9RmPFRCJ6ZII5HrkLOCcEf6+OyCktfR8KsOM0eDQhI37Y1ZEl/QuE6w2F0Ttj0c4kBpFICr9dFGuz5wuby+0FoknfKVp7SHUa/+SxMhVNsz0U3MsG35cmx8YGl3SeOdhgEiNXL0NNuf8oXHr5uN4+sy+uy7hT3oy+TAdVB+LHJ3Z3m7JtB5/fSgthmvsQxsUW+OYBv3fi9YrJ3jXsOYnteuzakDkitTiFXS0QL6WhCKYH+4KRYxWD2UsJE7ER9Ofoz9nkPuslA/XlaEebCPX5CEC9gALC/lIrpCJqoxaf2a1Wu+MKAuWUebCvTRsjtQkLgWqEIM68PlIuaSzovGnZJP/PPZZkr1pLYclVRSasyoBQ/sK3InEjXW1cWNvW760qAb29FliAjAbauTrDrvq3SAzQAZvKBNXSPEZYxw/4H+p1wADTj4nRU75krS/hLl7qnRxLiV4NVHfUMAE7HzR9N2LO2SmbyrEl5tl5WVoxaMbFO0Y92zwzuzLR5jedBrom2ToJY+ER3wbYlZaVZunuziDLi0pn7aGeNAVC8xbFtyCUjU9Q/pw6ZI5wcHGficaDurFFdOsWhmau3STOk78mMWbKBTt580n2u0AwzwShgvEsEYtONbUuh5HY6dOzbEcofNGloDCcOVRUVNEWS9ZGI+nZRLbOeiSgmsyYQ7gglHgBfzpF8DV3KAZR3xS9gdTMrYSAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAiz1doGZ2WH0DPjaOIjG+BV4Y10TSaSfbnCmOq3SkSAiCkYC3Pqk2HCCxL1v2ukS9e02v7zL1S+MObPoc8RzFTIPy7+dPPQCuqPu2l8Knkm1werJWyZMMC3IVObyLXMw3yg+39qJyUgFl/CzRC6XUt751Y/Ckgg2GUJh97Fj/vuvHViqYcZK1SIEPXnEgCIZ5Vuhl1Gt/mw2Mk0/tsLaCYktfBipPD2uWICfqu7GqGp49LO8YfGdbnBpNZu/R+f5Bw=="
     },
-    {
-      "name": "_check_timestamp",
-      "is_unconstrained": true,
-      "custom_attributes": [
-        "public",
-        "internal",
-        "view"
-      ],
-      "abi": {
-        "error_types": {
-          "11405868724477732285": {
-            "error_kind": "string",
-            "string": "Function _check_timestamp can only be called internally"
-          },
-          "13418685691864489983": {
-            "error_kind": "string",
-            "string": "Function _check_timestamp can only be called statically"
-          },
-          "1433889167918961673": {
-            "error_kind": "fmtstring",
-            "item_types": [],
-            "length": 17
-          },
-          "17843811134343075018": {
-            "error_kind": "string",
-            "string": "Stack too deep"
-          },
-          "8443716675528357851": {
-            "error_kind": "string",
-            "string": "Timestamp mismatch."
-          }
-        },
-        "parameters": [
-          {
-            "name": "operation",
-            "type": {
-              "kind": "integer",
-              "sign": "unsigned",
-              "width": 8
-            },
-            "visibility": "private"
-          },
-          {
-            "name": "value",
-            "type": {
-              "kind": "integer",
-              "sign": "unsigned",
-              "width": 64
-            },
-            "visibility": "private"
-          }
-        ],
-        "return_type": null
-      },
-      "bytecode": "JgACBAEnAAABBIBLJgAABAMmAgMEAiYCBAQAHxgABAADgEkdAIBJgEkCHQCASoBKBS0IgEkAAS0IgEoAAiQAAABZJAAAAIQnAgABBIBLJgICBAA6DQABAAInAIBDAgAEJwCARAIABicAgEUCAAEnAIBGAgACJwCARwIABScAgEgCAAMlJAAAA1IeAgAEAR4CAAUACjgEBQYjAgAGAAAApSQAAAN7HgIABAkmAgUAAQo4BAUGIwIABgAAAMEkAAADjR4CAAQGHAwEBQAcDAIEAAo4BQQCDDgFBAYLKAABgEUABCYCBQEBIwIABAAAAzsiAAAA9AsoAAGARgAHFgwCCCMCAAcAAAMpIgAAAQ0LKAABgEgACSMCAAkAAAMXIgAAASILKAABgEMACiMCAAoAAAMAIgAAATcLKAABgEcAChYMBgsjAgAKAAAC6SIAAAFQCygAAYBEAAgjAgAIAAAC1yIAAAFlJgIBAkkmAggCZCYCCgJhJgILAnImAgwCbyYCDQJpJgIOAnYmAg8CZSYCEAIgJgIRAmwmAhICbiYCEwJ0JgIUAnAsCAEVJgIWBBIAEAEWASYDFQQBACgVAhYsDBYXLA4BFwAoFwIXLA4SFwAoFwIXLA4OFwAoFwIXLA4KFwAoFwIXLA4RFwAoFwIXLA4NFwAoFwIXLA4IFwAoFwIXLA4QFwAoFwIXLA4MFwAoFwIXLA4UFwAoFwIXLA4PFwAoFwIXLA4LFwAoFwIXLA4KFwAoFwIXLA4TFwAoFwIXLA4NFwAoFwIXLA4MFwAoFwIXLA4SFyYCAQEAJgIIBAAKOAEFCiMCAAoAAALOJgILBBMsCAEMJgINBBMAEAENASwMDA0pAwANBRPmMpnlFxQJACgNAg0AKBUCDiYCDwQRLQQADoADLQQADYAELQQAD4AFJAAAA58mAg4EEQA4DQ4NLA4IDQAoDQINOw0MCywMAQYiAAAC4CwMCwYiAAAC4CwMBgIiAAAC9wQ4CwgBLAwBAiIAAAL3LAwCCSIAAAMOEjgGAgEsDAEJIgAAAw4sDAkHIgAAAyAsDAYHIgAAAyAsDAcEIgAAAzIsDAgEIgAAAzIsDAQDIgAAA0QsDAIDIgAAA0QjAgADAAADUSQAAAPlJScAgAQEeAANAAAAgASAAyMAgAMAAAN6KQEAAQX3ofOvpa3UyjsBAQIlKQEAAQWeScksjTulvTsBAQIlKQEAAQW6OL+KoDMf/zsBAQIlAQCAA4AFgActAIADgAgtAIAEgAkLAIAIgAeACiMAgAoAAAPkLQGACIAGLQKABoAJAQCACAACgAgBAIAJAAKACSIAAAOzJSkBAAEFdS4blGTo99s7AQECJS0AGMoYyg==",
-      "debug_symbols": "zVrbTuMwEP2XPPdhxh57xvzKCqECAVWqWlTKSivEv69T4RSaUNQmR/ILasDjcyFn4jp+bx7b+7fnu9Xmafva3Px5b9bbh+V+td3kq/ePRXO/W63Xq+e7r79uqPvBXg8Fry/LTXf9ul/u9s0Nx+gWTbt57D6qy1M8rdZtcxPzx8FgiY4/B+ePqR+sfmSweS0zmzf9Ovh20bC46XREtNCREH+jQ6Gn43hA51J3uqLgriiKdE1RmOxWTFTcisn5824l6mdOZOHULb1Gg4YriuwaJLMripIfK0rqiw+JfjGYJBaDKegvt6OSlNtRnTs1ONl5MkzEJwIcjQpgctoXybBo3CoK1hclO6/bpzJW6DiU1Q4A7CcDiCu+inffAEZuXG/F1yR0/CdwGmMe+57gIx8jwWMze06FRu4fen4wM2mZmr8pzEQOtkz3XaT3XWXgu8hkgMD0OTZ4HQD80PwuAThmQD0NAGKarkClT+QQINFkgOhLImMcAHhmrEX5lpwOoOWuNvIDAB/BAEHBANGhAdAKFK1A0QoMrcDQChJaQQIrEHJoALQCRitgtAKHVuDA7Vo8owHQCgStQNAKAqEBBA0AXrZI9GgAAwOgH/qCfuiLoYNm6KAldNBSQAOAgxZI0ADgoAX2aABw0AJ6VRHQq4qAXlUEDw5aEEIDoIMm6FYR0EEL6FaB3koI6K2EoOigKbpVGDpohm4Vhg5aQreKND1oJmXfNL8I+Ti/pd+/RtTjJnQ4vL2I5KthUo0nXI0njqthEmth4qkaJqEWJlKNJzOssmZiMsN7kZmYzLDqmYtJNZ5oNZ5oNc8dqyY7qZp+kmrpsUq1eKJUjyepFiZcS3ZUZvj6I/30wzMROsPOeez5RxscOLKL3yB1RRc/+G8/8tXf5W61vF+3n4cvn942D1/OYu7/vbQnxzJfdtuH9vFt13YHNI9nM7sVO6ss2CST4S6qHN2Co3aX3SqaLeS/akbNyP8B",
-      "brillig_names": [
-        "_check_timestamp"
-      ]
-    },
     {
       "name": "process_log",
       "is_unconstrained": true,
@@ -3603,6 +3493,26 @@
         "process_log"
       ]
     },
+    {
+      "name": "sync_notes",
+      "is_unconstrained": true,
+      "custom_attributes": [],
+      "abi": {
+        "error_types": {
+          "17843811134343075018": {
+            "error_kind": "string",
+            "string": "Stack too deep"
+          }
+        },
+        "parameters": [],
+        "return_type": null
+      },
+      "bytecode": "H4sIAAAAAAAA/7WTyw7CIBBFqcUo0sTEx39MU0y7dOHafyCtLHVRN+766dZkJkyI0QVwEzJMgMNcHoXwKjBKESGCHDEqjAs2Xs7tjDnEqVbBvin5HRijvvhLWH+jkFnk4QPxM50/rJBzmTyfe6F913PTrF8J/z5y+af7y+l//8OzRq9bzCvh/8P4uvfXx/M2ij/SbJGc0ptoOwAqvkT+EvmhJBvn8w+Yb4Svj6KMqNO1tnaNdfZkh8H0dhfwP+KH/QbzqHp4zgQAAA==",
+      "debug_symbols": "bY9dCoQwDITvkuc+NHUV9CqySNUohdJKrQuLePdNF5Huz0uYCV+GzA4j9dvcGTf5FZp2B+sHHY137PZDQB+MtWbu8jXINLB48+uiXbJr1CFCU5SFAHIjqwr5fjKWoKnUIX5QlCjVCbNW9YXjDf/zNV68QvnB3w+2Dx2M7i2dz0+bG7Iu8bnQV60l+IHGLVAqmHXj2WIplORYjn4B",
+      "brillig_names": [
+        "sync_notes"
+      ]
+    },
     {
       "name": "public_dispatch",
       "is_unconstrained": true,
@@ -3670,10 +3580,100 @@
         "return_type": null
       },
       "bytecode": "JgACBAEnAAABBIBKJgAABAMmAgIEASYCAwQAHxgAAwACgEktCIBJAAEkAAAARSQAAABwJwIAAQSASiYCAgQAOg0AAQACJwCAQwIABCcAgEQCAAYnAIBFAgABJwCARgIAAicAgEcCAAUnAIBIAgADJSQAAAT0KAIAAgBYryrgCjgBAgMmAgQEACYCBgQDADgEBgUsCAECABABBQEmAwIEAQAoAgIFLA4EBQAoBQIFLA4EBSYCBQQDADgCBQQmAgQEAiYCBQEBJgIGAAEmAgcEASYCCAQAIwIAAwAAAOIiAAACQCwIAQMmAgkEAwAQAQkBJgMDBAEAKAMCCR88AAcABAAJLA0DCQAoCQIJLA4JAywIAQkAAAECASwOAwksCAEDAAABAgEsDggDJgILBAwsCAAMLAwJDSwMAw4AEAALACQAAAUdLAQAACwMDQoAKAoCDAA4DAgNLA0NCxwMCwwCHAwMCgAcDAoLAiYCDAQNLAgADSwMCQ4sDAMPABAADAAkAAAFHSwEAAAsDA4KACgKAgkAOAkIDCwNDAMcDAMKBRwMCgkAHgIAAwEeAgAKAAo4AwoMIwIADAAAAcAkAAAFmB4CAAMJCjgDBgojAgAKAAAB1yQAAAWqHgIAAwYcDAMKACYCDAQNLAgADSwMCg4sDAsPLAwJEAAQAAwAJAAABbwsBAAALAwOAyMCAAMAAAIVJAAACDosDQIDACgDAgMsDgMCACgCAgosDQoJJgILBAIAOAoLAzoNAAMACSIAAAJAKAIAAwB57RaBCjgBAwkjAgAJAAACWyIAAAOdLAgBASYCAwQDABABAwEmAwEEAQAoAQIDHzwABwAEAAMsDQEDACgDAgMsDgMBLAgBAwAAAQIBLA4BAywIAQEAAAECASwOCAEmAgcECSwIAAksDAMKLAwBCwAQAAcAJAAABR0sBAAALAwKBAAoBAIJADgJCAosDQoHHAwHCQIcDAkEABwMBAcCJgIJBAosCAAKLAwDCywMAQwAEAAJACQAAAUdLAQAACwMCwQAKAQCAwA4AwgJLA0JAR4CAAMBHgIABAAKOAMECSMCAAkAAAMvJAAACEweAgADCQo4AwYEIwIABAAAA0YkAAAIXh4CAAMFJgIGBAksCAAJLAwDCiwMBwssDAEMABAABgAkAAAFvCwEAAAsDAoEIwIABAAAA38kAAAIcAAoAgIELA0EAyYCBgQCADgEBgE6DQABAAMiAAADnSYCAQJjJgICAnMmAgMCbyYCBAJVJgIGAnImAgcCbCYCCQJrJgIKAiAmAgsCdCYCDAJlJgINAncmAg4CbiwIAQ8mAhAEEQAQARABJgMPBAEAKA8CECwMEBEsDgQRACgRAhEsDg4RACgRAhEsDgkRACgRAhEsDg4RACgRAhEsDgMRACgRAhEsDg0RACgRAhEsDg4RACgRAhEsDgoRACgRAhEsDgIRACgRAhEsDgwRACgRAhEsDgcRACgRAhEsDgwRACgRAhEsDgERACgRAhEsDgsRACgRAhEsDgMRACgRAhEsDgYRJgIBAQAKOAEFAiMCAAIAAATzJgIDBBIsCAEEJgIGBBIAEAEGASwMBAYpAwAGBeWPmFkHMWKQACgGAgYAKA8CByYCCQQQLQQAB4ADLQQABoAELQQACYAFJAAACIImAgcEEAA4BgcGLA4IBgAoBgIGOw0EAyUnAIAEBHgADQAAAIAEgAMjAIADAAAFHCkBAAEF96Hzr6Wt1Mo7AQECJSQAAAT0LA0BAywNAgQmAgYEAgw4BAYHIwIABwAABUEkAAAIyAAoAwIGADgGBAcsDQcFLAgBBiYCBwQCABABBwEmAwYEAQAoBgIHLAwHCCwOBQgmAgUEAQA4BAUHDjgEBwgjAgAIAAAFiyQAAAjaLA4DASwOBwIsDAYBJSkBAAEFnknJLI07pb07AQECJSkBAAEFuji/iqAzH/87AQECJSQAAAT0CjgBAwUMOAEDBgsoAAKARQABIwIAAQAACCwiAAAF4AsoAAKARgADFgwFByMCAAMAAAgaIgAABfkLKAACgEgACCMCAAgAAAgIIgAABg4LKAACgEMACSMCAAkAAAfxIgAABiMLKAACgEcACRYMBgojAgAJAAAH2iIAAAY8CygAAoBEAAcjAgAHAAAHyCIAAAZRJgICAmUmAgcCICYCCQJsJgIKAm4mAgsCdCYCDAJwJgINAmQmAg4CYSYCDwJJJgIQAnImAhECbyYCEgJpJgITAnYsCAEUJgIVBBIAEAEVASYDFAQBACgUAhUsDBUWLA4PFgAoFgIWLA4KFgAoFgIWLA4TFgAoFgIWLA4OFgAoFgIWLA4JFgAoFgIWLA4SFgAoFgIWLA4NFgAoFgIWLA4HFgAoFgIWLA4RFgAoFgIWLA4MFgAoFgIWLA4CFgAoFgIWLA4QFgAoFgIWLA4OFgAoFgIWLA4LFgAoFgIWLA4SFgAoFgIWLA4RFgAoFgIWLA4KFiYCAgQAJgIHAQEmAgkBAAo4CQcKIwIACgAAB78mAgsEEywIAQwmAg0EEwAQAQ0BLAwMDSkDAA0FE+YymeUXFAkAKA0CDQAoFAIOJgIPBBEtBAAOgAMtBAANgAQtBAAPgAUkAAAIgiYCDgQRADgNDg0sDgINACgNAg07DQwLLAwJBiIAAAfRLAwKBiIAAAfRLAwGBSIAAAfoBDgKBwIsDAIFIgAAB+gsDAUIIgAAB/8SOAYFAiwMAggiAAAH/ywMCAMiAAAIESwMBgMiAAAIESwMAwEiAAAIIywMBwEiAAAIIywMAQQiAAAINSwMBQQiAAAINSwMBAElKQEAAQV1LhuUZOj32zsBAQIlKQEAAQVx7V8Tcb40BjsBAQIlKQEAAQWQokK5sxVPPjsBAQIlKQEAAQUfIIuHAZnP/TsBAQIlAQCAA4AFgActAIADgAgtAIAEgAkLAIAIgAeACiMAgAoAAAjHLQGACIAGLQKABoAJAQCACAACgAgBAIAJAAKACSIAAAiWJSkBAAEF6J0J/qERLQ47AQECJSkBAAEFRafKcRlB5BU7AQECJS0AGMoYyg==",
-      "debug_symbols": "zV3bbhs5DP0XP+dB4l39lcVikbZuESBIijRdYFH033ecZsauLXtAzjDxS2G3c86hRIojiVL9c/N5+/HH13/uHr48ft98+Ovn5v7x0+3z3ePD8O3nr5vNx6e7+/u7r/8c/vWm7P6oVV8A37/dPuy+f3++fXrefEDGm8324fPwSepA8OXufrv5IPDr75tNBXFDsPohfhXyq5BfhYsfwm6I+FUkoNLcECU/xNwQQy8EnGF5c/JoLTA9PHxuND2u+KKAJV2BsxUovQ2U3gZObwO7IxYE/BB37gWtfog7LYAVP4T8EH8nN39aaLowWKy210cN94GCIDt6LJBLL6n0teTSUy59S6WHXOvBUulxcWAWnej1D/rTZ5vB67Ot7Wmx6G9T9GpMoevpFZJ3MkVPTOF6PaZcT69ITR2gkpvaNTe1a25y1Nzk6FxeuOlzrW+5c472lkOwGtA4EzfE40FIpV6TMdfUM8vnblFjqJwaw1dkDCxeH4qML4YqCpcfJoH6+vDwsR0uJTvNRIWpnaZH604CflPLicZOJ2KZs7zwZDnUY8sxsc9f+DmXnzCZ397Ss9Km4SQN8LJnW5mYWzE+9iwn9wxbLv/iedYMvy59QzXFaRZaZvxaSEa/FtaZEatlTJOmAMd+VVnN7lrK8b4L2dJuqYVt4m92wi+5/K0k81Myv6Xy8+KNrzl+zeWvyfbX3PhkKMn8yfGD7q1cRvd+ORP4ISs4TurUcjY5yrzMNV2BsxWkpCukt0HdxV82dzFFyuL500y1SlZIlTMKKyTLOYX0NkB6GyC9DegPP3SX+IXID3HX8oTBD3G/AESqH+LvZC1+yNL538VNPNHU2pjkbqCKpRZtpdVc+tSdfS01l55z6RcH5loVOF1enl7PlOvpFcB3MkVPTbGrMQWvp1cwtbqkhLn0qaldOTc5cm5ylJJLn2x96pxD9S2HINYy7l5graeDUO2KjLFr6pnFc7f3qr7p4rr6e1XftCX2+cBvBXL5a0nmf9O66orVN4PknoHcuqohJvMvrx7itOUijJcfZtPRs2ytzoxZwTFRmnA79uwKFWfgfc/Qcc+sUHG+yM+QzC+5/Mt3sGf4KZm/5fJrsv2aHJ+WHJ8tOX5adv2jlZKuQOkKLVuhprcB3BvODYsf4lchvwr5VfwXKpv/QmXzX6hs/kJA8xcCmv9+VvPfz2oWUHFXjprzUMsLxH8FtRQKYAI6FQMY/4XqAhDA+G8ul8A17OJPG7X488aACfiUAj7lgE/910FrkYBPJRA7GvCpBmLHAj61QOxYwKctEDvN79NaMIDx+7RWCGD8Pq1QAxi/T6t/tjJgKIDxx06lgE8pEDuLl8vT1qXuNy55JNdEcsm0fPE1tYvknEneEsmd1+md5JmWN8wjh8UXsC6R15pJnmk5ZFoOibkFMDNaMDHOgSiTPNNyzrR88W2eS+SSGC1n/rMKno5isB3cwfxdkh5AFgD1l3tSyytIUDogDYAwotRfvc2BOADiiBKHlLoDittYoJGip6B+uM2BLADSiJJGlCyi1C/pz4D6hyyFpwtsB8W8PUj8oDN3xOdAEaV+jpgDtQCofwpvBnTmhMzkJyr7azhV7RXUDSOCUYkQ/gB1Stho40XDYct4Hwq19Y6PyHSSYUjX++xYrXvWpI1mIBycNek+vFtrTwWVP64cDYa8NLUf/ERT/xxUYcb+4f5mI0/5hg9OzEyg/gp+fyFTsZyCoJ+klKZh1gGdyaFTUVukA+pvGs2Y11/wqI4esoKnoP6Avgw6cxlkBtR/q86BIkoYUcKIEkWUKKLEESWOKElESSJKGlHSiJJFlCwyNPpv1TlQQOnMNYM5UESpf/prDkQRUCCFnTkQPweyACiSWDSSWJQizqWIczni3P4cfw4Uca5EwkgiztVIGEWykUaykUaykUaykbaAc62UCIgioEAYWcUIKBBGFpnmWGSaY1gjoEAYGUWcS5EwoohzORJG/Y0wo3FeblpmllUXNqusvzWxGnuq7Zpqu6ba3s+Sa7H30+lq7JzIfuYw4Wrsuba3TPZ+xl6NXTPZMdV2TLWdMJU9NWY4Nd4ldaxKqu2aanv/0Ptq7IkxA+XMMpomyOlOIJR+AVYmHbGjLeNfw9d/b5/ubj/eb19/XubLj4dPB7828/zft+3RD898e3r8tP3842m7+wma/a/P7LSH7eUbItj1z85+GHa4Qeru6+5lSCTDv9qgOij/Dw==",
+      "debug_symbols": "zV3bbhs5DP0XP+dB4l39lcVikbZpESBIijRdYFH033ecesauLXtAzjDxS2G3c86hRIojiVL9c/P57uOPr//cP355+r758NfPzcPTp9uX+6fH4dvPXzebj8/3Dw/3X/85/OtN2f5Rq74Cvn+7fdx+//5y+/yy+YCMN5u7x8/DJ6kDwZf7h7vNB4Fff99sKogbgtUP8auQX4X8Klz8EHZDxK8iAZXmhij5IeaGGHoh4AzLm5NHa4Hp4eFzo+lxxVcFLOkKnK1A6W2g9DZwehvYHbEg4Ie4cy9o9UPcaQGs+CHkh/g7ufnTQtOFwWK17R413AcKgm7psUAuvaTS15JLT7n0LZUecq0HS6XHxYFZdKLXP+hPn20Gu2db29Nisd+m6NWYQtfTKyTvZIqemML1eky5nl6RmjpAJTe1a25q19zkqLnJ0bm8cNPnWt9y5xztLYdgNaBxJm6Ix4OQSr0mY66pZ5bP3aLGUDk1hq/IGFi8PhQZXwxVFC4/TAJ19/DwsR0uJTvNRIWpnaZH604CflPLicZOJ2KZs7zwZDnUY8sxsc9f+TmXnzCZ397Ss9Km4SQN8LJnW5mYWzE+9iwn9wxbLv/iedYMvy59QzXFaRZaZvxaSEa/FtaZEatlTJOmAMd+VVnN7lrK8b4L2dJuqYVt4m92wi+5/K0k81Myv6Xy8+KNrzl+zeWvyfbX3PhkKMn8yfGD7q1cRvd+ORP4ISs4TurUcjY5yrzMNV2BsxWkpCukt0HdxV82dzFFyuL500y1SlZIlTMKKyTLOYX0NkB6GyC9DegPP3SX+IXID3HX8oTBD3G/AESqH+LvZC1+yNL538VNPNHU2pjkbqCKpRZtpdVc+tSdfS01l55z6RcH5loVOF1enl7PlOvpFcB3MkVPTbGrMQWvp1cwtbqkhLn0qaldOTc5cm5ylJJLn2x96pxD9S2HINYy7l5graeDUO2KjLFr6pnFc7f3qr7p4rr6e1XftCX2+cBvBXL5a0nmf9O66orVN4PknoHcuqohJvMvrx7itOUijJcfZtPRs2ytzoxZwTFRmnA79uwKFWfgfc/Qcc+sUHG+yM+QzC+5/Mt3sGf4KZm/5fJrsv2aHJ+WHJ8tOX5adv2jlZKuQOkKLVuhprcB3BvODYsf4lchvwr5VfwXKpv/QmXzX6hs/kJA8xcCmv9+VvPfz2oWUHFXjprzUMsrxH8FtRQKYAI6FQMY/4XqAhDA+G8ul8A17OJPG7X488aACfiUAj7lgE/910FrkYBPJRA7GvCpBmLHAj61QOxYwKctEDvN79NaMIDx+7RWCGD8Pq1QAxi/T6t/tjJgKIDxx06lgE8pEDuLl8vT1qXuNy55JNdEcsm0fPE1tYvknEneEsmd1+md5JmWN8wjh8UXsC6R15pJnmk5ZFoOibkFMDNaMDHOgSiTPNNyzrR88W2eS+SSGC1n/rMKno5isB3cwfxdkh5AFgD1l3tSyw4kKB2QBkAYUeqv3uZAHABxRIlDSt0BxW0s0EjRU1A/3OZAFgBpREkjShZR6pf0Z0D9Q5bC0wW2g2LeHiR+0Jk74nOgiFI/R8yBWgDUP4U3AzpzQmbyE5X9NZxh/roDdcOIYFQihD9AnRI22njRcNgy3odC7T2MMp1kGNL1PjtW6541aaMZCAdnTboPb9faU0HljytHddfUfvATTf1zUIUZ+4f7m4085Rs+ODEzgfor+P2FTMVyCoJ+klKahlkHdCaHTkVtkQ6ov2k0Y15/waM6esgKnoL6A/oy6MxlkBlQ/606B4ooYUQJI0oUUaKIEkeUOKIkESWJKGlESSNKFlGyyNDov1XnQAGlM9cM5kARpf7przkQRUCBFHbmQPwcyAKgSGLRSGJRijiXIs7liHP7c/w5UMS5EgkjiThXI2EUyUYayUYayUYayUbaAs61UiIgioACYWQVI6BAGFlkmmORaY5hjYACYWQUcS5FwogizuVIGPU3wozGeblpmVlWXdissv7WxGrsqbZrqu2aans/S67F3k+nq7FzIvuZw4Srsefa3jLZ+xl7NXbNZMdU2zHVdsJU9tSY4dR4l9SxKqm2a6rt/UPvq7EnxgyUM8tomiCnO4FQ+gVYmXTEjraMfw1f/719vr/9+HC3+3mZLz8ePx382szLf9/ujn545tvz06e7zz+e77Y/QbP/9Zmt9rC9fEME2/7Z2g/DDjdI3X7dvgyJZPhXG1QH5f8B",
       "brillig_names": [
         "public_dispatch"
       ]
+    },
+    {
+      "name": "compute_note_hash_and_optionally_a_nullifier",
+      "is_unconstrained": true,
+      "custom_attributes": [],
+      "abi": {
+        "error_types": {
+          "16541607464495309456": {
+            "error_kind": "fmtstring",
+            "item_types": [],
+            "length": 16
+          },
+          "17843811134343075018": {
+            "error_kind": "string",
+            "string": "Stack too deep"
+          }
+        },
+        "parameters": [
+          {
+            "name": "contract_address",
+            "type": {
+              "fields": [
+                {
+                  "name": "inner",
+                  "type": {
+                    "kind": "field"
+                  }
+                }
+              ],
+              "kind": "struct",
+              "path": "aztec::protocol_types::address::aztec_address::AztecAddress"
+            },
+            "visibility": "private"
+          },
+          {
+            "name": "nonce",
+            "type": {
+              "kind": "field"
+            },
+            "visibility": "private"
+          },
+          {
+            "name": "storage_slot",
+            "type": {
+              "kind": "field"
+            },
+            "visibility": "private"
+          },
+          {
+            "name": "note_type_id",
+            "type": {
+              "kind": "field"
+            },
+            "visibility": "private"
+          },
+          {
+            "name": "compute_nullifier",
+            "type": {
+              "kind": "boolean"
+            },
+            "visibility": "private"
+          },
+          {
+            "name": "packed_note_content",
+            "type": {
+              "kind": "array",
+              "length": 0,
+              "type": {
+                "kind": "field"
+              }
+            },
+            "visibility": "private"
+          }
+        ],
+        "return_type": {
+          "abi_type": {
+            "kind": "array",
+            "length": 4,
+            "type": {
+              "kind": "field"
+            }
+          },
+          "visibility": "public"
+        }
+      },
+      "bytecode": "H4sIAAAAAAAA/9VZy67aQAwdSEJIuAEKn3Cl7tomXJ47Fn3c30AFPqHrrLppP7qMGCcH46siYVfFEpoknhyfOXZmJqHjztY//TrhOA5tz10b9dmGtrzPKkWs0pJn50F4dh+EZ/QgPGNFnh2Bp2/peUvc+ZlL3fl5bC7iTT7BEdzk/gYAwX6HNgttF/yKCakyYZBa+Otyvs/cpSnzf8kCZmqDvyD8vg1+Sbw/1y0+joXiRqF9rVstX+Eeb0U4xuIlXPJ1wfeF+SLwfWU+rOFvzId1T5xIN1qYlOtqY50XGlsKY+u80TrXaofXSOvcmdZoRTnPGB/On/gU1Kdu+fSYLwZfxnwJ+Eh/3z5DP577FPp9hONP0IfXZ+Su65n8lH/U3aK+YgP8k82lHPD8xPVlbPRhDmLQ85npY7FuoD4W+nt9pm/wp2Nvae0ai5ieqBFp1sf+zJeBL64v4+ThPIY4iEU8Etb/QzgfhbYH99D9YyF+j8W/4C1cQ404ViRco/7++Xwfjgfh52voJ93jructvc31ci7N4Xr4qwY/s+F/JPzcBn9J+AMb/GZv82SCPysJv7Dh38xBQ5v6afaWIxv+B8Ifm+DPD7QOv3OtNXNEOJ7Adb35u6pu2SNh/JxxtdojTRgfrg+uwd43FbiOBR/P4VSIMxXiSFiZItaTItboPx1jXxFroIg1VMTSzGOqiKWpV66IVShiada9pl6UR2mf5m0b2vJOk/ZpiviVtE/TfJcnram+YkFDHF/C+v9gOg9MeFYzWnPoWacYGLswin3rek3xC4EP8c4F3z0fZw+L9XGzXmxOW7JqOds0+SwYV34N34twPsb+0tov7fsUtS6ld/8h6OotBl/BfAn4iKP07j804n+L/hh/LPj4+n9rLifuej0csHHjN6+typjb74HSt3rj+Wtx67NJ8XN3PV//q++NqA/fS+cC17Hg4/uTXIiTC3EeEYt/s0cNfV2TTnHd+rVyuVq3f3TRXJS4y/8BHIufsP6/wjmOjdp75vzjalcdX3bH3WK338+/7yYM31sXdPoDg5oBSR0fAAA=",
+      "debug_symbols": "tdfBioMwFIXhd8k6C29iksZXGYYSNZZAiBJ1YBDffWLptKVdlrMpjVw/N/7g3Vjv2/VyDmkYZ9Z8bSyOnVvCmMpp2zlrc4gxXM7Pl1l1/Fh1nZ8nl47jvLi8sEYqyZlPffmnqdw/hOhZo8XO30aNuE0acx9UYv/mzGocbXD0CUdbGE1VBbQJaAugLYF2DbQV0NZA2wDtE9AGdknALgnYJQG7JGCXBOySgF0SsEsCdkmfdmn/J8tr8YZbIC4qJE5IXCBxicRrJK6QuEbiBokjCxXIQiWyUAkrdC+nH5eDa6O/7V/DmrqndWz5nfzLZjblsfP9mv2xoz3WsyNGqXitrt8p5UCy5iRteUh50B8=",
+      "brillig_names": [
+        "compute_note_hash_and_optionally_a_nullifier"
+      ]
     }
   ],
   "outputs": {
@@ -3816,7 +3816,7 @@
       "path": "/build-volume/noir-projects/aztec-nr/aztec/src/oracle/notes.nr",
       "source": "use crate::{note::{note_header::NoteHeader, note_interface::NoteInterface}, utils::array};\n\nuse dep::protocol_types::{\n    address::AztecAddress,\n    indexed_tagging_secret::{INDEXED_TAGGING_SECRET_LENGTH, IndexedTaggingSecret},\n};\n\n/// Notifies the simulator that a note has been created, so that it can be returned in future read requests in the same\n/// transaction. This note should only be added to the non-volatile database if found in an actual block.\npub fn notify_created_note<let N: u32>(\n    storage_slot: Field,\n    note_type_id: Field,\n    packed_note_content: [Field; N],\n    note_hash: Field,\n    counter: u32,\n) {\n    /// Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n    /// to call.\n    unsafe {\n        notify_created_note_oracle_wrapper(\n            storage_slot,\n            note_type_id,\n            packed_note_content,\n            note_hash,\n            counter,\n        )\n    };\n}\n\n/// Notifies the simulator that a note has been nullified, so that it is no longer returned in future read requests in\n/// the same transaction. This note should only be removed to the non-volatile database if its nullifier is found in an\n/// actual block.\npub fn notify_nullified_note(nullifier: Field, note_hash: Field, counter: u32) {\n    /// Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n    /// to call.\n    unsafe { notify_nullified_note_oracle_wrapper(nullifier, note_hash, counter) };\n}\n\n/// Notifies the simulator that a non-note nullifier has been created, so that it can be used for note nonces.\npub fn notify_created_nullifier(nullifier: Field) {\n    // This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to call.\n    unsafe { notify_created_nullifier_oracle_wrapper(nullifier) };\n}\n\nunconstrained fn notify_created_note_oracle_wrapper<let N: u32>(\n    storage_slot: Field,\n    note_type_id: Field,\n    packed_note_content: [Field; N],\n    note_hash: Field,\n    counter: u32,\n) {\n    let _ = notify_created_note_oracle(\n        storage_slot,\n        note_type_id,\n        packed_note_content,\n        note_hash,\n        counter,\n    );\n}\n\n#[oracle(notifyCreatedNote)]\nunconstrained fn notify_created_note_oracle<let N: u32>(\n    _storage_slot: Field,\n    _note_type_id: Field,\n    _packed_note_content: [Field; N],\n    _note_hash: Field,\n    _counter: u32,\n) -> Field {}\n\nunconstrained fn notify_nullified_note_oracle_wrapper(\n    nullifier: Field,\n    note_hash: Field,\n    counter: u32,\n) {\n    let _ = notify_nullified_note_oracle(nullifier, note_hash, counter);\n}\n\n#[oracle(notifyNullifiedNote)]\nunconstrained fn notify_nullified_note_oracle(\n    _nullifier: Field,\n    _note_hash: Field,\n    _counter: u32,\n) -> Field {}\n\nunconstrained fn notify_created_nullifier_oracle_wrapper(nullifier: Field) {\n    let _ = notify_created_nullifier_oracle(nullifier);\n}\n\n#[oracle(notifyCreatedNullifier)]\nunconstrained fn notify_created_nullifier_oracle(_nullifier: Field) -> Field {}\n\n#[oracle(getNotes)]\nunconstrained fn get_notes_oracle<let N: u32, let S: u32>(\n    _storage_slot: Field,\n    _num_selects: u8,\n    _select_by_indexes: [u8; N],\n    _select_by_offsets: [u8; N],\n    _select_by_lengths: [u8; N],\n    _select_values: [Field; N],\n    _select_comparators: [u8; N],\n    _sort_by_indexes: [u8; N],\n    _sort_by_offsets: [u8; N],\n    _sort_by_lengths: [u8; N],\n    _sort_order: [u8; N],\n    _limit: u32,\n    _offset: u32,\n    _status: u8,\n    _return_size: u32,\n    _placeholder_fields: [Field; S],\n) -> [Field; S] {}\n\nunconstrained fn get_notes_oracle_wrapper<let N: u32, let S: u32>(\n    storage_slot: Field,\n    num_selects: u8,\n    select_by_indexes: [u8; N],\n    select_by_offsets: [u8; N],\n    select_by_lengths: [u8; N],\n    select_values: [Field; N],\n    select_comparators: [u8; N],\n    sort_by_indexes: [u8; N],\n    sort_by_offsets: [u8; N],\n    sort_by_lengths: [u8; N],\n    sort_order: [u8; N],\n    limit: u32,\n    offset: u32,\n    status: u8,\n    mut placeholder_fields: [Field; S],\n) -> [Field; S] {\n    let return_size = placeholder_fields.len() as u32;\n    get_notes_oracle(\n        storage_slot,\n        num_selects,\n        select_by_indexes,\n        select_by_offsets,\n        select_by_lengths,\n        select_values,\n        select_comparators,\n        sort_by_indexes,\n        sort_by_offsets,\n        sort_by_lengths,\n        sort_order,\n        limit,\n        offset,\n        status,\n        return_size,\n        placeholder_fields,\n    )\n}\n\npub unconstrained fn get_notes<Note, let N: u32, let M: u32, let S: u32, let NS: u32>(\n    storage_slot: Field,\n    num_selects: u8,\n    select_by_indexes: [u8; M],\n    select_by_offsets: [u8; M],\n    select_by_lengths: [u8; M],\n    select_values: [Field; M],\n    select_comparators: [u8; M],\n    sort_by_indexes: [u8; M],\n    sort_by_offsets: [u8; M],\n    sort_by_lengths: [u8; M],\n    sort_order: [u8; M],\n    limit: u32,\n    offset: u32,\n    status: u8,\n    mut placeholder_opt_notes: [Option<Note>; S], // TODO: Remove it and use `limit` to initialize the note array.\n    placeholder_fields: [Field; NS], // TODO: Remove it and use `limit` to initialize the note array.\n    _placeholder_note_length: [Field; N], // Turbofish hack? Compiler breaks calculating read_offset unless we add this parameter\n) -> [Option<Note>; S]\nwhere\n    Note: NoteInterface<N>,\n{\n    sync_notes_oracle_wrapper();\n    let fields = get_notes_oracle_wrapper(\n        storage_slot,\n        num_selects,\n        select_by_indexes,\n        select_by_offsets,\n        select_by_lengths,\n        select_values,\n        select_comparators,\n        sort_by_indexes,\n        sort_by_offsets,\n        sort_by_lengths,\n        sort_order,\n        limit,\n        offset,\n        status,\n        placeholder_fields,\n    );\n    let num_notes = fields[0] as u32;\n    let contract_address = AztecAddress::from_field(fields[1]);\n    for i in 0..placeholder_opt_notes.len() {\n        if i < num_notes {\n            // lengths named as per typescript.\n            let return_header_length: u32 = 2; // num_notes & contract_address.\n            let extra_preimage_length: u32 = 2; // nonce & note_hash_counter.\n            let read_offset: u32 = return_header_length + i * (N + extra_preimage_length);\n\n            let nonce = fields[read_offset];\n            let note_hash_counter = fields[read_offset + 1] as u32;\n            let note_content = array::subarray(fields, read_offset + 2);\n\n            let mut note = Note::unpack_content(note_content);\n            note.set_header(NoteHeader { contract_address, nonce, storage_slot, note_hash_counter });\n\n            placeholder_opt_notes[i] = Option::some(note);\n        };\n    }\n    placeholder_opt_notes\n}\n\n/// Returns true if the nullifier exists. Note that a `true` value can be constrained by proving existence of the\n/// nullifier, but a `false` value should not be relied upon since other transactions may emit this nullifier before the\n/// current transaction is included in a block. While this might seem of little use at first, certain design patterns\n/// benefit from this abstraction (see e.g. `PrivateMutable`).\npub unconstrained fn check_nullifier_exists(inner_nullifier: Field) -> bool {\n    check_nullifier_exists_oracle(inner_nullifier) == 1\n}\n\n#[oracle(checkNullifierExists)]\nunconstrained fn check_nullifier_exists_oracle(_inner_nullifier: Field) -> Field {}\n\n/// Same as `get_indexed_tagging_secret_as_sender`, except it returns the derived tag, ready to be included in a log.\npub unconstrained fn get_app_tag_as_sender(sender: AztecAddress, recipient: AztecAddress) -> Field {\n    get_indexed_tagging_secret_as_sender(sender, recipient).compute_tag(recipient)\n}\n\n/// Returns the tagging secret for a given sender and recipient pair, siloed for the current contract address.\n/// Includes the last known index used to send a note tagged with this secret.\n/// For this to work, PXE must know the ivsk_m of the sender.\n/// For the recipient's side, only the address is needed.\npub unconstrained fn get_indexed_tagging_secret_as_sender(\n    sender: AztecAddress,\n    recipient: AztecAddress,\n) -> IndexedTaggingSecret {\n    let result = get_indexed_tagging_secret_as_sender_oracle(sender, recipient);\n    IndexedTaggingSecret::deserialize(result)\n}\n\n#[oracle(getIndexedTaggingSecretAsSender)]\nunconstrained fn get_indexed_tagging_secret_as_sender_oracle(\n    _sender: AztecAddress,\n    _recipient: AztecAddress,\n) -> [Field; INDEXED_TAGGING_SECRET_LENGTH] {}\n\n/// Notifies the simulator that a tag has been used in a note, and to therefore increment the associated index so that\n/// future notes get a different tag and can be discovered by the recipient.\n/// This change should only be persisted in a non-volatile database if the tagged log is found in an actual block -\n/// otherwise e.g. a reverting transaction can cause the sender to accidentally skip indices and later produce notes\n/// that are not found by the recipient.\npub fn increment_app_tagging_secret_index_as_sender(sender: AztecAddress, recipient: AztecAddress) {\n    /// Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n    /// to call.\n    unsafe {\n        increment_app_tagging_secret_index_as_sender_wrapper(sender, recipient);\n    }\n}\n\nunconstrained fn increment_app_tagging_secret_index_as_sender_wrapper(\n    sender: AztecAddress,\n    recipient: AztecAddress,\n) {\n    increment_app_tagging_secret_index_as_sender_oracle(sender, recipient);\n}\n\n#[oracle(incrementAppTaggingSecretIndexAsSender)]\nunconstrained fn increment_app_tagging_secret_index_as_sender_oracle(\n    _sender: AztecAddress,\n    _recipient: AztecAddress,\n) {}\n\n/// Finds new notes that may have been sent to all registered accounts in PXE in the current contract and makes them available\n/// for later querying via the `get_notes` oracle.\npub fn sync_notes() {\n    /// Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n    /// to call.\n    unsafe {\n        sync_notes_oracle_wrapper();\n    }\n}\n\nunconstrained fn sync_notes_oracle_wrapper() {\n    sync_notes_oracle();\n}\n\n#[oracle(syncNotes)]\nunconstrained fn sync_notes_oracle() {}\n"
     },
-    "178": {
+    "179": {
       "path": "/build-volume/noir-projects/aztec-nr/aztec/src/utils/comparison.nr",
       "source": "struct ComparatorEnum {\n    pub EQ: u8,\n    pub NEQ: u8,\n    pub LT: u8,\n    pub LTE: u8,\n    pub GT: u8,\n    pub GTE: u8,\n}\n\npub global Comparator: ComparatorEnum =\n    ComparatorEnum { EQ: 1, NEQ: 2, LT: 3, LTE: 4, GT: 5, GTE: 6 };\n\npub fn compare(lhs: Field, operation: u8, rhs: Field) -> bool {\n    // Values are computed ahead of time because circuits evaluate all branches\n    let is_equal = lhs == rhs;\n    let is_lt = lhs.lt(rhs);\n\n    if (operation == Comparator.EQ) {\n        is_equal\n    } else if (operation == Comparator.NEQ) {\n        !is_equal\n    } else if (operation == Comparator.LT) {\n        is_lt\n    } else if (operation == Comparator.LTE) {\n        is_lt | is_equal\n    } else if (operation == Comparator.GT) {\n        !is_lt & !is_equal\n    } else if (operation == Comparator.GTE) {\n        !is_lt\n    } else {\n        panic(f\"Invalid operation\")\n    }\n}\n\nmod test {\n    use super::Comparator;\n    use super::compare;\n\n    #[test]\n    unconstrained fn test_compare() {\n        let lhs = 10;\n        let rhs = 10;\n        assert(compare(lhs, Comparator.EQ, rhs), \"Expected lhs to be equal to rhs\");\n\n        let lhs = 10;\n        let rhs = 11;\n        assert(compare(lhs, Comparator.NEQ, rhs), \"Expected lhs to be not equal to rhs\");\n\n        let lhs = 10;\n        let rhs = 11;\n        assert(compare(lhs, Comparator.LT, rhs), \"Expected lhs to be less than rhs\");\n\n        let lhs = 10;\n        let rhs = 10;\n        assert(compare(lhs, Comparator.LTE, rhs), \"Expected lhs to be less than or equal to rhs\");\n\n        let lhs = 11;\n        let rhs = 10;\n        assert(compare(lhs, Comparator.GT, rhs), \"Expected lhs to be greater than rhs\");\n\n        let lhs = 10;\n        let rhs = 10;\n        assert(\n            compare(lhs, Comparator.GTE, rhs),\n            \"Expected lhs to be greater than or equal to rhs\",\n        );\n\n        let lhs = 11;\n        let rhs = 10;\n        assert(\n            compare(lhs, Comparator.GTE, rhs),\n            \"Expected lhs to be greater than or equal to rhs\",\n        );\n\n        let lhs = 10;\n        let rhs = 11;\n        assert(!compare(lhs, Comparator.EQ, rhs), \"Expected lhs to be not equal to rhs\");\n\n        let lhs = 10;\n        let rhs = 10;\n        assert(!compare(lhs, Comparator.NEQ, rhs), \"Expected lhs to not be not equal to rhs\");\n\n        let lhs = 11;\n        let rhs = 10;\n        assert(!compare(lhs, Comparator.LT, rhs), \"Expected lhs to not be less than rhs\");\n\n        let lhs = 11;\n        let rhs = 10;\n        assert(\n            !compare(lhs, Comparator.LTE, rhs),\n            \"Expected lhs to not be less than or equal to rhs\",\n        );\n\n        let lhs = 10;\n        let rhs = 10;\n        assert(!compare(lhs, Comparator.GT, rhs), \"Expected lhs to not be greater than rhs\");\n\n        let lhs = 10;\n        let rhs = 11;\n        assert(\n            !compare(lhs, Comparator.GTE, rhs),\n            \"Expected lhs to not be greater than or equal to rhs\",\n        );\n\n        let lhs = 10;\n        let rhs = 11;\n        assert(\n            !compare(lhs, Comparator.GTE, rhs),\n            \"Expected lhs to not be greater than or equal to rhs\",\n        );\n    }\n}\n"
     },
@@ -3828,19 +3828,19 @@
       "path": "std/field/mod.nr",
       "source": "pub mod bn254;\nuse crate::{runtime::is_unconstrained, static_assert};\nuse bn254::lt as bn254_lt;\n\nimpl Field {\n    /// Asserts that `self` can be represented in `bit_size` bits.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^{bit_size}`.\n    // docs:start:assert_max_bit_size\n    pub fn assert_max_bit_size<let BIT_SIZE: u32>(self) {\n        // docs:end:assert_max_bit_size\n        static_assert(\n            BIT_SIZE < modulus_num_bits() as u32,\n            \"BIT_SIZE must be less than modulus_num_bits\",\n        );\n        self.__assert_max_bit_size(BIT_SIZE);\n    }\n\n    #[builtin(apply_range_constraint)]\n    fn __assert_max_bit_size(self, bit_size: u32) {}\n\n    /// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n    /// This slice will be zero padded should not all bits be necessary to represent `self`.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n    /// be able to represent the original `Field`.\n    ///\n    /// # Safety\n    /// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n    /// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n    /// wrap around due to overflow when verifying the decomposition.\n    #[builtin(to_le_bits)]\n    fn _to_le_bits<let N: u32>(self: Self) -> [u1; N] {}\n\n    /// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n    /// This array will be zero padded should not all bits be necessary to represent `self`.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n    /// be able to represent the original `Field`.\n    ///\n    /// # Safety\n    /// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n    /// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n    /// wrap around due to overflow when verifying the decomposition.\n    #[builtin(to_be_bits)]\n    fn _to_be_bits<let N: u32>(self: Self) -> [u1; N] {}\n\n    /// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n    /// This slice will be zero padded should not all bits be necessary to represent `self`.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n    /// be able to represent the original `Field`.\n    ///\n    /// # Safety\n    /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n    // docs:start:to_le_bits\n    pub fn to_le_bits<let N: u32>(self: Self) -> [u1; N] {\n        // docs:end:to_le_bits\n        let bits = self._to_le_bits();\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_le_bits();\n            assert(bits.len() <= p.len());\n            let mut ok = bits.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bits[N - 1 - i] != p[N - 1 - i]) {\n                        assert(p[N - 1 - i] == 1);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bits\n    }\n\n    /// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n    /// This array will be zero padded should not all bits be necessary to represent `self`.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n    /// be able to represent the original `Field`.\n    ///\n    /// # Safety\n    /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n    // docs:start:to_be_bits\n    pub fn to_be_bits<let N: u32>(self: Self) -> [u1; N] {\n        // docs:end:to_be_bits\n        let bits = self._to_be_bits();\n\n        if !is_unconstrained() {\n            // Ensure that the decomposition does not overflow the modulus\n            let p = modulus_be_bits();\n            assert(bits.len() <= p.len());\n            let mut ok = bits.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bits[i] != p[i]) {\n                        assert(p[i] == 1);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bits\n    }\n\n    /// Decomposes `self` into its little endian byte decomposition as a `[u8;N]` array\n    /// This array will be zero padded should not all bytes be necessary to represent `self`.\n    ///\n    /// # Failures\n    ///  The length N of the array must be big enough to contain all the bytes of the 'self',\n    ///  and no more than the number of bytes required to represent the field modulus\n    ///\n    /// # Safety\n    /// The result is ensured to be the canonical decomposition of the field element\n    // docs:start:to_le_bytes\n    pub fn to_le_bytes<let N: u32>(self: Self) -> [u8; N] {\n        // docs:end:to_le_bytes\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        // Compute the byte decomposition\n        let bytes = self.to_le_radix(256);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_le_bytes();\n            assert(bytes.len() <= p.len());\n            let mut ok = bytes.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bytes[N - 1 - i] != p[N - 1 - i]) {\n                        assert(bytes[N - 1 - i] < p[N - 1 - i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bytes\n    }\n\n    /// Decomposes `self` into its big endian byte decomposition as a `[u8;N]` array of length required to represent the field modulus\n    /// This array will be zero padded should not all bytes be necessary to represent `self`.\n    ///\n    /// # Failures\n    ///  The length N of the array must be big enough to contain all the bytes of the 'self',\n    ///  and no more than the number of bytes required to represent the field modulus\n    ///\n    /// # Safety\n    /// The result is ensured to be the canonical decomposition of the field element\n    // docs:start:to_be_bytes\n    pub fn to_be_bytes<let N: u32>(self: Self) -> [u8; N] {\n        // docs:end:to_be_bytes\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        // Compute the byte decomposition\n        let bytes = self.to_be_radix(256);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_be_bytes();\n            assert(bytes.len() <= p.len());\n            let mut ok = bytes.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bytes[i] != p[i]) {\n                        assert(bytes[i] < p[i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bytes\n    }\n\n    // docs:start:to_le_radix\n    pub fn to_le_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n        // Brillig does not need an immediate radix\n        if !crate::runtime::is_unconstrained() {\n            static_assert(1 < radix, \"radix must be greater than 1\");\n            static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n            static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n        }\n        self.__to_le_radix(radix)\n    }\n    // docs:end:to_le_radix\n\n    // docs:start:to_be_radix\n    pub fn to_be_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n        // Brillig does not need an immediate radix\n        if !crate::runtime::is_unconstrained() {\n            crate::assert_constant(radix);\n        }\n        self.__to_be_radix(radix)\n    }\n    // docs:end:to_be_radix\n\n    // `_radix` must be less than 256\n    #[builtin(to_le_radix)]\n    fn __to_le_radix<let N: u32>(self, radix: u32) -> [u8; N] {}\n\n    // `_radix` must be less than 256\n    #[builtin(to_be_radix)]\n    fn __to_be_radix<let N: u32>(self, radix: u32) -> [u8; N] {}\n\n    // Returns self to the power of the given exponent value.\n    // Caution: we assume the exponent fits into 32 bits\n    // using a bigger bit size impacts negatively the performance and should be done only if the exponent does not fit in 32 bits\n    pub fn pow_32(self, exponent: Field) -> Field {\n        let mut r: Field = 1;\n        let b: [u1; 32] = exponent.to_le_bits();\n\n        for i in 1..33 {\n            r *= r;\n            r = (b[32 - i] as Field) * (r * self) + (1 - b[32 - i] as Field) * r;\n        }\n        r\n    }\n\n    // Parity of (prime) Field element, i.e. sgn0(x mod p) = 0 if x `elem` {0, ..., p-1} is even, otherwise sgn0(x mod p) = 1.\n    pub fn sgn0(self) -> u1 {\n        self as u1\n    }\n\n    pub fn lt(self, another: Field) -> bool {\n        if crate::compat::is_bn254() {\n            bn254_lt(self, another)\n        } else {\n            lt_fallback(self, another)\n        }\n    }\n\n    /// Convert a little endian byte array to a field element.\n    /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n    pub fn from_le_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bytes[i] as Field) * v;\n            v = v * 256;\n        }\n        result\n    }\n\n    /// Convert a big endian byte array to a field element.\n    /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n    pub fn from_be_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bytes[N - 1 - i] as Field) * v;\n            v = v * 256;\n        }\n        result\n    }\n}\n\n#[builtin(modulus_num_bits)]\npub comptime fn modulus_num_bits() -> u64 {}\n\n#[builtin(modulus_be_bits)]\npub comptime fn modulus_be_bits() -> [u1] {}\n\n#[builtin(modulus_le_bits)]\npub comptime fn modulus_le_bits() -> [u1] {}\n\n#[builtin(modulus_be_bytes)]\npub comptime fn modulus_be_bytes() -> [u8] {}\n\n#[builtin(modulus_le_bytes)]\npub comptime fn modulus_le_bytes() -> [u8] {}\n\n/// An unconstrained only built in to efficiently compare fields.\n#[builtin(field_less_than)]\nunconstrained fn __field_less_than(x: Field, y: Field) -> bool {}\n\npub(crate) unconstrained fn field_less_than(x: Field, y: Field) -> bool {\n    __field_less_than(x, y)\n}\n\n// Convert a 32 byte array to a field element by modding\npub fn bytes32_to_field(bytes32: [u8; 32]) -> Field {\n    // Convert it to a field element\n    let mut v = 1;\n    let mut high = 0 as Field;\n    let mut low = 0 as Field;\n\n    for i in 0..16 {\n        high = high + (bytes32[15 - i] as Field) * v;\n        low = low + (bytes32[16 + 15 - i] as Field) * v;\n        v = v * 256;\n    }\n    // Abuse that a % p + b % p = (a + b) % p and that low < p\n    low + high * v\n}\n\nfn lt_fallback(x: Field, y: Field) -> bool {\n    if is_unconstrained() {\n        /// Safety: unconstrained context\n        unsafe {\n            field_less_than(x, y)\n        }\n    } else {\n        let x_bytes: [u8; 32] = x.to_le_bytes();\n        let y_bytes: [u8; 32] = y.to_le_bytes();\n        let mut x_is_lt = false;\n        let mut done = false;\n        for i in 0..32 {\n            if (!done) {\n                let x_byte = x_bytes[32 - 1 - i] as u8;\n                let y_byte = y_bytes[32 - 1 - i] as u8;\n                let bytes_match = x_byte == y_byte;\n                if !bytes_match {\n                    x_is_lt = x_byte < y_byte;\n                    done = true;\n                }\n            }\n        }\n        x_is_lt\n    }\n}\n\nmod tests {\n    use crate::{panic::panic, runtime};\n    use super::field_less_than;\n\n    #[test]\n    // docs:start:to_be_bits_example\n    fn test_to_be_bits() {\n        let field = 2;\n        let bits: [u1; 8] = field.to_be_bits();\n        assert_eq(bits, [0, 0, 0, 0, 0, 0, 1, 0]);\n    }\n    // docs:end:to_be_bits_example\n\n    #[test]\n    // docs:start:to_le_bits_example\n    fn test_to_le_bits() {\n        let field = 2;\n        let bits: [u1; 8] = field.to_le_bits();\n        assert_eq(bits, [0, 1, 0, 0, 0, 0, 0, 0]);\n    }\n    // docs:end:to_le_bits_example\n\n    #[test]\n    // docs:start:to_be_bytes_example\n    fn test_to_be_bytes() {\n        let field = 2;\n        let bytes: [u8; 8] = field.to_be_bytes();\n        assert_eq(bytes, [0, 0, 0, 0, 0, 0, 0, 2]);\n        assert_eq(Field::from_be_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_be_bytes_example\n\n    #[test]\n    // docs:start:to_le_bytes_example\n    fn test_to_le_bytes() {\n        let field = 2;\n        let bytes: [u8; 8] = field.to_le_bytes();\n        assert_eq(bytes, [2, 0, 0, 0, 0, 0, 0, 0]);\n        assert_eq(Field::from_le_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_le_bytes_example\n\n    #[test]\n    // docs:start:to_be_radix_example\n    fn test_to_be_radix() {\n        // 259, in base 256, big endian, is [1, 3].\n        // i.e. 3 * 256^0 + 1 * 256^1\n        let field = 259;\n\n        // The radix (in this example, 256) must be a power of 2.\n        // The length of the returned byte array can be specified to be\n        // >= the amount of space needed.\n        let bytes: [u8; 8] = field.to_be_radix(256);\n        assert_eq(bytes, [0, 0, 0, 0, 0, 0, 1, 3]);\n        assert_eq(Field::from_be_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_be_radix_example\n\n    #[test]\n    // docs:start:to_le_radix_example\n    fn test_to_le_radix() {\n        // 259, in base 256, little endian, is [3, 1].\n        // i.e. 3 * 256^0 + 1 * 256^1\n        let field = 259;\n\n        // The radix (in this example, 256) must be a power of 2.\n        // The length of the returned byte array can be specified to be\n        // >= the amount of space needed.\n        let bytes: [u8; 8] = field.to_le_radix(256);\n        assert_eq(bytes, [3, 1, 0, 0, 0, 0, 0, 0]);\n        assert_eq(Field::from_le_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_le_radix_example\n\n    #[test(should_fail_with = \"radix must be greater than 1\")]\n    fn test_to_le_radix_1() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 2;\n            let _: [u8; 8] = field.to_le_radix(1);\n        } else {\n            panic(f\"radix must be greater than 1\");\n        }\n    }\n\n    // TODO: Update this test to account for the Brillig restriction that the radix must be greater than 2\n    //#[test]\n    //fn test_to_le_radix_brillig_1() {\n    //    // this test should only fail in constrained mode\n    //    if runtime::is_unconstrained() {\n    //        let field = 1;\n    //        let out: [u8; 8] = field.to_le_radix(1);\n    //        crate::println(out);\n    //        let expected = [0; 8];\n    //        assert(out == expected, \"unexpected result\");\n    //    }\n    //}\n\n    #[test(should_fail_with = \"radix must be a power of 2\")]\n    fn test_to_le_radix_3() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 2;\n            let _: [u8; 8] = field.to_le_radix(3);\n        } else {\n            panic(f\"radix must be a power of 2\");\n        }\n    }\n\n    #[test]\n    fn test_to_le_radix_brillig_3() {\n        // this test should only fail in constrained mode\n        if runtime::is_unconstrained() {\n            let field = 1;\n            let out: [u8; 8] = field.to_le_radix(3);\n            let mut expected = [0; 8];\n            expected[0] = 1;\n            assert(out == expected, \"unexpected result\");\n        }\n    }\n\n    #[test(should_fail_with = \"radix must be less than or equal to 256\")]\n    fn test_to_le_radix_512() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 2;\n            let _: [u8; 8] = field.to_le_radix(512);\n        } else {\n            panic(f\"radix must be less than or equal to 256\")\n        }\n    }\n\n    // TODO: Update this test to account for the Brillig restriction that the radix must be less than 512\n    //#[test]\n    //fn test_to_le_radix_brillig_512() {\n    //    // this test should only fail in constrained mode\n    //    if runtime::is_unconstrained() {\n    //        let field = 1;\n    //        let out: [u8; 8] = field.to_le_radix(512);\n    //        let mut expected = [0; 8];\n    //        expected[0] = 1;\n    //        assert(out == expected, \"unexpected result\");\n    //    }\n    //}\n\n    #[test]\n    unconstrained fn test_field_less_than() {\n        assert(field_less_than(0, 1));\n        assert(field_less_than(0, 0x100));\n        assert(field_less_than(0x100, 0 - 1));\n        assert(!field_less_than(0 - 1, 0));\n    }\n}\n"
     },
-    "260": {
+    "261": {
       "path": "/build-volume/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
       "source": "use crate::{\n    abis::{\n        contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n        function_selector::FunctionSelector,\n        log_hash::{LogHash, ScopedLogHash},\n        note_hash::ScopedNoteHash,\n        nullifier::ScopedNullifier,\n        private_log::{PrivateLog, PrivateLogData},\n        side_effect::{OrderedValue, scoped::Scoped},\n    },\n    address::{AztecAddress, EthAddress},\n    constants::{\n        FUNCTION_TREE_HEIGHT, GENERATOR_INDEX__NOTE_HASH_NONCE, GENERATOR_INDEX__OUTER_NULLIFIER,\n        GENERATOR_INDEX__SILOED_NOTE_HASH, GENERATOR_INDEX__UNIQUE_NOTE_HASH,\n    },\n    merkle_tree::root::root_from_sibling_path,\n    messaging::l2_to_l1_message::{L2ToL1Message, ScopedL2ToL1Message},\n    poseidon2::Poseidon2Sponge,\n    traits::{FromField, Hash, is_empty, ToField},\n    utils::field::field_from_bytes_32_trunc,\n};\nuse super::{constants::TWO_POW_64, utils::{arrays::array_concat, field::field_from_bytes}};\n\npub fn sha256_to_field<let N: u32>(bytes_to_hash: [u8; N]) -> Field {\n    let sha256_hashed = sha256::digest(bytes_to_hash);\n    let hash_in_a_field = field_from_bytes_32_trunc(sha256_hashed);\n\n    hash_in_a_field\n}\n\npub fn private_functions_root_from_siblings(\n    selector: FunctionSelector,\n    vk_hash: Field,\n    function_leaf_index: Field,\n    function_leaf_sibling_path: [Field; FUNCTION_TREE_HEIGHT],\n) -> Field {\n    let function_leaf_preimage = ContractClassFunctionLeafPreimage { selector, vk_hash };\n    let function_leaf = function_leaf_preimage.hash();\n    root_from_sibling_path(\n        function_leaf,\n        function_leaf_index,\n        function_leaf_sibling_path,\n    )\n}\n\npub fn compute_note_hash_nonce(first_nullifier_in_tx: Field, note_index_in_tx: u32) -> Field {\n    // Hashing the first nullifier with note index in tx is guaranteed to be unique (because all nullifiers are also\n    // unique).\n    poseidon2_hash_with_separator(\n        [first_nullifier_in_tx, note_index_in_tx as Field],\n        GENERATOR_INDEX__NOTE_HASH_NONCE,\n    )\n}\n\npub fn compute_unique_note_hash(nonce: Field, siloed_note_hash: Field) -> Field {\n    let inputs = [nonce, siloed_note_hash];\n    poseidon2_hash_with_separator(inputs, GENERATOR_INDEX__UNIQUE_NOTE_HASH)\n}\n\npub fn compute_siloed_note_hash(app: AztecAddress, note_hash: Field) -> Field {\n    poseidon2_hash_with_separator(\n        [app.to_field(), note_hash],\n        GENERATOR_INDEX__SILOED_NOTE_HASH,\n    )\n}\n\n/// Computes unique note hashes from siloed note hashes\npub fn compute_unique_siloed_note_hash(\n    siloed_note_hash: Field,\n    first_nullifier: Field,\n    note_index_in_tx: u32,\n) -> Field {\n    if siloed_note_hash == 0 {\n        0\n    } else {\n        let nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n        compute_unique_note_hash(nonce, siloed_note_hash)\n    }\n}\n\n/// Siloing in the context of Aztec refers to the process of hashing a note hash with a contract address (this way\n/// the note hash is scoped to a specific contract). This is used to prevent intermingling of notes between contracts.\npub fn silo_note_hash(note_hash: ScopedNoteHash) -> Field {\n    if note_hash.contract_address.is_zero() {\n        0\n    } else {\n        compute_siloed_note_hash(note_hash.contract_address, note_hash.value())\n    }\n}\n\npub fn compute_siloed_nullifier(app: AztecAddress, nullifier: Field) -> Field {\n    poseidon2_hash_with_separator(\n        [app.to_field(), nullifier],\n        GENERATOR_INDEX__OUTER_NULLIFIER,\n    )\n}\n\npub fn silo_nullifier(nullifier: ScopedNullifier) -> Field {\n    if nullifier.contract_address.is_zero() {\n        nullifier.value() // Return value instead of 0 because the first nullifier's contract address is zero.\n    } else {\n        compute_siloed_nullifier(nullifier.contract_address, nullifier.value())\n    }\n}\n\npub fn compute_siloed_private_log_field(contract_address: AztecAddress, field: Field) -> Field {\n    poseidon2_hash([contract_address.to_field(), field])\n}\n\npub fn silo_private_log(private_log: Scoped<PrivateLogData>) -> PrivateLog {\n    if private_log.contract_address.is_zero() {\n        private_log.inner.log\n    } else {\n        let mut fields = private_log.inner.log.fields;\n        fields[0] = compute_siloed_private_log_field(private_log.contract_address, fields[0]);\n        PrivateLog { fields }\n    }\n}\n\nfn compute_siloed_contract_class_log_hash(address: AztecAddress, log_hash: Field) -> Field {\n    accumulate_sha256([address.to_field(), log_hash])\n}\n\npub fn silo_contract_class_log_hash(log_hash: ScopedLogHash) -> Field {\n    if log_hash.contract_address.is_zero() {\n        0\n    } else {\n        compute_siloed_contract_class_log_hash(log_hash.contract_address, log_hash.value())\n    }\n}\n\npub fn merkle_hash(left: Field, right: Field) -> Field {\n    poseidon2_hash([left, right])\n}\n\npub fn compute_l2_to_l1_hash(\n    contract_address: AztecAddress,\n    recipient: EthAddress,\n    content: Field,\n    rollup_version_id: Field,\n    chain_id: Field,\n) -> Field {\n    let mut bytes: [u8; 160] = std::mem::zeroed();\n\n    let inputs =\n        [contract_address.to_field(), rollup_version_id, recipient.to_field(), chain_id, content];\n    for i in 0..5 {\n        // TODO are bytes be in fr.to_buffer() ?\n        let item_bytes: [u8; 32] = inputs[i].to_be_bytes();\n        for j in 0..32 {\n            bytes[32 * i + j] = item_bytes[j];\n        }\n    }\n\n    sha256_to_field(bytes)\n}\n\npub fn silo_l2_to_l1_message(\n    msg: ScopedL2ToL1Message,\n    rollup_version_id: Field,\n    chain_id: Field,\n) -> Field {\n    if msg.contract_address.is_zero() {\n        0\n    } else {\n        compute_l2_to_l1_hash(\n            msg.contract_address,\n            msg.message.recipient,\n            msg.message.content,\n            rollup_version_id,\n            chain_id,\n        )\n    }\n}\n\n// Computes sha256 hash of 2 input hashes.\n//\n// NB: This method now takes in two 31 byte fields - it assumes that any input\n// is the result of a sha_to_field hash and => is truncated\n//\n// TODO(Jan and David): This is used for the encrypted_log hashes.\n// Can we check to see if we can just use hash_to_field or pedersen_compress here?\n//\npub fn accumulate_sha256(input: [Field; 2]) -> Field {\n    // This is a note about the cpp code, since it takes an array of Fields\n    // instead of a U128.\n    // 4 Field elements when converted to bytes will usually\n    // occupy 4 * 32 = 128 bytes.\n    // However, this function is making the assumption that each Field\n    // only occupies 128 bits.\n    //\n    // TODO(David): This does not seem to be getting guaranteed anywhere in the code?\n    // Concatentate two fields into 32x2 = 64 bytes\n    // accumulate_sha256 assumes that the inputs are pre-truncated 31 byte numbers\n    let mut hash_input_flattened = [0; 64];\n    for offset in 0..input.len() {\n        let input_as_bytes: [u8; 32] = input[offset].to_be_bytes();\n        for byte_index in 0..32 {\n            hash_input_flattened[offset * 32 + byte_index] = input_as_bytes[byte_index];\n        }\n    }\n\n    sha256_to_field(hash_input_flattened)\n}\n\n// Computes the final logs hash for a tx.\npub fn compute_tx_logs_hash<let N: u32>(logs: [LogHash; N]) -> Field {\n    // Convert each field element into a byte array and append the bytes to `hash_input_flattened`\n    let mut hash_input_flattened = [0; N * 32];\n    for offset in 0..N {\n        // TODO: This is not checking that the decomposition is smaller than P\n        let input_as_bytes: [u8; 32] = logs[offset].value.to_be_radix(256);\n        for byte_index in 0..32 {\n            hash_input_flattened[offset * 32 + byte_index] = input_as_bytes[byte_index];\n        }\n    }\n    // Ideally we would push to a slice then hash, but there is no sha_slice\n    // Hardcode to 256 bytes for now\n    let mut hash = sha256_to_field(hash_input_flattened);\n    // Not having a 0 value hash for empty logs causes issues with empty txs\n    // used for padding. Returning early is currently unsupported.\n    // We always provide sorted logs here, so 0 being empty means all are empty.\n    if is_empty(logs[0]) {\n        hash = 0;\n    }\n    hash\n}\n\npub fn verification_key_hash<let N: u32>(key: [Field; N]) -> Field {\n    crate::hash::poseidon2_hash(key)\n}\n\n#[inline_always]\npub fn pedersen_hash<let N: u32>(inputs: [Field; N], hash_index: u32) -> Field {\n    std::hash::pedersen_hash_with_separator(inputs, hash_index)\n}\n\npub fn poseidon2_hash<let N: u32>(inputs: [Field; N]) -> Field {\n    std::hash::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n    T: ToField,\n{\n    let inputs_with_separator = array_concat([separator.to_field()], inputs);\n    poseidon2_hash(inputs_with_separator)\n}\n\n// Performs a fixed length hash with a subarray of the given input.\n// Useful for SpongeBlob in which we aborb M things and want to check it vs a hash of M elts of an N-len array.\n// Using stdlib poseidon, this will always absorb an extra 1 as a 'variable' hash, and not match spongeblob.squeeze()\n// or any ts implementation. Also checks that any remaining elts not hashed are empty.\n#[no_predicates]\npub fn poseidon2_hash_subarray<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n    let mut sponge = poseidon2_absorb_chunks(input, in_len, false);\n    sponge.squeeze()\n}\n\n// NB the below is the same as std::hash::poseidon2::Poseidon2::hash(), but replacing a range check with a bit check,\n// and absorbing in chunks of 3 below.\n#[no_predicates]\npub fn poseidon2_cheaper_variable_hash<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n    let mut sponge = poseidon2_absorb_chunks(input, in_len, true);\n    // In the case where the hash preimage is variable-length, we append `1` to the end of the input, to distinguish\n    // from fixed-length hashes. (the combination of this additional field element + the hash IV ensures\n    // fixed-length and variable-length hashes do not collide)\n    if in_len != N {\n        sponge.absorb(1);\n    }\n    sponge.squeeze()\n}\n\n// The below fn reduces gates of a conditional poseidon2 hash by approx 3x (thank you ~* Giant Brain Dev @IlyasRidhuan *~ for the idea)\n// Why? Because when we call stdlib poseidon, we call absorb for each item. When absorbing is conditional, it seems the compiler does not know\n// what cache_size will be when calling absorb, so it assigns the permutation gates for /each i/ rather than /every 3rd i/, which is actually required.\n// The below code forces the compiler to:\n//  - absorb normally up to 2 times to set cache_size to 1\n//  - absorb in chunks of 3 to ensure perm. only happens every 3rd absorb\n//  - absorb normally up to 2 times to add any remaining values to the hash\n// In fixed len hashes, the compiler is able to tell that it will only need to perform the permutation every 3 absorbs.\n// NB: it also replaces unnecessary range checks (i < thing) with a bit check (&= i != thing), which alone reduces the gates of a var. hash by half.\n\n#[no_predicates]\nfn poseidon2_absorb_chunks<let N: u32>(\n    input: [Field; N],\n    in_len: u32,\n    variable: bool,\n) -> Poseidon2Sponge {\n    let iv: Field = (in_len as Field) * TWO_POW_64;\n    let mut sponge = Poseidon2Sponge::new(iv);\n    // Even though shift is always 1 here, if we input in_len = 0 we get an underflow\n    // since we cannot isolate computation branches. The below is just to avoid that.\n    let shift = if in_len == 0 { 0 } else { 1 };\n    if in_len != 0 {\n        // cache_size = 0, init absorb\n        sponge.cache[0] = input[0];\n        sponge.cache_size = 1;\n        // shift = num elts already added to make cache_size 1 = 1 for a fresh sponge\n        // M = max_chunks = (N - 1 - (N - 1) % 3) / 3: (must be written as a fn of N to compile)\n        // max_remainder = (N - 1) % 3;\n        // max_chunks = (N - 1 - max_remainder) / 3;\n        sponge = poseidon2_absorb_chunks_loop::<N, (N - 1 - (N - 1) % 3) / 3>(\n            sponge,\n            input,\n            in_len,\n            variable,\n            shift,\n        );\n    }\n    sponge\n}\n\n// NB: If it's not required to check that the non-absorbed elts of 'input' are 0s, set skip_0_check=true\n#[no_predicates]\npub fn poseidon2_absorb_chunks_existing_sponge<let N: u32>(\n    in_sponge: Poseidon2Sponge,\n    input: [Field; N],\n    in_len: u32,\n    skip_0_check: bool,\n) -> Poseidon2Sponge {\n    let mut sponge = in_sponge;\n    // 'shift' is to account for already added inputs\n    let mut shift = 0;\n    // 'stop' is to avoid an underflow when inputting in_len = 0\n    let mut stop = false;\n    for i in 0..3 {\n        if shift == in_len {\n            stop = true;\n        }\n        if (sponge.cache_size != 1) & (!stop) {\n            sponge.absorb(input[i]);\n            shift += 1;\n        }\n    }\n    sponge = if stop {\n        sponge\n    } else {\n        // max_chunks = (N - (N % 3)) / 3;\n        poseidon2_absorb_chunks_loop::<N, (N - (N % 3)) / 3>(\n            sponge,\n            input,\n            in_len,\n            skip_0_check,\n            shift,\n        )\n    };\n    sponge\n}\n\n// The below is the loop to absorb elts into a poseidon sponge in chunks of 3\n// shift - the num of elts already absorbed to ensure the sponge's cache_size = 1\n// M - the max number of chunks required to absorb N things (must be comptime to compile)\n// NB: The 0 checks ('Found non-zero field...') are messy, but having a separate loop over N to check\n// for 0s costs 3N gates. Current approach is approx 2N gates.\n#[no_predicates]\nfn poseidon2_absorb_chunks_loop<let N: u32, let M: u32>(\n    in_sponge: Poseidon2Sponge,\n    input: [Field; N],\n    in_len: u32,\n    variable: bool,\n    shift: u32,\n) -> Poseidon2Sponge {\n    assert(in_len <= N, \"Given in_len to absorb is larger than the input array len\");\n    // When we have an existing sponge, we may have a shift of 0, and the final 'k+2' below = N\n    // The below avoids an overflow\n    let skip_last = 3 * M == N;\n    // Writing in_sponge: &mut does not compile\n    let mut sponge = in_sponge;\n    let mut should_add = true;\n    // The num of things left over after absorbing in 3s\n    let remainder = (in_len - shift) % 3;\n    // The num of chunks of 3 to absorb (maximum M)\n    let chunks = (in_len - shift - remainder) / 3;\n    for i in 0..M {\n        // Now we loop through cache size = 1 -> 3\n        should_add &= i != chunks;\n        // This is the index at the start of the chunk (for readability)\n        let k = 3 * i + shift;\n        if should_add {\n            // cache_size = 1, 2 => just assign\n            sponge.cache[1] = input[k];\n            sponge.cache[2] = input[k + 1];\n            // cache_size = 3 => duplex + perm\n            for j in 0..3 {\n                sponge.state[j] += sponge.cache[j];\n            }\n            sponge.state = std::hash::poseidon2_permutation(sponge.state, 4);\n            sponge.cache[0] = input[k + 2];\n            // cache_size is now 1 again, repeat loop\n        } else if (!variable) & (i != chunks) {\n            // if we are hashing a fixed len array which is a subarray, we check the remaining elts are 0\n            // NB: we don't check at i == chunks, because that chunk contains elts to be absorbed or checked below\n            let last_0 = if (i == M - 1) & (skip_last) {\n                0\n            } else {\n                input[k + 2]\n            };\n            let all_0 = (input[k] == 0) & (input[k + 1] == 0) & (last_0 == 0);\n            assert(all_0, \"Found non-zero field after breakpoint\");\n        }\n    }\n    // we have 'remainder' num of items left to absorb\n    should_add = true;\n    // below is to avoid overflows (i.e. if inlen is close to N)\n    let mut should_check = !variable;\n    for i in 0..3 {\n        should_add &= i != remainder;\n        should_check &= in_len - remainder + i != N;\n        if should_add {\n            // we want to absorb the final 'remainder' items\n            sponge.absorb(input[in_len - remainder + i]);\n        } else if should_check {\n            assert(input[in_len - remainder + i] == 0, \"Found non-zero field after breakpoint\");\n        }\n    }\n    sponge\n}\n\npub fn poseidon2_hash_with_separator_slice<T>(inputs: [Field], separator: T) -> Field\nwhere\n    T: ToField,\n{\n    let in_len = inputs.len() + 1;\n    let iv: Field = (in_len as Field) * TWO_POW_64;\n    let mut sponge = Poseidon2Sponge::new(iv);\n    sponge.absorb(separator.to_field());\n\n    for i in 0..inputs.len() {\n        sponge.absorb(inputs[i]);\n    }\n\n    sponge.squeeze()\n}\n\n#[no_predicates]\npub fn poseidon2_hash_bytes<let N: u32>(inputs: [u8; N]) -> Field {\n    let mut fields = [0; (N + 30) / 31];\n    let mut field_index = 0;\n    let mut current_field = [0; 31];\n    for i in 0..inputs.len() {\n        let index = i % 31;\n        current_field[index] = inputs[i];\n        if index == 30 {\n            fields[field_index] = field_from_bytes(current_field, false);\n            current_field = [0; 31];\n            field_index += 1;\n        }\n    }\n    if field_index != fields.len() {\n        fields[field_index] = field_from_bytes(current_field, false);\n    }\n    poseidon2_hash(fields)\n}\n\n#[test]\nfn poseidon_chunks_matches_fixed() {\n    let in_len = 501;\n    let mut input: [Field; 4096] = [0; 4096];\n    let mut fixed_input = [3; 501];\n    assert(in_len == fixed_input.len()); // sanity check\n    for i in 0..in_len {\n        input[i] = 3;\n    }\n    let sub_chunk_hash = poseidon2_hash_subarray(input, in_len);\n    let fixed_len_hash = std::hash::poseidon2::Poseidon2::hash(fixed_input, fixed_input.len());\n    assert(sub_chunk_hash == fixed_len_hash);\n}\n\n#[test]\nfn poseidon_chunks_matches_variable() {\n    let in_len = 501;\n    let mut input: [Field; 4096] = [0; 4096];\n    for i in 0..in_len {\n        input[i] = 3;\n    }\n    let variable_chunk_hash = poseidon2_cheaper_variable_hash(input, in_len);\n    let variable_len_hash = std::hash::poseidon2::Poseidon2::hash(input, in_len);\n    assert(variable_chunk_hash == variable_len_hash);\n}\n\n#[test]\nfn existing_sponge_poseidon_chunks_matches_fixed() {\n    let in_len = 501;\n    let mut input: [Field; 4096] = [0; 4096];\n    let mut fixed_input = [3; 501];\n    assert(in_len == fixed_input.len()); // sanity check\n    for i in 0..in_len {\n        input[i] = 3;\n    }\n    // absorb 250 of the 501 things\n    let empty_sponge = Poseidon2Sponge::new((in_len as Field) * TWO_POW_64);\n    let first_sponge = poseidon2_absorb_chunks_existing_sponge(empty_sponge, input, 250, true);\n    // now absorb the final 251 (since they are all 3s, im being lazy and not making a new array)\n    let mut final_sponge = poseidon2_absorb_chunks_existing_sponge(first_sponge, input, 251, true);\n    let fixed_len_hash = Poseidon2Sponge::hash(fixed_input, fixed_input.len());\n    assert(final_sponge.squeeze() == fixed_len_hash);\n}\n\n#[test]\nfn poseidon_chunks_empty_inputs() {\n    let in_len = 0;\n    let mut input: [Field; 4096] = [0; 4096];\n    let mut constructed_empty_sponge = poseidon2_absorb_chunks(input, in_len, true);\n    let mut first_sponge =\n        poseidon2_absorb_chunks_existing_sponge(constructed_empty_sponge, input, in_len, true);\n    assert(first_sponge.squeeze() == constructed_empty_sponge.squeeze());\n}\n\n#[test]\nfn smoke_sha256_to_field() {\n    let full_buffer = [\n        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n        25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n        48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70,\n        71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93,\n        94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112,\n        113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130,\n        131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148,\n        149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159,\n    ];\n    let result = sha256_to_field(full_buffer);\n\n    assert(result == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184c7);\n\n    // to show correctness of the current ver (truncate one byte) vs old ver (mod full bytes):\n    let result_bytes = sha256::digest(full_buffer);\n    let truncated_field = crate::utils::field::field_from_bytes_32_trunc(result_bytes);\n    assert(truncated_field == result);\n    let mod_res = result + (result_bytes[31] as Field);\n    assert(mod_res == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184e0);\n}\n\n#[test]\nfn compute_l2_l1_hash() {\n    // All zeroes\n    let hash_result =\n        compute_l2_to_l1_hash(AztecAddress::from_field(0), EthAddress::zero(), 0, 0, 0);\n    assert(hash_result == 0xb393978842a0fa3d3e1470196f098f473f9678e72463cb65ec4ab5581856c2);\n\n    // Non-zero case\n    let hash_result = compute_l2_to_l1_hash(\n        AztecAddress::from_field(1),\n        EthAddress::from_field(3),\n        5,\n        2,\n        4,\n    );\n    assert(hash_result == 0x3f88c1044a05e5340ed20466276500f6d45ca5603913b9091e957161734e16);\n}\n\n#[test]\nfn silo_l2_to_l1_message_matches_typescript() {\n    let version = 4;\n    let chainId = 5;\n\n    let hash = silo_l2_to_l1_message(\n        ScopedL2ToL1Message {\n            message: L2ToL1Message { recipient: EthAddress::from_field(1), content: 2, counter: 0 },\n            contract_address: AztecAddress::from_field(3),\n        },\n        version,\n        chainId,\n    );\n\n    // The following value was generated by `l2_to_l1_message.test.ts`\n    let hash_from_typescript = 0x00c6155d69febb9d5039b374dd4f77bf57b7c881709aa524a18acaa0bd57476a;\n\n    assert_eq(hash, hash_from_typescript);\n}\n"
     },
-    "277": {
+    "278": {
       "path": "/build-volume/noir-projects/noir-protocol-circuits/crates/types/src/poseidon2.nr",
       "source": "use crate::constants::TWO_POW_64;\n\n// NB: This is a clone of noir/noir-repo/noir_stdlib/src/hash/poseidon2.nr\n// It exists as we sometimes need to perform custom absorption, but the stdlib version\n// has a private absorb() method (it's also designed to just be a hasher)\n// Can be removed when standalone noir poseidon lib exists: See noir#6679\n\ncomptime global RATE: u32 = 3;\n\npub struct Poseidon2Sponge {\n    pub cache: [Field; 3],\n    pub state: [Field; 4],\n    pub cache_size: u32,\n    pub squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2Sponge {\n    #[no_predicates]\n    pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n        Poseidon2Sponge::hash_internal(input, message_size, message_size != N)\n    }\n\n    pub(crate) fn new(iv: Field) -> Poseidon2Sponge {\n        let mut result =\n            Poseidon2Sponge { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n        result.state[RATE] = iv;\n        result\n    }\n\n    fn perform_duplex(&mut self) {\n        // add the cache into sponge state\n        for i in 0..RATE {\n            // We effectively zero-pad the cache by only adding to the state\n            // cache that is less than the specified `cache_size`\n            if i < self.cache_size {\n                self.state[i] += self.cache[i];\n            }\n        }\n        self.state = std::hash::poseidon2_permutation(self.state, 4);\n    }\n\n    pub fn absorb(&mut self, input: Field) {\n        assert(!self.squeeze_mode);\n        if self.cache_size == RATE {\n            // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n            self.perform_duplex();\n            self.cache[0] = input;\n            self.cache_size = 1;\n        } else {\n            // If we're absorbing, and the cache is not full, add the input into the cache\n            self.cache[self.cache_size] = input;\n            self.cache_size += 1;\n        }\n    }\n\n    pub fn squeeze(&mut self) -> Field {\n        assert(!self.squeeze_mode);\n        // If we're in absorb mode, apply sponge permutation to compress the cache.\n        self.perform_duplex();\n        self.squeeze_mode = true;\n\n        // Pop one item off the top of the permutation and return it.\n        self.state[0]\n    }\n\n    fn hash_internal<let N: u32>(\n        input: [Field; N],\n        in_len: u32,\n        is_variable_length: bool,\n    ) -> Field {\n        let iv: Field = (in_len as Field) * TWO_POW_64;\n        let mut sponge = Poseidon2Sponge::new(iv);\n        for i in 0..input.len() {\n            if i < in_len {\n                sponge.absorb(input[i]);\n            }\n        }\n\n        // In the case where the hash preimage is variable-length, we append `1` to the end of the input, to distinguish\n        // from fixed-length hashes. (the combination of this additional field element + the hash IV ensures\n        // fixed-length and variable-length hashes do not collide)\n        if is_variable_length {\n            sponge.absorb(1);\n        }\n        sponge.squeeze()\n    }\n}\n"
     },
-    "307": {
+    "308": {
       "path": "/build-volume/noir-projects/noir-protocol-circuits/crates/types/src/type_serialization.nr",
       "source": "use crate::traits::{Deserialize, Serialize};\n\nglobal BOOL_SERIALIZED_LEN: u32 = 1;\nglobal U8_SERIALIZED_LEN: u32 = 1;\nglobal U16_SERIALIZED_LEN: u32 = 1;\nglobal U32_SERIALIZED_LEN: u32 = 1;\nglobal U64_SERIALIZED_LEN: u32 = 1;\nglobal U128_SERIALIZED_LEN: u32 = 2;\nglobal FIELD_SERIALIZED_LEN: u32 = 1;\nglobal I8_SERIALIZED_LEN: u32 = 1;\nglobal I16_SERIALIZED_LEN: u32 = 1;\nglobal I32_SERIALIZED_LEN: u32 = 1;\nglobal I64_SERIALIZED_LEN: u32 = 1;\n\nimpl Serialize<BOOL_SERIALIZED_LEN> for bool {\n    fn serialize(self) -> [Field; BOOL_SERIALIZED_LEN] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize<BOOL_SERIALIZED_LEN> for bool {\n    fn deserialize(fields: [Field; BOOL_SERIALIZED_LEN]) -> bool {\n        fields[0] as bool\n    }\n}\n\nimpl Serialize<U8_SERIALIZED_LEN> for u8 {\n    fn serialize(self) -> [Field; U8_SERIALIZED_LEN] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize<U8_SERIALIZED_LEN> for u8 {\n    fn deserialize(fields: [Field; U8_SERIALIZED_LEN]) -> Self {\n        fields[0] as u8\n    }\n}\n\nimpl Serialize<U16_SERIALIZED_LEN> for u16 {\n    fn serialize(self) -> [Field; U16_SERIALIZED_LEN] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize<U16_SERIALIZED_LEN> for u16 {\n    fn deserialize(fields: [Field; U16_SERIALIZED_LEN]) -> Self {\n        fields[0] as u16\n    }\n}\n\nimpl Serialize<U32_SERIALIZED_LEN> for u32 {\n    fn serialize(self) -> [Field; U32_SERIALIZED_LEN] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize<U32_SERIALIZED_LEN> for u32 {\n    fn deserialize(fields: [Field; U32_SERIALIZED_LEN]) -> Self {\n        fields[0] as u32\n    }\n}\n\nimpl Serialize<U64_SERIALIZED_LEN> for u64 {\n    fn serialize(self) -> [Field; U64_SERIALIZED_LEN] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize<U64_SERIALIZED_LEN> for u64 {\n    fn deserialize(fields: [Field; U64_SERIALIZED_LEN]) -> Self {\n        fields[0] as u64\n    }\n}\n\nimpl Serialize<U128_SERIALIZED_LEN> for U128 {\n    fn serialize(self) -> [Field; U128_SERIALIZED_LEN] {\n        // We use little-endian ordering to match the order in which U128 defines its limbs.\n        // This is necessary because of how Noir handles serialization:\n        // - When calling a contract function from TypeScript, the serialization in encoder.ts gets used and then Noir\n        //   deserializes using its intrinsic serialization logic (based on the limb order in the struct).\n        // - When calling a contract function from another function, the `serialize` method is invoked on the type\n        //   first.\n        // For this reason if we didn't use the ordering of U128 limbs here and in encoder.ts we would get an arguments\n        // hash mismatch.\n        [self.lo, self.hi]\n    }\n}\n\nimpl Deserialize<U128_SERIALIZED_LEN> for U128 {\n    fn deserialize(fields: [Field; U128_SERIALIZED_LEN]) -> Self {\n        U128::from_u64s_le(fields[0] as u64, fields[1] as u64)\n    }\n}\n\nimpl Serialize<FIELD_SERIALIZED_LEN> for Field {\n    fn serialize(self) -> [Field; FIELD_SERIALIZED_LEN] {\n        [self]\n    }\n}\n\nimpl Deserialize<FIELD_SERIALIZED_LEN> for Field {\n    fn deserialize(fields: [Field; FIELD_SERIALIZED_LEN]) -> Self {\n        fields[0]\n    }\n}\n\nimpl Serialize<I8_SERIALIZED_LEN> for i8 {\n    fn serialize(self) -> [Field; I8_SERIALIZED_LEN] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize<I8_SERIALIZED_LEN> for i8 {\n    fn deserialize(fields: [Field; I8_SERIALIZED_LEN]) -> Self {\n        fields[0] as i8\n    }\n}\n\nimpl Serialize<I16_SERIALIZED_LEN> for i16 {\n    fn serialize(self) -> [Field; I16_SERIALIZED_LEN] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize<I16_SERIALIZED_LEN> for i16 {\n    fn deserialize(fields: [Field; I16_SERIALIZED_LEN]) -> Self {\n        fields[0] as i16\n    }\n}\n\nimpl Serialize<I32_SERIALIZED_LEN> for i32 {\n    fn serialize(self) -> [Field; I32_SERIALIZED_LEN] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize<I32_SERIALIZED_LEN> for i32 {\n    fn deserialize(fields: [Field; I32_SERIALIZED_LEN]) -> Self {\n        fields[0] as i32\n    }\n}\n\nimpl Serialize<I64_SERIALIZED_LEN> for i64 {\n    fn serialize(self) -> [Field; I64_SERIALIZED_LEN] {\n        [self as Field]\n    }\n}\n\nimpl Deserialize<I64_SERIALIZED_LEN> for i64 {\n    fn deserialize(fields: [Field; I64_SERIALIZED_LEN]) -> Self {\n        fields[0] as i64\n    }\n}\n\nimpl<T, let N: u32, let M: u32> Serialize<N * M> for [T; N]\nwhere\n    T: Serialize<M>,\n{\n    fn serialize(self) -> [Field; N * M] {\n        let mut result: [Field; N * M] = std::mem::zeroed();\n        let mut serialized: [Field; M] = std::mem::zeroed();\n        for i in 0..N {\n            serialized = self[i].serialize();\n            for j in 0..M {\n                result[i * M + j] = serialized[j];\n            }\n        }\n        result\n    }\n}\n\nimpl<T, let N: u32, let M: u32> Deserialize<N * M> for [T; N]\nwhere\n    T: Deserialize<M>,\n{\n    fn deserialize(fields: [Field; N * M]) -> Self {\n        let mut reader = crate::utils::reader::Reader::new(fields);\n        let mut result: [T; N] = std::mem::zeroed();\n        reader.read_struct_array::<T, M, N>(Deserialize::deserialize, result)\n    }\n}\n\n#[test]\nfn test_u16_serialization() {\n    let a: u16 = 10;\n    assert_eq(a, u16::deserialize(a.serialize()));\n}\n\n#[test]\nfn test_i8_serialization() {\n    let a: i8 = -10;\n    assert_eq(a, i8::deserialize(a.serialize()));\n}\n\n#[test]\nfn test_i16_serialization() {\n    let a: i16 = -10;\n    assert_eq(a, i16::deserialize(a.serialize()));\n}\n\n#[test]\nfn test_i32_serialization() {\n    let a: i32 = -10;\n    assert_eq(a, i32::deserialize(a.serialize()));\n}\n\n#[test]\nfn test_i64_serialization() {\n    let a: i64 = -10;\n    assert_eq(a, i64::deserialize(a.serialize()));\n}\n"
     },
-    "326": {
+    "327": {
       "path": "/build-volume/noir-projects/noir-protocol-circuits/crates/types/src/utils/reader.nr",
       "source": "pub struct Reader<let N: u32> {\n    data: [Field; N],\n    offset: u32,\n}\n\nimpl<let N: u32> Reader<N> {\n    pub fn new(data: [Field; N]) -> Self {\n        Self { data, offset: 0 }\n    }\n\n    pub fn read(&mut self) -> Field {\n        let result = self.data[self.offset];\n        self.offset += 1;\n        result\n    }\n\n    pub fn read_u32(&mut self) -> u32 {\n        self.read() as u32\n    }\n\n    pub fn read_bool(&mut self) -> bool {\n        self.read() as bool\n    }\n\n    pub fn read_array<let K: u32>(&mut self) -> [Field; K] {\n        let mut result = [0; K];\n        for i in 0..K {\n            result[i] = self.data[self.offset + i];\n        }\n        self.offset += K;\n        result\n    }\n\n    pub fn read_struct<T, let K: u32>(&mut self, deserialise: fn([Field; K]) -> T) -> T {\n        let result = deserialise(self.read_array());\n        result\n    }\n\n    pub fn read_struct_array<T, let K: u32, let C: u32>(\n        &mut self,\n        deserialise: fn([Field; K]) -> T,\n        mut result: [T; C],\n    ) -> [T; C] {\n        for i in 0..C {\n            result[i] = self.read_struct(deserialise);\n        }\n        result\n    }\n\n    pub fn finish(self) {\n        assert(self.offset == self.data.len(), \"Reader did not read all data\");\n    }\n}\n"
     },