npm - @aztec/protocol-contracts - Versions diffs - 0.87.1 → 0.87.2-nightly.20250524 - Mend

@aztec/protocol-contracts 0.87.1 → 0.87.2-nightly.20250524

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (9) hide show

package/artifacts/AuthRegistry.json +30 -30
package/artifacts/ContractClassRegisterer.json +15 -15
package/artifacts/ContractInstanceDeployer.json +25 -25
package/artifacts/FeeJuice.json +22 -22
package/artifacts/MultiCallEntrypoint.json +10 -10
package/artifacts/Router.json +15 -15
package/dest/protocol_contract_data.js +7 -7
package/package.json +4 -4
package/src/protocol_contract_data.ts +7 -7

package/artifacts/Router.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "transpiled": true,
-  "noir_version": "1.0.0-beta.5+0000000000000000000000000000000000000000",
+  "noir_version": "1.0.0-beta.6+0000000000000000000000000000000000000000",
   "name": "Router",
   "functions": [
     {
@@ -56,7 +56,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBLJwAABAMnAgMEAicCBAQAHwoAAwAEgEkdAIBJgEkCLgiASQABLgiASgACJQAAAFIlAAAAfSgCAAEEgEsnAgIEADsOAAIAASgAgEMCAAMoAIBEAgACKACARQIAASgAgEYCAAQoAIBHAgAGKACASAIABSYlAAADQR4CAAQBHgIABQAKKgQFBiQCAAYAAACeJQAAA2oeAgAECScCBQABCioEBQYkAgAGAAAAuiUAAAN8HgIABAUKKgQCBQwqBAIGCyIAAYBFAAInAgQBASQCAAIAAAMqIwAAAOMLIgABgEQABxYKBQgkAgAHAAADGCMAAAD8CyIAAYBDAAkkAgAJAAADBiMAAAERCyIAAYBGAAokAgAKAAAC7yMAAAEmCyIAAYBIAAoWCgYLJAIACgAAAtgjAAABPwsiAAGARwAIJAIACAAAAsYjAAABVCcCAQJJJwIIAm4nAgoCdicCCwJhJwIMAmwnAg0CaScCDgJkJwIPAiAnAhACbycCEQJwJwISAmUnAhMCcicCFAJ0LQgBFScCFgQSAAgBFgEnAxUEAQAiFQIWLQoWFy0OARcAIhcCFy0OCBcAIhcCFy0OChcAIhcCFy0OCxcAIhcCFy0ODBcAIhcCFy0ODRcAIhcCFy0ODhcAIhcCFy0ODxcAIhcCFy0OEBcAIhcCFy0OERcAIhcCFy0OEhcAIhcCFy0OExcAIhcCFy0OCxcAIhcCFy0OFBcAIhcCFy0ODRcAIhcCFy0OEBcAIhcCFy0OCBcnAgEBACcCCAQACioBBAokAgAKAAACvScCCwQTLQgBDCcCDQQTAAgBDQEtCgwNKgMADQUT5jKZ5RcUCQAiDQINACIVAg4nAg8EES4CAA6AAy4CAA2ABC4CAA+ABSUAAAOOJwIOBBEAKg0ODS0OCA0AIg0CDTwOCwwtCgEGIwAAAs8tCgsGIwAAAs8tCgYFIwAAAuYEKgsIAS0KAQUjAAAC5i0KBQkjAAAC/RIqBgUBLQoBCSMAAAL9LQoJByMAAAMPLQoGByMAAAMPLQoHAiMAAAMhLQoIAiMAAAMhLQoCAyMAAAMzLQoFAyMAAAMzJAIAAwAAA0AlAAAD1CYoAIAEBHgADQAAAIAEgAMkAIADAAADaSoBAAEF96Hzr6Wt1Mo8BAIBJioBAAEFce1fE3G+NAY8BAIBJioBAAEFkKJCubMVTz48BAIBJgEAgAOABYAHLgCAA4AILgCABIAJCwCACIAHgAokAIAKAAAD0y4BgAiABi4EgAaACQEAgAgAAoAIAQCACQACgAkjAAADoiYqAQABBR8gi4cBmc/9PAQCASY=",
-      "debug_symbols": "nZfRbuIwEEX/Jc882GOPZ8yvrKqK0rRCigClsNKq4t93DL4BKjmq8oJvrvHxjD024bt779/On6+7/cfhq1v/+e7ext0w7D5fh8N2c9od9uZ+d658+GBNWFnL3TpZG+1ZSsu3lkNttVt7ZyKZ4X0RWoXAUQ+RTEQTuTgFm80h6yJnDpEJEhM2M5WZyb5MTCbYRAGSjaIcb13BlS4LI/hcRYnzJrgKhsNwEpwER+AIHIWjcDKcXJ3oHMTk1DCijxBwCA7BCQFCqogEkapgD4EpEHxMACYABUDRKhRAxRQZwFynYGTByIKRBSML9hXIFCAqkANBABg9BIDYAmYAGVMkABOmEAAFU5T6oVxEqiLDydVJLkLkKnyA0CoIzjX4Iq7VchVcBcNhOMlDYJSAIyArHIWTCaKOErKuYCdFyp4Gq3ktteGtsLXE4/lyWXU4ia+nse/LQXw4mnZgj5ux35+69f48DKvu72Y4X7/0ddzsr+1pM1qvTdLv36014Mdu6Iu6rO6jXXuoJx+0DjfNaUJkeWL4NoOdIgKTOhESPRGoTVAuy3IlKAfXIsznkeieh1Irj9hmxOykIuzYpFYUPJNHjFhMtfO6LI/H/dDYymOWYTU8MaxWWwxtM8Ruz4qQIL6VSW4TMjkQMpEuWovnPHjJWqSAPfWJZSLw8wnxM8WZQkAUyX5lWon4MFMXokCoOlqyFqncKTUP0WYeM8UZMgorujvAK/+aEMuP8Y0QqE2QmaIIGlEU0ckD4xkxU5khKFYihPyA+HFfzZQm5Wk7gnvYjh8ImtsP7wTlbTprM5W59Zxuiyhx0Y6wn27eIIsI4uJ0zt2yGASE5JYR7ISBkJYRRFCZ6sIigkbEoNKOgeauTPz+yH0nYvh9CnEav3AR0hRB0h8H/MUeN9vd+PTmfymocbd5G/r6+HHebx96T/+O6ME/h+N42Pbv57EvpPvfB3sd+uPFr+zV/8Xe8l155LzyKZZHXx6Trry4l0sJ5j8=",
+      "debug_symbols": "nZfRbuIwEEX/Jc88eMYej82vrKqK0rRCigClsNKq4t93DL4BKjmq8oJvrvHxjD024bt779/On6+7/cfhq1v/+e7ext0w7D5fh8N2c9od9uZ+d658kLfGr6yVbh2tDfaspZVbK762qVuTMxHNICoiVaFwEkFEE8FELk7BZnPYutiZw2yC1YTNzGVmti+zsAkxUYBsoziHW5d3pcvC8JSrKHHehFQhcAROhBPhKByFk+AkOBlOrk5wDmJyahiBAgQchsNwvIfQKgJDxCqEIDAFgg8RwAigAqipigRgwhQZwFynEGQhyEKQhSALoQoU9hAVKJ4hAAwEASC2QARAwRQRwIgpFEDFFKV+OBcRq8hwcnWiCxC5CvIQqQqGcw2+iGu1XIVUIXAETiQIjFJwFOQEJ8HJDFFHKVuXt5OiZU+91XwqtUFW2KnEQ3K5rDqcxNfT2PflID4cTTuwx83Y70/den8ehlX3dzOcr1/6Om721/a0Ga3XJun379Ya8GM39EVdVvfRrj2UmHyqw01LnBBZnxjUZohTRGAyTYTITwRuE5I4qoQkFFuE+Twi3/NI3MojtBkhZa2IkF0zCpnJI/iAPIK4ZXk87kcKrTxmGVbDE8NqtcVIbYb6AIR60VYmuU3IlLCamWnZWjznIUvWInpEQfEhD3k+ITRTnNEzoojeSysR8jN1oRFRJE1pyVrEcqfUPB7O2M88ZorTZxRWcHcAJfk1IZQf4xvBc5ugM2UlOpWV5PDAeEbMVKb3CSvhfb7vKP24r2ZKk3NCFN45biF4bj/Ihem+IRelmcrceoZpRzQs2hGh6eb1uoigLkzn3C2LQUGIbhnBjhUIcRlBFZWZnF9EsKt7OqHtGHjuykQ96H0ngv99ClM96cJFiFMEMf044C/2uNnuxqc3/0tBjbvN29DXx4/zfvvQe/p3RA/+ORzHw7Z/P499Id3/Ptjr0B+yo22v/i/2lu/Ko+QVxVAeqTzGtCJ1L5cSzH8=",
       "brillig_names": [
         "_check_block_number"
       ]
@@ -116,7 +116,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBLJwAABAMnAgMEAicCBAQAHwoAAwAEgEkdAIBJgEkCHQCASoBKBS4IgEkAAS4IgEoAAiUAAABZJQAAAIQoAgABBIBLJwICBAA7DgACAAEoAIBDAgADKACARAIAAigAgEUCAAEoAIBGAgAEKACARwIABigAgEgCAAUmJQAAA1IeAgAEAR4CAAUACioEBQYkAgAGAAAApSUAAAN7HgIABAknAgUAAQoqBAUGJAIABgAAAMElAAADjR4CAAQGHAoEBQAcCgIEAAoqBQQCDCoFBAYLIgABgEUABCcCBQEBJAIABAAAAzsjAAAA9AsiAAGARAAHFgoCCCQCAAcAAAMpIwAAAQ0LIgABgEMACSQCAAkAAAMXIwAAASILIgABgEYACiQCAAoAAAMAIwAAATcLIgABgEgAChYKBgskAgAKAAAC6SMAAAFQCyIAAYBHAAgkAgAIAAAC1yMAAAFlJwIBAkknAggCbicCCgJ2JwILAmEnAgwCbCcCDQJpJwIOAmQnAg8CICcCEAJvJwIRAnAnAhICZScCEwJyJwIUAnQtCAEVJwIWBBIACAEWAScDFQQBACIVAhYtChYXLQ4BFwAiFwIXLQ4IFwAiFwIXLQ4KFwAiFwIXLQ4LFwAiFwIXLQ4MFwAiFwIXLQ4NFwAiFwIXLQ4OFwAiFwIXLQ4PFwAiFwIXLQ4QFwAiFwIXLQ4RFwAiFwIXLQ4SFwAiFwIXLQ4TFwAiFwIXLQ4LFwAiFwIXLQ4UFwAiFwIXLQ4NFwAiFwIXLQ4QFwAiFwIXLQ4IFycCAQEAJwIIBAAKKgEFCiQCAAoAAALOJwILBBMtCAEMJwINBBMACAENAS0KDA0qAwANBRPmMpnlFxQJACINAg0AIhUCDicCDwQRLgIADoADLgIADYAELgIAD4AFJQAAA58nAg4EEQAqDQ4NLQ4IDQAiDQINPA4LDC0KAQYjAAAC4C0KCwYjAAAC4C0KBgIjAAAC9wQqCwgBLQoBAiMAAAL3LQoCCSMAAAMOEioGAgEtCgEJIwAAAw4tCgkHIwAAAyAtCgYHIwAAAyAtCgcEIwAAAzItCggEIwAAAzItCgQDIwAAA0QtCgIDIwAAA0QkAgADAAADUSUAAAPlJigAgAQEeAANAAAAgASAAyQAgAMAAAN6KgEAAQX3ofOvpa3UyjwEAgEmKgEAAQWeScksjTulvTwEAgEmKgEAAQW6OL+KoDMf/zwEAgEmAQCAA4AFgAcuAIADgAguAIAEgAkLAIAIgAeACiQAgAoAAAPkLgGACIAGLgSABoAJAQCACAACgAgBAIAJAAKACSMAAAOzJioBAAEFdS4blGTo99s8BAIBJg==",
-      "debug_symbols": "nZfRbuIwEEX/Jc88eOyxPeZXVlVFaVohIUAprLSq+PedAd8EKjmq8kJuruPjGXtsku/uvX+7fL7uDh/Hr27957t7G3b7/e7zdX/cbs6740Hd787ZD4XcrcOqI/bdOtlV77Neo79fk6vX2K3JqchqEJmIVQgckSpKUMEmzImrzjtzkglzRAWp44MJdbw+7JlV2MM2treHU1Gho/uiQ3jtFYjuTYGsqagIqYqYq0geAk6Gk+EIHIFT4JTqsPMQcAgOwfFwfA2DA0HAYTgMJzoIhqjpcAoQUgWCZwTPAqAAWAAsEaICo2OICowUICowIouILCKyiKECIzsIABlDRAAjhsASRCxBzABmDCEACoYQAAuGsPoJWlHJ6ucu4BAcTxCpiuAgYhUMx4K/CauWm7BQ7wJOhpMxlqBXAadUcnYOYnRKFVR7ZbYmr8LWNGjNi9UGaWGLxUP5el112Juv56HvbWs+bFbdwqfN0B/O3fpw2e9X3d/N/nJ76Ou0Odyu582grbpB+8O7XhX4sdv3pq6rqbdrdyXdkVK7q45pRJT8xKA2Q2sMEaiUkZD8E8G3CRLtuLgRJAbXIsznkfyUh/hWHtxm6H7KFcGFUiuKOJMHMyZTOPGyPB7XQ7iVxywjJRoZSUKLIW1GDhErkkOmVialTSjegVC8l0Vz8ZxHXDAXJWNJS5nmMj7vD5opzaRnaiWkSM3SpDBTFcIIQiTFBTMxZUHOxVYac1PpwjiTjpcRpv1FzjenMrcRoaCy2U31QLquvyWwvQTcCcG3CXNVGYRREPoP/8B4PqtmZiIEQUUEfW2YEM9F6WdOTF8EyxHcw2T+RMzUpS5CjtOCFGmlMjuf43HFmRetSKTx6A95ESE7Hg8atyyGDEJyywjJ/p7vhLSMkDMqU1xYRBBGDJLbMYSZwszYoHlaCQ6/T4HH/gsnIY0RJPmxwV/0drPdDU8fI1dDDbvN276vtx+Xw/ah9fzvhBZ8zJyG47Z/vwy9kaYvGn0t/ENaB/qP+aJfIM5u9cCilO2W7FaituaXqwXzHw==",
+      "debug_symbols": "nVfRbuIwEPyXPPPgtb1em185VRWlaYWEAKVw0qni328XPAlUclTlBY/H8XjXnjXJd/fev10+X3eHj+NXt/7z3b0Nu/1+9/m6P243593xoOx35+yHgnTrsOoo+m6drNW+aMv+3iZXW+7W5BSIEkQGuIIMJucKSlAQDRjDq847Y5IBY7ICUsYHA8p4fdjHqMAetrW9PZyKAl3dF13C66xAdB8KZENFQUgVsFSQPAAYASNgMpgMpoAplYnOA4AhMATGg/E1jBgIAEwEE8GwA4gANZ2YAkCuAMFHBB8zBDMECwQLA1RBdhGgCjIFgCrIyIKRBSMLDlWQowOAYMQSDEHGEjgCxhGwQFCwRIZgxhIZggVLmH+COiqZf+4ADIHxBJAqCA6AK4hgLPgbMLfcgIV6B2AEjGCtjFkFOqUqi3MAI1MqoDpLog15BXamQT2fzRukxs4WD8n1uupQm6/noe+tNB+KVUv4tBn6w7lbHy77/ar7u9lfbg99nTaHW3veDDqqBdof3rVVwY/dvjd0XU2zXXsqaUXmOl0xp1GiyJMGtTXYCSJQmEeF5J8UfFshs6OqkJlSS2E+j+SnPLJv5RHbGjEXqRJaWs0oeCaPGCLy0HJflsfjeeTYymNWIyUaNVIOLY3c1pAQISF6x7YyKW2FQhm7WTwt24vnPHjBXhQZgyjTXvJzfdCMNZO6oiokds00KMy4Ilv1312h9l6wE1MW5By30pjbShfGnXRxmcJUX+R8cyulLREKnB3ddEuQnutvFaK9BNwVgm8rzLhS9C8JvuYHR1B+vqtmdiKE0RFBXxsmiWdT+pkb05eMKIJ72MyfEjO+1EOIDweSuJXK7H7G8UQkLjoRpvHqD7JIQVwcLxq3LAaBQnLLFNJYoCktUxCBM7MLixT0vwMK0o4hzBhT4AeZTiKG36cw+kkWbkIaI0j5R4G/aHez3Q1PHyNXkxp2m7d9X7sfl8P2YfT874QRfMychuO2f78MvSlNXzT6WviH1Af6j/miXyDOunphURLrknUz66i8XC2Y/w==",
       "brillig_names": [
         "_check_timestamp"
       ]
@@ -1728,7 +1728,7 @@
         }
       },
       "bytecode": "H4sIAAAAAAAA/+XdBXhT9x6H8bRpC8XdpYVtOCRN0ia4u7tDJUXGYNgG087d3Zkyd1fmG3P3jW3M3QW7399ILodDtue5tyfbfZ97nud9GuvJ538iTZOTczJ826d8v8+X6d9+OEP5Ez8zVZ7rtORP5+HsFJernuK0milOq53itLopTmuk+rpOa53icnkpTstPcVqbFKe1S3Fae1XVt/OUkfjZN/EzFCgMh+NFBfFgKFgcKIiVRCOBcKSkMBqMBiPRSFlBNBSKR8PRolhJrCgQC4ZD8WB5JBYqD2yfavl3zCtQqamgNJ3O2v+9M+Q+wWz1VJbDasthq2O5Jw93cByunbhM8vfq6HhdVU/V9+84PTllupZBoHJTsJ2Hy7OB3zuX8z5r883zpfc+29C7+2xJOp2NPHAWxeJlQV1jOp2N/3tn2H1CqsdWQ8djq9GfPM4aux5bTXS8qWqmmqd4bPldyyBQuSnYwcN5NfF7d9u08O5xmvK2aeG4PZo6DjdzHG7uum1a6ngr1doe64nbJst1u6Sa+nozjlDGX1xPZa/D/XjL8NYebO/dvALpMnZIgzEdzpb+9Dj/PXn9B7yBh08M+Wn6A56f+AOelTielWK5eH1DZvj+v+9wXjsbpPmB4ZUz1bx3edBV9oHiJbijLz0L1usxe/iACnaCjDnTwzF3hozZ7+GYu/xNYw5Ubgp29XD51YE8oXfzMZwBiDMIcRZAnCGIMwxxRiDOQoizCOKMQpwxiLM7xNkD4uwJcfaCOHtDnH0gzr4QZz+Isz/EOQDiHAhxDoI4B0OcQyDOoRDnMIhzOMQ5AuIcCXGOgjhHQ5xjIM6xEOc4iHM8xDkB4pwIcU6COCdDnFMgzqkQ5zSIczrEOQPinAlxzoI4Z0OccyDOuRBnMcRZAnGWQpxlEGcc4iyHOOdBnPMhzgUQ50KIc0+IcxHEuRfEuRjiXAJx7g1xLoU4l0GcyyHOFRDnSohzH4hzX4hzFcS5GuLcD+LcH+I8AOI8EOI8COI8GOKsgDgPgTgPhTgPgzgPhziPgDiPhDiPgjiPhjiPgTiPhTiPgziPhzhPgDhPhDhPgjhPhjhPgThPhThPgzhPhzjPgDjPhDjPgjjPhjjPgTjPhTjPgzjPhzgvgDgvhDgvgjjXQJwXQ5yXQJyXQpyXQZyXQ5xXQJxrIc4rIc6rIM6rIc5rIM5rIc7rIM7rIc4bIM4bIc6bIM6bIc5bIM5bIc7bIM7bIc47IM47Ic67IM67Ic57IM57Ic77IM77Ic4HIM51EOeDEOdDEOfDEOcjEOejEOdjEOfjEOcTEOeTEOd6iPMpiPNpiPMZiPNZiPM5iPN5iPMFiPNFiPMliPNliPMViPNViPM1iPN1iPMNiPNNiPMtiPNtiPMdiPNdiPM9iHMDxPk+xPkBxPkhxLkR4vwI4vwY4vwE4vwU4vwM4vwc4vwC4vwS4vwK4vwa4vwG4vwW4vwO4vwe4vwB4vwR4vwJ4vwZ4vwF4vwV4vwN4vwd4twEcW6GOLdAnFshzm0Qp82Q4MyAODMhTj/EmQVxZkOcORBnFYizKsSZC3FWgzirQ5w1IM6aEGctiLM2xFkH4qwLcdaDOOtDnA0gzoYQZyOIszHE2QTibApxNoM4m0OcLSDOlhBnK4izNcSZB3HmQ5xtIM62EOduEOfuEOceEGc7iLM9xNkB4uwIcXaCODtDnF0gzq4QZzeIMwBxBiHOAogzBHGGIc4IxFkIcRZBnFGIMwZxdoc4e6TJmelyhgKF4XC8qCAeDAWLAwWxkmgkEI6UFEaD0WAkGikriIZC8Wg4WhQriRUFYsFwKB4sj8RC5Yl5Z3g45p7/h2PuBbk/9s7wbvn91W0TqNwU7OOhs6X/77k/Bio3Bft6OOYGfsb9sR/kcdMf4hwAcQ6EOAdBnIMhziEQ51CIcxjEORziHAFxjoQ4R0GcoyHOMRDnWIhzHMQ5HuKcAHFOhDgnQZyTIc4pEOdUiHMaxDkd4pwBcc6EOGdBnLMhzjkQ51yIsxjiLIE4SyHOMogzDnGWQ5zzIM75EOcCiHMhxLknxLkI4twL4lwMcS6BOPeGOJdCnMsgzuUQ5wqIcyXEuQ/EuS/EuQriXA1x7gdx7g9xHgBxHghxHgRxHgxxVkCch0Cch0Kch0Gch0OcR0CcR0KcR0GcR0Ocx0Ccx0Kcx0Gcx0OcJ0CcJ0KcJ0GcJ0Ocp0Ccp0Kcp0Gcp0OcZ0CcZ0KcZ0GcZ0Oc50Cc50Kc50Gc50OcF0CcF0KcF0GcayDOiyHOSyDOSyHOyyDOyyHOKyDOtRDnlRDnVRDn1RDnNRDntRDndRDn9RDnDRDnjRDnTRDnzRDnLRDnrRDnbRDn7RDnHRDnnRDnXRDn3RDnPRDnvRDnfRDn/RDnAxDnOojzQYjzIYjzYYjzEYjzUYjzMYjzcYjzCYjzSYhzPcT5FMT5NMT5DMT5LMT5HMT5PMT5AsT5IsT5EsT5MsT5CsT5KsT5GsT5OsT5BsT5JsT5FsT5NsT5DsT5LsT5HsS5AeJ8H+L8AOL8EOLcCHF+BHF+DHF+AnF+CnF+BnF+DnF+AXF+CXF+BXF+DXF+A3F+C3F+B3F+D3H+AHH+CHH+BHH+DHH+AnH+CnH+BnH+DnFugjg3Q5xbIM6tEOc2iNOXyXBmQJyZEKcf4syCOLMhzhyIswrEWRXizIU4q0Gc1SHOGhBnTYizFsRZG+KsA3HWhTjrQZz1Ic4GEGdDiLMRxNkY4mwCcTaFOJtBnM0hzhYQZ0uIsxXE2RrizIM48yHONhBnW4hzN4hzd4hzD4izHcTZHuLsAHF2hDg7QZydIc4uEGdXiLMbxBmAOIMQZwHEGYI4wxBnBOIshDiLIM4oxBmDOLtDnD0gzp4QZy+IszfE2Qfi7Atx9oM4+0OcAyDOgRDnIIhzMMQ5BOIcCnEOgziHQ5wjIM6REOcoiHM0xDkG4hwLcY6DOMdDnBMgzokQ5ySIczLEOQXinApxToM4p0OcMyDOmRDnLIhzNsQ5B+KcC3EWQ5wlEGcpxFkGccYhznKIcx7EOR/iXABxLoQ494Q4F0Gce0GciyHOJRDn3hDnUohzGcS5HOJcAXGuhDj3gTj3hThXQZyrIc79IM79Ic4DIM4DIc6DIM6DIc4KiPMQiPNQiPMwiPNwiPMIiPNIiPMoiPNoiPMYiPNYiPM4iPN4iPMEiPNEiPMkiPNkiPMUiPNUiPM0iPN0iPMMiPNMiPMsiPNsiPMciPNciPM8iPN8iPMCiPNCiPMiiHMNxHkxxHkJxHkpxHkZxHk5xHkFxLkW4rwS4rwK4rwa4rwG4rwW4rwO4rwe4rwB4rwR4rwJ4rwZ4rwF4rwV4rwN4rwd4rwD4rwT4rwL4rwb4rwH4rwX4rwP4rwf4nwA4lwHcT4IcT4EcT4McT4CcT4KcT4GcT4OcT4BcT4Jca6HOJ+COJ+GOJ+BOJ+FOJ+DOJ+HOF+AOF+EOF+COF+GOF+BOF+FOF+DOF+HON+AON+EON+CON+GON+BON+FON+DODdAnO9DnB9AnB9CnBshzo8gzo8hzk8gzk/T5Mx0OUOBwnA4XlQQD4aCxYGCWEk0EghHSgqjwWgwEo2UFURDoXg0HC2KlcSKArFgOBQPlkdiofLEvNt5OObP/qYxByo3BT/P9G755fsZt3OWh8vvC8h9O9vDMX8JGXOOh2P+CjLmKh6O+WvImKt6OOZvIGPO9XDM30LGXM3DMX8HGXN1D8f8PWTMNTwc8w+QMdf0cMw/QsZcy8Mx/wQZc20Px/wzZMx1PBzzL5Ax1/VwzL9CxlzPwzH/BhlzfQ/H/DtkzA08HPMmyJgbejjmzZAxN/JwzFsgY27s4Zi3QsbcxMMxb4OMuamHY/ZB3vds5uGYMyBjbu7hmDMhY27h4Zj9kDG39HDMWZAxt/JwzNmQMbf2cMw5kDHneTjmKpAx53s45qqQMbfxcMy5kDG39XDM1SBj3s3DMVeHjHl3D8dcAzLmPTwcc00Px6xZ/bGOz8bEgDuqTqqz6qK6qm52PSqoCmxZqLCKqEJVpKIqprqrHqqn6qV6qz6JsfdT/dUANVANUoPVEDVUDVPD1Qg1Uo1So9UYNVaNU+PVBDVRTVKT1RQ1VU1T09UMNVPNUrPVHDVXFasSVarKVFyVq3lqvlqgFqo91SK1l1qslqi91VK1TC1XK9RKtY/aV61Sq9V+an91gDpQHaQOVhXqEHWoOkwdro5QR6qj1NHqGHWsOk4dr05QJ6qT1MnqFHWqOk2drs5QZ6qz1NnqHHWuOk+dry5QF6qL1Bp1sbpEXaouU5erK9RadaW6Sl2trlHXquvU9eoGdaO6Sd2sblG3qtvU7eoOdae6S92t7lH3qvvU/eoBtU49qB5SD6tH1KPqMfW4ekI9qdarp9TT6hn1rHpOPa9eUC+ql9TL6hX1qnpNva7eUG+qt9Tb6h31rnpPbVDvqw/Uh2qj+kh9rD5Rn6rP1OfqC/Wl+kp9rb5R36rv1PfqB/Wj+kn9rH5Rv6rf1O9qk9qstqitapuyB1mGylR+laWyVY6qoqqqXFVNVVc1VE1VS9VWdVRdVU/VVw1UQ9VINVZNVFPVTDVXLVRL1Uq1VnkqX7VRbdVuane1h2qn2qsOqqPqpDqrLqqr6qYCKqgKVEiFVUQVqiIVVTHVXfVQPVUv1Vv1UX1VP9VfDVAD1SA1WA1RQ9UwNVyNUCPVKDVajVFj1Tg1Xk1QE9UkNVlNUVPVNDVdzVAz1Sw1W81Rc1WxKlGlqkzFVbmap+arBWqh2lMtUnupxWqJ2lstVcvUcrVCrVT7qH3VKrVa7af2VweoA9VB6mBVoQ5Rh6rD1OHqCHWkOkodrY5Rx6rj1PHqBHWiOkmdrE5Rp6rT1OnqDHWmOkudrc5R56rz1PnqAnWhukitURerS9Sl6jJ1ubpCrVVXqqvU1eoada26Tl2vblA3qpvUzeoWdau6Td2u7lB3qrvU3eoeda+6T92vHlDr1IPqIfWwekQ9qh5Tj6sn1JNqvXpKPa2eUc+q59Tz6gX1onpJvaxeUa+q19Tr6g31pnpLva3eUe+q99QG9b76QH2oNqqP1MfqE/Wp+kx9rr5QX6qv1NfqG/Wt+k59r35QP6qf1M/qF/Wr+k39rjapzWqL2qq2KXtBkaEylV9lqWyVo6qoqipXVVPVVQ1VU9VStVUdVVfVU/VVA9VQNVKNVRPVVDVTzVUL1VK1Uq1VnspXbVRbtZvaXe2h2qn2qoPqqDqpzqqL6qq6qYAKqgIVUmEVUYWqSEVVTHVXPVRP1Uv1Vn1UX9VP9VcD1EA1SA1WQ9RQNUwNVyPUSDVKjVZj1Fg1To1XE9RENUlNVlPUVDVNTVcz1Ew1S81Wc9RcVaxKVKkqU3FVruap+WqBWqhsX/W2H3jbx7rtv9z2DW773bZ9Wtv+om1fzLafY9uHsO2f1/Z9a/uVtX222v5QbV+jth9P20em7X/S9u1YoWyfhLa/P9uXnu2nzvYBZ/tXs32X2X7BbJ9btj8r21eU7YfJ9nFk+w+yffPYfm9snzK2vxbbF4rtZ8T24WH7x7B9T9h+HWyfCbY/AtvWv21H37ZRb9t/t22rr1G2TXDb3rZty9q2E23bYLbtG9u2g227vLbNW9uerG2r1baDatsYte132rYxbbuTtk1H216ibYvQtvNn29Cz7dPZtt9su2q2zTLbHphta8u2Y2XbiLLtL9m2jdYp2yaPbe/GtiVj22mxbaDY9kVs2x22XQzb5oRtz8G2lWDbIbDv+Nv35+276fa9b/tOtX1f2b4LbN+zte+w2vdD7buX9r1G+86gfR/Pvutm3yOz72jZ95/su0UblH0nxr5vYt/lsNe79h0EW7/f1p239dJtPW1bB9rW47X1Wm09T1vv0dYDtPXibD0xW2/K1iOy9WpsPRNb78LWQ7DP5e1zavvc1j7HtM/17HMu+9zHPgexzwXsfXJ739jeR7X3Fe19Nnvfyd6Hsfcl7P90+7/V/o+z/2vsdX7m9pcOPltP2aaOvh1T4mnFZv3H+bZer63naut92nqQtl6grSdn643ZelS2XpGtZ2Prndh6GLZegn1Ob59b2+e49rmmfc5nn3vZ50D2uYh9TmDvm9v7yPa+qr3PaO+75al81UbZ/+32f6z9X2f/59i68+1VB9+uU6bjcL3Ez4Yb+zVdun7tIOflmv/JecnfjyV+5rpOz0gsj76J44HKTcFcx3y9nn80EI7l+naePPaHcn073388nn8kOf/s9Mz/j3WYbRpYsWP+zrEkr9fvupz7d+z8monDGb5dL5McRzruR7qd072c/n07V0nT/JPLLcex7PwpxpS8/pqu2yp5fqqfyXm5z0teVzVfWu/Dwb8am9OfvG/UcV3evQz+bF45/+G8/snb1LmsnbfpH5ep2HFepuu8LMd5Oa7zsit2HaP9ncpzXM79GMxynZe8n9g0tGLHPDo55tc5cTi5/NL53J2u5wyb6qfwO6/LpioVO5ZHctn4Hacll3nyNqjqvLzrvFzHeVkVO19PtcTxLMf1OOeVdGS7Lp98vVI78TPH8TvJ36+T4vpzXNe/kzvFae7lkpvi8rkpLm/30baJw9UT2X0o5Jjfnz1GnK9lkodr+3Z9Pkj+bpofzwVJa1YKq/P5JXn99pqwYeLw8hVLlsWHLR60Kl66csWCJYsHFJfOj/tck/PB57xjul+kOheAc6Cp5uF3/H6qyW6Q5IukrIqdf69v4vRAJaaiaCCQvO7kAyLb5fS5rj/bdflo4ng1x7iSPyvzBcPyouJgeai4vDhSXFYWLi2u55q/z7fjjmfLKfmiGf6iOPp3vShO04uxcHL+OemZf8oXxamecJL34cEVO5bl4IqdTcnLDHFcZojjMjb91Qtn9x9tmwa5znM+lga7znM+WSWv156A6/p2HE7e79P8Bz36T/5BT/7hST4h25NzXuLw4iUrFpSvHrR46cr4ynjZ2JUlixaUDl65uHT7E/WiRT7X5H7RneE6nuk67n5OzkoxH/fk/L0Mxxj+15+rmyWO/9PP1f8CyJrFgM8eAgA=",
-      "debug_symbols": "pZbdjvIgEIbvpcc9YIafAW/FGFO1u2nSVNPVTb4Y7/0bVn70ALarJ74tlYdheIG5Nod+d/ncDtPH8atZra/Nbh7Gcfjcjsd9dx6OE7deG+F/lG5W2DbK3IXuYu/iWG5tA/6PwC9w47fI2J7nvvdfHqA81Kmb++ncrKbLOLbNdzdefv70deqmHz13M38VbdNPB1YGfgxj759ube4tyl0VYehsUKXuIO1SgJYQAJpMBqjFEYCyMhBAOUoIflxIQK0oENAAlgiqQkAVc4hoMsE8p0GXCVI4HQgSuFuBYCp50KRNTIQmyouJFp8gVJkIYGQgKJ0Rzj0hbCUOtCkM3+0VhDR5SUEUEbWJ8DKkFaHyRGq2UBayLWTJFoCV3QHgAkKBzlEYWOxu+eDuB1/o5/0BFXOCMWkiYEhAhqg/QEhThlhRhFQsyssaF0USQMnkQFWXp5Tys8Siy6FmMKNtngwV3eGHetfnVcZCo/+SkYX7HvH9jY/y/YwsZfBB+BpjYVar+Vh4fvyyZ5xINrOSSnsGK1aVFJ2qJBTvx3oYVuWta50qhSFr55AzLh0ijoQtnWX+Oi+bTCuXXKapDKlGYiEtr3PGFCEVizgdb1tgx71Ut/DQsfIRDybzt8OG37r9MD9XeKB4ACaCDmqCkh+Y1Qb1hR5nEUVQCIpBpb+QWFVQXzRyWpF5/nxFCso86Rf7u5uHbjf2Pgof52Xax6D49fzvFL/EwvQ0H/f94TL3fgK5OuVx1wxWuOEguWWtodVmk2pS38QBIjf5HPwH",
+      "debug_symbols": "pZbdjvIgEIbvpcc9YAYYwFsxxlTtbpo01XR1ky/Ge/+GFUp7ANvVE6el8jA/LzD36tQebp/7bvg4f1Wb7b06jF3fd5/7/nxsrt154NF7JfyP0tUG60rR05insU/j2DzqCvwfgV/gwW+Rsb+Obeu/zKC81KUZ2+FabYZb39fVd9Pffv70dWmGH3ttRv4q6qodTmwZ+NH1rX961Gm2yE9VBsNkQjVNB2nXArSEANCGEkCt9gCUlYEAypkJwY8rCaiVCQQkwBxBFQioYg4RKRFomQadJ0jhdCBI4GkZAhXyoJ2NYQAJARMDLS4gphAIIMVAQOmEcG6BsAU/0EYE+GmvICSlkoLIIkqBcBmmiph8ICVZKAtJFjInC8DC7gBwAaFAJy8IVqtbztQ904Ve7g8oiBOIpkCAzEwYWv0BYnRSl7EiCylIlMsaiyINQE7kYIoq13Gr8TPJrMqhJDDSNgVjsurw1XtX50XGSqH/kpGV+x7x/Y2P8v2MrGXwQfgaY2VWi/lYeX78smfcpFWy0uT2DBakKk1UqpKQvR/LbliVBGKdyrkhS+eQIzcdIs4ImzvL/HWeF5lWblKZNnlI0RMLU3mdI8pCChJxOt62wIp7qW/hpWPnI2Yi87fDjt+aYzcuOzxQvAATQQdLwRq/MFsbrG/0OIsogoVgMVjpLyS2KljfNHJakXn+fEUTLPOkL/Z3M3bNoW+9F97P23CMTvHr9d8lfomN6WU8H9vTbWx9AKk75XW3DFa4Yyd5ZKuh1rSbelI/xA4iD/kc/Ac=",
       "brillig_names": [
         "store_in_execution_cache_oracle_wrapper",
         "notify_enqueued_public_function_call_wrapper"
@@ -3344,7 +3344,7 @@
         }
       },
       "bytecode": "H4sIAAAAAAAA/+XdBXhT9x6H8bRpC8XdpYVtOCRN0ia4u7tDJUXGYNgG087d3Zkyd1fmG3P3jW3M3QW7399ILodDtue5tyfbfZ97nud9GuvJ538iTZOTczJ826d8v8/n928/nKH8iZ+ZKs91WvKn83B2istVT3FazRSn1U5xWt0UpzVSfV2ntU5xubwUp+WnOK1NitPapTitvarqOq1DwuKcMhI/k6eHAoXhcLyoIB4MBYsDBbGSaCQQjpQURoPRYCQaKSuIhkLxaDhaFCuJFQViwXAoHiyPxELlge1TLf+OeQUqNRWUptNZ+793htwnmK2eynJYbTlsddwWWx23QfJw7cRlkr9XR8frqnqqvn/H6ckp07UMApWbgu08XJ4N/N65nPdZm2+eL7332Ybe3WdL0uls5IEzEi0uLyiOB9LpbPzfO8PuE1I9tho6HluN/uRx1tj12Gqi401VM9U8xWPL71oGgcpNwQ4ezquJ37vbpoV3j9OUt00Lx+3R1HG4meNwc9dt01LHW6nW9lhP3DZZrtsl1dTXm3GEMv7ieip7He7HW4a39mB77+aVNmOHNBjT4WzpT4/z35PXf8AbePjEkJ+mP+D5iT/gWYnjWSmWi9c3ZIbv//sO57WzQZofGF45U817lwddZR8oXoI7+tKzYL0es4cPqGAnyJgzPRxzZ8iY/R6OucvfNOZA5aZgVw+XXx3IE3o3H8MZgDiDEGcBxBmCOMMQZwTiLIQ4iyDOKMQZgzi7Q5w9IM6eEGcviLM3xNkH4uwLcfaDOPtDnAMgzoEQ5yCIczDEOQTiHApxDoM4h0OcIyDOkRDnKIhzNMQ5BuIcC3GOgzjHQ5wTIM6JEOckiHMyxDkF4pwKcU6DOKdDnDMgzpkQ5yyIczbEOQfinAtxFkOcJRBnKcRZBnHGIc5yiHMexDkf4lwAcS6EOPeEOBdBnHtBnIshziUQ594Q51KIcxnEuRziXAFxroQ494E494U4V0GcqyHO/SDO/SHOAyDOAyHOgyDOgyHOCojzEIjzUIjzMIjzcIjzCIjzSIjzKIjzaIjzGIjzWIjzOIjzeIjzBIjzRIjzJIjzZIjzFIjzVIjzNIjzdIjzDIjzTIjzLIjzbIjzHIjzXIjzPIjzfIjzAojzQojzIohzDcR5McR5CcR5KcR5GcR5OcR5BcS5FuK8EuK8CuK8GuK8BuK8FuK8DuK8HuK8AeK8EeK8CeK8GeK8BeK8FeK8DeK8HeK8A+K8E+K8C+K8G+K8B+K8F+K8D+K8H+J8AOJcB3E+CHE+BHE+DHE+AnE+CnE+BnE+DnE+AXE+CXGuhzifgjifhjifgTifhTifgzifhzhfgDhfhDhfgjhfhjhfgThfhThfgzhfhzjfgDjfhDjfgjjfhjjfgTjfhTjfgzg3QJzvQ5wfQJwfQpwbIc6PIM6PIc5PIM5PIc7PIM7PIc4vIM4vIc6vIM6vIc5vIM5vIc7vIM7vIc4fIM4fIc6fIM6fIc5fIM5fIc7fIM7fIc5NEOdmiHMLxLkV4twGcdoMCc4MiDMT4vRDnFkQZzbEmQNxVoE4q0KcuRBnNYizOsRZA+KsCXHWgjhrQ5x1IM66EGc9iLM+xNkA4mwIcTaCOBtDnE0gzqYQZzOIsznE2QLibAlxtoI4W0OceRBnPsTZBuJsC3HuBnHuDnHuAXG2gzjbQ5wdIM6OEGcniLMzxNkF4uwKcXaDOAMQZxDiLIA4QxBnGOKMQJyFEGcRxBmFOGMQZ3eIs0eanJkuZyhQGA7HiwriwVCwOFAQK4lGAuFISWE0GA1GopGygmgoFI+Go0WxklhRIBYMh+LB8kgsVJ6Yd4aHY+75fzjmXpD7Y+8M75bfX902gcpNwT4eOlv6/577Y6ByU7Cvh2Nu4GfcH/tBHjf9Ic4BEOdAiHMQxDkY4hwCcQ6FOIdBnMMhzhEQ50iIcxTEORriHANxjoU4x0Gc4yHOCRDnRIhzEsQ5GeKcAnFOhTinQZzTIc4ZEOdMiHMWxDkb4pwDcc6FOIshzhKIsxTiLIM44xBnOcQ5D+KcD3EugDgXQpx7QpyLIM69IM7FEOcSiHNviHMpxLkM4lwOca6AOFdCnPtAnPtCnKsgztUQ534Q5/4Q5wEQ54EQ50EQ58EQZwXEeQjEeSjEeRjEeTjEeQTEeSTEeRTEeTTEeQzEeSzEeRzEeTzEeQLEeSLEeRLEeTLEeQrEeSrEeRrEeTrEeQbEeSbEeRbEeTbEeQ7EeS7EeR7EeT7EeQHEeSHEeRHEuQbivBjivATivBTivAzivBzivALiXAtxXglxXgVxXg1xXgNxXgtxXgdxXg9x3gBx3ghx3gRx3gxx3gJx3gpx3gZx3g5x3gFx3glx3gVx3g1x3gNx3gtx3gdx3g9xPgBxroM4H4Q4H4I4H4Y4H4E4H4U4H4M4H4c4n4A4n4Q410OcT0GcT0Ocz0Ccz0Kcz0Gcz0OcL0CcL0KcL0GcL0Ocr0Ccr0Kcr0Gcr0Ocb0Ccb0Kcb0Gcb0Oc70Cc70Kc70GcGyDO9yHODyDODyHOjRDnRxDnxxDnJxDnpxDnZxDn5xDnFxDnlxDnVxDn1xDnNxDntxDndxDn9xDnDxDnjxDnTxDnzxDnLxDnrxDnbxDn7xDnJohzM8S5BeLcCnFugzh9mQxnBsSZCXH6Ic4siDMb4syBOKtAnFUhzlyIsxrEWR3irAFx1oQ4a0GctSHOOhBnXYizHsRZH+JsAHE2hDgbQZyNIc4mEGdTiLMZxNkc4mwBcbaEOFtBnK0hzjyIMx/ibANxtoU4d4M4d4c494A420Gc7SHODhBnR4izE8TZGeLsAnF2hTi7QZwBiDMIcRZAnCGIMwxxRiDOQoizCOKMQpwxiLM7xNkD4uwJcfaCOHtDnH0gzr4QZz+Isz/EOQDiHAhxDoI4B0OcQyDOoRDnMIhzOMQ5AuIcCXGOgjhHQ5xjIM6xEOc4iHM8xDkB4pwIcU6COCdDnFMgzqkQ5zSIczrEOQPinAlxzoI4Z0OccyDOuRBnMcRZAnGWQpxlEGcc4iyHOOdBnPMhzgUQ50KIc0+IcxHEuRfEuRjiXAJx7g1xLoU4l0GcyyHOFRDnSohzH4hzX4hzFcS5GuLcD+LcH+I8AOI8EOI8COI8GOKsgDgPgTgPhTgPgzgPhziPgDiPhDiPgjiPhjiPgTiPhTiPgziPhzhPgDhPhDhPgjhPhjhPgThPhThPgzhPhzjPgDjPhDjPgjjPhjjPgTjPhTjPgzjPhzgvgDgvhDgvgjjXQJwXQ5yXQJyXQpyXQZyXQ5xXQJxrIc4rIc6rIM6rIc5rIM5rIc7rIM7rIc4bIM4bIc6bIM6bIc5bIM5bIc7bIM7bIc47IM47Ic67IM67Ic57IM57Ic77IM77Ic4HIM51EOeDEOdDEOfDEOcjEOejEOdjEOfjEOcTEOeTEOd6iPMpiPNpiPMZiPNZiPM5iPN5iPMFiPNFiPMliPNliPMViPNViPM1iPN1iPMNiPNNiPMtiPNtiPMdiPNdiPM9iHMDxPk+xPkBxPkhxLkR4vwI4vwY4vwE4vw0Tc5MlzMUKAyH40UF8WAoWBwoiJVEI4FwpKQwGowGI9FIWUE0FIpHw9GiWEmsKBALhkPxYHkkFipPzLudh2P+7G8ac6ByU/DzTO+WX76fcTtnebj8voDct7M9HPOXkDHneDjmryBjruLhmL+GjLmqh2P+BjLmXA/H/C1kzNU8HPN3kDFX93DM30PGXMPDMf8AGXNND8f8I2TMtTwc80+QMdf2cMw/Q8Zcx8Mx/wIZc10Px/wrZMz1PBzzb5Ax1/dwzL9DxtzAwzFvgoy5oYdj3gwZcyMPx7wFMubGHo55K2TMTTwc8zbImJt6OGYf5H3PZh6OOQMy5uYejjkTMuYWHo7ZDxlzSw/HnAUZcysPx5wNGXNrD8ecAxlznodjrgIZc76HY64KGXMbD8ecCxlzWw/HXA0y5t08HHN1yJh393DMNSBj3sPDMdf0cMya1R/r+GxMDLij6qQ6qy6qq+pm16OCqsCWhQqriCpURSqqYqq76qF6ql6qt+qTGHs/1V8NUAPVIDVYDVFD1TA1XI1QI9UoNVqNUWPVODVeTVAT1SQ1WU1RU9U0NV3NUDPVLDVbzVFzVbEqUaWqTMVVuZqn5qsFaqHaUy1Se6nFaonaWy1Vy9RytUKtVPuofdUqtVrtp/ZXB6gD1UHqYFWhDlGHqsPU4eoIdaQ6Sh2tjlHHquPU8eoEdaI6SZ2sTlGnqtPU6eoMdaY6S52tzlHnqvPU+eoCdaG6SK1RF6tL1KXqMnW5ukKtVVeqq9TV6hp1rbpOXa9uUDeqm9TN6hZ1q7pN3a7uUHequ9Td6h51r7pP3a8eUOvUg+oh9bB6RD2qHlOPqyfUk2q9eko9rZ5Rz6rn1PPqBfWiekm9rF5Rr6rX1OvqDfWmeku9rd5R76r31Ab1vvpAfag2qo/Ux+oT9an6TH2uvlBfqq/U1+ob9a36Tn2vflA/qp/Uz+oX9av6Tf2uNqnNaovaqrYpe5BlqEzlV1kqW+WoKqqqylXVVHVVQ9VUtVRtVUfVVfVUfdVANVSNVGPVRDVVzVRz1UK1VK1Ua5Wn8lUb1VbtpnZXe6h2qr3qoDqqTqqz6qK6qm4qoIKqQIVUWEVUoSpSURVT3VUP1VP1Ur1VH9VX9VP91QA1UA1Sg9UQNVQNU8PVCDVSjVKj1Rg1Vo1T49UENVFNUpPVFDVVTVPT1Qw1U81Ss9UcNVcVqxJVqspUXJWreWq+WqAWqj3VIrWXWqyWqL3VUrVMLVcr1Eq1j9pXrVKr1X5qf3WAOlAdpA5WFeoQdag6TB2ujlBHqqPU0eoYdaw6Th2vTlAnqpPUyeoUdao6TZ2uzlBnqrPU2eocda46T52vLlAXqovUGnWxukRdqi5Tl6sr1Fp1pbpKXa2uUdeq69T16gZ1o7pJ3axuUbeq29Tt6g51p7pL3a3uUfeq+9T96gG1Tj2oHlIPq0fUo+ox9bh6Qj2p1qun1NPqGfWsek49r15QL6qX1MvqFfWqek29rt5Qb6q31NvqHfWuek9tUO+rD9SHaqP6SH2sPlGfqs/U5+oL9aX6Sn2tvlHfqu/U9+oH9aP6Sf2sflG/qt/U72qT2qy2qK1qm7IXFBkqU/lVlspWOaqKqqpyVTVVXdVQNVUtVVvVUXVVPVVfNVANVSPVWDVRTVUz1Vy1UC1VK9Va5al81Ua1Vbup3dUeqp1qrzqojqqT6qy6qK6qmwqooCpQIRVWEVWoilRUxVR31UP1VL1Ub9VH9VX9VH81QA1Ug9RgNUQNVcPUcDVCjVSj1Gg1Ro1V49R4NUFNVJPUZDVFTVXT1HQ1Q81Us9RsNUfNVcWqRJWqMhVX5Wqemq8WqIXK9lVv+4G3fazb/stt3+C2323bp7XtL9r2xWz7ObZ9CNv+eW3ft7ZfWdtnq+0P1fY1avvxtH1k2v4nbd+OFcr2SWj7+7N96dl+6mwfcLZ/Ndt3me0XzPa5Zfuzsn1F2X6YbB9Htv8g2zeP7ffG9ilj+2uxfaHYfkZsHx62fwzb94Tt18H2mWD7I7Bt/dt29G0b9bb9d9u2+hpl2wS37W3btqxtO9G2DWbbvrFtO9i2y2vbvLXtydq2Wm07qLaNUdt+p20b07Y7adt0tO0l2rYIbTt/tg092z6dbfvNtqtm2yyz7YHZtrZsO1a2jSjb/pJt22idsm3y2PZubFsytp0W2waKbV/Ett1h28WwbU7Y9hxsWwm2HQL7jr99f96+m27f+7bvVNv3le27wPY9W/sOq30/1L57ad9rtO8M2vfx7Ltu9j0y+46Wff/Jvlu0Qdl3Yuz7JvZdDnu9a99BsPX7bd15Wy/d1tO2daBtPV5br9XW87T1Hm09QFsvztYTs/WmbD0iW6/G1jOx9S5sPQT7XN4+p7bPbe1zTPtczz7nss997HMQ+1zA3ie3943tfVR7X9HeZ7P3nex9GHtfwv5Pt/9b7f84+7/GXudnbn/p4LP1lG3q6NsxJZ5WbNZ/nG/r9dp6rrbep60HaesF2npytt6YrUdl6xXZeja23omth2HrJdjn9Pa5tX2Oa59r2ud89rmXfQ5kn4vY5wT2vrm9j2zvq9r7jPa+W57KV22U/d9u/8fa/3X2f46tO99edfDtOmU6DtdP/Gy4sV/TpevXDnJersWfnJf8/VjiZ67r9IzE8uibOB6o3BTMdczX6/lHA+FYrm/nyWN/KNe38/3H4/lHkvPPTs/8/1iH2aaBFTvm7xxL8nr9rsu5f8fOr5k4nOHb9TLJcaTjfqTbOd3L6d+3c5U0zT+53HIcy86fYkzJ66/puq2S56f6mZyX+7zkdVXzpfU+HPyrsTn9yftGHdfl3cvgz+aV8x/O65+8TZ3L2nmb/nGZih3nZbrOy3Kcl+M6L7ti1zHa36k8x+Xcj8Es13nJ+4lNQyt2zKOTY36dE4eTyy+dz93pes6wqX4Kv/O6bKpSsWN5JJeN33Facpknb4Oqzsu7zst1nJdVsfP1VEscz3Jcj3NeSUe26/LJ1yu1Ez9zHL+T/P06Ka4/x3X9O7lTnOZeLrkpLp+b4vJ2H22bOFw9kd2HQo75/dljxPlaJnm4tm/X54Pk76b58VyQtGalsDqfX5LXb68JGyYOL1+xZFl82OJBq+KlK1csWLJ4QHHp/LjPNTkffM47pvtFqnMBOAeaah5+x++nmuwGSb5IyqrY+ff6Jk4PVGIqigYCyetOPiCyXU6f6/qzXZePJo5Xc4wr+bMyXzAsLyoOloeKy4sjxWVl4dLieq75+3w77ni2nJonDsNfFEf/rhfFaXoxFk7OPyc980/5ojjVE07yPjy4YseyHFyxsyl5mSGOywxxXMamv3rh7P6jbdMg13nOx9Jg13nOJ6vk9doTcF3fjsPJ+32a/6BH/8k/6Mk/PMknZHtyzkscXrxkxYLy1YMWL10ZXxkvG7uyZNGC0sErF5duf6JetMjnmtwvujNcxzNdx93PyVkp5uOenL+X4RjD//pzdbPE8X/6ufpfYGWiROMeAgA=",
-      "debug_symbols": "pZbdjvIgEIbvpcc9YIafAW/FGFO1u2nSVNPVTb4Y7/0bVn70ALarJ74tlYdheIG5Nod+d/ncDtPH8atZra/Nbh7Gcfjcjsd9dx6OE7deG+F/lG5W2DbK3IXuYu/iWG5tA/6PwC9w47fI2J7nvvdfHqA81Kmb++ncrKbLOLbNdzdefv70deqmHz13M38VbdNPB1YGfgxj759ube4tyl0VYehsUKXuIO1SgJYQAJpMBqjFEYCyMhBAOUoIflxIQK0oENAAlgiqQkAVc4hoMsE8p0GXCVI4HQgSuFuBYCp50KRNTIQmyouJFp8gVJkIYGQgKJ0Rzj0hbCUOtCkM3+0VhDR5SUEUEbWJ8DKkFaHyRGq2UBayLWTJFoCV3QHgAkKBzlEYWBoEyWgs++BM/bw7oGJNMCZNAwwJyBD1BwhpyhAripCKQXlR45JIAihZHKjq8ZRQfpZY9DjU7GW0zZOhojf8UO+6vMpYaPNfMrJw1yO+v+1Rvp+RpQw+Bl9jLMxqNR8LT49f9owTyWZWUmnPYMWqkqJTlYTi7VgPw6q8da1TpTBk7Y51xqVDxJGwpZPMX+Zlk2nlkss0lSHVSCyk5XXOmCKkYhGn410L7LiXqhYeOtY94sFk/m7Y8Fu3H+bn+g64tAMmgglKQa0fuL1XdKwofHZYISgGlUGVv45YdVBfK3JakXn+fEUblHnSL/Z3Nw/dbux9FD7Oy7SPQfHr+d8pfoll6Wk+7vvDZe79BHJtyuOvGaxww8Fyy1pDq80mVaS+iQNEbvI5+A8=",
+      "debug_symbols": "pZbdjvIgEIbvpcc9YAYYwFsxxlTtbpo01XTtJl+M9/4NKxR7ANvVE6el8jA/LzC36tQeps99N3ycv6rN9lYdxq7vu899fz421+488OitEv5H6WqDdaXoYczD2IdxbO51Bf6PwC9w57fI2F/HtvVfnqC81KUZ2+FabYap7+vqu+mnnz99XZrhx16bkb+KumqHE1sGfnR965/udZot8lOVwTCZUM3TQdq1AC0hALShBFCrPQBlZSCAcmZG8ONKAmplAgEJMEdQBQKqmENESgRapkHnCVI4HQgSeFqGQIU8aGdjGEBCwMxAiwuIKQQCSDEQUDohnFsgbMEPtBEBftorCEmppCCyiFIgXIa5IiYfSEkWykKShczJArCwOwBcQCjQyQuCtU4YGYVln5Spl7sDCtIEojkMIPMkC63+ADE6actYkYUUBMpFjSWRBiAncTBFjeuYD34mmdU4lORF2qZgTFYbvnbvqrzIWCnzXzKyctcjvr/tUb6fkbUMPgZfY6zMajEfK0+PX/aMm7VKVprcnsGCVKWJSlUSsrdj2Q2rkkCsUzk3ZOmOdeTmQ8QZYXMnmb/M8yLTys0q0yYPKXpiYS6vc0RZSEEiTse7FlhxL3UtvHTse8STyPzdsOO35tiNy/4OuLUDJgIFa4K1fuH60dGxReGzwxaCxWBlsMpfR2x1sL5X5LQi8/z5ijZY5klf7O9m7JpD33ovvJ/TcIxO8ev13yV+iW3pZTwf29M0tj6A1Jvy+lsGK9yxszyy1VBr2s0dqR9iB5GHfA7+Aw==",
       "brillig_names": [
         "store_in_execution_cache_oracle_wrapper",
         "notify_enqueued_public_function_call_wrapper"
@@ -3422,13 +3422,13 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBWJwAABAMnAgIEAScCAwQAHwoAAgADgFUuCIBVAAElAAAARSUAAADEKAIAAQSAVicCAgQAOw4AAgABKACAQwIAAygAgEQCAAIoAIBFAgABKACARgIABCgAgEcCAAYoAIBIAgAFKACASQEAACgAgEoEAAAoAIBLAQABKACATAQAASgAgE0EAAIoAIBOAgAgKACATwIAZSgAgFACAGwoAIBRAgBuKACAUgIAbygAgFMCAHIoAIBUAgB0JiUAAAWNKQIAAgBYryrgCioBAgMnAgQEACcCBgQDACoEBgUtCAECAAgBBQEnAwIEAQAiAgIFLQ4EBQAiBQIFLQ4EBScCBQQDACoCBQQnAgQAASQCAAMAAAEiIwAAAnEtCAEDJwIFBAMACAEFAScDAwQBACIDAgUfMIBNgEwABS0IAQUAAAECAS0OAwUtCAEDAAABAgEuDIBKAAMnAgcECC0IAAgtCgUJLQoDCgAIAAcAJQAABbYtAgAALQoJBgEiAAaATAAILQsIBxwKBwgCHAoIBgAcCgYHAicCCAQJLQgACS0KBQotCgMLAAgACAAlAAAFti0CAAAtCgoGASIABoBMAAUtCwUDHAoDBgUcCgYFAB4CAAMBHgIABgAKKgMGCCQCAAgAAAHxJQAABi0eAgADCQoqAwQGJAIABgAAAgglAAAGPx4CAAMGHAoDBgAnAggECS0IAAktCgYKLQoHCy0KBQwACAAIACUAAAZRLQIAAC0KCgMkAgADAAACRiUAAAi2LQsCAwAiAwIDLQ4DAgAiAgIGLQsGBScCBwQCACoGBwM7DgAFAAMjAAACcSkCAAMAee0WgQoqAQMFJAIABQAAAowjAAADvy0IAQMnAgUEAwAIAQUBJwMDBAEAIgMCBR8wgE2ATAAFLQgBBQAAAQIBLQ4DBS0IAQMAAAECAS4MgEoAAycCBwQILQgACC0KBQktCgMKAAgABwAlAAAFti0CAAAtCgkGASIABoBMAAgtCwgHHAoHCAIcCggGABwKBgcCJwIIBAktCAAJLQoFCi0KAwsACAAIACUAAAW2LQIAAC0KCgYBIgAGgEwABS0LBQMeAgAFAR4CAAYACioFBggkAgAIAAADUSUAAAjIHgIABQkKKgUEBiQCAAYAAANoJQAACNoeAgAEBScCBgQILQgACC0KBAktCgcKLQoDCwAIAAYAJQAABlEtAgAALQoJBSQCAAUAAAOhJQAACOwAIgICBS0LBQQnAgYEAgAqBQYDOw4ABAADIwAAA78nAgICVScCAwJrJwIEAncnAgUCcycCBgJjJwIHAnsnAggCfS0IAQknAgoEHAAIAQoBJwMJBAEAIgkCCi0KCgstDgILACILAgsuDIBRAAsAIgsCCy0OAwsAIgsCCy4MgFEACwAiCwILLgyAUgALACILAgstDgQLACILAgsuDIBRAAsAIgsCCy4MgE4ACwAiCwILLQ4FCwAiCwILLgyATwALACILAgsuDIBQAAsAIgsCCy4MgE8ACwAiCwILLQ4GCwAiCwILLgyAVAALACILAgsuDIBSAAsAIgsCCy4MgFMACwAiCwILLgyATgALACILAgstDgcLACILAgstDgULACILAgsuDIBPAAsAIgsCCy4MgFAACwAiCwILLgyATwALACILAgstDgYLACILAgsuDIBUAAsAIgsCCy4MgFIACwAiCwILLgyAUwALACILAgstDggLCyCASYBLAAIkAgACAAAFjCcCAwQeLQgBBCcCBQQeAAgBBQEtCgQFKgMABQUnRkiy9UEXvQAiBQIFACIJAgYnAgcEGy4CAAaAAy4CAAWABC4CAAeABSUAAAj+JwIGBBsAKgUGBS4MgEwABQAiBQIFLQ4BBQAiBQIFPA4DBCYoAIAEBHgADQAAAIAEgAMkAIADAAAFtSoBAAEF96Hzr6Wt1Mo8BAIBJiUAAAWNLQsBAy0LAgQNIgAEgE0ABSQCAAUAAAXYJQAACUQAIgMCBgAqBgQHLQsHBS0IAQYnAgcEAgAIAQcBJwMGBAEAIgYCBy0KBwgtDgUIASIABIBMAAUOKgQFByQCAAcAAAYgJQAACVYtDgMBLQ4FAi0KBgEmKgEAAQWeScksjTulvTwEAgEmKgEAAQW6OL+KoDMf/zwEAgEmJQAABY0KKgEDBQwqAQMGCyIAAoBFAAEkAgABAAAIqCMAAAZ1CyIAAoBEAAMWCgUHJAIAAwAACJYjAAAGjgsiAAKAQwAIJAIACAAACIQjAAAGowsiAAKARgAJJAIACQAACG0jAAAGuAsiAAKASAAJFgoGCiQCAAkAAAhWIwAABtELIgACgEcAByQCAAcAAAhEIwAABuYnAgICSScCBwJ2JwIJAmEnAgoCaScCCwJkJwIMAnAtCAENJwIOBBIACAEOAScDDQQBACINAg4tCg4PLQ4CDwAiDwIPLgyAUQAPACIPAg8tDgcPACIPAg8tDgkPACIPAg8uDIBQAA8AIg8CDy0OCg8AIg8CDy0OCw8AIg8CDy4MgE4ADwAiDwIPLgyAUgAPACIPAg8tDgwPACIPAg8uDIBPAA8AIg8CDy4MgFMADwAiDwIPLQ4JDwAiDwIPLgyAVAAPACIPAg8tDgoPACIPAg8uDIBSAA8AIg8CDy4MgFEADwsggEmASwACJAIAAgAACDknAgcEEy0IAQknAgoEEwAIAQoBLQoJCioDAAoFE+YymeUXFAkAIgoCCgAiDQILJwIMBBEuAgALgAMuAgAKgAQuAgAMgAUlAAAI/icCCwQRACoKCwouDIBKAAoAIgoCCjwOBwkuCIBJAAYjAAAITS0KCgYjAAAITS0KBgUjAAAIZAQqCgcCLQoCBSMAAAhkLQoFCCMAAAh7EioGBQItCgIIIwAACHstCggDIwAACI0tCgYDIwAACI0tCgMBIwAACJ8tCgcBIwAACJ8tCgEEIwAACLEtCgUEIwAACLEtCgQBJioBAAEFdS4blGTo99s8BAIBJioBAAEFce1fE3G+NAY8BAIBJioBAAEFkKJCubMVTz48BAIBJioBAAEFHyCLhwGZz/08BAIBJgEAgAOABYAHLgCAA4AILgCABIAJCwCACIAHgAokAIAKAAAJQy4BgAiABi4EgAaACQEAgAgAAoAIAQCACQACgAkjAAAJEiYqAQABBcVrxFoOEAACPAQCASYqAQABBUWnynEZQeQVPAQCASY=",
-      "debug_symbols": "tVlRbtw4DL3LfOfDkiiR6lWKokjT6SJAkATTZIFFkbsvKZHPkwI2Ui/2J3zmUE8kRVGy8+v0/fzt9a+v948/nn6ePn3+dfp2uX94uP/r68PT3e3L/dOjan+dFvuTl3T6lG5OOS0u6+lTVpkXl/5c/LmQyz4l+TP5cy0uZcqWXfKUXXnIJLnsQ5aFXPpz8ues46vJNmVJLqvLPqX5YbIqP5usLvuUrbjkKTm79GdJLnVcV9mLS/09LTcnWnKA0KRJQWlSUE4uq8s5NVnKhvRnKi6NSHNO5usEapE0S9QogGmaAjZNN2CJtumFHPQcwHJcbk7VfM1kgB2MZTUw1pUNmEYUjJXtBmqA7sA8nYAd1BSgOWihaTG8xXCOUTKLoEqbsieXOqRo4G1ZAlCA7iCFxhw2aek0WfOokGaemDRHhvRn9mf2Z5kV0kSmtBUekofkJbmclca+vOzLy7687MvLvrzsy8u+vOzLy5YzDZ5rddln3fBY3AFCw07BTiFOIT5196l7G1KW5LK6tGRpQsV8HcCctboR2zdWN2Ibx6pESnNAFKDPupFKs0rEfB2geQGJ7ZdSDdgUxmyLOkFzYHt7AgogE/SlBAhNygF8eM8UwNe+FwogDiy5E4TGXC0aRbe0ThAaDg2HRkIjoemhGa4qSMvwdSLoEnQJOmtNjlogy7IjDkSwI9hV2FXYNdg1zMGYl2EnsBPYddh1jyylhYDCLiGOlGCXYWetwFENRAkovE8VdhV2DXYNdpyBwvsk8ADepw4P4H3GKmR4n1MGCr6cYZdhVwgIfBSeZnifK+wq7BrsGHYcEWVJQPCgwyvbn0V7ahrH2UTD54k4kO1ORxhRoBu5H2gU+UB2rDqCrkE3Kn4gxlgBn2CODh08Heeao/CPUgKCnXWCWg1ZY3Vkh3AzZKs6kc3hyBqptictlwQEnV04qgxEQD1Qhi5DV6CzdjCR7a3aDdmqOqqBLEOOJBDHiDb270QaG5GhYoeKxdYs42RxzIPFfG6sLGTztnFtsbFsB+r4la3+qtUBW61NZHthopG1iaAT6AS6Dl0Pndjx6CiYJUGXoMvQjfxNFF5JKUA9EMGOYFdhZ71pIutNjmDHsGPYCewQkSAi6WHXlwwUfD0VINhl2CGOjjg64uiIoyOOjjjGGTFRgx3i6IhjnBMTCezsUKt5IJkoL6OKB7Kd4qgGygvQquuBRsVOxIEqdBW6UbsTYSyDTzCHQNeh6+FfWsK/NHZPGTd8m4Pe3m5O8T7w9eVyPtvrwNULgr42PN9ezo8vp0+Prw8PN6e/bx9eh9HP59vHIV9uL/qrZun8+F2lEv64fzgbertZRy/bQ4uWhI/W/scg6B9m0DbcnEGhHGDQvkfOYA1ti6HsMCzV2uGkWGpv4Gj5w17UFHlMVZYjcfQaudRC3sxl22aQFARSCOP1wPkwwcIg4E0C2Sbokp2g97QSlH6EgI8QWOeMLGrD/M8UtGxS7FV1SxJV3Zi21jLtFaXu+OBQXNei1MS8I6Ftkqp9xjkUylZdp7pTEzXF3tCDZdmk2A+l5TUUyZuh8DYJdRSnXlE2t2jaWVg9LCOjom/oB0O5XhWhzVB2SfRKApImZYskp20SLuhZXDhtBZPzzmbT4yp2m16+j+XjfSj1SD6022HTrwmt7/dK3qnRRj06X9M+vJmLvdYnhN4nrR7JxRqGvnjWrTh2s7ms+0RfSrcodo/TLOtx2jcPw71zSGdOqxe0udV2dpq+tuFUp6tc/N5Cd5PRCvLZKm8lo+xQtFIiEv3qtLmoZaeD6p0koS6uluRP9kjLONjb1RXn46ta1vrWF8m2uao77ZOjsK5uFlQ+7ECPqqJlDUDfLz5KQDnqgUreJKAdBv2EFKdy1zfdK473FDsts5Sr2+rV9SK9b1W00zJzRzmU5aocfqcou/uL67q/umyFspdOHGR0dbv4g/VYb6u18BECxqWbry4Ff+IBB4F+PD5C0GznT4J2iIDx5iFLOUIgFB4Ib3tQ0/+1K5kw/FgGGuZvcmhbV1zX69Ut5vcXhj0P8oIGXQ8RpJWgHSGoaG1t4UMe1CgjTed7gi/6eHt3f3n3f7s3o7rc3357OPvjj9fHu6tfX/55jl/i/37Pl6e78/fXy9mY1n/+6ReGz6Rf3InaF/3AobrPWZc0M9tjsl/1GwjV/OXNnPkX",
+      "debug_symbols": "tVnbbhs5DP0XP+dBF1Kk8itFUaSpuwhgOIGbLLAo8u9LSiTHDjCDdBb7Ep6hqTMkRVHS5Pfhx/H721/fns4/n38d7r/8Pny/PJ1OT399Oz0/Prw+PZ9F+/uQ9E9J+XCf7w4lJ5N4uC8iSzJpz9WeK5jsU4I9gz1jNclTtmKSpuzCAyrBZB+yJjBpz9mei4xHlW3Kmk2iyT6l+qEShZ9Uosk+ZasmaUoqJu2Zs0kZ10X2alJ+z+nuAKk4cE2eFJAnBZRsEk3OV4OmbEh7hmpSiSTnoL5OIBZZsgQNHKimCSDVdAWaaH09g4FeHGiO690B1dcCCsjAmFYFY15JgWpYwJjZrgAddAPq6QRkALODZqC5pvnw5sPJR/EsAuQ2Zc8mZUiVwFtKDsBBN5Bdow6r1HSqxDIqpKknKtWRIe2Z7JnsmWeFNOYpdYaHpCEpZZOz0siml2x6yaaXbHrJppdsesmml2x6SXMmwROiyT7rhsbkDuAaMgoyCjYKtld3e3VvQ3LKJtGkJksSyurrAOqs1g3rutG6YV04WiVcmwEAB33WDSPMKmH1dYBmBcS6Xioq0Fcos07qBM2Aru0JwAFP0FN14JpcHNjwXsCBzX2v4IANaHIncI26WiWKrmmdwDXkGnINu4Zd010zXBWQ0/B1otDl0OXQaWsy1Bxplg2RIwg7CDsMOwy7FnYt3kHxXgo7DjsOux523SLLOUEgt8sRR85hV8JOW4EhdAQ5kHufMeww7FrYtbCjEsi9zxwehPe5hwfhfYlZKOF9ySWQ85USdiXsKgQKPnBPS3hfMOww7FrYUdiRR1Q4BwoPenil67NKT81jO5to+DwROdLVaShG1NCN3A80inwg3VYNha6FblT8QBRjOfg43tFDF56Ofc2Q+wc5Bwo77QSIirSxGtJNuCnSWZ1I32FIG6m0JymXHCh0euBAHggCdUcldCV0NXTaDibStYVdkc6qIXSkGTLEjshHtLF+J5LYABRV3VQ0tqYZB41jbizqcyNhAX1vG8cWHUu6oY5fSesPtQ5Ia20iXQsTjaxNFDoOHYeuh667jnV7NOTMnEOXQ1dCN/I3kXvFtQbqjiDsIOww7LQ3TaS9yVDYUdhR2HHYRUQcEXF3u55KIOfruQYKuxJ2EUePOHrE0SOOHnH0iGPsERO1sIs4esQx9omJOOx0U8MyEE9U0qjigXSlGEJHJQVadN3RqNiJyBGGDkM3aneiGEvBx/EODl0PXXf/cnL/8lg9dZzw9R3w/n538PvAt9fL8ajXgasLglwbXh4ux/Pr4f78djrdHf5+OL0No18vD+chXx8u8qtk6Xj+IVIIfz6djore75bRaX1olaTa6FoLBUH/NEOROjMGgbyDQfoeGIM2tDWGusEg8+dh6H6+JKKVT3uB2fOYkdOeOOTc4wydV3PZ1hk4OwFXiPG1fZ4gURDQKgGvE3QuRtB7Xghq30NAewi0c3oWpWH+ZwpIqxRbVd30ZjarWu4ta3OZt4pSVrxzCMa2kNAtCayTyP3Rq1Igr9V1xo2akM3fiwJzW6XYDqWVJRQuq6HQOgnI5mMc0NO6HxsTy3KT91AA085QrmflemrpD0jkSBIkjesaScnrJHJtdQ6qSGvBlLKx2GTj99UmO82+fNyGgnvy0Snc6EtC8XatlI0abVIcxtAwrQZStlqfNAuvDanzPblYwpCLJ67FsZnNtKwTuZSuUWxup1Gesp321c1wax+SGyheebGazo2VJte22NXhKhcfW+hmMlqNfLarAv+QjLpBIbcBL84mt7K1QOpGB2VqsScS86410pbTRbtqwp+fVfkoGscshLY6qxvtk7ywaMkk1E870L2qIC0ByP3iswRQvB6gllUC2GAgpOh3eNUmMt9SbLTMWnk5rV4dL/Jtq4KNllk6uxc1Xa3QjxRb5aAflJb11XAtlK10QswHwZ75WE6reHXS+wMCikM31bTLA3KClnYRtGjYre0ikHu8r+xU9xAwxJZB6x5g/r9WJUUd0b4MtHh/413LGuO4jlenmI8Xhi0PSooGjbsI8kLQ9hBgtLaWaJcH6GUk6bwl+CqPD49Pl5v/270r1eXp4fvpaI8/386PV7++/vPiv/j//V4uz4/HH2+XozIt//yTLwxfQL64A7Sv8oFDdF+KTGkh0sesv8o3EMDy9V2d+Rc=",
       "brillig_names": [
         "public_dispatch"
       ]
     },
     {
-      "name": "sync_notes",
+      "name": "sync_private_state",
       "is_unconstrained": true,
       "custom_attributes": [
         "utility"
@@ -3446,7 +3446,7 @@
       "bytecode": "H4sIAAAAAAAA/7WTPQ+CMBCGi2KUjzjgoD+jBAyM+LG4OLpXCkpUSAB3frqQXENtwKjAJU17FJ5736OVUB0SzDLqEAyyglmBecTtj8vhQY67hakIdfvku9i2lQZ/Peq3FGBKw/Ax4w/UfzwFzr6o+bwXVndWDo1b66g+H0P5Z/9vSP+LD5418GpAXnmew/oS5Nt74t+Oz8c5SNnXTR1EgnIxdK5CSd0lcZ4SP99QmgZZJhJGDWTUQlU56pVE8YG26fmRdgrSLEpikSZ/Sav6yu6lXLyr8eA57hCOizHTMAb+BDV3X+b2+feXkKuCJ+bT+1Nn6BAztEhI1oRS2yeGwK+CP38vlizs4eEFAAA=",
       "debug_symbols": "nZPfioQgFIff5Vx3ofkn7VWGYbCyQRALpxaW6N1XB52pBZdlbjyZ5/v6VbrBoLv1fjNunB7QXjbovLHW3G926tViJhfuboDigAm0pAJMoWWhMGibUDi0ct8ryP23xWsd2w+CoJ2V126B1q3WVvCl7PpseszKPeuifFhFFWg3hBqEo7E6Xu3Vm0ZlFCNGecIx4oi9FLI5OXDZ0YhsEIi+eE5PfF3mWc0Sz9j7FTCR/w0gSJMDMFkKQMs8JTLxlIuPAgiaA0hRCsDLfPjuiec1/ySArOskkISVAog/Aoi8hxr06xdcw1T1xp+29h5V3qjO6jQdV9cfVpfvOa/kozH7qdfD6nU0Hc5HGC9YVDW57vFpPw==",
       "brillig_names": [
-        "sync_notes"
+        "sync_private_state"
       ]
     }
   ],
@@ -3581,12 +3581,12 @@
               "type": {
                 "fields": [],
                 "kind": "struct",
-                "path": "Router::sync_notes_parameters"
+                "path": "Router::sync_private_state_parameters"
               }
             }
           ],
           "kind": "struct",
-          "path": "Router::sync_notes_abi"
+          "path": "Router::sync_private_state_abi"
         }
       ]
     }
@@ -3610,7 +3610,7 @@
     },
     "18": {
       "path": "std/field/mod.nr",
-      "source": "pub mod bn254;\nuse crate::{runtime::is_unconstrained, static_assert};\nuse bn254::lt as bn254_lt;\n\nimpl Field {\n    /// Asserts that `self` can be represented in `bit_size` bits.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^{bit_size}`.\n    // docs:start:assert_max_bit_size\n    pub fn assert_max_bit_size<let BIT_SIZE: u32>(self) {\n        // docs:end:assert_max_bit_size\n        static_assert(\n            BIT_SIZE < modulus_num_bits() as u32,\n            \"BIT_SIZE must be less than modulus_num_bits\",\n        );\n        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"
+      "source": "pub mod bn254;\nuse crate::{runtime::is_unconstrained, static_assert};\nuse bn254::lt as bn254_lt;\n\nimpl Field {\n    /// Asserts that `self` can be represented in `bit_size` bits.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^{bit_size}`.\n    // docs:start:assert_max_bit_size\n    pub fn assert_max_bit_size<let BIT_SIZE: u32>(self) {\n        // docs:end:assert_max_bit_size\n        static_assert(\n            BIT_SIZE < modulus_num_bits() as u32,\n            \"BIT_SIZE must be less than modulus_num_bits\",\n        );\n        __assert_max_bit_size(self, BIT_SIZE);\n    }\n\n    /// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n    /// This 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 = __to_le_bits(self);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_le_bits();\n            assert(bits.len() <= p.len());\n            let mut ok = bits.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bits[N - 1 - i] != p[N - 1 - i]) {\n                        assert(p[N - 1 - i] == 1);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bits\n    }\n\n    /// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n    /// This array will be zero padded should not all bits be necessary to represent `self`.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting 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 = __to_be_bits(self);\n\n        if !is_unconstrained() {\n            // Ensure that the decomposition does not overflow the modulus\n            let p = modulus_be_bits();\n            assert(bits.len() <= p.len());\n            let mut ok = bits.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bits[i] != p[i]) {\n                        assert(p[i] == 1);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bits\n    }\n\n    /// Decomposes `self` into its little endian byte decomposition as a `[u8;N]` array\n    /// This array will be zero padded should not all bytes be necessary to represent `self`.\n    ///\n    /// # Failures\n    ///  The length N of the array must be big enough to contain all the bytes of the 'self',\n    ///  and no more than the number of bytes required to represent the field modulus\n    ///\n    /// # Safety\n    /// The result is ensured to be the canonical decomposition of the field element\n    // docs:start:to_le_bytes\n    pub fn to_le_bytes<let N: u32>(self: Self) -> [u8; N] {\n        // docs:end:to_le_bytes\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        // Compute the byte decomposition\n        let bytes = self.to_le_radix(256);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_le_bytes();\n            assert(bytes.len() <= p.len());\n            let mut ok = bytes.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bytes[N - 1 - i] != p[N - 1 - i]) {\n                        assert(bytes[N - 1 - i] < p[N - 1 - i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bytes\n    }\n\n    /// Decomposes `self` into its big endian byte decomposition as a `[u8;N]` array of length required to represent the field modulus\n    /// This array will be zero padded should not all bytes be necessary to represent `self`.\n    ///\n    /// # Failures\n    ///  The length N of the array must be big enough to contain all the bytes of the 'self',\n    ///  and no more than the number of bytes required to represent the field modulus\n    ///\n    /// # Safety\n    /// The result is ensured to be the canonical decomposition of the field element\n    // docs:start:to_be_bytes\n    pub fn to_be_bytes<let N: u32>(self: Self) -> [u8; N] {\n        // docs:end:to_be_bytes\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        // Compute the byte decomposition\n        let bytes = self.to_be_radix(256);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_be_bytes();\n            assert(bytes.len() <= p.len());\n            let mut ok = bytes.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bytes[i] != p[i]) {\n                        assert(bytes[i] < p[i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bytes\n    }\n\n    fn to_le_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n        // Brillig does not need an immediate radix\n        if !crate::runtime::is_unconstrained() {\n            static_assert(1 < radix, \"radix must be greater than 1\");\n            static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n            static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n        }\n        __to_le_radix(self, radix)\n    }\n\n    fn to_be_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n        // Brillig does not need an immediate radix\n        if !crate::runtime::is_unconstrained() {\n            static_assert(1 < radix, \"radix must be greater than 1\");\n            static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n            static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n        }\n        __to_be_radix(self, radix)\n    }\n\n    // Returns self to the power of the given exponent value.\n    // Caution: we assume the exponent fits into 32 bits\n    // using a bigger bit size impacts negatively the performance and should be done only if the exponent does not fit in 32 bits\n    pub fn pow_32(self, exponent: Field) -> Field {\n        let mut r: Field = 1;\n        let b: [u1; 32] = exponent.to_le_bits();\n\n        for i in 1..33 {\n            r *= r;\n            r = (b[32 - i] as Field) * (r * self) + (1 - b[32 - i] as Field) * r;\n        }\n        r\n    }\n\n    // Parity of (prime) Field element, i.e. sgn0(x mod p) = 0 if x `elem` {0, ..., p-1} is even, otherwise sgn0(x mod p) = 1.\n    pub fn sgn0(self) -> u1 {\n        self as u1\n    }\n\n    pub fn lt(self, another: Field) -> bool {\n        if crate::compat::is_bn254() {\n            bn254_lt(self, another)\n        } else {\n            lt_fallback(self, another)\n        }\n    }\n\n    /// Convert a little endian byte array to a field element.\n    /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n    pub fn from_le_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bytes[i] as Field) * v;\n            v = v * 256;\n        }\n        result\n    }\n\n    /// Convert a big endian byte array to a field element.\n    /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n    pub fn from_be_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bytes[N - 1 - i] as Field) * v;\n            v = v * 256;\n        }\n        result\n    }\n}\n\n#[builtin(apply_range_constraint)]\nfn __assert_max_bit_size(value: Field, bit_size: u32) {}\n\n// `_radix` must be less than 256\n#[builtin(to_le_radix)]\nfn __to_le_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n// `_radix` must be less than 256\n#[builtin(to_be_radix)]\nfn __to_be_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n/// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n/// This 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)]\nfn __to_le_bits<let N: u32>(value: Field) -> [u1; N] {}\n\n/// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n/// This array will be zero padded should not all bits be necessary to represent `self`.\n///\n/// # Failures\n/// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting 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)]\nfn __to_be_bits<let N: u32>(value: Field) -> [u1; N] {}\n\n#[builtin(modulus_num_bits)]\npub comptime fn modulus_num_bits() -> u64 {}\n\n#[builtin(modulus_be_bits)]\npub comptime fn modulus_be_bits() -> [u1] {}\n\n#[builtin(modulus_le_bits)]\npub comptime fn modulus_le_bits() -> [u1] {}\n\n#[builtin(modulus_be_bytes)]\npub comptime fn modulus_be_bytes() -> [u8] {}\n\n#[builtin(modulus_le_bytes)]\npub comptime fn modulus_le_bytes() -> [u8] {}\n\n/// An unconstrained only built in to efficiently compare fields.\n#[builtin(field_less_than)]\nunconstrained fn __field_less_than(x: Field, y: Field) -> bool {}\n\npub(crate) unconstrained fn field_less_than(x: Field, y: Field) -> bool {\n    __field_less_than(x, y)\n}\n\n// Convert a 32 byte array to a field element by modding\npub fn bytes32_to_field(bytes32: [u8; 32]) -> Field {\n    // Convert it to a field element\n    let mut v = 1;\n    let mut high = 0 as Field;\n    let mut low = 0 as Field;\n\n    for i in 0..16 {\n        high = high + (bytes32[15 - i] as Field) * v;\n        low = low + (bytes32[16 + 15 - i] as Field) * v;\n        v = v * 256;\n    }\n    // Abuse that a % p + b % p = (a + b) % p and that low < p\n    low + high * v\n}\n\nfn lt_fallback(x: Field, y: Field) -> bool {\n    if is_unconstrained() {\n        // Safety: unconstrained context\n        unsafe {\n            field_less_than(x, y)\n        }\n    } else {\n        let x_bytes: [u8; 32] = x.to_le_bytes();\n        let y_bytes: [u8; 32] = y.to_le_bytes();\n        let mut x_is_lt = false;\n        let mut done = false;\n        for i in 0..32 {\n            if (!done) {\n                let x_byte = x_bytes[32 - 1 - i] as u8;\n                let y_byte = y_bytes[32 - 1 - i] as u8;\n                let bytes_match = x_byte == y_byte;\n                if !bytes_match {\n                    x_is_lt = x_byte < y_byte;\n                    done = true;\n                }\n            }\n        }\n        x_is_lt\n    }\n}\n\nmod tests {\n    use crate::{panic::panic, runtime};\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"
     },
     "185": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/comparison.nr",
@@ -3618,7 +3618,7 @@
     },
     "282": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
-      "source": "use crate::{\n    abis::{\n        contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n        contract_class_log::ContractClassLog,\n        function_selector::FunctionSelector,\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        CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, FUNCTION_TREE_HEIGHT, GENERATOR_INDEX__NOTE_HASH_NONCE,\n        GENERATOR_INDEX__OUTER_NULLIFIER, GENERATOR_INDEX__SILOED_NOTE_HASH,\n        GENERATOR_INDEX__UNIQUE_NOTE_HASH, TWO_POW_64,\n    },\n    merkle_tree::root::root_from_sibling_path,\n    messaging::l2_to_l1_message::{L2ToL1Message, ScopedL2ToL1Message},\n    poseidon2::Poseidon2Sponge,\n    traits::{FromField, Hash, ToField},\n    utils::{arrays::array_concat, field::{field_from_bytes, field_from_bytes_32_trunc}},\n};\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::new(fields, private_log.inner.log.length)\n    }\n}\n\npub fn compute_siloed_contract_class_log_field(\n    contract_address: AztecAddress,\n    first_field: Field,\n) -> Field {\n    poseidon2_hash([contract_address.to_field(), first_field])\n}\n\npub fn silo_contract_class_log(contract_class_log: ContractClassLog) -> ContractClassLog {\n    if contract_class_log.contract_address.is_zero() {\n        contract_class_log\n    } else {\n        let mut log = contract_class_log;\n        log.log.fields[0] = compute_siloed_contract_class_log_field(\n            contract_class_log.contract_address,\n            log.log.fields[0],\n        );\n        log\n    }\n}\n\npub fn compute_contract_class_log_hash(log: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS]) -> Field {\n    poseidon2_hash(log)\n}\n\npub fn 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\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    poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n    T: ToField,\n{\n    let inputs_with_separator = 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 poseidon::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 = poseidon::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 = poseidon::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"
+      "source": "use crate::{\n    abis::{\n        contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n        contract_class_log::ContractClassLog,\n        function_selector::FunctionSelector,\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        CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, FUNCTION_TREE_HEIGHT, GENERATOR_INDEX__NOTE_HASH_NONCE,\n        GENERATOR_INDEX__OUTER_NULLIFIER, GENERATOR_INDEX__SILOED_NOTE_HASH,\n        GENERATOR_INDEX__UNIQUE_NOTE_HASH, TWO_POW_64,\n    },\n    merkle_tree::root::root_from_sibling_path,\n    messaging::l2_to_l1_message::{L2ToL1Message, ScopedL2ToL1Message},\n    poseidon2::Poseidon2Sponge,\n    traits::{FromField, Hash, ToField},\n    utils::{arrays::array_concat, field::{field_from_bytes, field_from_bytes_32_trunc}},\n};\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_nonce_and_unique_note_hash(\n    siloed_note_hash: Field,\n    first_nullifier: Field,\n    note_index_in_tx: u32,\n) -> Field {\n    let nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n    compute_unique_note_hash(nonce, siloed_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        compute_nonce_and_unique_note_hash(siloed_note_hash, first_nullifier, note_index_in_tx)\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::new(fields, private_log.inner.log.length)\n    }\n}\n\npub fn compute_siloed_contract_class_log_field(\n    contract_address: AztecAddress,\n    first_field: Field,\n) -> Field {\n    poseidon2_hash([contract_address.to_field(), first_field])\n}\n\npub fn silo_contract_class_log(contract_class_log: ContractClassLog) -> ContractClassLog {\n    if contract_class_log.contract_address.is_zero() {\n        contract_class_log\n    } else {\n        let mut log = contract_class_log;\n        log.log.fields[0] = compute_siloed_contract_class_log_field(\n            contract_class_log.contract_address,\n            log.log.fields[0],\n        );\n        log\n    }\n}\n\npub fn compute_contract_class_log_hash(log: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS]) -> Field {\n    poseidon2_hash(log)\n}\n\npub fn 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\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    poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n    T: ToField,\n{\n    let inputs_with_separator = 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 poseidon::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 = poseidon::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 = poseidon::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"
     },
     "299": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/poseidon2.nr",
@@ -3628,7 +3628,7 @@
       "path": "/home/aztec-dev/aztec-packages/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 = 1;\nglobal FIELD_SERIALIZED_LEN: u32 = 1;\nglobal I8_SERIALIZED_LEN: u32 = 1;\nglobal I16_SERIALIZED_LEN: u32 = 1;\nglobal I32_SERIALIZED_LEN: u32 = 1;\nglobal I64_SERIALIZED_LEN: u32 = 1;\n\nimpl Serialize<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        [self as Field]\n    }\n}\n\nimpl Deserialize<U128_SERIALIZED_LEN> for u128 {\n    fn deserialize(fields: [Field; U128_SERIALIZED_LEN]) -> Self {\n        fields[0] as u128\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"
     },
-    "358": {
+    "360": {
       "path": "/home/aztec-dev/aztec-packages/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"
     },
@@ -3650,7 +3650,7 @@
     },
     "62": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/public_context.nr",
-      "source": "use crate::context::gas::GasOpts;\nuse crate::hash::{\n    compute_l1_to_l2_message_hash, compute_l1_to_l2_message_nullifier, compute_secret_hash,\n};\nuse dep::protocol_types::abis::function_selector::FunctionSelector;\nuse dep::protocol_types::address::{AztecAddress, EthAddress};\nuse dep::protocol_types::constants::MAX_FIELD_VALUE;\nuse dep::protocol_types::traits::{Empty, FromField, Packable, Serialize, ToField};\n\npub struct PublicContext {\n    pub args_hash: Option<Field>,\n    pub compute_args_hash: fn() -> Field,\n}\n\nimpl PublicContext {\n    pub fn new(compute_args_hash: fn() -> Field) -> Self {\n        PublicContext { args_hash: Option::none(), compute_args_hash }\n    }\n\n    pub fn emit_public_log<T, let N: u32>(_self: &mut Self, log: T)\n    where\n        T: Serialize<N>,\n    {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { emit_public_log(Serialize::serialize(log).as_slice()) };\n    }\n\n    pub fn note_hash_exists(_self: Self, note_hash: Field, leaf_index: Field) -> bool {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { note_hash_exists(note_hash, leaf_index) } == 1\n    }\n\n    pub fn l1_to_l2_msg_exists(_self: Self, msg_hash: Field, msg_leaf_index: Field) -> bool {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { l1_to_l2_msg_exists(msg_hash, msg_leaf_index) } == 1\n    }\n\n    pub fn nullifier_exists(_self: Self, unsiloed_nullifier: Field, address: AztecAddress) -> bool {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { nullifier_exists(unsiloed_nullifier, address.to_field()) } == 1\n    }\n\n    pub fn consume_l1_to_l2_message(\n        &mut self,\n        content: Field,\n        secret: Field,\n        sender: EthAddress,\n        leaf_index: Field,\n    ) {\n        let secret_hash = compute_secret_hash(secret);\n        let message_hash = compute_l1_to_l2_message_hash(\n            sender,\n            self.chain_id(),\n            /*recipient=*/\n            self.this_address(),\n            self.version(),\n            content,\n            secret_hash,\n            leaf_index,\n        );\n        let nullifier = compute_l1_to_l2_message_nullifier(message_hash, secret);\n\n        assert(\n            !self.nullifier_exists(nullifier, self.this_address()),\n            \"L1-to-L2 message is already nullified\",\n        );\n        assert(\n            self.l1_to_l2_msg_exists(message_hash, leaf_index),\n            \"Tried to consume nonexistent L1-to-L2 message\",\n        );\n\n        self.push_nullifier(nullifier);\n    }\n\n    pub fn message_portal(_self: &mut Self, recipient: EthAddress, content: Field) {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { send_l2_to_l1_msg(recipient, content) };\n    }\n\n    pub unconstrained fn call_public_function(\n        _self: &mut Self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field],\n        gas_opts: GasOpts,\n    ) -> [Field] {\n        let calldata = args.push_front(function_selector.to_field());\n\n        call(\n            gas_opts.l2_gas.unwrap_or(MAX_FIELD_VALUE),\n            gas_opts.da_gas.unwrap_or(MAX_FIELD_VALUE),\n            contract_address,\n            calldata,\n        );\n        // Use success_copy to determine whether the call succeeded\n        let success = success_copy();\n\n        let result_data = returndata_copy(0, returndata_size());\n        if !success {\n            // Rethrow the revert data.\n            avm_revert(result_data);\n        }\n        result_data\n    }\n\n    pub unconstrained fn static_call_public_function(\n        _self: &mut Self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field],\n        gas_opts: GasOpts,\n    ) -> [Field] {\n        let calldata = args.push_front(function_selector.to_field());\n\n        call_static(\n            gas_opts.l2_gas.unwrap_or(MAX_FIELD_VALUE),\n            gas_opts.da_gas.unwrap_or(MAX_FIELD_VALUE),\n            contract_address,\n            calldata,\n        );\n        // Use success_copy to determine whether the call succeeded\n        let success = success_copy();\n\n        let result_data = returndata_copy(0, returndata_size());\n        if !success {\n            // Rethrow the revert data.\n            avm_revert(result_data);\n        }\n        result_data\n    }\n\n    pub fn push_note_hash(_self: &mut Self, note_hash: Field) {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { emit_note_hash(note_hash) };\n    }\n    pub fn push_nullifier(_self: &mut Self, nullifier: Field) {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { emit_nullifier(nullifier) };\n    }\n\n    pub fn this_address(_self: Self) -> AztecAddress {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            address()\n        }\n    }\n    pub fn msg_sender(_self: Self) -> AztecAddress {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            sender()\n        }\n    }\n    pub fn selector(_self: Self) -> FunctionSelector {\n        // The selector is the first element of the calldata when calling a public function through dispatch.\n        // Safety: AVM opcodes are constrained by the AVM itself\n        let raw_selector: [Field; 1] = unsafe { calldata_copy(0, 1) };\n        FunctionSelector::from_field(raw_selector[0])\n    }\n    pub fn get_args_hash(mut self) -> Field {\n        if !self.args_hash.is_some() {\n            self.args_hash = Option::some((self.compute_args_hash)());\n        }\n\n        self.args_hash.unwrap_unchecked()\n    }\n    pub fn transaction_fee(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            transaction_fee()\n        }\n    }\n\n    pub fn chain_id(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            chain_id()\n        }\n    }\n    pub fn version(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            version()\n        }\n    }\n    pub fn block_number(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            block_number()\n        }\n    }\n    pub fn timestamp(_self: Self) -> u64 {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            timestamp()\n        }\n    }\n    pub fn fee_per_l2_gas(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            fee_per_l2_gas()\n        }\n    }\n    pub fn fee_per_da_gas(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            fee_per_da_gas()\n        }\n    }\n\n    pub fn l2_gas_left(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            l2_gas_left()\n        }\n    }\n    pub fn da_gas_left(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            da_gas_left()\n        }\n    }\n    pub fn is_static_call(_self: Self) -> bool {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { is_static_call() } == 1\n    }\n\n    pub fn raw_storage_read<let N: u32>(_self: Self, storage_slot: Field) -> [Field; N] {\n        let mut out = [0; N];\n        for i in 0..N {\n            // Safety: AVM opcodes are constrained by the AVM itself\n            out[i] = unsafe { storage_read(storage_slot + i as Field) };\n        }\n        out\n    }\n\n    pub fn storage_read<T, let N: u32>(self, storage_slot: Field) -> T\n    where\n        T: Packable<N>,\n    {\n        T::unpack(self.raw_storage_read(storage_slot))\n    }\n\n    pub fn raw_storage_write<let N: u32>(_self: Self, storage_slot: Field, values: [Field; N]) {\n        for i in 0..N {\n            // Safety: AVM opcodes are constrained by the AVM itself\n            unsafe { storage_write(storage_slot + i as Field, values[i]) };\n        }\n    }\n\n    pub fn storage_write<T, let N: u32>(self, storage_slot: Field, value: T)\n    where\n        T: Packable<N>,\n    {\n        self.raw_storage_write(storage_slot, value.pack());\n    }\n}\n\n// Unconstrained opcode wrappers (do not use directly).\nunconstrained fn address() -> AztecAddress {\n    address_opcode()\n}\nunconstrained fn sender() -> AztecAddress {\n    sender_opcode()\n}\nunconstrained fn transaction_fee() -> Field {\n    transaction_fee_opcode()\n}\nunconstrained fn chain_id() -> Field {\n    chain_id_opcode()\n}\nunconstrained fn version() -> Field {\n    version_opcode()\n}\nunconstrained fn block_number() -> Field {\n    block_number_opcode()\n}\nunconstrained fn timestamp() -> u64 {\n    timestamp_opcode()\n}\nunconstrained fn fee_per_l2_gas() -> Field {\n    fee_per_l2_gas_opcode()\n}\nunconstrained fn fee_per_da_gas() -> Field {\n    fee_per_da_gas_opcode()\n}\nunconstrained fn l2_gas_left() -> Field {\n    l2_gas_left_opcode()\n}\nunconstrained fn da_gas_left() -> Field {\n    da_gas_left_opcode()\n}\nunconstrained fn is_static_call() -> Field {\n    is_static_call_opcode()\n}\nunconstrained fn note_hash_exists(note_hash: Field, leaf_index: Field) -> u1 {\n    note_hash_exists_opcode(note_hash, leaf_index)\n}\nunconstrained fn emit_note_hash(note_hash: Field) {\n    emit_note_hash_opcode(note_hash)\n}\nunconstrained fn nullifier_exists(nullifier: Field, address: Field) -> u1 {\n    nullifier_exists_opcode(nullifier, address)\n}\nunconstrained fn emit_nullifier(nullifier: Field) {\n    emit_nullifier_opcode(nullifier)\n}\nunconstrained fn emit_public_log(message: [Field]) {\n    emit_public_log_opcode(message)\n}\nunconstrained fn l1_to_l2_msg_exists(msg_hash: Field, msg_leaf_index: Field) -> u1 {\n    l1_to_l2_msg_exists_opcode(msg_hash, msg_leaf_index)\n}\nunconstrained fn send_l2_to_l1_msg(recipient: EthAddress, content: Field) {\n    send_l2_to_l1_msg_opcode(recipient, content)\n}\nunconstrained fn call(\n    l2_gas_allocation: Field,\n    da_gas_allocation: Field,\n    address: AztecAddress,\n    args: [Field],\n) {\n    call_opcode(l2_gas_allocation, da_gas_allocation, address, args)\n}\n\nunconstrained fn call_static(\n    l2_gas_allocation: Field,\n    da_gas_allocation: Field,\n    address: AztecAddress,\n    args: [Field],\n) {\n    call_static_opcode(l2_gas_allocation, da_gas_allocation, address, args)\n}\n\npub unconstrained fn calldata_copy<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {\n    calldata_copy_opcode(cdoffset, copy_size)\n}\n\n// `success_copy` is placed immediately after the CALL opcode to get the success value\nunconstrained fn success_copy() -> bool {\n    success_copy_opcode()\n}\n\nunconstrained fn returndata_size() -> u32 {\n    returndata_size_opcode()\n}\n\nunconstrained fn returndata_copy(rdoffset: u32, copy_size: u32) -> [Field] {\n    returndata_copy_opcode(rdoffset, copy_size)\n}\n\npub unconstrained fn avm_return(returndata: [Field]) {\n    return_opcode(returndata)\n}\n\n// This opcode reverts using the exact data given. In general it should only be used\n// to do rethrows, where the revert data is the same as the original revert data.\n// For normal reverts, use Noir's `assert` which, on top of reverting, will also add\n// an error selector to the revert data.\nunconstrained fn avm_revert(revertdata: [Field]) {\n    revert_opcode(revertdata)\n}\n\nunconstrained fn storage_read(storage_slot: Field) -> Field {\n    storage_read_opcode(storage_slot)\n}\n\nunconstrained fn storage_write(storage_slot: Field, value: Field) {\n    storage_write_opcode(storage_slot, value);\n}\n\nimpl Empty for PublicContext {\n    fn empty() -> Self {\n        PublicContext::new(|| 0)\n    }\n}\n\n// AVM oracles (opcodes) follow, do not use directly.\n#[oracle(avmOpcodeAddress)]\nunconstrained fn address_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodeSender)]\nunconstrained fn sender_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodeTransactionFee)]\nunconstrained fn transaction_fee_opcode() -> Field {}\n\n#[oracle(avmOpcodeChainId)]\nunconstrained fn chain_id_opcode() -> Field {}\n\n#[oracle(avmOpcodeVersion)]\nunconstrained fn version_opcode() -> Field {}\n\n#[oracle(avmOpcodeBlockNumber)]\nunconstrained fn block_number_opcode() -> Field {}\n\n#[oracle(avmOpcodeTimestamp)]\nunconstrained fn timestamp_opcode() -> u64 {}\n\n#[oracle(avmOpcodeFeePerL2Gas)]\nunconstrained fn fee_per_l2_gas_opcode() -> Field {}\n\n#[oracle(avmOpcodeFeePerDaGas)]\nunconstrained fn fee_per_da_gas_opcode() -> Field {}\n\n#[oracle(avmOpcodeL2GasLeft)]\nunconstrained fn l2_gas_left_opcode() -> Field {}\n\n#[oracle(avmOpcodeDaGasLeft)]\nunconstrained fn da_gas_left_opcode() -> Field {}\n\n#[oracle(avmOpcodeIsStaticCall)]\nunconstrained fn is_static_call_opcode() -> Field {}\n\n#[oracle(avmOpcodeNoteHashExists)]\nunconstrained fn note_hash_exists_opcode(note_hash: Field, leaf_index: Field) -> u1 {}\n\n#[oracle(avmOpcodeEmitNoteHash)]\nunconstrained fn emit_note_hash_opcode(note_hash: Field) {}\n\n#[oracle(avmOpcodeNullifierExists)]\nunconstrained fn nullifier_exists_opcode(nullifier: Field, address: Field) -> u1 {}\n\n#[oracle(avmOpcodeEmitNullifier)]\nunconstrained fn emit_nullifier_opcode(nullifier: Field) {}\n\n// TODO(#11124): rename unencrypted to public in avm\n#[oracle(avmOpcodeEmitUnencryptedLog)]\nunconstrained fn emit_public_log_opcode(message: [Field]) {}\n\n#[oracle(avmOpcodeL1ToL2MsgExists)]\nunconstrained fn l1_to_l2_msg_exists_opcode(msg_hash: Field, msg_leaf_index: Field) -> u1 {}\n\n#[oracle(avmOpcodeSendL2ToL1Msg)]\nunconstrained fn send_l2_to_l1_msg_opcode(recipient: EthAddress, content: Field) {}\n\n#[oracle(avmOpcodeCalldataCopy)]\nunconstrained fn calldata_copy_opcode<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {}\n\n#[oracle(avmOpcodeReturndataSize)]\nunconstrained fn returndata_size_opcode() -> u32 {}\n\n#[oracle(avmOpcodeReturndataCopy)]\nunconstrained fn returndata_copy_opcode(rdoffset: u32, copy_size: u32) -> [Field] {}\n\n#[oracle(avmOpcodeReturn)]\nunconstrained fn return_opcode(returndata: [Field]) {}\n\n// This opcode reverts using the exact data given. In general it should only be used\n// to do rethrows, where the revert data is the same as the original revert data.\n// For normal reverts, use Noir's `assert` which, on top of reverting, will also add\n// an error selector to the revert data.\n#[oracle(avmOpcodeRevert)]\nunconstrained fn revert_opcode(revertdata: [Field]) {}\n\n#[oracle(avmOpcodeCall)]\nunconstrained fn call_opcode(\n    l2_gas_allocation: Field,\n    da_gas_allocation: Field,\n    address: AztecAddress,\n    args: [Field],\n) {}\n\n#[oracle(avmOpcodeStaticCall)]\nunconstrained fn call_static_opcode(\n    l2_gas_allocation: Field,\n    da_gas_allocation: Field,\n    address: AztecAddress,\n    args: [Field],\n) {}\n\n#[oracle(avmOpcodeSuccessCopy)]\nunconstrained fn success_copy_opcode() -> bool {}\n\n#[oracle(avmOpcodeStorageRead)]\nunconstrained fn storage_read_opcode(storage_slot: Field) -> Field {}\n\n#[oracle(avmOpcodeStorageWrite)]\nunconstrained fn storage_write_opcode(storage_slot: Field, value: Field) {}\n"
+      "source": "use crate::context::gas::GasOpts;\nuse crate::hash::{\n    compute_l1_to_l2_message_hash, compute_l1_to_l2_message_nullifier, compute_secret_hash,\n};\nuse dep::protocol_types::abis::function_selector::FunctionSelector;\nuse dep::protocol_types::address::{AztecAddress, EthAddress};\nuse dep::protocol_types::constants::MAX_U32_VALUE;\nuse dep::protocol_types::traits::{Empty, FromField, Packable, Serialize, ToField};\n\npub struct PublicContext {\n    pub args_hash: Option<Field>,\n    pub compute_args_hash: fn() -> Field,\n}\n\nimpl PublicContext {\n    pub fn new(compute_args_hash: fn() -> Field) -> Self {\n        PublicContext { args_hash: Option::none(), compute_args_hash }\n    }\n\n    pub fn emit_public_log<T, let N: u32>(_self: &mut Self, log: T)\n    where\n        T: Serialize<N>,\n    {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { emit_public_log(Serialize::serialize(log).as_slice()) };\n    }\n\n    pub fn note_hash_exists(_self: Self, note_hash: Field, leaf_index: Field) -> bool {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { note_hash_exists(note_hash, leaf_index) } == 1\n    }\n\n    pub fn l1_to_l2_msg_exists(_self: Self, msg_hash: Field, msg_leaf_index: Field) -> bool {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { l1_to_l2_msg_exists(msg_hash, msg_leaf_index) } == 1\n    }\n\n    pub fn nullifier_exists(_self: Self, unsiloed_nullifier: Field, address: AztecAddress) -> bool {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { nullifier_exists(unsiloed_nullifier, address.to_field()) } == 1\n    }\n\n    pub fn consume_l1_to_l2_message(\n        &mut self,\n        content: Field,\n        secret: Field,\n        sender: EthAddress,\n        leaf_index: Field,\n    ) {\n        let secret_hash = compute_secret_hash(secret);\n        let message_hash = compute_l1_to_l2_message_hash(\n            sender,\n            self.chain_id(),\n            /*recipient=*/\n            self.this_address(),\n            self.version(),\n            content,\n            secret_hash,\n            leaf_index,\n        );\n        let nullifier = compute_l1_to_l2_message_nullifier(message_hash, secret);\n\n        assert(\n            !self.nullifier_exists(nullifier, self.this_address()),\n            \"L1-to-L2 message is already nullified\",\n        );\n        assert(\n            self.l1_to_l2_msg_exists(message_hash, leaf_index),\n            \"Tried to consume nonexistent L1-to-L2 message\",\n        );\n\n        self.push_nullifier(nullifier);\n    }\n\n    pub fn message_portal(_self: &mut Self, recipient: EthAddress, content: Field) {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { send_l2_to_l1_msg(recipient, content) };\n    }\n\n    pub unconstrained fn call_public_function(\n        _self: &mut Self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field],\n        gas_opts: GasOpts,\n    ) -> [Field] {\n        let calldata = args.push_front(function_selector.to_field());\n\n        call(\n            gas_opts.l2_gas.unwrap_or(MAX_U32_VALUE),\n            gas_opts.da_gas.unwrap_or(MAX_U32_VALUE),\n            contract_address,\n            calldata,\n        );\n        // Use success_copy to determine whether the call succeeded\n        let success = success_copy();\n\n        let result_data = returndata_copy(0, returndata_size());\n        if !success {\n            // Rethrow the revert data.\n            avm_revert(result_data);\n        }\n        result_data\n    }\n\n    pub unconstrained fn static_call_public_function(\n        _self: &mut Self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field],\n        gas_opts: GasOpts,\n    ) -> [Field] {\n        let calldata = args.push_front(function_selector.to_field());\n\n        call_static(\n            gas_opts.l2_gas.unwrap_or(MAX_U32_VALUE),\n            gas_opts.da_gas.unwrap_or(MAX_U32_VALUE),\n            contract_address,\n            calldata,\n        );\n        // Use success_copy to determine whether the call succeeded\n        let success = success_copy();\n\n        let result_data = returndata_copy(0, returndata_size());\n        if !success {\n            // Rethrow the revert data.\n            avm_revert(result_data);\n        }\n        result_data\n    }\n\n    pub fn push_note_hash(_self: &mut Self, note_hash: Field) {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { emit_note_hash(note_hash) };\n    }\n    pub fn push_nullifier(_self: &mut Self, nullifier: Field) {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { emit_nullifier(nullifier) };\n    }\n\n    pub fn this_address(_self: Self) -> AztecAddress {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            address()\n        }\n    }\n    pub fn msg_sender(_self: Self) -> AztecAddress {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            sender()\n        }\n    }\n    pub fn selector(_self: Self) -> FunctionSelector {\n        // The selector is the first element of the calldata when calling a public function through dispatch.\n        // Safety: AVM opcodes are constrained by the AVM itself\n        let raw_selector: [Field; 1] = unsafe { calldata_copy(0, 1) };\n        FunctionSelector::from_field(raw_selector[0])\n    }\n    pub fn get_args_hash(mut self) -> Field {\n        if !self.args_hash.is_some() {\n            self.args_hash = Option::some((self.compute_args_hash)());\n        }\n\n        self.args_hash.unwrap_unchecked()\n    }\n    pub fn transaction_fee(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            transaction_fee()\n        }\n    }\n\n    pub fn chain_id(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            chain_id()\n        }\n    }\n    pub fn version(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            version()\n        }\n    }\n    pub fn block_number(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            block_number()\n        }\n    }\n    pub fn timestamp(_self: Self) -> u64 {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            timestamp()\n        }\n    }\n    pub fn fee_per_l2_gas(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            fee_per_l2_gas()\n        }\n    }\n    pub fn fee_per_da_gas(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            fee_per_da_gas()\n        }\n    }\n\n    pub fn l2_gas_left(_self: Self) -> u32 {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            l2_gas_left()\n        }\n    }\n    pub fn da_gas_left(_self: Self) -> u32 {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            da_gas_left()\n        }\n    }\n    pub fn is_static_call(_self: Self) -> bool {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { is_static_call() } == 1\n    }\n\n    pub fn raw_storage_read<let N: u32>(_self: Self, storage_slot: Field) -> [Field; N] {\n        let mut out = [0; N];\n        for i in 0..N {\n            // Safety: AVM opcodes are constrained by the AVM itself\n            out[i] = unsafe { storage_read(storage_slot + i as Field) };\n        }\n        out\n    }\n\n    pub fn storage_read<T, let N: u32>(self, storage_slot: Field) -> T\n    where\n        T: Packable<N>,\n    {\n        T::unpack(self.raw_storage_read(storage_slot))\n    }\n\n    pub fn raw_storage_write<let N: u32>(_self: Self, storage_slot: Field, values: [Field; N]) {\n        for i in 0..N {\n            // Safety: AVM opcodes are constrained by the AVM itself\n            unsafe { storage_write(storage_slot + i as Field, values[i]) };\n        }\n    }\n\n    pub fn storage_write<T, let N: u32>(self, storage_slot: Field, value: T)\n    where\n        T: Packable<N>,\n    {\n        self.raw_storage_write(storage_slot, value.pack());\n    }\n}\n\n// Unconstrained opcode wrappers (do not use directly).\nunconstrained fn address() -> AztecAddress {\n    address_opcode()\n}\nunconstrained fn sender() -> AztecAddress {\n    sender_opcode()\n}\nunconstrained fn transaction_fee() -> Field {\n    transaction_fee_opcode()\n}\nunconstrained fn chain_id() -> Field {\n    chain_id_opcode()\n}\nunconstrained fn version() -> Field {\n    version_opcode()\n}\nunconstrained fn block_number() -> Field {\n    block_number_opcode()\n}\nunconstrained fn timestamp() -> u64 {\n    timestamp_opcode()\n}\nunconstrained fn fee_per_l2_gas() -> Field {\n    fee_per_l2_gas_opcode()\n}\nunconstrained fn fee_per_da_gas() -> Field {\n    fee_per_da_gas_opcode()\n}\nunconstrained fn l2_gas_left() -> u32 {\n    l2_gas_left_opcode()\n}\nunconstrained fn da_gas_left() -> u32 {\n    da_gas_left_opcode()\n}\nunconstrained fn is_static_call() -> Field {\n    is_static_call_opcode()\n}\nunconstrained fn note_hash_exists(note_hash: Field, leaf_index: Field) -> u1 {\n    note_hash_exists_opcode(note_hash, leaf_index)\n}\nunconstrained fn emit_note_hash(note_hash: Field) {\n    emit_note_hash_opcode(note_hash)\n}\nunconstrained fn nullifier_exists(nullifier: Field, address: Field) -> u1 {\n    nullifier_exists_opcode(nullifier, address)\n}\nunconstrained fn emit_nullifier(nullifier: Field) {\n    emit_nullifier_opcode(nullifier)\n}\nunconstrained fn emit_public_log(message: [Field]) {\n    emit_public_log_opcode(message)\n}\nunconstrained fn l1_to_l2_msg_exists(msg_hash: Field, msg_leaf_index: Field) -> u1 {\n    l1_to_l2_msg_exists_opcode(msg_hash, msg_leaf_index)\n}\nunconstrained fn send_l2_to_l1_msg(recipient: EthAddress, content: Field) {\n    send_l2_to_l1_msg_opcode(recipient, content)\n}\nunconstrained fn call(\n    l2_gas_allocation: u32,\n    da_gas_allocation: u32,\n    address: AztecAddress,\n    args: [Field],\n) {\n    call_opcode(l2_gas_allocation, da_gas_allocation, address, args)\n}\n\nunconstrained fn call_static(\n    l2_gas_allocation: u32,\n    da_gas_allocation: u32,\n    address: AztecAddress,\n    args: [Field],\n) {\n    call_static_opcode(l2_gas_allocation, da_gas_allocation, address, args)\n}\n\npub unconstrained fn calldata_copy<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {\n    calldata_copy_opcode(cdoffset, copy_size)\n}\n\n// `success_copy` is placed immediately after the CALL opcode to get the success value\nunconstrained fn success_copy() -> bool {\n    success_copy_opcode()\n}\n\nunconstrained fn returndata_size() -> u32 {\n    returndata_size_opcode()\n}\n\nunconstrained fn returndata_copy(rdoffset: u32, copy_size: u32) -> [Field] {\n    returndata_copy_opcode(rdoffset, copy_size)\n}\n\npub unconstrained fn avm_return(returndata: [Field]) {\n    return_opcode(returndata)\n}\n\n// This opcode reverts using the exact data given. In general it should only be used\n// to do rethrows, where the revert data is the same as the original revert data.\n// For normal reverts, use Noir's `assert` which, on top of reverting, will also add\n// an error selector to the revert data.\nunconstrained fn avm_revert(revertdata: [Field]) {\n    revert_opcode(revertdata)\n}\n\nunconstrained fn storage_read(storage_slot: Field) -> Field {\n    storage_read_opcode(storage_slot)\n}\n\nunconstrained fn storage_write(storage_slot: Field, value: Field) {\n    storage_write_opcode(storage_slot, value);\n}\n\nimpl Empty for PublicContext {\n    fn empty() -> Self {\n        PublicContext::new(|| 0)\n    }\n}\n\n// AVM oracles (opcodes) follow, do not use directly.\n#[oracle(avmOpcodeAddress)]\nunconstrained fn address_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodeSender)]\nunconstrained fn sender_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodeTransactionFee)]\nunconstrained fn transaction_fee_opcode() -> Field {}\n\n#[oracle(avmOpcodeChainId)]\nunconstrained fn chain_id_opcode() -> Field {}\n\n#[oracle(avmOpcodeVersion)]\nunconstrained fn version_opcode() -> Field {}\n\n#[oracle(avmOpcodeBlockNumber)]\nunconstrained fn block_number_opcode() -> Field {}\n\n#[oracle(avmOpcodeTimestamp)]\nunconstrained fn timestamp_opcode() -> u64 {}\n\n#[oracle(avmOpcodeFeePerL2Gas)]\nunconstrained fn fee_per_l2_gas_opcode() -> Field {}\n\n#[oracle(avmOpcodeFeePerDaGas)]\nunconstrained fn fee_per_da_gas_opcode() -> Field {}\n\n#[oracle(avmOpcodeL2GasLeft)]\nunconstrained fn l2_gas_left_opcode() -> u32 {}\n\n#[oracle(avmOpcodeDaGasLeft)]\nunconstrained fn da_gas_left_opcode() -> u32 {}\n\n#[oracle(avmOpcodeIsStaticCall)]\nunconstrained fn is_static_call_opcode() -> Field {}\n\n#[oracle(avmOpcodeNoteHashExists)]\nunconstrained fn note_hash_exists_opcode(note_hash: Field, leaf_index: Field) -> u1 {}\n\n#[oracle(avmOpcodeEmitNoteHash)]\nunconstrained fn emit_note_hash_opcode(note_hash: Field) {}\n\n#[oracle(avmOpcodeNullifierExists)]\nunconstrained fn nullifier_exists_opcode(nullifier: Field, address: Field) -> u1 {}\n\n#[oracle(avmOpcodeEmitNullifier)]\nunconstrained fn emit_nullifier_opcode(nullifier: Field) {}\n\n// TODO(#11124): rename unencrypted to public in avm\n#[oracle(avmOpcodeEmitUnencryptedLog)]\nunconstrained fn emit_public_log_opcode(message: [Field]) {}\n\n#[oracle(avmOpcodeL1ToL2MsgExists)]\nunconstrained fn l1_to_l2_msg_exists_opcode(msg_hash: Field, msg_leaf_index: Field) -> u1 {}\n\n#[oracle(avmOpcodeSendL2ToL1Msg)]\nunconstrained fn send_l2_to_l1_msg_opcode(recipient: EthAddress, content: Field) {}\n\n#[oracle(avmOpcodeCalldataCopy)]\nunconstrained fn calldata_copy_opcode<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {}\n\n#[oracle(avmOpcodeReturndataSize)]\nunconstrained fn returndata_size_opcode() -> u32 {}\n\n#[oracle(avmOpcodeReturndataCopy)]\nunconstrained fn returndata_copy_opcode(rdoffset: u32, copy_size: u32) -> [Field] {}\n\n#[oracle(avmOpcodeReturn)]\nunconstrained fn return_opcode(returndata: [Field]) {}\n\n// This opcode reverts using the exact data given. In general it should only be used\n// to do rethrows, where the revert data is the same as the original revert data.\n// For normal reverts, use Noir's `assert` which, on top of reverting, will also add\n// an error selector to the revert data.\n#[oracle(avmOpcodeRevert)]\nunconstrained fn revert_opcode(revertdata: [Field]) {}\n\n#[oracle(avmOpcodeCall)]\nunconstrained fn call_opcode(\n    l2_gas_allocation: u32,\n    da_gas_allocation: u32,\n    address: AztecAddress,\n    args: [Field],\n) {}\n\n#[oracle(avmOpcodeStaticCall)]\nunconstrained fn call_static_opcode(\n    l2_gas_allocation: u32,\n    da_gas_allocation: u32,\n    address: AztecAddress,\n    args: [Field],\n) {}\n\n#[oracle(avmOpcodeSuccessCopy)]\nunconstrained fn success_copy_opcode() -> bool {}\n\n#[oracle(avmOpcodeStorageRead)]\nunconstrained fn storage_read_opcode(storage_slot: Field) -> Field {}\n\n#[oracle(avmOpcodeStorageWrite)]\nunconstrained fn storage_write_opcode(storage_slot: Field, value: Field) {}\n"
     },
     "64": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/utility_context.nr",
@@ -3662,7 +3662,7 @@
     },
     "90": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/dispatch.nr",
-      "source": "use super::utils::compute_fn_selector;\nuse std::panic;\n\n/// Returns an `fn public_dispatch(...)` function for the given module that's assumed to be an Aztec contract.\npub comptime fn generate_public_dispatch(m: Module) -> Quoted {\n    let functions = m.functions();\n    let functions =\n        functions.filter(|function: FunctionDefinition| function.has_named_attribute(\"public\"));\n\n    let unit = get_type::<()>();\n\n    let ifs = functions.map(|function: FunctionDefinition| {\n        let parameters = function.parameters();\n        let return_type = function.return_type();\n\n        let selector: Field = compute_fn_selector(function);\n\n        let mut parameters_size = 0;\n        for param in parameters {\n            parameters_size += size_in_fields(param.1);\n        }\n\n        let initial_read = if parameters.len() == 0 {\n            quote {}\n        } else {\n            // The initial calldata_copy offset is 1 to skip the Field selector\n            // The expected calldata is the serialization of\n            // - FunctionSelector: the selector of the function intended to dispatch\n            // - Parameters: the parameters of the function intended to dispatch\n            // That is, exactly what is expected for a call to the target function,\n            // but with a selector added at the beginning.\n            quote {\n                let input_calldata: [Field; $parameters_size] = dep::aztec::context::public_context::calldata_copy(1, $parameters_size);\n                let mut reader = dep::aztec::protocol_types::utils::reader::Reader::new(input_calldata);\n            }\n        };\n\n        let parameter_index = &mut 0;\n        let reads = parameters.map(|param: (Quoted, Type)| {\n            let parameter_index_value = *parameter_index;\n            let param_name = f\"arg{parameter_index_value}\".quoted_contents();\n            let param_type = param.1;\n            let read = quote {\n                let $param_name: $param_type = reader.read_struct(dep::aztec::protocol_types::traits::Deserialize::deserialize);\n            };\n            *parameter_index += 1;\n            quote { $read }\n        });\n        let read = reads.join(quote { });\n\n        let mut args = &[];\n        for parameter_index in 0..parameters.len() {\n            let param_name = f\"arg{parameter_index}\".quoted_contents();\n            args = args.push_back(quote { $param_name });\n        }\n\n        let args = args.join(quote { , });\n        // name of the function is assigned just before the call so debug metadata doesn't span most of this macro when figuring out where the call comes from.\n        let name = function.name();\n        let call = quote { $name($args) };\n\n        let return_code = if return_type == unit {\n            quote {\n                $call;\n                // Force early return.\n                dep::aztec::context::public_context::avm_return([]);\n            }\n        } else {\n            quote {\n                let return_value = dep::aztec::protocol_types::traits::Serialize::serialize($call);\n                dep::aztec::context::public_context::avm_return(return_value.as_slice());\n            }\n        };\n\n        let if_ = quote {\n            if selector == $selector {\n                $initial_read\n                $read\n                $return_code\n            }\n        };\n        if_\n    });\n\n    if ifs.len() == 0 {\n        // No dispatch function if there are no public functions\n        quote {}\n    } else {\n        let ifs = ifs.push_back(quote { panic(f\"Unknown selector {selector}\") });\n        let dispatch = ifs.join(quote {  });\n\n        let body = quote {\n            // We mark this as public because our whole system depends on public\n            // functions having this attribute. However, the public MACRO will\n            // handle the public_dispatch function specially and do nothing.\n            #[public]\n            pub unconstrained fn public_dispatch(selector: Field) {\n                $dispatch\n            }\n        };\n\n        body\n    }\n}\n\ncomptime fn size_in_fields(typ: Type) -> u32 {\n    let size = array_size_in_fields(typ);\n    let size = size.or_else(|| bool_size_in_fields(typ));\n    let size = size.or_else(|| constant_size_in_fields(typ));\n    let size = size.or_else(|| field_size_in_fields(typ));\n    let size = size.or_else(|| int_size_in_fields(typ));\n    let size = size.or_else(|| str_size_in_fields(typ));\n    let size = size.or_else(|| struct_size_in_fields(typ));\n    let size = size.or_else(|| tuple_size_in_fields(typ));\n    if size.is_some() {\n        size.unwrap()\n    } else {\n        panic(f\"Can't determine size in fields of {typ}\")\n    }\n}\n\ncomptime fn array_size_in_fields(typ: Type) -> Option<u32> {\n    typ.as_array().and_then(|typ: (Type, Type)| {\n        let (typ, element_size) = typ;\n        element_size.as_constant().map(|x: u32| x * size_in_fields(typ))\n    })\n}\n\ncomptime fn bool_size_in_fields(typ: Type) -> Option<u32> {\n    if typ.is_bool() {\n        Option::some(1)\n    } else {\n        Option::none()\n    }\n}\n\ncomptime fn field_size_in_fields(typ: Type) -> Option<u32> {\n    if typ.is_field() {\n        Option::some(1)\n    } else {\n        Option::none()\n    }\n}\n\ncomptime fn int_size_in_fields(typ: Type) -> Option<u32> {\n    if typ.as_integer().is_some() {\n        Option::some(1)\n    } else {\n        Option::none()\n    }\n}\n\ncomptime fn constant_size_in_fields(typ: Type) -> Option<u32> {\n    typ.as_constant()\n}\n\ncomptime fn str_size_in_fields(typ: Type) -> Option<u32> {\n    typ.as_str().map(|typ| size_in_fields(typ))\n}\n\ncomptime fn struct_size_in_fields(typ: Type) -> Option<u32> {\n    typ.as_data_type().map(|typ: (TypeDefinition, [Type])| {\n        let struct_type = typ.0;\n        let generics = typ.1;\n        let mut size = 0;\n        for field in struct_type.fields(generics) {\n            size += size_in_fields(field.1);\n        }\n        size\n    })\n}\n\ncomptime fn tuple_size_in_fields(typ: Type) -> Option<u32> {\n    typ.as_tuple().map(|types: [Type]| {\n        let mut size = 0;\n        for typ in types {\n            size += size_in_fields(typ);\n        }\n        size\n    })\n}\n\ncomptime fn get_type<T>() -> Type {\n    let t: T = std::mem::zeroed();\n    std::meta::type_of(t)\n}\n"
+      "source": "use super::utils::compute_fn_selector;\nuse std::panic;\n\n/// Returns an `fn public_dispatch(...)` function for the given module that's assumed to be an Aztec contract.\npub comptime fn generate_public_dispatch(m: Module) -> Quoted {\n    let functions = m.functions();\n    let functions =\n        functions.filter(|function: FunctionDefinition| function.has_named_attribute(\"public\"));\n\n    let unit = get_type::<()>();\n\n    let ifs = functions.map(|function: FunctionDefinition| {\n        let parameters = function.parameters();\n        let return_type = function.return_type();\n\n        let selector: Field = compute_fn_selector(function);\n\n        let mut parameters_size = 0;\n        for param in parameters {\n            parameters_size += size_in_fields(param.1);\n        }\n\n        let initial_read = if parameters.len() == 0 {\n            quote {}\n        } else {\n            // The initial calldata_copy offset is 1 to skip the Field selector\n            // The expected calldata is the serialization of\n            // - FunctionSelector: the selector of the function intended to dispatch\n            // - Parameters: the parameters of the function intended to dispatch\n            // That is, exactly what is expected for a call to the target function,\n            // but with a selector added at the beginning.\n            quote {\n                let input_calldata: [Field; $parameters_size] = dep::aztec::context::public_context::calldata_copy(1, $parameters_size);\n                let mut reader = dep::aztec::protocol_types::utils::reader::Reader::new(input_calldata);\n            }\n        };\n\n        let parameter_index: &mut u32 = &mut 0;\n        let reads = parameters.map(|param: (Quoted, Type)| {\n            let parameter_index_value = *parameter_index;\n            let param_name = f\"arg{parameter_index_value}\".quoted_contents();\n            let param_type = param.1;\n            let read = quote {\n                let $param_name: $param_type = reader.read_struct(dep::aztec::protocol_types::traits::Deserialize::deserialize);\n            };\n            *parameter_index += 1;\n            quote { $read }\n        });\n        let read = reads.join(quote { });\n\n        let mut args = &[];\n        for parameter_index in 0..parameters.len() {\n            let param_name = f\"arg{parameter_index}\".quoted_contents();\n            args = args.push_back(quote { $param_name });\n        }\n\n        let args = args.join(quote { , });\n        // name of the function is assigned just before the call so debug metadata doesn't span most of this macro when figuring out where the call comes from.\n        let name = function.name();\n        let call = quote { $name($args) };\n\n        let return_code = if return_type == unit {\n            quote {\n                $call;\n                // Force early return.\n                dep::aztec::context::public_context::avm_return([]);\n            }\n        } else {\n            quote {\n                let return_value = dep::aztec::protocol_types::traits::Serialize::serialize($call);\n                dep::aztec::context::public_context::avm_return(return_value.as_slice());\n            }\n        };\n\n        let if_ = quote {\n            if selector == $selector {\n                $initial_read\n                $read\n                $return_code\n            }\n        };\n        if_\n    });\n\n    if ifs.len() == 0 {\n        // No dispatch function if there are no public functions\n        quote {}\n    } else {\n        let ifs = ifs.push_back(quote { panic(f\"Unknown selector {selector}\") });\n        let dispatch = ifs.join(quote {  });\n\n        let body = quote {\n            // We mark this as public because our whole system depends on public\n            // functions having this attribute. However, the public MACRO will\n            // handle the public_dispatch function specially and do nothing.\n            #[public]\n            pub unconstrained fn public_dispatch(selector: Field) {\n                $dispatch\n            }\n        };\n\n        body\n    }\n}\n\ncomptime fn size_in_fields(typ: Type) -> u32 {\n    let size = array_size_in_fields(typ);\n    let size = size.or_else(|| bool_size_in_fields(typ));\n    let size = size.or_else(|| constant_size_in_fields(typ));\n    let size = size.or_else(|| field_size_in_fields(typ));\n    let size = size.or_else(|| int_size_in_fields(typ));\n    let size = size.or_else(|| str_size_in_fields(typ));\n    let size = size.or_else(|| struct_size_in_fields(typ));\n    let size = size.or_else(|| tuple_size_in_fields(typ));\n    if size.is_some() {\n        size.unwrap()\n    } else {\n        panic(f\"Can't determine size in fields of {typ}\")\n    }\n}\n\ncomptime fn array_size_in_fields(typ: Type) -> Option<u32> {\n    typ.as_array().and_then(|typ: (Type, Type)| {\n        let (typ, element_size) = typ;\n        element_size.as_constant().map(|x: u32| x * size_in_fields(typ))\n    })\n}\n\ncomptime fn bool_size_in_fields(typ: Type) -> Option<u32> {\n    if typ.is_bool() {\n        Option::some(1)\n    } else {\n        Option::none()\n    }\n}\n\ncomptime fn field_size_in_fields(typ: Type) -> Option<u32> {\n    if typ.is_field() {\n        Option::some(1)\n    } else {\n        Option::none()\n    }\n}\n\ncomptime fn int_size_in_fields(typ: Type) -> Option<u32> {\n    if typ.as_integer().is_some() {\n        Option::some(1)\n    } else {\n        Option::none()\n    }\n}\n\ncomptime fn constant_size_in_fields(typ: Type) -> Option<u32> {\n    typ.as_constant()\n}\n\ncomptime fn str_size_in_fields(typ: Type) -> Option<u32> {\n    typ.as_str().map(|typ| size_in_fields(typ))\n}\n\ncomptime fn struct_size_in_fields(typ: Type) -> Option<u32> {\n    typ.as_data_type().map(|typ: (TypeDefinition, [Type])| {\n        let struct_type = typ.0;\n        let generics = typ.1;\n        let mut size = 0;\n        for field in struct_type.fields(generics) {\n            size += size_in_fields(field.1);\n        }\n        size\n    })\n}\n\ncomptime fn tuple_size_in_fields(typ: Type) -> Option<u32> {\n    typ.as_tuple().map(|types: [Type]| {\n        let mut size = 0;\n        for typ in types {\n            size += size_in_fields(typ);\n        }\n        size\n    })\n}\n\ncomptime fn get_type<T>() -> Type {\n    let t: T = std::mem::zeroed();\n    std::meta::type_of(t)\n}\n"
     },
     "97": {
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/functions/utils.nr",

package/dest/protocol_contract_data.js CHANGED Viewed

@@ -26,14 +26,14 @@ export const ProtocolContractAddress = {
     Router: AztecAddress.fromBigInt(6n)
 };
 export const ProtocolContractLeaves = {
-    AuthRegistry: Fr.fromHexString('0x1f498360a588c6b9bdb5d0a2c0f27d2b91d6b0ca05566a426730e5063a04bb80'),
-    ContractInstanceDeployer: Fr.fromHexString('0x1fbadfc62feb4602dc3965aa3878e40c0b685b7a11bf953b3ec39f7689b90400'),
-    ContractClassRegisterer: Fr.fromHexString('0x2cd6fd67485b4de4b700d971ab338277bc9b48b451a92d1786d231d320ea2861'),
-    MultiCallEntrypoint: Fr.fromHexString('0x27e8e13b07c409cfc9fffd3c0d97b7dfeaea73272245659397f27d1c92237340'),
-    FeeJuice: Fr.fromHexString('0x0ad5c0999692263842476c07a515e25109b986cb1dc6ccb782580832e222c622'),
-    Router: Fr.fromHexString('0x22da197f32a0cf129eb0e960e459ac27024b65b9c77b33d6ff4e3321e405d2fc')
+    AuthRegistry: Fr.fromHexString('0x262a3c363adcedb0e46d8a2f06e751f18714b4043021e92e13950d9ce073cfd6'),
+    ContractInstanceDeployer: Fr.fromHexString('0x1f5a4270e01aa443f44ed9ac2f5f139aa15cdae0b877c003590fee05f68d85b3'),
+    ContractClassRegisterer: Fr.fromHexString('0x168d24baa470e778a7da8eabcf137d7837292c1e0bca83b615dcd0f084c23ac7'),
+    MultiCallEntrypoint: Fr.fromHexString('0x1cdce65d157d80045f1ecc300dda3044484b38938d44cac1af61660cae1c32be'),
+    FeeJuice: Fr.fromHexString('0x0a5374b621df1c64a2219723beb007478584c3f5e1052288a19a0392a092e6ce'),
+    Router: Fr.fromHexString('0x1c380a3ce80d9bfd1247a4efc95ca1782d572e660ada6bd7ec90958e36833064')
 };
-export const protocolContractTreeRoot = Fr.fromHexString('0x26cf2e5cef38a4caa15b82168ae7f99fcb15a602b8289664a38f83bd7ece4703');
+export const protocolContractTreeRoot = Fr.fromHexString('0x13b587f58f77a7ad53b50e5509a4aff45cf77ccd44d7e5af3ea19c51bcc02d0d');
 export const REGISTERER_CONTRACT_CLASS_REGISTERED_TAG = Fr.fromHexString('0x20cd27645f65c15a38720ca984aef936592f3938a705db706d068ad13fc58ae9');
 export const REGISTERER_PRIVATE_FUNCTION_BROADCASTED_TAG = Fr.fromHexString('0x0abf338154e355442d9916d630da0491036d5a7b23c42b477c1395ba3bf9b42d');
 export const REGISTERER_UTILITY_FUNCTION_BROADCASTED_TAG = Fr.fromHexString('0x27774539896271d6dbe0c1de45ddc44709d1e8d9a9fb686ca3c105d87c417bb8');

package/package.json CHANGED Viewed

@@ -2,7 +2,7 @@
   "name": "@aztec/protocol-contracts",
   "homepage": "https://github.com/AztecProtocol/aztec-packages/tree/master/yarn-project/protocol-contracts",
   "description": "Canonical Noir contracts for the Aztec Network",
-  "version": "0.87.1",
+  "version": "0.87.2-nightly.20250524",
   "type": "module",
   "exports": {
     ".": "./dest/index.js",
@@ -69,9 +69,9 @@
     ]
   },
   "dependencies": {
-    "@aztec/constants": "0.87.1",
-    "@aztec/foundation": "0.87.1",
-    "@aztec/stdlib": "0.87.1",
+    "@aztec/constants": "0.87.2-nightly.20250524",
+    "@aztec/foundation": "0.87.2-nightly.20250524",
+    "@aztec/stdlib": "0.87.2-nightly.20250524",
     "lodash.chunk": "^4.2.0",
     "lodash.omit": "^4.5.0",
     "tslib": "^2.4.0"

package/src/protocol_contract_data.ts CHANGED Viewed

@@ -40,17 +40,17 @@ Router: AztecAddress.fromBigInt(6n)
     export const ProtocolContractLeaves = {
-      AuthRegistry: Fr.fromHexString('0x1f498360a588c6b9bdb5d0a2c0f27d2b91d6b0ca05566a426730e5063a04bb80'),
-ContractInstanceDeployer: Fr.fromHexString('0x1fbadfc62feb4602dc3965aa3878e40c0b685b7a11bf953b3ec39f7689b90400'),
-ContractClassRegisterer: Fr.fromHexString('0x2cd6fd67485b4de4b700d971ab338277bc9b48b451a92d1786d231d320ea2861'),
-MultiCallEntrypoint: Fr.fromHexString('0x27e8e13b07c409cfc9fffd3c0d97b7dfeaea73272245659397f27d1c92237340'),
-FeeJuice: Fr.fromHexString('0x0ad5c0999692263842476c07a515e25109b986cb1dc6ccb782580832e222c622'),
-Router: Fr.fromHexString('0x22da197f32a0cf129eb0e960e459ac27024b65b9c77b33d6ff4e3321e405d2fc')
+      AuthRegistry: Fr.fromHexString('0x262a3c363adcedb0e46d8a2f06e751f18714b4043021e92e13950d9ce073cfd6'),
+ContractInstanceDeployer: Fr.fromHexString('0x1f5a4270e01aa443f44ed9ac2f5f139aa15cdae0b877c003590fee05f68d85b3'),
+ContractClassRegisterer: Fr.fromHexString('0x168d24baa470e778a7da8eabcf137d7837292c1e0bca83b615dcd0f084c23ac7'),
+MultiCallEntrypoint: Fr.fromHexString('0x1cdce65d157d80045f1ecc300dda3044484b38938d44cac1af61660cae1c32be'),
+FeeJuice: Fr.fromHexString('0x0a5374b621df1c64a2219723beb007478584c3f5e1052288a19a0392a092e6ce'),
+Router: Fr.fromHexString('0x1c380a3ce80d9bfd1247a4efc95ca1782d572e660ada6bd7ec90958e36833064')
     };
-    export const protocolContractTreeRoot = Fr.fromHexString('0x26cf2e5cef38a4caa15b82168ae7f99fcb15a602b8289664a38f83bd7ece4703');
+    export const protocolContractTreeRoot = Fr.fromHexString('0x13b587f58f77a7ad53b50e5509a4aff45cf77ccd44d7e5af3ea19c51bcc02d0d');