@aztec/protocol-contracts 0.82.1 → 0.82.2-alpha-testnet.1

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
  1. package/artifacts/AuthRegistry.json +959 -959
  2. package/artifacts/ContractClassRegisterer.json +341 -341
  3. package/artifacts/ContractInstanceDeployer.json +643 -643
  4. package/artifacts/FeeJuice.json +418 -418
  5. package/artifacts/MultiCallEntrypoint.json +30 -30
  6. package/artifacts/Router.json +271 -271
  7. package/dest/protocol_contract_data.js +7 -7
  8. package/package.json +4 -4
  9. package/src/protocol_contract_data.ts +7 -7
package/artifacts/Router.json CHANGED
@@ -4,24 +4,35 @@
4
4
  "name": "Router",
5
5
  "functions": [
6
6
  {
7
- "name": "sync_notes",
7
+ "name": "public_dispatch",
8
8
  "is_unconstrained": true,
9
- "custom_attributes": [],
9
+ "custom_attributes": [
10
+ "public"
11
+ ],
10
12
  "abi": {
11
- "parameters": [],
13
+ "parameters": [
14
+ {
15
+ "name": "selector",
16
+ "type": {
17
+ "kind": "field"
18
+ },
19
+ "visibility": "private"
20
+ }
21
+ ],
12
22
  "return_type": null,
13
23
  "error_types": {
14
- "2920182694213909827": {
15
- "error_kind": "string",
16
- "string": "attempt to subtract with overflow"
24
+ "1433889167918961673": {
25
+ "error_kind": "fmtstring",
26
+ "length": 17,
27
+ "item_types": []
17
28
  },
18
- "3305101268118424981": {
29
+ "2242946026394210301": {
19
30
  "error_kind": "string",
20
- "string": "Attempted to delete past the length of a CapsuleArray"
31
+ "string": "Block number mismatch."
21
32
  },
22
- "3367683922240523006": {
33
+ "2830029349304997821": {
23
34
  "error_kind": "fmtstring",
24
- "length": 58,
35
+ "length": 27,
25
36
  "item_types": [
26
37
  {
27
38
  "kind": "field"
@@ -32,53 +43,44 @@
32
43
  "error_kind": "string",
33
44
  "string": "attempt to add with overflow"
34
45
  },
35
- "5727012404371710682": {
46
+ "8209322232883590150": {
36
47
  "error_kind": "string",
37
- "string": "push out of bounds"
48
+ "string": "Function _check_block_number can only be called internally"
38
49
  },
39
- "6753155520859132764": {
50
+ "8443716675528357851": {
40
51
  "error_kind": "string",
41
- "string": "Failed to deliver note"
52
+ "string": "Timestamp mismatch."
42
53
  },
43
- "8830323656616886390": {
54
+ "10421965853029650238": {
44
55
  "error_kind": "string",
45
- "string": "Got a public log emitted by a different contract"
56
+ "string": "Function _check_block_number can only be called statically"
46
57
  },
47
- "13649294680379557736": {
58
+ "11405868724477732285": {
48
59
  "error_kind": "string",
49
- "string": "extend_from_bounded_vec out of bounds"
60
+ "string": "Function _check_timestamp can only be called internally"
50
61
  },
51
- "14657895983200220173": {
62
+ "13418685691864489983": {
52
63
  "error_kind": "string",
53
- "string": "Attempted to read past the length of a CapsuleArray"
64
+ "string": "Function _check_timestamp can only be called statically"
54
65
  },
55
66
  "16761564377371454734": {
56
67
  "error_kind": "string",
57
68
  "string": "Array index out of bounds"
58
69
  },
59
- "16775516380094354375": {
60
- "error_kind": "fmtstring",
61
- "length": 40,
62
- "item_types": []
63
- },
64
- "16954218183513903507": {
65
- "error_kind": "string",
66
- "string": "Attempted to read past end of BoundedVec"
67
- },
68
70
  "17843811134343075018": {
69
71
  "error_kind": "string",
70
72
  "string": "Stack too deep"
71
73
  }
72
74
  }
73
75
  },
74
- "bytecode": "H4sIAAAAAAAA/+1dXYhcyXWunu6eme6Z1rT+tV7J6/WPdjde2/03f5Jszb9GWv2sd9eGQCD0dLcUO+uVWWkNBkMmJBDyYkhiHPKSvDgEB4c4TmJsMAkO+SEQ/BQ2GILJQ1jIQyA4G5I8xLGudE/3N1+fW3175tRMa3cKhum+deo7p06dc+pU3bq3M65XMvH/nNtDEZBnCo/+x//cGNRnH/wtxd8reyvVAvG1xF+oNBYLSv8M5a8XYsxMGPyK4AfSf2Uixrm63cPHvgjfyQd/U/D5mOvZR6j+y/iF7P9xT5/Fdla3XbfY8G20BXttO0i/aoK/Hga/IfgbYfDrgn8lDH5F8DfD4FcjX4n85MuTj/CmH/wdibHvdO6vvHq39Ys33/jcVud1sTyRAi0Rr2ddf4lQj/VQV+++dv/1Zuv+crv9eufePUYYU5BdAmoRUH+h+ZnXrraT5BkS7dOd1+995u5rjJZLiSbxIA/00d9S/L2ypzLfjTfjQfBr3Xg+EQR/bk7wJ8PopzvfFcLIf1vwi2Hwq4I/FQa/LfjTYfAbgl8Kg9+1/yNB8Ge79j8TRv6ufZbD4HcE/2gY/FnBPxYEf74bH46HkX9e8E+Ekb9WivFOul6ROUN4n4LrdnN6ta3NzDwLIv8iyWqdY2SIn8jD+pF5X3R3WpG1rNRxDDit8Dmt8NGwjhpinTDEmjDEKoxoH6cMsUqGWGVDrOOGWOOGWJa6t/ShyRHFKhpiWdqEpe4t7WvaEMvSty1tYsYQyzJGHzPEGtX5UdbZYXOr3j7nmTD4dZ8usE/CX3KlI0CfSfgvWFwnvIqEZdy3qq9vKL9vnFEHe7UZwSoodSHG9JSn38w/iV7Ll4X+CQ8+0s+4fht+gnTxnjC6qPnG7QngKfyjeUNidLuz9cad63fvOCpZ0oPo7SzRyR7tmOvX95kELEffz9K1LOBhieSWGH7vi6+1bt6937nnBpSwmxrzW4J/Mgx+Wwu+hvgVzVEN8RtacLfDn2tJsEZHzdDYh3G86mLayUD4F12/U4aYDN5D8rB+eFPgSUXWslLHPvSkwudJhY+GddIQa9wQ65Qh1lFDrLIh1rQhVmlE+3jcEGtU7atoiHXCEOu0IZalfVnq64whlqV9WfpQwRDL0iYs46okwgWlzjBX6OYpnEBHRerOAW+eo98L9HIoJaNg8VEB7FPU169M9nCZjuXBvOkc4LOeMN8QPZ6FeutDY6gPY/zuwvKc26lT7tN7E3Ql9dp/weI64VV0/XoPkR9qfUP52V/QLlEHSVjnhsQqKHUhxvSsp9/Iv+SRVevHk6QTLR5p+bfQv9cjF9LPKLylrejwKagLscmg6RB9UfjvZpNB9HaG6OSg1pjrt8FzCViOvp+ha0mbDL71ZBp/FjmjUlawZMMk8KbQbW0+y5jhNxqB43xbiwnOhZ1HDPVTZ380lL27Z/O+MLJ3dfN0mLHt7pm9Pwz+guB/IAx+96DOB4PgN7rj+6Ew49s9CHQ+CP58Vz/PBMGvd/XzrOsVI910D3k9F0Y33UNSPxMEf7Yblz9srptKF/t5kN0QvzuuHwljN9249lHAN4wLLcH/WBj87gHNShj8blyouj3bTp0vCHYtyNjOdWN+PYzt1AS/EUb33bgzu3fd9wkv2HNBdDPbzTXnw+imKfgLYfC7MXnRXve1aG/vxzHWDOhe+sE3iXNB+lhvyrrmgusvUncRePP+0yWgH3b/Sfo07P4Trq1QNsTMu946FPWahXqk///4fzQuP4k/Rwf1ZGw+ARg8NkuEL98reyqNqvR32fUXqVsB3jw2q0A/7NgsxZ+HHZvLUIeyISaODer1MtQj/VSmJ8vXJnsyM79PuH75PkHfn1X4lYif1EdFxngZrhvu/1YyxE/6hteQf9GFtLneXuAyycP6EVuL9nPkQOurd5vt1ebn773xameMVInDhPAzBCc0SItlBkRCem7Pw/4epR0XUWWeZJb7+VFoOBl/LiXwiUrB9ffZcpmc1mSEf9H1u1oIk7lM8rB+ODwtKbKWlTrcumQz9JnmIdYh1kFhSdqgTU8+f7ns4aNNlSXAk7rnqS6ryCd1OU/dBU/dRaVfWkoo29pS93EFM4qrv5zpXU/SzRJck61/LT1LmmuSsNYIC9svE9bKAKwNwsL2nA6tDsBaJyxsv0pYax6s6PMH3E4sbL9GWOsDsCqEhe3XCWtjANYCYWH7DcK6MgDr/YSF7a8Q1uYArI8RFrbfJKyrA7DmCQvbXyWsawOwniYsbH+NsF4YgPVRwsL2LxDW9QFYZwkL20vbkoIlcUtyphtw/SByJuFfJFmN5enmTDdcv15RP5wz3VRkLSt1HGtuKnxuKnw0rFVDrDVDrHVDrA1DrCuGWJuGWFcNsa4ZYnGs8c2L0WfZavXNi9IO7Q3pskCjzYWIkTTvZp0+n15P0R+8xrq5nsAvSb4loJF1rm+en1HascxLHj6DZBY6LTflozQYgzmPxNyU813MTZep7qLSL85NcVy13FT0hrlpnvrzq/GHAslvPFdU8JnCJF0dwD5EJ0P8nDvYfQhtu5R1sRKEd6OaVhcrpIvlQLrwxQttT0botdx/WaHHbb87nfvX795Z+eIrzTsTQMquj+KUiO4yfV9KEGuJ6Fbou7gty4FYWFgO3lZk+qUB9FodY4gprhPtUvy9srfSvZt9JQx+99SktrTDPgl/ccs1RVdp3UZ4FQkrlNtofUP5efrD9DHNEnhjSKyCUhdiTNc9/Ub+JY+s5QRZo8JT6JNx56Np9vcyO7HZn1AP2SB6qM+ltUe5VnT9cS6EPWZJHtYPLxNziqxlpY5PkuUUPjmFj4ZVMMQ6b4hVNsSaNsQaH9E+Wo6jZR9nRrSPU4ZYpwyxzhhiHTXEOm2IVTLEsrQJS3+09CFLm7DU13FDrElDLEvdTxhiWer+hCGWpb4sY2HREMtSX6MaCy31ZRlz3g05k6VNWM7blrp/zhDL0u4tdV8zxLLUvWUfLeOEZQ5gqa8jhlj8dpu063q5flGhX1Po5RYP3iaRtrKHgrdCDPcsaj494a0Z4b+bJ4Ll+yzR8RPBqPsLCViOvs/StazTnwj2ndpPO774UxMo77hCj3h8ev2JeOAjPf5BrMyyIlMW8OXpA97Lc8Az7F5yvZYhfs7tHB9H/Iskq7HtdvfbtKNG2p6t6G5TkbWs1PFTxdoxpE2Fj4ZVMMSaMsQ6ZYh1xhDrqCHWaUOskiGWpU2UDbHGDbEsbcJSX8cNsSz1NWGIZamv84ZYlrY6bYj1bhjHE4ZYlvqynIeKhliW+hrVechSX5bx3tK+LGOOpT9a2oRlzmSp++cMsSzt3lL3NUMsS91b9tEyToxq/nXEEEv2j7THUtaIj7aGveLhg+2vpMDS1sNCrz3G4tun0h5jkb0HPB4eYp9KGw/tUZjd7FOJ3qpEx/tUOMZXE7Acfa/StaR9Kj5z9eVY+aLfNcJYir9X9li0Y8tsoxmQUfp7ZbtHczmhD78B+11/OLkTE+1MxhOPvPKjg5p8/D2v0I5RndB+FWT7o1i2NGfaAo1DK0P8RC8uoe/7daZNGyeUcYz0E2jPbyvj+uNZVuEp8spY+mKv+DO+6QLpN6CP7P8Yj/J07WuxUsoKJj/GnDb+R3Pd747t7Bv7gfZfcPmab14ROuGD503F7yN5vj62sw3HCWwbfX4a6pH+C5M9zG/EmNojwywj+yLGoqisbe+kF1lk355pOI4J/Z9ArPgmxbHLSp+f9sgsmHjPAx/9eD5Bhm/TfBDIz9T5QHjt9+Py/LwB9j/QufzUcVj4FxWdhIjD6yn1OipxWOTV4jCfvQ8Vh/8uUBz+PsUo7A+/1kAbt3UFt6y0Zx1iu73Ge01mn9/tlg9iYc6I45oUO/HeN45HDq6jzXHsFPp/hPj9p55cD+e2N8cGy5pRZM0T/c/C3PZDshu8z87PZeD4XKS6ywrfDNE6kBNpeD4SOccT6C8m9OtflHvZGUUX2rheTJAhl9Cv5xNk+NddjOtbY4NlxXHltYXQX4Jx/TcaV5TdN66XqA7HVXSk5UE85rhu0tZS7JPY/uAfUW2lfixzVF+VFXZt2KpkCB/lWVP0EzhHqmtzOs97g+b0NdAh0uNnaY/XsrFhaM+28ZkOrOP5fi/P+4XE8uUhOKZR3PkfWg+GmLe1GBFi3RkVidNaXsXrjGHzKmyfJq8Km0fPzqeNefxMbajnkX22rOlViwEbpHOsex98HmTnyEfDOj2iWEcNsaYMsU4ZYlnqq2SIVTbEOm6INT6ifSyMqFwzhliW/mg5jtOGWJY+NGmIZTmOlrZ6zBDL0r5OGGLlDbEs7X5UY45lH48YYj1jiHXSEMtSX5a5iaV9jWpeaGn3o5rLFQ2xzhhivRtyuVG1e8vc5HBOGw5rVHO5UY2FlrmcZSy0HEdLfY1q/vURQ6xRzb8mDLEsfdvShyz1ZTkPWfrQqOreMn5Z7suN6t6QpX1Z5r6jmmOO6txRN8Q6Se3wntQKYMg9K7yXannfV/CvBcIXXWk/1YF9Ev58D0rqtf+CxXXCq+j69R7i/prWN58d4DMXqIMkrKtDYhWUuhBjuunpN/IveWTV+rFhqJMxQ6wcYaW9ryr02rM5mp2805/NEb19mug2tnt6YN9I+2zOp+la1unP5mjnEfgM1rDnEbQzYvt17uGd1p80Z9fCnJuoLaadZ/i8eOiza5pefT/zmPYd4fzL93s5+1QzxCoZYk0aYo0bYs0YYhUMscqGWKcNsU4YYhUNsSzH0VJflrY6bYhlaatHDbFGNU5Y+qOl7kfVVs8bYlnahKWtWurrlCGWZYy2zAGOGWJZzh2WPjSq9vVuiF8h5qGDO89eT/3TrcL/cT/P/iH4jHXI5yDukView7G8f2B5v8Xy/Oy4Idao3s+z7OOongUZ1eclzhtijerZLEv7soyFlnIdntc7ON3XDLEs7cvyXr1lHy11P2GI9W44H3QYJw5O95Z9tHyGxjKfGFXdW56dOfSh4bDmDLEOfejgdG+5drdcI8v5s0Hv1vlWbidP2T9JerfOCtQj/X/me5h/ntvJ+wLwFizZ2wpzT71WyRA/5/S9LeFfJFlt5entbWnv/UH98N7WsiJrWal7Ej5jHfJZVvhoWCVDrElDrBlDrIIh1jFDrKOGWCdGVK5pQ6xxQ6ziiMp12hDL0u4t5bLU/RlDLMtxtNT9hCGWZR+PGGI9Y4h10hDLUl9lQ6xR9W3LuUPyCe0di5epDt+HtpbAD+miInnpKtRb5oGh3/OXof5in7FPfA53BegzCf8Fi+v4/fYrgXTn6xvKz/aD71tEHSRhrQ2JFfh3BrpjuurpN/IveWTV+rFMOtH4aGsUod/wyIX02tlyaRv291B7zz1o443nK4T/bp57EL09RXT8mySo+/UELEffn6JrWcDDov0+MZ/fv0B9SBrfstJe6NKs7cPEgXo9bVwS/vu1tl9JqVfR3aoia1mp47W95p+rCh8Nq2SINWmINWOIVTDEOmaIddQQ68SIyjVtiDVuiHXEEOsZQ6yThliW+iobYln642lDLEu7t4yFluM4YYhlOY6W8ctSX6cMsYqGWJb6svQhy3zCUl9nDLEO4+rBxVVL3T9niGVp95a6rxliWereso+WceK4Idao5qsfMcSSfDXwPmntcJ901+Vwn9TTb+S/133SvegkS1hZBcu355p2bGdc/3hK28A+1t1zXXbJekL+u9lzle81olvb7umBx241AcvR9xpdyzr/niviXUqQU/jyNbaVS8Q3KoPOcn01r/NMOsvFv50q9D+As1y/k9/ZR2z/RPxZ7ChHMi/F3yt7KvWmttfsSCf4+3S8z3oJ6Fe3e3RcsvQd+xTZ5Vfg9+qYjuVBW+DfzhPMpHHBcUP638/3ZPn2pI6Zcbp9yT0IoRddjgMd0rAMQv91kIF/V1docgn9yiVg/gXY2zfyOqZTMLV+XaR+sQwXSAah/yb0S34bMev6x49tkK9F35+FzxddMlZGwbqUAiujfOcx535Hfx+Pvyfphsdc6L/jGfOMIgP+niWPT5ZkYBr+7Uqh+Z4iQzRfyDOErbuf/+Jq8/P33ni146jk4DOGB/nOw8dDkFFwkoqIHHVPzNrnCtwOvz+ryBB1WcJPu/Nq534nodPcybEEZmNOLxzHpF1Uwsb7R3kD8nNOz6eFf9H1236IfDpH8iTN4TxfYduyUid90uZY9ueMIkNGkaHsBseDTMr+TLvefZ179+++nmRzbCtsWzj3sjzc3hGWFiujEjnaj+PP+5WHMdaY08diY/vRf/GXZcJair9X9lR6vzUq+X/e6fPBMtQj/ZsQW79L8X3Z9etLeycdy4D03O+oaOcUVtxg3lpOE3Yvov+3XPMJfVuFeqT/kUe/2lrVp981hR77LfKIfrV1b1r9rm0/+j/q+n3rAPWL/rVGdSg7xyFN98uKXFocWk6BdUnBwnzpQfLwmS90Xr95934HQxZ319HnAl3jtCJH3y8kiDpFdBfpO2+z8dSyRN8/rsinFZEDy5SHV1IRExRd/QeY4PfIBLUpB2WQMMbLe2yLy3sxLzwqx+Y17KNj2F7oND58xHZTaZehOpRh0yMDtt+fV103uqFHXn2ctCS/CvVI/xNP6NFeRb2s9J9lQPqrRBMVTffXqA7bsW0M+4psbH/Vw+fKHvlcUfhkE7CllBRcjFWoG1vbqTQyxE/kxWvIv+hC2nJvmeKzo6jwMuUFRdayUrcIn7EO+byg8NGwVg2xfPGK/WfYuKjZt+8nDEbV5gIdq/banKbXYW3uKfi8VzsJgTXj+sebY5Wmm2sePtiefzYD27HNBfrJgNm0Nif8iy6oD1R946fpVXR3XZG1rNSxnVxX+FxX+DxOWNX4s9ivFk936yfYXuhKSrtMwn/hw9d2Owdco/4MOwdovr3Xn7HR+Azr97vlg1hy+5B9xIIP2tvzbiefDUWGaI2zPt5rE/3diGkwL8e2ssWWJ/r/nuhhbsaYWs6KMmL7HFy/qvSD+d2IeUgsvgltDGNfBR9HcMQr8FqpXaI+Yykp/WbfvwV17EcvQh3b/iehDseLC6/bURfR0uwvU9y+1WzkBaq7ofRD6m4q/dDi1VWqQ9+/QXUYf25SHerjHHxGHlHJuv6xk32HNHmzfEe/eF7hnSf6e+QXYXKCWtM3vxQUXVnyThMfkb8vHykqdbk9yNpZaHUWtxqNufnG7Gy9NT9s7sBxEem1bdSw8a+2IL6b3e7h3wC9RiUHddepLg91ImMUFrKFnfLfCCR/Gv1rMQDpr0AfhhnLY64/DnFutFs///V98fN6++D8vN4eZT+vdbZac83m7XrrdqXVvN2x9PN1hT6snz868vVQhu0e/uPj5/WmhZ/z0Zm9rPf4PoxFzDjce+2W4HuvH4bPHP+G3bsaM8Ty7YNxDjnsPpj285gHuA+W2uYO98H2B0vbu+J8Zljb1n4C9eByjvR7r8K/6IL6QNU3fppeec8A25aVOrYTLR+5ofB5nLB47xVth+13WD/B9kl5qNRr/4UPX/P5I9971nxot3OAL+8IsSea1u93ywexeO/1hiEftLe0e69/S3uvkjen3XsV+m/B3uvfe/ZeUUZsn3bvVeh/QGtP3GcMvfcqvALvvXZ4fxWLtr/Kvp92f5Vt/yWow/HiEmrv9TrVafurUndL6YcWr3jv1be/ivHnFtWhPnjvVYtzOHa893qY63pL8Fx3Fj5jHfJJm59eMcTynbdK2rtDPr7zVtpaLc2aftRsLvSa/oWUen03rK94TT/s+kq7r3a4vuq3ucP11e6xfOsrtt9h/UTLTUKvr3xzAK+vhp0DNN/2zQG77c+wfr9bPqO8vjo30WsT/e12ffU5WF+9L/48Q+1ZRpzvcX21ofSDz7h/KOYxCmdbwvwUsu36iv0o1PpKdDHs+mpD6Ydv/15be/nyGv4JZi1n1eIPr7186ystzuE6gNdXG0q/+Hteod2kOqG9AD74WY8P+p6XWUvoE8YDpP9ggiyXY/6RCRwp6JhjCmZU+BHVMHlN7xG/60oftbkhT/Rr0Mfvkq3jPWJ8nXhUcttB+lONRDha6MnB9pcHvjwv+datrCek950f860/tdezow/wY7Rh1lM9G8Ax5nlP80ehfzGlDYheD8IG8Dww24AWs7Rzxz6bwbHhOOt71kHjjXbBNhBmH8dvA9o8wTbwcyltQPR6EDaAemUb0PYFkT6NDWhzdBob0M6941zA500Ee9zp85Hg8Xx0B8ZIXqUj8uFPsrD9rinYOL/64llG6UeJ6rAt/vQh59d3YW7/Y8p9A91b6L66TvLIpNh4y+2UWejvKX6RoTaoL9/c86JCf0vRoZYXvkh12p78DNFGn3mtIjlzTsGOPvNaRei/ROOF+XXotcpL1IcXoQ+sx6jw+k7ofxvs75cot9TWIJo+OXfX1iAzitwyDqK/V1wQ/XXt/VOup4OsIusrbqeOhP7XUs4DeH8uKrntIP1paPPAy65XeB54BeqyCj375KcUehwb0VmZ6Nk/8TtifRKu8TwgOhx3+hjhPgbS/6ZnHsB89WWSHfOAF6ku7XrxJZB5f2L4bIX3ArD4nmXR9gJ4D+FlqOM9BLSDYfcQRBfD7iFYxCE+zzsqfivjEBX2W/TRrELPfjvIz2V/sOz6x9L3rM9LVJfGZ6KySfzQXmRs0Gd8MUNbP3AOjG1xD5Rzrj+DOe/txyTn+s6QOZe2D88yIP3jknN9/x2Qc/0z2N9f7zLn4vMo77Sc6x8Oc66Rz7n+aZc5F+4pWORcbz+GORefu3pccy5fHDrMuexyrjQ+E5W0OdfbgXIuOdfL7yz4X5jzFmM7DHyPt87xLSnnSopv/+fJuTR9+XIuLUfDfnPOheN2i+rSnku9TjJgvuIUes65hH6cxgt9PHTO9Unqwy3oA+sxKpxzCf3TcR8i+ytM7tSZdq9Z0ye/fyFtHJRxEP29HEZ/dY5JaO8o68tup46E/misl0E5F56TiEpuO0h/DjR2a3E2aR7G74iFeQLnXBgztTESPF67noUx4pwLcyeeP/A+LZ8tv6bw1eYknD/2J4Y3bvN5GCzaeRjOndAP+T0wafOxYd8Dg8+AD5NzWcQhfjZ9VPwW1x/st+ij2nqF/XaQn3POhWPJ9o0+w2usND4TFc650F66c6jr+YwvZqTNuW4A7jo994TvUJX3KfjOC2Wov5o8QoOfN0EGjZ7v2Qr9ihLDwp4HqWyJzLt99+6GMjdmqA3qzffab4t374Y9O9HTl3Z2Qnt3HJ+duJEyl7gE/YlKbjtIf1paTMJx45iU9t0KrCek197lp8WdTarDn0jjMxfamQaR4ZIiQwau+c4qSNvIl9+KO6fFDI4n2vu6OT6gPNq7ldmPxhPok85H/rwnngTyj6bPP7BfSf7R8sQTzfbwnfXD2h7HE+0MZODnrbrxRDuTuanIw2cyP5synuzPmUw9nuznmUyOGb5nTjGe8Jlo9Nk0ZznTxhM8+/QmxROkW0vBE98Jtbb96L/YK9qO4fi2OSYl7R0lxaQvefxbi4u+fEHLL7DfvHekvVsxsL62fPpaT6GvX0np3xnoT1Ry20H60xr2rKU2pr6zloPGVHSm3XPnXAJ9iHOCjMIH/Yl9eJ3aRyXy4a/HHQip9/mFSkV4ypiLHXHJQT3S/1ZsO0Xoh/zfyzvvbs83q7frzdvN2Wa73Wg1ea8yKjLGU+6RHX8Z7Fj4O2onfpl39vqsDPHzdsK/SLIay9N95jRP8rB+RJfTrvebOa/ebbbjX4MbI1Vil1idCMfdRrVgXZauZej7GLUTN9JMleXMKBiaCvixoozCP0vfURdOuTam0GdSYMnnrEeWJIwMYZQ8GNFQW7tua2tuqxG9srLamKs3Ku1BrmvNvzHbnG8156vVxUa106jO7jf/zlZjcX5rsTVbaVcWq4v1/eY/31x4wH2x0WzMVVqV+bn95l9bWJhbrG1VGvPt1u12Y9/7v9Wea1UW69V2szn/oPsL+97/drtTbVTnFxc6jUZ7cf/tb2HxgeHd7jSr1WqtXensN//Z9tZCZb7WXGy35tr12dZupm6crmR7OUqL/opS+3gndkf6i2359qTQ/xBuT/4N3Z7EuUxknqH2GEOlbgLqslQ3CXUy50hfJcVzrj9NKRLmUvy9sreS+tUYwr9IsoZKU4okD+rcuf5XFE+Fkach8kwr8hQUeY4++Dvi+scM5RMszDnWtx/91+wLdc168OmmrLQfpzotFZW6MUUGqUMbmaA6TGHF3qcS+sb5o2Bpfsxtk3SBfi+5XJ7wfwR+n4k7p/kv+z36L/s9+wTWoS2IfsR2p6ndUvy9srfStV1ZzifpdNrt1JHQv+XZStH8YRKucR5aUuix33nSF/pLifRVCqOv7jGOIwP0VSJ9Cf2/e/Sl9X/Co68jCn3Joy/UJbZl3kmxaL9scZBu2RaF/r9SblNNQn+iktsO0p9ZbZtK9PpQfuCb5C9In2b8NX8pEz2OtxbjOVYj3ymqw9jM8R9jvMQ2jKWcv2Gs5vwtKhPbbkd/H/6Ha6JP6dsk0lNdAepy2zv5FOPvcoyNsUSOPNGXYI542AdoI+3LCv9x4r9DbuUajgdjZZVrQh/pdDyWMcha+sE+3Nzt+cpsrd3o1NoDt+E0PaGfRkV0jWMxrvQtT/QnC70+nwZ7e0ir8IvoznvoMgn/H2Io13LbO69pY4S2K/TCu7jdL6PUTUEdxpCoTMffUV+IJXLkif4DZLtob9K+rPCfJP475Fause1OKfRTCn00PmdjGcVuse/W64uHPAkfr7Fs58GvfgqOkDXzHoABAA==",
75
- "debug_symbols": "7V3bruvGkf2X8+yHvlTf5lcGg8BJnOAAhh04zgCDIP8+EilS2hap7q3dJKtY6yWw45Z21arFuiyRxX9/++tPf/7X3//0/Ze//frPb//13//+9vOvf/nx9++//nL5t3//54dvf/7t+88/f//7nx7/72/m+j+2DOf/+Y8ff7n+6z9///G337/9lyVn0w/ffvrlr8M/53z5jr99//mny7+Z8p8fns5nE26ns/Pz2ZgXjgY3HQ3B3L+W7H/+54dvznSxJsTJmpRfW0O+3I5SzE/W2B7WFONvp4tNr62JM4zRxSdrXBdryE7WBKpYk83taDLPkfKL1gTy0/fbEPLDx66+P1szQWPtnTaUhj9AW/+BsPUfiFv/gbT1H8hb/4Gy8R/wZus/YLf+A27rP7D1ley3vpL91ley3/pK9ltfyX7rK9lvfSXT1lcybX0l09ZXMm19JdPWVzJtfSXT1lcybX0l09ZXMm19JYetr+Sw9ZUctr6Sw9ZXctj6Sg5bX8lh6ys5bH0lh62v5LD1lRy3vpLj1ldy3PpKjltfyXHrKzlufSXHra/kuPWVHLe+kuPWV3La+kpOW1/JaesrOW19Jaetr+S09ZWctr6S09ZXctr6Sk5bX8l56ys5b30l562v5Lz1lZy3vpLz1ldy3vpKzltfyXnrKzlvfSWXra/ksvWVXLa+ksvWV3LZ+kouW1/JZesruWx9JZetr+Sy9ZVsTZdL2Uc//dTr48Mv28ksHLYp3846c7fHJb/48z3dzmZfKmdLnn5cL+Xj2cFRq8VRp8VRr8VR0uJo0OJo1OJo0uJo1uJoUeKo1dIZWS2dkT1RZxSns5cO3j17eqLWqOIpqfH0RM1RxdMTdUcVT0/UHlU87dQf5ek+dJ+tqXga7XTYRne/wX3RfDIThPR4g3uwo/V9mp483xDvSyivrffRTTe5++TvJiU3WOQMO4ssO4scO4s8O4uInUWBnUWRnUWJnUWZnUXscrZnl7M9u5zt2eVszy5ne3Y527PL2Z5dzvbscrZnl7M9u5xN7HI2scvZxC5nE7ucTexyNrHL2cQuZxO7nE3scjaxy9mBXc4O7HJ2YJezA7ucHdjl7MAuZwd2OTuwy9mBXc4O7HJ2ZJezI7ucHdnl7MguZ0d2OTuyy9mRXc6O7HJ2ZJezI7ucndjl7MQuZyd2OTuxy9mJXc5O7HJ2Ypez0wE5O5vp/j6fvX2yKLOzqHCzKBt2Fll2Fjl2Fnl2FhE7i8KxFpF7suiAnJ3IzxY9bLG9WPR8uN+d1Tmp8TSr8bRo8bQYNZ5aNZ46NZ56NZ6SGk+DGk/V9EhFTY9U1PRIRUuP5MyZeqSXjyo5c6YmqeLqmbqkiqtnapMqrpIeV8/UKFVcPaBTyrHMribzB33LmcTOoszNoiPuja5YdISWPPcWvlj7ZBGxsyiwsyiysyixsyizs6hws+iIe6MrFh3x+192d4v8k0WBnUUHXP1lfskeGRNetznuYv/tsPPlfqtAuL3PLsk2P8s2v4g2/4g7g3uab2Wb72Sb72WbT+zNN3fz85P5Qbb5/KvuS/O5V90wv3/40gSGR/OfD5OZGyQyCxcK9xL9OV+jfeUr93pOMcy+Prx0e9HX+x1Ume5G2ItYdnU1ca/9HV3l3id0dJV7T9HRVe79R0dXSY+r3Cvrp1wN09mc4gdXF77Yzpsm3XU34nSa4tLhPKHhzYejA4TcC7YACE/VBxwCYT5Vf3EMhKfqW46B8FT90DEQnqrPOgZCAoRfhZC73iUAQu6amwAIMZ18GUJMJ1+GENPJVyEsmE6+DCGmky9DiOnkyxBiOvkyhAQIvwohppMvQ4jp5MsQYjr5MoSYTr4MIaaTL0LoDaaTL0OI6eTLEGI6+TKEmE6+DCEBwi9CaNWy0BQ3Q2jiawhznm4jLdZVvtiWbKdvvvyze3ikOOcRc7W0PRBztVP4gZirHdsPxFztnH8g5mqFgQMxV6skHIe5Uys9HIi5Wq3iQMzVihsHYo45dH/MCZjvjjnm0P0xxxy6P+aYQ/fHHHPo/phjDt0dc485dH/MMYfujznm0P0xxxy6P+YEzHfHHHPo/phjDt0fc8yh+2OOOXR/zDGH7o45YQ7dH3PMoftjjjl0f8wxh+6POQHz3THHHLo/5phD98ccc+j+mGMO3R9zzKG7Yx4wh+6POebQ/THHHLo/5phD98ecgPnumGMO3R9zzKH7Y445dH/MMYfujznm0N0xZ//K0DNijjl0f8wxh+6POebQ/TEnYL475phD98ccc+j+mGMO3R9zzKH7Y445dHfMz/X6aiGYYw7dH3PMoftjjjl0f8xJLeap3DFPrzF/ueY56R0ru0God0rsBaGoF7V68xrCFKccl1J88lQSWb7mqaRB/mue7j8+k/Fh9rRUPPXeztee9/fr9PqCgMH+Itv+A97L2dd+K9x+J9x+L9x+Em5/EG5/FG5/Em6/8Pp7wMvvyNI0Wl/+inltfzY0zQT+/r0u+YWzJcdpwC8fz148pQPeUXeUp1aNp06Np16Np6TG06DG06jG06TG06zGUzU9klXTI1k1PZJV0yPZI+qpyZOn1n2YxQaLIjuLEjuLMjuLCjeLnGFnkWVnkWNnkWdnEbGziF3OduxytmOXsx27nO3Y5WzPLmd7djnbs8vZnl3O9uxytmeXsz27nO3Z5WzPLmd7djmb2OVsYpeziV3OJnY5m9jlbGKXs4ldziZ2OZvY5Wxil7MDu5wd2OXswC5nB3Y5O7DL2YFdzg7scnZgl7MDu5wd2OXsyC5nR3Y5O7LL2ZFdzo7scnZkl7Mju5wd2eXsyC5nR3Y5O7HL2Yldzk7scnZil7MTu5yd2OXsxC5nJ3Y5O7HL2Yldzs7scnZml7Mzu5yd2eXszC5nZ3Y5O7PL2Zldzs7scnZml7MLu5xd2OXswi5nF3Y5u7DL2YVdzi7scnZhl7MLu5xduOXsYLjl7GC45exguOXsYLjl7GC45exguOXsYLjl7GC45exguOXsYNjlbMsuZ1t2Oduyy9mWXc627HI2u+cgA7vnIAO75yADu+cgA7vnIAO75yADu+cgA7vnIAO75yADu+cgA7vnIIM7086WOJ21xrgPhwdXz7S0peLqmba2VFw909qW1676M+1tqbh6psUtFVdZbW4ZLDqgkntHs0UPCywni4idRYGdRZGdRYmdRYWbRUc8i1qxyLKzyLGziF2GJHYZkthlSGKXIYldhjziWdSKRexydmCXswO7nB3Y5ezALmcHdjk7sMvZgV3ODuxydmCXswO7nB3Z5ezILmdHdjk7ssvZkV3OjuxydmSXsyO7nB3Z5ezILmcndjk7scvZiV3OTuxydmKXsxO7nJ3Y5ezELmcndjk7scvZmV3OzuxydmaXszO7nJ3Z5ezMLmdndjk7s8vZmV3OzuxydmGXswu7nF3Y5ezCLmcXdjm7sMvZhV3OLuxydmGXswu3nB0Nt5wdDbecHQ23nB0Nt5wdDbecHQ23nB0Nt5wdDbecHQ23nB0Nu5xt2eVsyy5nW3Y527LL2ZZdzrbscrZll7Mtu5xt2eVsyy5nO3Y527HL2Y5dznbscrZjl7Mdu5zt2OVsxy5nO3Y527HL2Z5dzvbscrZnl7PZPXUY2T11GNk9dRjZPXUY2T11GD27nM3uOcjI7jnIyO45yHjEc5AxhMmibMujRc+HP/VQfI63s6V8PDt46tV4Smo8DSfy9OVKh3jEg6ZHuZr0uJr1uFrUuHrEw7xHuXpAR5PJz66GiqspTmdTivNRiqPxTrLxXrLxtLvxwcbpu4N9+OpF470r04Y77y3Nh2/WB9HWR9HWJ+bW+1hm63N6sH7herKzp+Rs+qOnWY2n5VBPnct/HIsPeLS7ZpFlZ9H+1TMkM42DIaX8mp+W0ty6BOvvdmRaOB3nlaaX34wezo5tzgEPjR/nKynyNSjyNSryNSnyNSvytejx9YBVBcf5ahX5qqhvSor6pgNWQhznq6K+KSnqm5Kivikp6pvyueorTYcvvz88+3quPByntfqXRv/ZV+55ONgwG+Lpg6+D/dxza81+7vmyZj/3HFizn/08SHdDfKhc67a4PKeG4sofdfLCfiLs6i37mtXVW/ZTYVdv2c+FXb0lTt4OFrHqGwaLWHUCg0UH1PZsp59UQwnpNUepTF8c7GNlXPpil8zURrrk3B/5mdV4WpR4mg5Y5nKUp1aNp06Np16Np6TG06DG06jGUy09UjJaeqRk1PRIVk2PZMX2SIP1YvuewXqxvcxgPYm2XmzPMVgvto8YrBfbGwzWi633g/Via/jVese8Lgc33xdPuVKXrcl+ehDq8s/B/KEyO+aVuauvzOt4V1+ZV/2uvjKvU5/ztYTZalOi/aOvzDPrJ33NZrLaGhP/4Ks/VR6u+HqqPFzxlXseDnN3kKnqayrhnpvsk6/c83BPX0mRr8wnu66+cq+vn/L1dS/hmU+NXX1lPmN29ZV739TRVzpVfX3dD9Op8vDrvolOlYcrvp4qD1d8ZZWHB4tYZcurRYHVLDhYdMDEVuY+LfqHtL98D2lKM+nSw36UZD/9890Bi6oOc9XrcZX0uBr0uBr1uJr0uJr1uFrUuHrEmq+jXNXTLUU93VLU0y0dsZbsKFf1dEtRT7cU9XRLUU+3FPV0S0lPt5TkdkuD+XI7oMF8uV3NYD7JNl9u9zGYL7ejGMyX2yUM5sut/IP5cqv51fwst0IP5suuull21c2yq+4Ra996mi+76mbZVTfLrrpZdtXNsqtukV11i+yqW2RX3SK76h6x2qyn+bKrbpFddYvsqltkV90iuupmI7rqZiO66mYjuupmI7rqZiO66mYjuupmI7rqZiO66mYjuupmI7vqWtlV18quulZ21bWyq+4Rq7B6mi+76lrZVdfKrrpWdtW1squuk111neyq62RXXSe76jrZVdfJrrpOdtV1squuk111neyq62VXXS+76nrZVdfLrrpHrBLrab7squtlV10vu+p62VXXy666JLvqkuyqS7KrLsmuuiS76pLsqkuyqy7Jrroku+qS7KobZFddwbvgBvNlV13BO9sG82VXXcG71QbzZVddwTvQBvNlV13Bu8qu5gvePzaYL7vqCt4TNpgvu+oK3uc1mC+76greuzWYL7vqCt6PNZgvu+oK3mM1mC+76sreTZVl76bKsndTZdm7qbLs3VRZ9m6qLHs3VZa9myrL3k2VZe+myrJ3U2XZu6my7N1UWfZuqix7N1WWvZsqy95NlWXvpsqyd1Nl2bupsuzdVFn2bqosezdVlr2bKsveTZVl76bKsndTZdm7qYrs3VRF9m6qIns3VZG9m6oY0VW3yN5NVWTvpiqyd1MV2bupiuzdVEX2bqoiezdVkb2bqsjeTVVk76YqsndTFdm7qYrs3VRF9m6qIns3VZG9m6rI3k1VZO+mKrJ3UxXZu6mK7N1URfZuqiJ7N1WRvZuqyN5NVWTvpiqyd1MV2bupiuzdVEX2bqoiezdVkb2bqsjeTVVk76YqsndTFdm7qYrs3VRF9m6qIns3VZG9m6rI3k1VZO+mKrJ3UxXZu6mK7N1URfZuqiJ7N1WRvZuqyN5NVWTvpiqyd1MV2bupCvvdVJffPidDSshP5rOvuoVuh50x5dH858PZTGezvx91yS+cLTnezpby8ewAC/tqfggs/HdpHQML++7jGFjYdzXHwMK+WzoGFgIsS7Cw7+6OgYV913gMLOw1oGNgQZe7CAu63CVY+O+uOwYWdLmLsKDLXYQFXe4iLARYlmBBl7sIi9ouN05nrTHuGRe1bW4FF7V9bgUXtY3ua1z474s8CBe1rW4FF7m97mC+3J50MJ9kmy+3xxvMl9uLDebLbZkG8+V2NoP5chuQq/n8N1y+Nl9uOR/Ml111+W+4fG0+86rrbMm3w5RNfN0Lkp/PRrqbnBe/+H7nkLfOvv7i13gMODIv/2JwZN6HiMGReUMkBkfmnZkYHJm3iEJwvOgWzJtVOUAyb5vlAMm8gZcDJPNRQg6QBCD7AImpphOQGGs6AYm5phOQGGw6AYnJpg+Q3JdvywESk00nIDHZdAISk00nIAlA9gESk00nIDHZdAISk00nIDHZdAISk00fILm/4EAOkJhsOgGJyaYTkJhsOgFJALIPkJhsOgGJyaYTkJhsOgGJyaYTkJhs+gDJ/SUycoDEZNMJSEw2nYDEZNMJSAKQfYDEZNMJSEw2nYDEZNMJSEw2nYDEZNMHSO4v6pIDJCabTkBisukEJCabTkASgOwDJCabTkBisukEJCabTkBisukEJCabPkByfxmiHCAx2XQCEpNNJyAx2XQCkgBkHyAx2XQCEpNNJyAx2XQCEpNNJyAx2fQBkvsLXOUAicmmE5CYbDoBicmmE5AEIPsAicmmE5CYbDoBicmmE5CYbDoBicmmD5DcX9orB0hMNp2AxGTTCUhMNp2AJADZB0hMNp2AxGTTCUhMNp2AxGTTCUhMNk9ADsBwf+nyccBg8lgBBpPECjCYDFaAIQCzDAw69xVg0ImvAIPOegUYdMorwKDzXQaG+2vEjwMGne8KMOh8V4BB57sCDAGYZWDQ+a4Ag853BRh0vivAoPNdAQad7yIwFu8kXwMGne8KMOh8V4BB57sCDAGYZWDQ+a4Ag853BRh0vivAoPNdAQad7zIweGf1GjDofFeAQee7Agw63xVgCMAsA4POdwUYdL4rwKDzXQEGne8KMOh8l4HBO43XgEHnuwIMOt8VYND5rgBDAGYZGHS+K8Cg810BBp3vCjDofFeAQee7DAzeebsGDDrfFWDQ+a4Ag853BRgCMMvAoPNdAQad7wow6HxXgEHnuwIMOt9lYPBO1DVg0PmuAIPOdwUYdL4rwBCAWQYGne8KMOh8V4BB57sCDDrfFWDQ+S4Dg3dmrgGDzncFGHS+K8Cg810BhgDMMjDofFeAQee7Agw63xVg0PmuAIPOdxkYvFNxDRh0vivAoPNdAQad7wowBGCWgUHnuwIMOt8VYND5rgCDzncFGHS+y8DgnXtrwKDzXQEGne8KMOh8V4AhALMMDDrfFWDQ+a4Ag853BRh0vivAoPNdBgbvcFsDBp3vCjDofFeAQee7AgwBmGVg0PmuAIPOdwUYdL4rwKDzXQEGne8yMHiH2xow6HxXgEHnuwIMOt8VYAjALAODzncFGHS+K8Cg810BBp3vCjDofBeBced6I5edz7r0AZjRV7mFZrRfbj0Y7Zebtkf75WbX0X65SXCwX/Bbd0b75Q7To/1ya8Vov9zRdLSfhNsvvP4Kfr/KaL/w+iv4bSWj/cLrr+B3f4z2C6+/gt+kMdovvP4Kfi/FaL/w+iv4LQ+j/cLrr+B3Joz2C6+/gt9AMNovvP4K3uc/2i+8/grejj/aL7z+Ct41P9ovvP4K3tw+2i+8/gregz7aL7z+Ct4qPtovvP4K3tE92i+8/greeD3aL7z+Ct4fPdovvP4K3sY82i+8/grebTzaL7z+Ct4UPNovvP4K3rs72i+8/greYjvaL7z+Ct4JO9ovvP4K3rA62i+8/greVzraL7z+Ct7+OdovvP4K3qU52i+8/greTDnaL7z+Ct7zONovvP5y35pIOfvJ/mLp2X7m9Zeyvdvv3KP9z4ezodvZ7O9GXDi2cLbkeDtbysezIy7M6/phuDDvFw7DhXkfchguzPubo3DhvtfwMFyY92OH4cK8zzsMF+b942G4EHBZxAX97jIu6HeXcUG/u4wL+t1lXNT2u3E6a41xz8BwX2d4HDBqO94aMGpb3howanveGjAEYJaBYdX1jiaxajhHk1j1eqNJrNqs0SRWHc7VJG9Y9RajSayq+mgSq3o6msSqko0msaoho0nssrfntfZvNIld9va8lvONJvHL3rxW6I0m8cvevBbdjSbxy9681tGNJvHL3ryWxo0m8cvevFa7jSbxy968FrCNJvHL3rzWpI0m8cvevJaZjSbxy968Vo6NJvHL3rwWg40m8cvevNZ3jSbxy968lmyNJvHL3rxWYY0m8cvevBZWjSbxy9681kqNJvHL3ryWP40m8cvevFY0jSbxy968FimNJvHL3rzWHY0m8cvevJYSjSbxy968VgeNJvHL3rwW/Iwm8cvevNbwjCbxy968luWMJvHL3rxW2owm8cvevBbPjCbxy9681sOMJvHL3ryWuIwm8cvevFatjCbxy968FqKMJvHL3rzWlowm8cvevJaLjCbxy968VoCMJvHL3rwWaowm8cvevNZIjCbxy968lieMJvHL3rxWBowm8cvevB6UH03il715PR4+msQve/N6KHo0iV/25vUk8GgSv+zN6+nX0SR+2ZvXE5+jSfyyN79nLT2/Zy09v2ctPb9nLYnfs5bE71lL4vesJR3wrGW8yMiTSSH6R5OeD/dbwkKG9Lga9Lga9bia9Lia9bha1Lh6wDO9h7lq9bjq9Liqp1s64Jnpw1zV0y1ZPd2S1dMtWT3dkj1Tt/R6Pxu5M7VLNV/P1C/VfD1Tw1Tz9UwdU81XUuQrq55pNIlVbzOaxKoHGUw64Nn+GNL0tqwUfHpN0kszczt7Qe9uRZ7M95zMH03a/7JPZT6cCoXXiLo0H3bJ3Q+HdLM/CLc/Crc/Cbc/C7e/yLb/gOf9+9pvhdvvuNtPNNsf47P9Xrj97OtvxX7m9dfbOBnibSrP9jOvv1X7mdffqv3M62/Vfub119vgXtkfmOd/7+P0fgnvk3u2n3n+r9rPPP9X7eee/2v2c8//PpjZ/vjB/gX5weTpYidTnot14F4sPufsnJmXneVeWXyZKwsZ/8XIci9Dn3P2dWQj85nRk8uzsw+3rc72M58Zq/Zz7xlq9nPvGWr2kyT76dl+7j1DzX7uPUPNfu5tQM1+7pXdpTLbH8vrYmdjnnoem+je89jLr5yDt4l7tUt+7rATha/1MYl7afycs6/7mMS9jsZyd/aj9rfAYzMfttabBR5zr7opTTdv+fyx6i6Fdvpich+v2QVkfJnS2fXW6vm0v6A0IsO9nh+HDPdO4ThkuPcgxyHDvbs5DhnufdNxyHCXTw5DJrPvPrsgM/rKvvns6Cv33rOnr6fqPP00Ll7y+YKvpMjXA+6Z7Xg36AHbnrqan2WbX5ibTzP3w0fzl1wtd1/t/XQcXS3c75ru6KrV46rT4yqr++a3dZX0uBr0uMq9U+noKveupqOr3Dugjq6q6ZaCUdMtBaOmWwpGTbcUjJpuKRjS46qabikYNd1SMGq6pWDUdEvB6OmWrJ5uyerplqyebsly75b8bH2kiqu1ewnDEXvxjnOWe8fU1VnuPdMnnI33/T2JHm4lXPxim/30g6Iz7sHBYG/IcG+xjkOGe0fWB5nRV+4tWUdfHfeebNXX0XxW72R5PuweGops7rdFJ7vYfbz6FTocsHXtOF9ZvUVmY19ZvZ5mY19ZvfdmY19ZvVBnY19ZvalnW189q1cAfdXXftOxZ/UeIka4sHoZEiNcTtW7dcSFgMsiLqfqCTvicqr+sSMup+o1PzHzV1ZaB3+qxrQnMKfqYjsCQ6dqeXsCc6qetycwp2p6ewJzqq73E8C4EKfDLj5U68UvtiVMv0dc7LEPMNINRgKMDTDmedGGM/4jjM+ns53fqJCdKZXTF7fmJynzw09Gnm79F52qXz9niE41OpwzRFqnGEEh0jpPCQqR1slOToiC1hlTUIi0TruCQqR17hYUIigA7ENECBH3EEFd2DVEI+jQCw4AHQrAAaBjpu8PurN30IOrnL7uh7udTqX4ymk//15AD9XC0TJ082vqnHWvDwc3fW94uBfQTSyBrACWVFkSoWyAJXWWQFwBS+osgb4DltRZAokJLKmzhMASsKTKEghtYEmdJVAGwZI6SyBlgiV1lkB7BUvqLIH2CpZcgxKnJwYvEtoTSxK0V7CkzhJor2BJnSXQXsGSISjT2fjx6MgSaK9gSZ0lBJaAJVWWQHsFS+osgfYKltRZAu0VLKmzBNorWFJnCbRXsKTKkgztFSypswTaK1hSZwm0V7CkzhJor2BJnSUEloAlVZZAe1XIkjH0EFTVhh4qqdrQQ/pUG3romVpDXyBSqg09lEe1oYecqDb00AjVhp4Qeq2hh5qnNvRQ89SGHmqe2tBDzVMbeqh5SkMfDdQ8taGHmqc29FDz1IYec/1pQ+/8PfQUnkOPDv+0oU+2TEYn798+PPIE4wB4cvUwxslDG/PTepdoMTuAJy08waABnrTwBFMJeNLCE9yQAJ5cPUxp+mKbyvO8Ywk8AU8aeAJJBDxp4QnuiwBPWniCmyjAkxaeQI8FT1p4Aj0WPGngiYMeC5608AR6LHjSwhPoseBJC0+gx4InLTwh8AQ8aeAJ9FjwpIUn0GPBkxaeQI8FT1p4Aj0WPGnhCfRY8OTqYbFuCnhxzzzx0GPBkxaeqNVjy4yit85WeGJofr315Z/T3Q5rylLsJ8zTnYCUboirVTYPQ1ytRngY4gTEd0ZcrW51GOJqFaDDEFerpRyGuFpV4jDE1c73RyFOaiflwxDHzLk34pg590YcM+feiBMQ3xlxzJx7I46Zc2/EMXPujThmzr0Rx8y5M+IBM+feiGPmvCD+sJhv5ffweYufzZTvKMYbipgje6CI2bAHigQUO6CIGa4HipjLeqCIWasHipifeqCImagDihFzTg8UMbv0QBGzSw8UMbv0QJGAYgcUMbv0QBGzSw8UMbv0QBGzSw8UMbt0QDFhdumBImaXHihidumBotbZxTuafkf1vvbFzrvJZEdUfSb2IpXdTmdnSuX0xa00e/jwnKufQ0QIEfcQaZ26BIVI60gnKERa50VBIdI6jAoKkdZJV06IstYxWlCItM7ogkKkVQAQFCKoC+xDRAjRniEaQYdecADoUAAOAB0zfX/QmexctGX6acE5614fDvNTS8Glx6MjSyArgCV1lkDZAEuqLCkQV8CSOkug74AldZZAYgJL6iyBygWW1FlCYAlYUmUJlEGwpM4SSJlgSZ0l0F7BkjpLoL2CJdegRDOxJNpnlkB7BUtqLEkG2itYUmcJtFewZAjKdDZ+PDqyBNorWFJnCbRXsKTOEgJLwJIqS6C9giV1lkB7BUvqLIH2CpbUWQLtFSypswTaK1hSZYmF9gqW1FkC7RUsqbME2itYUmcJtFewpM4SAkv0sWQMPQRVtaGHSqo29JA+1YYeeqba0EOk1Bp6B+VRbeghJ6oNPTRCtaGH8Kc29ITQaw091Dy1oYeapzb0UPPUhh5qntrQQ83TGnoPNU9t6KHmqQ09IfRnDb3z99A/vC92Dj06/NOGPs2vCnbJ+7cPjzzBOACeXCMeo58CHvPzeheP2QE8aeAJYdAAT1p4gqkEPGnhCW5IAE+uEU9p+mKbyvO8Q7h7ATxp4QmBJ+BJA09wXwR40sIT3EQBnrTwBHoseNLCE+ix4EkLT6DHgicNPAnQY8GTFp5AjwVPWngCPRY8aeEJ9FjwpIUnBJ6AJw08gR4LnrTwBHoseNLCE+ix4EkLT6DHgifXiBfrpoAXt8AT6LHgSQNPolo91tN0o58n4yo8sXHmifOpxpP76exMqZy+uJVmDx9i7yneQqRWCpUTIrUqpJwQqRUA5YSIECLuIVIre8kJkVrFSU6I1Io9ckKkVmeREyK1EoeYECWoC+xDBHVh1xCNoEMvOAB0KAAHgE4AvTvoEl/f56bvDS49Hh1ZAlkBLKmzBMoGWFJnCcQVsKTOEug7YEmdJZCYwJIqSzJULrCkzhIIbWBJnSVQBsGSOksgZYIldZYQWAKWVFkC7RUsuQYlmokl8XnvbYb2CpbUWQLtFSypswTaK1gyBGU6GxdeFpWhvYIlVZYUaK9gSZ0l0F7BkjpLoL2CJXWWQHsFS+osIbAELKmyBNorWFJnCbRXsKTOEmivYEmdJdBewZI6S6C9giU1lmQD7RUsqbME2qtCloyhh6CqNvRQSdWGnhB6raGHnqk29BAp1YYeyqPa0ENOVBt6aIRaQ28h/KkNPdQ8taGHmqc29FDz1IaeEHqtoYeapzb0UPPUhh5qntrQQ83TGnqHuf60oXf+HnoKz6EnhP6sof/Mq4JfHB55gnEAPLlGPMYJDhuzfeYJZgfwpIUnGDTAkxaeYCoBT1p4ghsSwJNrxFOavvj6hP0TTzzuXgBPWngCSQQ8aeEJ7osAT1p4gpsowJMWnhB4Ap408AR6LHjSwhPoseBJC0+gx4InLTyBHguetPAEeix40sATgh4LnrTwBHoseNLCE+ix4EkLT6DHgictPCHwBDxp4An0WPDkGvFi3RTw4hZ4Aj0WPGnhiVo99oLzzJMYHr94ACZoFQzoIqrdqUiVL14/PKKodZzui6LWYfNTKMYc5hXhOd1v3Y03ELVOYl1BJID4dRC19vCfA7GY2eTi0hOIWhvcriBq7f66gqj1p+quIGr9HbcniBEzSwcQMbJ0ABETSwcQMbF0AJEA4tdBxMTSAURMLB1AxMTSAURMLB1AxMTydRATJpYOIGJi6QAiJpYOIGJi6QAiAcSvg4iJpQOImFg6gIiJpQOImFg6gIiJ5esgZkwsHUDExNIBREwsHUDExNIBRAKIXwcRE0sHEDGxdAARE0sHEDGxdAARE8vXQSyYWDqAiImlCUSab3wv4RlETCwdQMTE0gFEAohfBxETSwcQMbF0AFFHs331tRhslDntk/3eTGedt/R4eAy91qqF0BvsfVEbeqxyURt6bMtWG3oswFYbeuy01hp6izXVpw29K24OvQmvD1sz73izJuZnnmBNNXjSwhOsqQZPrhG3fn6tsQ32mScQFcGTFp4QeAKeNPAEciV40sITaJvgycCT2UNr80IfC0kEPLlGnMy0tfvyj8/5xEE/AU9aeAL9BDxp4Qn0E/CkhSfQT8CTIeLO3wNunnlC4Al40sAT6CfgSQtPoJ+AJy08wY1k4EkLT3DXGXjSwhPoseBJA0889FjwpIUn0GPBkxaeQI8FT1p4Aj0WPGnhCYEn4Mk1yml+TXoo7pkn0GPBkxaeQI8FT1p4Aj0WPGnhCfRY8KSFJ9BjwZMGnhD0WPCkhSfQY8GTFp5AZwNPrhH3duaJ98/3xxKBJ+BJA0+gs4EnLTyBzgaetPAEOht40sIT6GzgSQtPoLOBJw08CdDZwJMWnkBnA09aeIL7HsGTFp5AjwVPWnhC4Al40sAT6LHgycATSjNP4vN91AF6LHjSwhPoseBJC0+gx4InLTyBHgueNPAkQo8FT1p4Aj0WPGnhCfRY8OQa8cpe0Ag9Fjxp4QmBJ+BJA0+gx4InLTyBzqaQJ0Pok9rW1NEEove1L3bezaEnskJCX3l7bFLbbSL0hNBrDb3anhChV/uzO0KvtsNH6NX+OI7Qq/29+/yh/5T+Y2yZAm7i8/tSs9rfu8GTT/FE7e/d4MmHiFfe050hKoInLTyBAgmetPCEwBPwpIEn0DbBk4En8y+11uaFPhaSCHjye/2+iAz9BDxp4EmBfgKetPAE+gl40sIT6CfgyRDx1+8jK9BPwJMWnhB4Ap408AT6CXjSwhPcSAaetPAEd52BJy08gR4LnrTwBHoseFLliTMGeix40sIT6LHgSQtPoMeCJy08gR4LngwRf/UezAtPCDwBTxp4Aj0WPGnhCfRY8KSFJ9BjwZMWnkCPBU9aeAI9Fjxp4ImFHguetPAEOht4co34y/dMXXgCnQ08aeEJgSfgSQNPoLOBJy08gc4GnrTwBDobeNLCE+hs4EkLT6CzgScNPHHQ2cCTFp7gvkfwpIUn0GPBkxaeQI8FT1p4QuAJePKt8r7UC0+gx4InLTyBHguetPAEeix40sIT6LHgSQtPoMeCJw088dBjwZMWnkCPBU+uEX+5F/TCE+ix4EkLT6DHgictPCHwBDxp4Al0NoU8GUJPWltTF+J02MWrU6++2OYyLYa5dvNCQv/y7bGX0GvtNhF60tpAIvRECL3W0Gv92R2hJ60dPkJPWn8cR+hJ6+/dCkL/Kf3H2DIF3MT8zBOtv3eDJ5/iSdD6ezd48tHDl+/pvvAEoiJ40sITKJDgSQtPIFeCJy08IfAEPLnGNYaZJ3mhj4UkAp78Xr8vIkA/AU9aeAL9BDxp4EmEfgKetPAE+gl4MkT89fvIIvQT8KSFJ9BPwJMWnhB4Ap408AQ3koEnLTzBXWfgSQtPoMeCJy08gR4LnrTwBHoseNLAkwQ9Fjxp4Qn0WPCkhSfQY8GTIeKv34OZoMeCJy08IfAEPGngCfRY8KSFJ9BjwZMWnkCPBU9aeAI9Fjxp4Qn0WPCkgScZOht4cvWw8p6pDJ0NPGnhCXQ28KSFJwSegCcNPIHOBp608AQ6G3jSwhPobOBJC0+gs4EnLTyBzgaeNPCk4L5H8KSFJ9BjwZMWnkCPBU9aeAI9FjwZePL6famFwBPwpIEn0GPBkxaeQI8FT1p4Aj0WPGnhCfRY8KSFJ9BjwZM6T6yBHgueXD18vRfUGuix4EkLT6DHgictPIEeC5608AQ6m0KejKE/YNTN81sIQwnpdehDmL445MdoLn2xvQjGs9UXUfAeonhztihy1ppTOVvub4YyDzyenLWanHWanPWanKUTOXtxsNyddfHB2YWq/VDi3UMlnoAJAGYZmAhgloFJAGYZmDN1fF2BOVN32BMYd6ZOsisw5+o6s3noTeKTs+fqOivOnqvrrDhLmpw9UydZdfZM3WHV2TN1fFVnz6XbVZw9l2732ll/Lt2u4qymDspr6qC8pg7KkyZnuddZN9kRKNedff0riudeZ7s6y73Ofs7Z11o7ca+zXZ3lXme7Osu9znZ1lnud/YyzPcU54l6TDwOGuwJyGDDc1ZLDgDlTx9cVmDN1h12BOVMn2ROYcK6u8/WkGM7VdVacPVfXWXH2TF1n1VnS5OyZusOqs2fq+KrOnku3qzh7Lt2u4uy5dLvXzkZNHVTU1EFFTR1U1NRBxQPqbDLTQ1Ihpfza2YvCQbMh1j+4u/RMVaTpcAz24ay/OZtO5Wyan9PLYcHZfC5n7exsXHC2KHI2GU3OWk3OOk3Oek3OkiZnw6mcjdNz2jHmBWfP1UFVnD1XB1Vx9lwdVMXZc3VQr53N5+qgKs6eq4OqOHuuDqri7Lk6qIqzpMlZTR1U1tRBZU0d1Npa5zApV5ffDO4fC0ue5tn2THc/rS+3v5A3/wtl47/g1paQdvwLdvO/4Db/C/7rf2E+m1P88Beez17frXM77OyDbk5LtxblPN0JXKyrfbEvk5+OHu4a9t7cHCUtjgYtjkYtjtbzvfvg6Pip/NanyjufWn4CIfnp57dEDyv+6PaZRZ4WmkAuITx/Jr7xmfTGZ/Ibn1lGzsy/QV5Ik58+tXJ/ZO1T9q1Pubc+5d/6FL31qfDWp+Jbn0pvfSq/9am3uBHf4kZ8ixvxLW7Et7gRw+ezxfIv6sVMXXVxC59548pf/hXw9d9Z/jGt8hn3xmf8G5+hNzB4IzOnNzJzeic+b2TmZRH29WeWtczKZ5Z5ECZel+SeP+Pe+Ix/4zP0xmfCG5+Jb3wmvfGZGg+WPvMGD8obPFh+zWzlM+6Nz/g3PvNGPihv5IPyRj4ob+SD8kY+KJ/ngTfmjc/YNz7j3vjMJ3nwn8u//e+Pv33/8c8///TPyyeu//Ffv/zl9++//nL719//7x/Tf/nzb99//vn73//0j99+/ctPf/3Xbz/96edf/3L9b9/M7X/+23lnf3Ce3MUaP/y7SZd/t+ny78NW5ovcY364/E+4/h92OGHz5YQzF1su9vw/",
76
+ "bytecode": "JwACBAEoAAABBIBVJwAABAMnAgIEAScCAwQAHxgAAwACgFQuCIBUAAElAAAARSUAAAC9KAIAAQSAVScCAgQAOw0AAQACKACAQwIABCgAgEQCAAYoAIBFAgABKACARgIAAigAgEcCAAUoAIBIAgADKACASQEAACgAgEoEAAAoAIBLAQABKACATAQAASgAgE0CACAoAIBOAgBlKACATwIAbCgAgFACAG4oAIBRAgBvKACAUgIAcigAgFMCAHQmJQAABaUpAgACAFivKuAKOAECAycCBAQAJwIGBAMAOAQGBS0IAQIAEAEFAScDAgQBACgCAgUtDgQFACgFAgUtDgQFJwIFBAMAOAIFBCcCBAQCJwIFAAEkAgADAAABICMAAAJ8LQgBAycCBgQDABABBgEnAwMEAQAoAwIGHzSATAAEAAYtDQMGACgGAgYtDgYDLQgBBgAAAQIBLQ4DBi0IAQMAAAECAS4KgEoAAycCCAQJLQgACS0MBgotDAMLABAACAAlAAAFzi0EAAAtDAoHASgAB4BMAAktDQkIHAwICQIcDAkHABwMBwgCJwIJBAotCAAKLQwGCy0MAwwAEAAJACUAAAXOLQQAAC0MCwcBKAAHgEwABi0NBgMcDAMHBRwMBwYAHgIAAwEeAgAHAAo4AwcJJAIACQAAAfwlAAAGRx4CAAMJCjgDBQckAgAHAAACEyUAAAZZHgIAAwYcDAMHACcCCQQKLQgACi0MBwstDAgMLQwGDQAQAAkAJQAABmstBAAALQwLAyQCAAMAAAJRJQAACNAtDQIDACgDAgMtDgMCACgCAgctDQcGJwIIBAIAOAcIAzsNAAMABiMAAAJ8KQIAAwB57RaBCjgBAwYkAgAGAAAClyMAAAPXLQgBAycCBgQDABABBgEnAwMEAQAoAwIGHzSATAAEAAYtDQMEACgEAgQtDgQDLQgBBAAAAQIBLQ4DBC0IAQMAAAECAS4KgEoAAycCBwQILQgACC0MBAktDAMKABAABwAlAAAFzi0EAAAtDAkGASgABoBMAAgtDQgHHAwHCAIcDAgGABwMBgcCJwIIBAktCAAJLQwECi0MAwsAEAAIACUAAAXOLQQAAC0MCgYBKAAGgEwABC0NBAMeAgAEAR4CAAYACjgEBggkAgAIAAADaSUAAAjiHgIABAkKOAQFBiQCAAYAAAOAJQAACPQeAgAEBScCBgQILQgACC0MBAktDAcKLQwDCwAQAAYAJQAABmstBAAALQwJBSQCAAUAAAO5JQAACQYAKAICBS0NBQQnAgYEAgA4BQYDOw0AAwAEIwAAA9cnAgICeycCAwJjJwIEAnMnAgUCVScCBgJrJwIHAn0nAggCdy0IAQknAgoEHAAQAQoBJwMJBAEAKAkCCi0MCgstDgULACgLAgsuCoBQAAsAKAsCCy0OBgsAKAsCCy4KgFAACwAoCwILLgqAUQALACgLAgstDggLACgLAgsuCoBQAAsAKAsCCy4KgE0ACwAoCwILLQ4ECwAoCwILLgqATgALACgLAgsuCoBPAAsAKAsCCy4KgE4ACwAoCwILLQ4DCwAoCwILLgqAUwALACgLAgsuCoBRAAsAKAsCCy4KgFIACwAoCwILLgqATQALACgLAgstDgILACgLAgstDgQLACgLAgsuCoBOAAsAKAsCCy4KgE8ACwAoCwILLgqATgALACgLAgstDgMLACgLAgsuCoBTAAsAKAsCCy4KgFEACwAoCwILLgqAUgALACgLAgstDgcLCyCASYBLAAIkAgACAAAFpCcCAwQeLQgBBCcCBQQeABABBQEtDAQFKgMABQUnRkiy9UEXvQAoBQIFACgJAgYnAgcEGy4EAAaAAy4EAAWABC4EAAeABSUAAAkYJwIGBBsAOAUGBS4KgEwABQAoBQIFLQ4BBQAoBQIFPA0EAyYoAIAEBHgADQAAAIAEgAMkAIADAAAFzSoBAAEF96Hzr6Wt1Mo8AQECJiUAAAWlLQ0BAy0NAgQnAgYEAgw4BAYHJAIABwAABfIlAAAJXgAoAwIGADgGBActDQcFLQgBBicCBwQCABABBwEnAwYEAQAoBgIHLQwHCC0OBQgBKAAEgEwABQ44BAUHJAIABwAABjolAAAJcC0OAwEtDgUCLQwGASYqAQABBZ5JySyNO6W9PAEBAiYqAQABBbo4v4qgMx//PAEBAiYlAAAFpQo4AQMFDDgBAwYLKAACgEUAASQCAAEAAAjCIwAABo8LKAACgEYAAxYMBQckAgADAAAIsCMAAAaoCygAAoBIAAgkAgAIAAAIniMAAAa9CygAAoBDAAkkAgAJAAAIhyMAAAbSCygAAoBHAAkWDAYKJAIACQAACHAjAAAG6wsoAAKARAAHJAIABwAACF4jAAAHACcCAgJwJwIHAmQnAgkCYScCCgJJJwILAmknAgwCdi0IAQ0nAg4EEgAQAQ4BJwMNBAEAKA0CDi0MDg8tDgoPACgPAg8uCoBQAA8AKA8CDy0ODA8AKA8CDy0OCQ8AKA8CDy4KgE8ADwAoDwIPLQ4LDwAoDwIPLQ4HDwAoDwIPLgqATQAPACgPAg8uCoBRAA8AKA8CDy0OAg8AKA8CDy4KgE4ADwAoDwIPLgqAUgAPACgPAg8tDgkPACgPAg8uCoBTAA8AKA8CDy0OCw8AKA8CDy4KgFEADwAoDwIPLgqAUAAPCyCASYBLAAIkAgACAAAIUycCBwQTLQgBCScCCgQTABABCgEtDAkKKgMACgUT5jKZ5RcUCQAoCgIKACgNAgsnAgwEES4EAAuAAy4EAAqABC4EAAyABSUAAAkYJwILBBEAOAoLCi4KgEoACgAoCgIKPA0JBy4IgEkABiMAAAhnLQwKBiMAAAhnLQwGBSMAAAh+BDgKBwItDAIFIwAACH4tDAUIIwAACJUSOAYFAi0MAggjAAAIlS0MCAMjAAAIpy0MBgMjAAAIpy0MAwEjAAAIuS0MBwEjAAAIuS0MAQQjAAAIyy0MBQQjAAAIyy0MBAEmKgEAAQV1LhuUZOj32zwBAQImKgEAAQVx7V8Tcb40BjwBAQImKgEAAQWQokK5sxVPPjwBAQImKgEAAQUfIIuHAZnP/TwBAQImAQCAA4AFgAcuAIADgAguAIAEgAkLAIAIgAeACiQAgAoAAAldLgGACIAGLgKABoAJAQCACAACgAgBAIAJAAKACSMAAAksJioBAAEF6J0J/qERLQ48AQECJioBAAEFRafKcRlB5BU8AQECJg==",
77
+ "debug_symbols": "zV3RjhM7DP2XPu9D7Dixw69cXaEFFrTSakHLcqUrxL/f6dKZzrbujTjEQ19QCzk5PonjZOwM/b77cPfu26e3948fP3/dvfnr++7h8/vb5/vPj9O37z9udu+e7h8e7j+9Xf/1Lu3/oCYvgK9fbh/3378+3z49797kxO1md/f4YfpIRacuPt4/3O3eEKUff9/sOGUIZR6KleoBNX20MxRlCAVxMcTFiqAyQyiISyAuqQiqEIQqCKomBGWub5BIOqCoEL1C3Zy3TpJtbp5E29K+1heSxluQaDzJtKq3INlCCW2hhF2fpCKzT1KleuqTmQVCNQSVM4RSBOVHni6qIqgCjbwfeXqo6kY5aq3MkSdR7riS0bxdWpalbZb2k6FGM2gKZ5BwBotmsBzOEK7hwmY0kmGEtyZdGPQVw3nbZnxo29oxZOf8sjolyVVZY3/OGj2zhvJVWXNVY8PRa104eq1L5nCG6J1pOpCFM5RohhKuoUg4w8ark4xlPnVZzmfrs9brsmfICQq1R9K5PeW67DF3fKTND1BTskB6z1u58mzQ9FnKqr067WXy40NzMeH105mjtei8HVgxPXmUEysjzC90NF+pZ36tc3Opmnrmp7KYz3Rqfhs++ppfmf9CUuJJip9vHE1iv08iVJZcgpByZ7aV0hx+lbj8/2w3rsvZha2czHahPNx8ORsjsg1IuG5Akum3SZrqcpY8ti3iNK1c8qFt5SqdZd3SHMKsMZ9OdK4DLaeUytr0PYH8/tBQWnx1asBnDDWaoaRwBglnsGiGyuEMGs2g4Ro03Fst3Fst3JcaUjsrDaln1cQQyq9n1WpHVOsOwjE4T5/5NP1fibYgKRuQ+IWM0SRbKPF3zE65uvopgh6q5vgaU60bVMuq8hYkWyixLZTYFkoaUqyqDSkT6oUkeg9lCIoYQiElSWWCUMjIa04QKjrBqkLhDCWcoUUzlBzOEF0O0Bqu4cJmNJBBR3jrqHKearsma+yaynlq11TO03ZVY9Oi17qlHM4QvdaNKJwhemcyTuEM8Rqid1fLG69Ozm1JD8gq63lYnyZ0ZfYMr6xsWTyzMqT69KeKZ1Y2qGtZTVuQ2AYkOr76tGHxzHSDupbZBhU6a7QFyYCMeM2LR9VVHs0vnyWb12pNrXUWti05FLNymkJpacAA1SUHSFVtbfsLQ41moBTOIOEMFs3AHM6g0Qw5XEMO91YJ91YJ9yU/FTS2TtH8bNBgEr/mO5pENyDRLZTYL0/8C8oQVIO4GsJFKWUMhrERxkYYGzMGUwiWMbaMsQnGJhWClYTBCgSrhMEwbYppU0ybYdoM09YwL2mQT1IiDAZpI2IMhmnjjMGgyEVYLCEslpBg2gTT5t+Y68MaBKvQMiUsKJBi2hTTZpi2hmlr0DJlLChwglyZsaDA2AGDsaDA2AGDsaDAGZs3weZNMG0F01aweavYvFVomTIWFFgxbYZpM0xbg7TllDAYFPAyEQaDFs6F//kh57xcGMz6+rKPk9Ses9R6TImKHvq32P4vXJMc1r8fWAb2X2L7L8HzW6Ltb7H9+/mYgf1rbP8WbL8F2++njwb2H+s/kmL9XygF9x9sf/D+Ihwb/yVTcP/B4y/B4++XbstyqazY6g30n5do6ML7tz2Qu5IrzVXfmusZqCRBQAiTn6npgPycbw+EMGWEyT9claVEVZOeg3yP64EKACoIU0GYKsJUBQG55+Va5ltXdXXFZAH5L/t1QH5utwdqAMh/7OqBgIGofpIvL0MuafWGnZWfIL9MOu0sMyjzK5BzUSfbXI+bCser96vMaZyPHpBrWsVe775QnvJfc2Nev4rjNaZ9nv/Qevrc1loPUv2asyzjs743M4+Pn+8rS+goWc9B/rlRl7ql5nQGuvD2TlFZVowD8q+V1ry8u14dkF9Z6pjn54JVZ0exlM9B/nsAHZBfCemB9NdBlhgBIUyEMBHCxAiTf5DsgDIhIIRJECZBmPxdtQcSBNQAkF8i6YAU0aSIJkU0+VnQHsgAUEM0NUBTSxkBAZoaElgaElgaI5oY0ZQFASHzJIgmQTQhMaIhMaIhMaIhMaIhMaIhMaIZoqkhmpAY0YAYwSkVAEQJAbk7ocl8SDRNnTP+5SQIJ/8/wh7Vu//oPqx3jezdP7YM6z10Vkuo7X4eYlTvfhphVO/+izPDeg+13UJt9/Mjo3pvkT5z4ULcsN4j1ypRqO2huwcxh/YeGd/JT4yqLJDz5AuTvwTrwlPtJEv3Y/r6z+3T/e27h7vDzwN9/Pb4fvVrQc//frk7+eGgL0+f3999+PZ0t/8JoeOvB+25ZVIvJe8PLnv7We2G7eXr3o2k6PSvbWKdmP8D",
76
78
  "brillig_names": [
77
- "sync_notes"
79
+ "public_dispatch"
78
80
  ]
79
81
  },
80
82
  {
81
- "name": "check_timestamp",
83
+ "name": "check_block_number",
82
84
  "is_unconstrained": false,
83
85
  "custom_attributes": [
84
86
  "private"
@@ -578,9 +580,7 @@
578
580
  {
579
581
  "name": "value",
580
582
  "type": {
581
- "kind": "integer",
582
- "sign": "unsigned",
583
- "width": 64
583
+ "kind": "field"
584
584
  },
585
585
  "visibility": "private"
586
586
  }
@@ -1668,13 +1668,13 @@
1668
1668
  }
1669
1669
  }
1670
1670
  },
1671
- "bytecode": "H4sIAAAAAAAA/+XdB3RTdf/H8bRpCwUKFARlKAVUNiRN0ibsvfcGFx2poAiyFJx17703Ttx7T9yKW3EvVNyTveH/+T4kD5dL9Jz/0xt93ue557xP2yS9ef1uRtPkjgzf9inf7/Otytz+fYbyJ77aSQWu05Jfnd9np7hczRSn5aU4rU6K0/JTnNZQ9XSd1izF5QpSnNY8xWktUpzWKsVprVV112ltEhbnlJH4mjw9FCgKh+PFhfFgKFgSKIyVRiOBcKS0KBqMBiPRSHlhNBSKR8PR4lhprDgQC4ZD8WBFJBaqCGyftmbumFegSlNhWTqd2/5zZ8h9gtnqqSyH1ZbDVsdtsdVxGyS/35a4TPL37IbKUJnK73ecnpgyXcsgULUp2MrD5Znl987lvM/afAt86b3PZntmLyxNpzPHA2ckWlJRWBIPpNNZ7T93ht0npHps2e2VfAzl+FM/zqr5d35sVdfPuaqGqpniseV3LYNA1aZgGw/nVd3v3W1Ty7vHacrbppbj9sh1fF/D8X1N122Tp59rqzqqbuK2yXLdLqmmnt6MI5TxF9dT1etwP94yvLUHW3s3r7QZ26TBmA5nnj89zn9PXv8Bz/LwiSE/TX/A8xN/wLMSP2elWC5e35AZvv/tO5zXzqw0PzC8cqaa9y4Puqo+ULwEt/WlZ8F6PWYPH1DBdpAxZ3o45vaQMfs9HHOHv2nMgapNwY4eLj8f5Am9k4/hDECcQYizEOIMQZxhiDMCcRZBnMUQZxTijEGcnSHOLhBnV4izG8TZHeLsAXH2hDh7QZy9Ic4+EGdfiLMfxNkf4hwAcQ6EOAdBnIMhziEQ51CIcxjEORziHAFxjoQ4R0GcoyHOMRDnWIhzHMQ5HuKcAHFOhDgnQZyTIc79IM79Ic4DIM4DIc6DIM4pEGcJxFkKcZZBnOUQZxzirIA4D4Y4p0Kc0yDOQyDOQyHO6RDnYRDnDIhzJsR5OMQ5C+KcDXHOgTjnQpzzIM4jIM4jIc75EOcCiPMoiPNoiPMYiPNYiPM4iPN4iLMS4jwB4jwR4jwJ4jwZ4jwF4jwV4jwN4jwd4jwD4jwT4jwL4jwb4jwH4jwX4jwP4jwf4rwA4rwQ4rwI4rwY4rwE4rwU4rwM4rwc4rwC4rwS4rwK4rwa4rwG4rwW4rwO4lwIcV4Pcd4Acd4Icd4Ecd4Mcd4CcS6COG+FOG+DOG+HOO+AOO+EOO+COO+GOO+BOO+FOO+DOO+HOB+AOB+EOB+COB+GOB+BOB+FOB+DOB+HOJ+AOJ+EOJ+COJ+GOJ+BOBdDnM9CnM9BnM9DnC9AnC9CnC9BnC9DnK9AnK9CnEsgztcgztchzjcgzjchzrcgzrchzncgznchzvcgzqUQ5/sQ5wcQ54cQ50cQ58cQ5ycQ56cQ52cQ5+cQ5xcQ55cQ5zKI8yuI82uI8xuIcznE+S3E+R3E+T3E+QPE+SPE+RPE+TPE+QvE+SvE+RvE+TvE+QfEuQLiXAlxroI4V0OcayDOtRDnOohzPcS5AeLcCHFugjg3Q5xbIM6tEOc2iNNmSHBmQJyZEKcf4syCOLMhzhyIsxrEWR3izIU4a0CcNSHOWhBnHsRZG+KsA3HWhTjzIc56EGd9iHM3iLMBxNkQ4twd4twD4mwEcTaGOJtAnE0hzj0hzr0gzmYQZwHE2RzibAFxtoQ494Y494E494U4W0GcrSHONhBnW4izHcTZHuLsAHF2hDg7QZwBiDMIcRZCnCGIMwxxRiDOIoizGOKMQpwxiLMzxNklTc5MlzMUKAqH48WF8WAoWBIojJVGI4FwpLQoGowGI9FIeWE0FIpHw9HiWGmsOBALhkPxYEUkFqpIzDvDwzF3/R8cczfI/bF7hnfL769um0DVpmAPD515/r/n/hio2hTs6eGYs/yM+2MvyOOmN8TZB+LsC3H2gzj7Q5wDIM6BEOcgiHMwxDkE4hwKcQ6DOIdDnCMgzpEQ5yiIczTEOQbiHAtxjoM4x0OcEyDOiRDnJIhzMsS5H8S5P8R5AMR5IMR5EMQ5BeIsgThLIc4yiLMc4oxDnBUQ58EQ51SIcxrEeQjEeSjEOR3iPAzinAFxzoQ4D4c4Z0GcsyHOORDnXIhzHsR5BMR5JMQ5H+JcAHEeBXEeDXEeA3EeC3EeB3EeD3FWQpwnQJwnQpwnQZwnQ5ynQJynQpynQZynQ5xnQJxnQpxnQZxnQ5znQJznQpznQZznQ5wXQJwXQpwXQZwXQ5yXQJyXQpyXQZyXQ5xXQJxXQpxXQZxXQ5zXQJzXQpzXQZwLIc7rIc4bIM4bIc6bIM6bIc5bIM5FEOetEOdtEOftEOcdEOedEOddEOfdEOc9EOe9EOd9EOf9EOcDEOeDEOdDEOfDEOcjEOejEOdjEOfjEOcTEOeTEOdTEOfTEOczEOdiiPNZiPM5iPN5iPMFiPNFiPMliPNliPMViPNViHMJxPkaxPk6xPkGxPkmxPkWxPk2xPkOxPkuxPkexLkU4nwf4vwA4vwQ4vwI4vwY4vwE4vwU4vwM4vwc4vwC4vwS4lwGcX4FcX4NcX4DcS6HOL+FOL+DOL+HOH+AOH+EOH+COH+GOH+BOH+FOH+DOH+HOP+AOFdAnCshzlUQ52qIcw3EuRbiXAdxroc4N0CcGyHOTRDnZohzC8S5FeLcBnH6MhnODIgzE+L0Q5xZEGc2xJkDcVaDOKtDnLkQZw2IsybEWQvizIM4a0OcdSDOuhBnPsRZD+KsD3HuBnE2gDgbQpy7Q5x7QJyNIM7GEGcTiLMpxLknxLkXxNkM4iyAOJtDnC0gzpYQ594Q5z4Q574QZyuIszXE2QbibAtxtoM420OcHSDOjhBnJ4gzAHEGIc5CiDMEcYYhzgjEWQRxFkOcUYgzBnF2hji7QJxdIc5uEGd3iLMHxNkT4uwFcfaGOPtAnH0hzn4QZ3+IcwDEORDiHARxDoY4h0CcQyHOYRDncIhzBMQ5EuIcBXGOhjjHQJxjIc5xEOd4iHMCxDkR4pwEcU6GOPeDOPeHOA+AOA+EOA+COKdAnCUQZynEWQZxlkOccYizAuI8GOKcCnFOgzgPgTgPhTinQ5yHQZwzIM6ZEOfhEOcsiHM2xDkH4pwLcc6DOI+AOI+EOOdDnAsgzqMgzqMhzmMgzmMhzuMgzuMhzkqI8wSI80SI8ySI82SI8xSI81SI8zSI83SI8wyI80yI8yyI82yI8xyI81yI8zyI83yI8wKI80KI8yKI82KI8xKI81KI8zKI83KI8wqI80qI8yqI82qI8xqI81qI8zqIcyHEeT3EeQPEeSPEeRPEeTPEeQvEuQjivBXivA3ivB3ivAPivBPivAvivBvivAfivBfivA/ivB/ifADifBDifAjifBjifATifBTifAzifBzifALifBLifArifBrifAbiXAxxPgtxPgdxPg9xvgBxvghxvgRxvgxxvgJxvgpxLoE4X4M4X4c434A434Q434I434Y434E434U434M4l0Kc70OcH0CcH0KcH6XJmelyhgJF4XC8uDAeDAVLAoWx0mgkEI6UFkWD0WAkGikvjIZC8Wg4WhwrjRUHYsFwKB6siMRCFYl5t/JwzB//TWMOVG0KfpLp3fLL9zNu5ywPl9+nkPt2todj/gwy5hwPx/w5ZMzVPBzzF5AxV/dwzF9Cxpzr4ZiXQcZcw8MxfwUZc00Px/w1ZMy1PBzzN5Ax53k45uWQMdf2cMzfQsZcx8MxfwcZc10Px/w9ZMz5Ho75B8iY63k45h8hY67v4Zh/gox5Nw/H/DNkzA08HPMvkDE39HDMv0LGvLuHY/4NMuY9PBzz75AxN/JwzH9AxtzYwzGvgIy5iYdjXgkZc1MPx7wKMuY9PRzzasiY9/JwzGsgY27m4ZjXQsZc4OGY10HG3NzDMa+HjLmFh2PeABlzSw/HvBEy5r09HPMmyJj38XDMmyFj3tfDMW/xcMx+3/Z1fJYmBtxWtVPtVQfVUXWy61FBVWjLQoVVRBWpYhVVMdVZdVFdVTfVXfVIjL2X6q36qL6qn+qvBqiBapAarIaooWqYGq5GqJFqlBqtxqixapwaryaoiWqSmqz2U/urA9SB6iA1RZWoUlWmylVcVaiD1VQ1TR2iDlXT1WFqhpqpDlez1Gw1R81V89QR6kg1Xy1QR6mj1THqWHWcOl5VqhPUieokdbI6RZ2qTlOnqzPUmeosdbY6R52rzlPnqwvUheoidbG6RF2qLlOXqyvUleoqdbW6Rl2rrlML1fXqBnWjukndrG5Ri9St6jZ1u7pD3anuUnere9S96j51v3pAPageUg+rR9Sj6jH1uHpCPameUk+rZ9Ri9ax6Tj2vXlAvqpfUy+oV9apaol5Tr6s31JvqLfW2eke9q95TS9X76gP1ofpIfaw+UZ+qz9Tn6gv1pVqmvlJfq2/UcvWt+k59r35QP6qf1M/qF/Wr+k39rv5QK9RKtUqtVmvUWrVOrVcb1Ea1SW1WW9RWtU3ZgyxDZSq/ylLZKkdVU9VVrqqhaqpaKk/VVnVUXZWv6qn6ajfVQDVUu6s9VCPVWDVRTdWeai/VTBWo5qqFaqn2VvuofVUr1Vq1UW1VO9VedVAdVScVUEFVqEIqrCKqSBWrqIqpzqqL6qq6qe6qh+qpeqneqo/qq/qp/mqAGqgGqcFqiBqqhqnhaoQaqUap0WqMGqvGqfFqgpqoJqnJaj+1vzpAHagOUlNUiSpVZapcxVWFOlhNVdPUIepQNV0dpmaomepwNUvNVnPUXDVPHaGOVPPVAnWUOlodo45Vx6njVaU6QZ2oTlInq1PUqeo0dbo6Q52pzlJnq3PUueo8db66QF2oLlIXq0vUpeoydbm6Ql2prlJXq2vUteo6tVBdr25QN6qb1M3qFrVI3apuU7erO9Sd6i51t7pH3avuU/erB9SD6iH1sHpEPaoeU4+rJ9ST6in1tHpGLVbPqufU8+oF9aJ6Sb2sXlGvqiXqNfW6ekO9qd5Sb6t31LvqPbVUva8+UB+qj9TH6hP1qfpMfa6+UF+qZeor9bX6Ri1X36rv1PfqB/Wj+kn9rH5Rv6rf1O/qD7VCrVSr1Gq1Rq1V69R6tUFtVJvUZrVFbVXblL2gyFCZyq+yVLbKUdVUdZWraqiaqpbKU7VVHVVX5at6qr7aTTVQDdXuag/VSDVWTVRTtafaSzVTBaq5aqFaqr3VPmpf1Uq1Vm1UW9VOtVcdVEfVSQVUUBWqkAqriCpSxSqqYqqz6qK6qm6qu+phr1dUL9Vb9VF9VT/VXw1QA9UgNVgNUUPVMDVcjVAj1Sg1Wo1RY9U4NV5NUBPVJDVZ2bHm7Tjudox0O/64Hdt7irJjUtvxnu1YynacYjsGsB1f145da8eFtWOu2vFM7VihdhxOO8alHT/Sjs1oxz20Ywra8frsWHh2nDk7hpsdH82OPWbH9bJjZtnxqOxYT3YcJTtGkR3/x46tU6nsmDB2vBU7lokdJ8SOwWHHt7BjR9hxGeyYB3Y8AdtXv+0H3/Yxb/tvt32j237HbZ/etr9s2xe17efZ9qFs+ye2ff/afnVtn7W2P1jb16rtx9T2EWr737R9Wy5Utk9G29+h7UvQ9tNn+8Cz/cvZvttsv2i2zzHbn5ftK8v2Q2X7eLL9J9m+iWy/P7ZPHdtfje0LxvazYvswsf2D2L43bL8Wts8I2x+D7evA9iNg2+jb9u+2bfliZdtE2/bGti2vbSdr26Da9p227aRtl2jb/Nn2dLatmm0HZttY2fZLtm2QbXdj27TY9iK2LYa9XrVtCGz9fFv33dYrt/WsbR1mWw/X1ku19TRtvUVbj2+ZsvW8bL0nWw/I1oux9URsvQlbj8A+V7fPme1zV/sc0j6Xs8+p7HMb+xzD3te397ntfV97H9TeF7T3yex9I3sfxd5XsP+z7f9O+z/M/i+x1+mZ2//0+2w9Y5va+nZMiacFnz9xvq2Xa+up2nqbth6jrddn67nZel+2HpStF2Trydh6I7Yeha1XYJ+z2+fO9jmsfS5pn9PZ51b2OY59rmHv89v73vY+sL0vau8T2vtmBaq5aqHs/277P9T+L7P/U2zd99aqjW/XKdPxff3E1wbLezWatWRRP+flmv7JecnfjyW+5rpOz0gsj56JnwNVm4K5jvl6Pf9oIBzL9e08eewP5fp2vv94PP9Icv7Z6Zn/v9ZBtqlv5Y75O8eSvF6/63Lu37Hz8xLfZ/h2vUxyHOm4H+l2Tvdy+vftXC1N808utxzHsvOnGFPy+vNct1Xy/FRfk/Nyn5e8rhq+tN6Hg381Nqc/ed+o67q8exn82bxy/p/z+idvU+eydt6m/7pM5Y7zMl3nZTnOy3Gdl1256xjt71SB43Lux2CW67zk/cSmgZU75tHOMb/2ie+Tyy+dz93pes6wqX4Kv/O6bKpWuWN5JJeN33Facpknb4Pqzsu7zst1nJdVufP11Ej8nOW4Hue8ko5s1+WTr1fqJL7mOH4n+ft1U1x/juv6d3KnOM29XHJTXD43xeXtPtoy8X3NRHYfCjnm92ePEedrmeT3dXy7Ph8kfzfNj+fCpDUrhdX5/JK8fntN2CDx/Zy5M2fHB83oNz9eNm/utJkz+pSUTY37XJPzwee8Y7pfpDoXgHOgqebhd/x+qslukOSLpKzKnX+vZ+L0QBWm4mggkLzu5AMi2+X0ua4/23X5aOLnGo5xJb9WZQPBiuKSYEWopKIkUlJeHi4rqeeav8+3445ny6lJ4nv4i+Lo3/WiOE0vxsLJ+eekZ/4pXxSnesJJ3of7V+5Ylv0rdzYlLzPAcZkBjsvY9FcvnN1/tG3q5zrP+Vjq7zrP+WSVvF57As737fg+eb9P8x/06D/5Bz35hyf5hGxPzgWJ72fMnDutYkG/GbPmxefFy0fOK50+raz/vBll25+op0/3uSb3i+4M18+Zrp/dz8lZKebjnpy/l+EYw3/7c3XjxM//9HP1/wEZa+J7IxQCAA==",
1672
- "debug_symbols": "7ZffiuowEMbfJde9yExmMomvcliWqt2lUKpUPXAQ3/0kYsy6myoi+w96I530S/L5+9Im3atlM9+9Prf9y2qjZn/2qlst6m276kO1V8DHts267mO52dbDVs2QnK9U0y/DJTMdKvXSdo2aAcih+qhG0kmNFs9q5wpioz2fxAasuy4G9kwndbh+I0ehkhNAm5wAcVZ7KI1urEmDE+gL9VOlwE5oxtDIhGYMjSujQZPR8A00BDaBJNRZbfk4g//sGVCXZhCT8nKQ4+ISUbDCkiBZcZkSF9O1BlO6AnAzXZCcrtE30gXLLluRx9JFmMiMkMGJzAgZM5EZIUM/m8z37SLIE5kRMvZxMl6fyTgjN8hIWu9kMhcgPJqRh804yjE5T9fNgPfm/Ph5zxcbdwm8+Eze4Yd93v1u+/5r7aPW9nxk1Qjmuv3w/9LYgO7N0tGHp1DNh7br2tfni88xHX+o+PCzgdNwLPb9QiR7fxe5v4u7v4u/s0uo4PhhWuxIkl5TFukd0lD+rYe2nndNZBnv7vpFQhvK7b91upPgr4fVolnuhibGkBOIO3Z4IRLG43Y8DDNUbLO32IRQYWg6hJn/Aw==",
1671
+ "bytecode": "H4sIAAAAAAAA/+XdB3RTdf/H8bRpCwUKFAQFVAqobEiapE3Ye+8NLjpSQRFkKTjr3ntvnLj3nrgVt+JeqLgXe4//5/uQPFwu0XP+T2/0eZ/nnvM+bZP05vW7GU2TOzJ826d8v8+3MnP79xnKn/hqJxW4Tkt+dX6fneJyNVOclpfitDopTstPcVpD1cN1WtMUlytIcVqzFKc1T3FayxSntVLVfTtPGYmvPRJfQ4GicDheXBgPhoIlgcJYaTQSCEdKi6LBaDASjZQXRkOheDQcLY6VxooDsWA4FA9WRGKhisD2aWvmjnkFqjQVlqXTue0/d4bcJ5itnspyWG05bHUs9+T3rR3fb0tcJvl7dkNlqEzl9ztOT0yZrmUQqNoUbOnh8szye+dy3mdtvgW+9N5nsz2zF5am05njgbM4Fi8P6hrT6az2nzvD7hNSPbbs9ko+hnL8qR9n1fw7P7aq6+dcVUPVTPHY8ruWQaBqU7C1h/Oq7vfutqnl3eM05W1Ty3F75Dq+r+H4vqbrtsnTz7VVHVU3cdtkuW6XVFMPb8YRyviL66nqdbgfbxne2oOtvJtXIF3G1mkwpsOZ50+P89+T13/Aszx8YshP0x/w/MQf8KzEz1kplovXN2SG73/7Due1MyvNDwyvnKnmvcuDrqoPFC/BbXzpWbBej9nDB1SwLWTMmR6OuR1kzH4Px9z+bxpzoGpTsIOHy88HeULv6GM4AxBnEOIshDhDEGcY4oxAnEUQZzHEGYU4YxBnJ4izM8TZBeLsCnF2gzi7Q5w9IM6eEGcviLM3xNkH4uwLcfaDOPtDnAMgzoEQ5yCIczDEOQTiHApxDoM4h0OcIyDOkRDnKIhzNMQ5BuIcC3GOgzjHQ5wTIM6JEOckiHN/iPMAiPNAiPMgiPNgiHMyxFkCcZZCnGUQZznEGYc4KyDOQyDOKRDnVIjzUIjzMIhzGsR5OMQ5HeKcAXEeAXHOhDhnQZyzIc45EOdciPNIiPMoiHMexDkf4jwa4jwG4jwW4jwO4jwe4jwB4qyEOE+EOE+COE+GOE+BOE+FOE+DOE+HOM+AOM+EOM+COM+GOM+BOM+FOM+DOM+HOC+AOC+EOC+COC+GOC+BOC+FOC+DOC+HOK+AOK+EOK+COK+GOK+BOK+FOK+DOK+HOBdAnDdAnDdCnDdBnDdDnLdAnLdCnAshztsgztshzjsgzjshzrsgzrshznsgznshzvsgzvshzgcgzgchzocgzochzkcgzkchzscgzschzicgzichzqcgzqchzmcgzmchzkUQ53MQ5/MQ5wsQ54sQ50sQ58sQ5ysQ56sQ52sQ52KI83WI8w2I802I8y2I822I8x2I812I8z2I832IcwnE+QHE+SHE+RHE+THE+QnE+SnE+RnE+TnE+QXE+SXE+RXEuRTi/Bri/Abi/BbiXAZxfgdxfg9x/gBx/ghx/gRx/gxx/gJx/gpx/gZx/g5x/gFxLoc4V0CcKyHOVRDnaohzDcS5FuJcB3Guhzg3QJwbIc5NEOdmiHMLxLkV4twGcdoMCc4MiDMT4vRDnFkQZzbEmQNxVoM4q0OcuRBnDYizJsRZC+LMgzhrQ5x1IM66EGc+xFkP4qwPce4GcTaAOBtCnLtDnHtAnI0gzsYQZxOIc0+Icy+Ic2+IsynEWQBxNoM4m0OcLSDOfSDOfSHO/SDOlhBnK4izNcTZBuJsC3G2gzjbQ5wdIM6OEGcA4gxCnIUQZwjiDEOcEYizCOIshjijEGcM4uwEcXZOkzPT5QwFisLheHFhPBgKlgQKY6XRSCAcKS2KBqPBSDRSXhgNheLRcLQ4VhorDsSC4VA8WBGJhSoS887wcMxd/gfH3BVyf+yW4d3y+6vbJlC1KdjdQ2ee/++5PwaqNgV7eDjmLD/j/tgT8rjpBXH2hjj7QJx9Ic5+EGd/iHMAxDkQ4hwEcQ6GOIdAnEMhzmEQ53CIcwTEORLiHAVxjoY4x0CcYyHOcRDneIhzAsQ5EeKcBHHuD3EeAHEeCHEeBHEeDHFOhjhLIM5SiLMM4iyHOOMQZwXEeQjEOQXinApxHgpxHgZxToM4D4c4p0OcMyDOIyDOmRDnLIhzNsQ5B+KcC3EeCXEeBXHOgzjnQ5xHQ5zHQJzHQpzHQZzHQ5wnQJyVEOeJEOdJEOfJEOcpEOepEOdpEOfpEOcZEOeZEOdZEOfZEOc5EOe5EOd5EOf5EOcFEOeFEOdFEOfFEOclEOelEOdlEOflEOcVEOeVEOdVEOfVEOc1EOe1EOd1EOf1EOcCiPMGiPNGiPMmiPNmiPMWiPNWiHMhxHkbxHk7xHkHxHknxHkXxHk3xHkPxHkvxHkfxHk/xPkAxPkgxPkQxPkwxPkIxPkoxPkYxPk4xPkExPkkxPkUxPk0xPkMxPksxLkI4nwO4nwe4nwB4nwR4nwJ4nwZ4nwF4nwV4nwN4lwMcb4Ocb4Bcb4Jcb4Fcb4Ncb4Dcb4Lcb4Hcb4PcS6BOD+AOD+EOD+COD+GOD+BOD+FOD+DOD+HOL+AOL+EOL+COJdCnF9DnN9AnN9CnMsgzu8gzu8hzh8gzh8hzp8gzp8hzl8gzl8hzt8gzt8hzj8gzuUQ5wqIcyXEuQriXA1xroE410Kc6yDO9RDnBohzI8S5CeLcDHFugTi3QpzbIE5fJsOZAXFmQpx+iDML4syGOHMgzmoQZ3WIMxfirAFx1oQ4a0GceRBnbYizDsRZF+LMhzjrQZz1Ic7dIM4GEGdDiHN3iHMPiLMRxNkY4mwCce4Jce4Fce4NcTaFOAsgzmYQZ3OIswXEuQ/EuS/EuR/E2RLibAVxtoY420CcbSHOdhBne4izA8TZEeIMQJxBiLMQ4gxBnGGIMwJxFkGcxRBnFOKMQZydIM7OEGcXiLMrxNkN4uwOcfaAOHtCnL0gzt4QZx+Isy/E2Q/i7A9xDoA4B0KcgyDOwRDnEIhzKMQ5DOIcDnGOgDhHQpyjIM7REOcYiHMsxDkO4hwPcU6AOCdCnJMgzv0hzgMgzgMhzoMgzoMhzskQZwnEWQpxlkGc5RBnHOKsgDgPgTinQJxTIc5DIc7DIM5pEOfhEOd0iHMGxHkExDkT4pwFcc6GOOdAnHMhziMhzqMgznkQ53yI82iI8xiI81iI8ziI83iI8wSIsxLiPBHiPAniPBniPAXiPBXiPA3iPB3iPAPiPBPiPAviPBviPAfiPBfiPA/iPB/ivADivBDivAjivBjivATivBTivAzivBzivALivBLivArivBrivAbivBbivA7ivB7iXABx3gBx3ghx3gRx3gxx3gJx3gpxLoQ4b4M4b4c474A474Q474I474Y474E474U474M474c4H4A4H4Q4H4I4H4Y4H4E4H4U4H4M4H4c4n4A4n4Q4n4I4n4Y4n4E4n4U4F0Gcz0Gcz0OcL0CcL0KcL0GcL0Ocr0Ccr0Kcr0GciyHO1yHONyDONyHOtyDOtyHOdyDOdyHO9yDO9yHOJRDnBxDnhxDnRxDnx2lyZrqcoUBROBwvLowHQ8GSQGGsNBoJhCOlRdFgNBiJRsoLo6FQPBqOFsdKY8WBWDAcigcrIrFQRWLeLT0c8yd/05gDVZuCn2Z6t/zy/YzbOcvD5fcZ5L6d7eGYP4eMOcfDMX8BGXM1D8f8JWTM1T0c81eQMed6OOalkDHX8HDMX0PGXNPDMX8DGXMtD8f8LWTMeR6OeRlkzLU9HPN3kDHX8XDM30PGXNfDMf8AGXO+h2P+ETLmeh6O+SfImOt7OOafIWPezcMx/wIZcwMPx/wrZMwNPRzzb5Ax7+7hmH+HjHkPD8f8B2TMjTwc83LImBt7OOYVkDE38XDMKyFj3tPDMa+CjHkvD8e8GjLmvT0c8xrImJt6OOa1kDEXeDjmdZAxN/NwzOshY27u4Zg3QMbcwsMxb4SMeR8Px7wJMuZ9PRzzZsiY9/NwzFs8HLPft30dnyWJAbdRbVU71V51UB3telRQFdqyUGEVUUWqWEVVTHVSnVUX1VV1U90TY++peqneqo/qq/qp/mqAGqgGqcFqiBqqhqnhaoQaqUap0WqMGqvGqfFqgpqoJqn91QHqQHWQOlhNViWqVJWpchVXFeoQNUVNVYeqw9Q0dbiarmaoI9RMNUvNVnPUXHWkOkrNU/PV0eoYdaw6Th2vTlCV6kR1kjpZnaJOVaep09UZ6kx1ljpbnaPOVeep89UF6kJ1kbpYXaIuVZepy9UV6kp1lbpaXaOuVdep69UCdYO6Ud2kbla3qFvVQnWbul3doe5Ud6m71T3qXnWful89oB5UD6mH1SPqUfWYelw9oZ5UT6mn1TPqWbVIPaeeVy+oF9VL6mX1inpVvaYWq9fVG+pN9ZZ6W72j3lXvqffVEvWB+lB9pD5Wn6hP1Wfqc/WF+lJ9pZaqr9U36lu1TH2nvlc/qB/VT+pn9Yv6Vf2mfld/qOVqhVqpVqnVao1aq9ap9WqD2qg2qc1qi9qqtil7kGWoTOVXWSpb5ahqqrrKVTVUTVVL5anaqo6qq/JVPVVf7aYaqIZqd7WHaqQaqyZqT7WX2ls1VQWqmWquWqh91L5qP9VStVKtVRvVVrVT7VUH1VEFVFAVqpAKq4gqUsUqqmKqk+qsuqiuqpvqrnqonqqX6q36qL6qn+qvBqiBapAarIaooWqYGq5GqJFqlBqtxqixapwaryaoiWqS2l8doA5UB6mD1WRVokpVmSpXcVWhDlFT1FR1qDpMTVOHq+lqhjpCzVSz1Gw1R81VR6qj1Dw1Xx2tjlHHquPU8eoEValOVCepk9Up6lR1mjpdnaHOVGeps9U56lx1njpfXaAuVBepi9Ul6lJ1mbpcXaGuVFepq9U16lp1nbpeLVA3qBvVTepmdYu6VS1Ut6nb1R3qTnWXulvdo+5V96n71QPqQfWQelg9oh5Vj6nH1RPqSfWUelo9o55Vi9Rz6nn1gnpRvaReVq+oV9VrarF6Xb2h3lRvqbfVO+pd9Z56Xy1RH6gP1UfqY/WJ+lR9pj5XX6gv1VdqqfpafaO+VcvUd+p79YP6Uf2kfla/qF/Vb+p39YdarlaolWqVWq3WqLVqnVqvNqiNapParLaorWqbshcUGSpT+VWWylY5qpqqrnJVDVVT1VJ5qraqo+qqfFVP1Ve7qQaqodpd7aEaqcaqidpT7aX2Vk1VgWqmmqsWah+1r9pPtVStVGvVRrVV7VR71UF1VAEVVIUqpMIqoopUsYqqmOqkOqsuqqvqprrb6xXVU/VSvVUf1Vf1U/3VADVQDVKD1RA1VA1Tw9UINVKNUqPVGDVWjVPj1QQ1UU1Sdqx5O467HSPdjj9ux/aerOyY1Ha8ZzuWsh2n2I4BbMfXtWPX2nFh7ZirdjxTO1aoHYfTjnFpx4+0YzPacQ/tmIJ2vD47Fp4dZ86O4WbHR7Njj9lxveyYWXY8KjvWkx1HyY5RZMf/sWPrVCo7Jowdb8WOZWLHCbFjcNjxLezYEXZcBjvmgR1PwPbVb/vBt33M2/7bbd/ott9x26e37S/b9kVt+3m2fSjb/olt37+2X13bZ63tD9b2tWr7MbV9hNr+N23flguU7ZPR9ndo+xK0/fTZPvBs/3K27zbbL5rtc8z252X7yrL9UNk+nmz/SbZvItvvj+1Tx/ZXY/uCsf2s2D5MbP8gtu8N26+F7TPC9sdg+zqw/QjYNvq2/bttW75I2TbRtr2xbctr28naNqi2fadtO2nbJdo2f7Y9nW2rZtuB2TZWtv2SbRtk293YNi22vYhti2GvV20bAls/39Z9t/XKbT1rW4fZ1sO19VJtPU1bb9HW41uqbD0vW+/J1gOy9WJsPRFbb8LWI7DP1e1zZvvc1T6HtM/l7HMq+9zGPsew9/XtfW5739feB7X3Be19MnvfyN5HsfcV7P9s+7/T/g+z/0vsdXrm9j/9PlvP2KY2vh1T4mnB50+cb+vl2nqqtt6mrcdo6/XZem623petB2XrBdl6MrbeiK1HYesV2Ofs9rmzfQ5rn0va53T2uZV9jmOfa9j7/Pa+t70PbO+L2vuE9r5ZgWqmmiv7v9v+D7X/y+z/FFv3vZVq7dt1ynR8Xy/xtcGyno1mLl7Y13m5Jn9yXvL3Y4mvua7TMxLLo0fi50DVpmCuY75ezz8aCMdyfTtPHvtDub6d7z8ezz+SnH92eub/r3WQbepTuWP+zrEkr9fvupz7d+z8vMT3Gb5dL5McRzruR7qd072c/n07V0vT/JPLLcex7PwpxpS8/jzXbZU8P9XX5Lzc5yWvq4Yvrffh4F+NzelP3jfqui7vXgZ/Nq+c/+e8/snb1Lmsnbfpvy5TueO8TNd5WY7zclznZVfuOkb7O1XguJz7MZjlOi95P7FpQOWOebR1zK9d4vvk8kvnc3e6njNsqp/C77wum6pV7lgeyWXjd5yWXObJ26C68/Ku83Id52VV7nw9NRI/ZzmuxzmvpCPbdfnk65U6ia85jt9J/n7dFNef47r+ndwpTnMvl9wUl89NcXm7j7ZIfF8zkd2HQo75/dljxPlaJvl9Hd+uzwfJ303z47kwac1KYXU+vySv314TNkh8P3vOjFnxgdP7zouXzZ0zdcb03iVlU+I+1+R88DnvmO4Xqc4F4Bxoqnn4Hb+farIbJPkiKaty59/rkTg9UIWpOBoIJK87+YDIdjl9ruvPdl0+mvi5hmNcya9V2UCworgkWBEqqSiJlJSXh8tK6rnm7/PtuOPZckq+aIa/KI7+XS+K0/RiLJycf0565p/yRXGqJ5zkfbhf5Y5l2a9yZ1PyMv0dl+nvuIxNf/XC2f1H26a+rvOcj6V+rvOcT1bJ67Un4Hzfju+T9/s0/0GP/pN/0JN/eJJPyPbkXJD4fvqMOVMr5vedPnNufG68fMTc0mlTy/rNnV62/Yl62jSfa3K/6M5w/Zzp+tn9nJyVYj7uyfl7GY4x/Lc/VzdO/PxPP1f/H5osVbwPFAIA",
1672
+ "debug_symbols": "7ZfbjuIwDIbfJde9iB3bSXiV1WhUoDOqVBVUYKUV4t03QYQAm4LQzu7MSL2p6vR3Yn9Oc9irZTPfvb+2/dtqo2Y/9qpbLeptu+qDtVdAx7bNuu6judnWw1bNkJyvVNMvwyszHSr11naNmgHYQ/WnGkknNQqe1c4VxEZ7PokNiLsvBvZMJ3V4v5CjpVIkgJIiAeKs9lDq3YhJnRPoK/VLpYAnNGNoZEIzhsaW0aDJaPgBGgJJIAl1VgsfR3D/fARfGgGMy4lfQOUSUxDLNqnFusyJi/UVg6m+FuBhfcHm+hr9oL4g7HIo9u/qi3piM8oGJjajbHBiM8rGfHU2n7efIE1sRtnwR7Dx+szGGfuAjU2znkwmA4THcOQDwnGUS+U83Q8HvDfn39B7vtrIS/Ctz/Qd3u77aL97Au5/J4Bay/kYqxHM/QRChqlvQHcxgfThJVjzoe269v316oqm44OKU50NnLpjK7fTkeR5F/u8i3vexT/pEiw4XlaLjmTTciVIN0iD+bMe2nreNZFl/LrrFwltMLe/1ulLgr8eVotmuRuaWIZcgbhHhYWRMB6Q4yGQoWLJscUmhApD0yGM/Bs=",
1673
1673
  "brillig_names": [
1674
1674
  "store_in_execution_cache_oracle_wrapper",
1675
1675
  "notify_enqueued_public_function_call_wrapper"
1676
1676
  ],
1677
- "verification_key": "AAAAAAAQAAAAAAAAAAAAFAAAAAAAAAAQAAAAAAADKLEBAAAAAAAAAAEAAAACAAAAAwAAAAQAAAAFAAAABgAAAAcAAAAIAAAACQAAAAoAAAALAAAADAAAAA0AAAAOAAAADwAAAAAAAAAAAAAAJh7dsPvffmpu9ROyqj5T/wGuAhr+eXH7Z9Y+rq8joRYoMy3OeLmiVdIHkSQUyO4/8F9aummTfLawPJyNp/nCMwR+sO0Yi78tcwi6mctUvI6fs3XrxtsXcWHRuKcu0kK3AZTVaEcRJid7qq3davy4WHdWCK+rgUElk42aj7V+FFACKT5oAYYXcQV1uD3Yy2OvmfElFuljpvj6D8yAvh3KKSgOjIv6K2PXH9iTbFxXltINCW4pX+zAIcOXkTVykfkCDjpqr9d+dLsE/PNTJ0xfKwVMS3b9qvoWQjYKkSfGx/8h3GmZSPnSQ/RpCtbTqaptLdyaTMLO8adk5N96MfapFiAynkdY+jmqfgBRaa466RlN/olc3pcjw27oMqcLF7G7ED8doGhoskg/4nd9HoP5fTanNFcURudekLSn31Mm/mothY96KBmENl9866cgdK9W2HNdicGCiUjAsPTgtpG1FigQ0Fz9LIfhEdoVMzvnR8uCh1lkLIRJS4eWunZMA2EBIuSmLVifXcWOAD4X0sKeZqqcjXq3WBuYEO2nPlPhfd8OP4PTyf+mJHwLpRXOLm9SrLCVbfb6d5ltuCSwof5icCmMMxH8kXD5LelAsEKquZDVPGo7JjOc2mtz35IIMUFZB7BfQIphKEclkBa5IErkvzdTfrGWsFwdmPpRAWqbrLsbT9vHPvgyCPHIuwlg1yliWilWolRa3Ef7N2h3c0y/biQL/4K/f5M//kZCH7koNmXFGKBnhQ7e3PtFPqPApgFZAe7rkX5KtImbOL/BiKd/PvSmdwpPvbbnSYvX/gGlOY4Q1fG441JoUAPoG9hubACZUJ3jrVwWYL2TlWMyQa5OKQCmHerHazcMpPQvc6Zly3Wp69xYzUvfivfn/P+jbVtxLll4nw2duz8VreU4S3hJDbHYM3nHO+QRI96/yIyfyNYrcq3BN0OMoNM3FEWlepaQ5kT1hLr6RUEkzwGtW+CxOQEZ4kHuu+v/XH1/INxsWtG2r3jcIG1/d4U/Bf3n69NyAv81eWr89ilQcB5sAM+P/+rmh4+CPDnlNMHi4kYqKTcPfntI+NNMrL3f/j1rkr82nU25+sRHjyZ+bCM9BAVWsCjZNG8jihsTTBeAO4/UmLEwCqzGKlx2Zs1KKhS6AkboKAdGZAv05LONeSmWPv/c5y6nyjZ53UMrnKn9tn5C7DEaIODBrQpWDKk4HgL9YdUyHrvcxgnhclcBtQ1BhFBLYwdkUiwPJcjFesf+TFchJ95ydR5P0699NorWuUanPTmzJxH8QVN0Ge77YUKIDXgfT56+5eKUDcbMctqWH2eP1I0BZx46tb5lNIJKgpwUVpYUncZOpLdtEUArKgT4zQBJ3QiwkgHeDlIOrdt/v4hEwQ3FgUYk0dKuNIS8uQdOyEoYAkP+Xkk4Zc567aTIuz0qRiKgag496i7fv+o8bzu7qSAHh9MUV9V+61DRpXjfjk6bl1wDs1kWfF5z7AKELwtWEgKhDRTa/UKB/tvkmzEVms0A/WPzmL9t0I4rv0et+RssFYuzHBg+9IqzTfs1daUW/FanzEJ6NsI3oVNGA7UNpVUnk0czHOVNm6jV0pBITc/mf/zmUkAihtENDmZi7sLf+h6Ii8i2+fc8YWjB0P5KDZnuO5qCrQF/I9rg1myK+TKYBw85KeMYV95srLLw0L/FnlK3uPwWMY7hwEZPIxLfg0MS4SiRWUg9KQSODJnz4ae0G0XJ9nfxQRqXnfsMPKV+mghOGkA+t679/F+fkbkRjVkxPCp1P67v69rN1IDElxuZCVktPUcD//cjc76jauOgQgn/gPlTJ6vX6LxcuFSvEDwnfYOAgKeIRDV4CUhoHgmRUb6la2DbQ6W3ueQQ2ar1wQrcicSNdbVxY29bvrSoBvb0WWICMBtq5OsOu+rdIDNABm8oE1dI8RljHD/gf6nXAANOPidFTvmStL+EuXuqdHEuJXg1Ud9QwATsfNH03Ys7ZKZvKsSXm2XlZWjFoxsU7Rj3bPDO7MtHmN50GuibZOglj4RHfBtiVlpVm6e7OIMuLSmftoZ40BULzFsW3IJSNT1D+nDpkjnBwcZ+JxoO6sUV06xaGZq7dJM6TvyYxZsoFO3nzSfa7QDDPBKGC8SwRi041tS6Hkdjp07NsRyh80aWgMJw5VFRU0RZL1kYj6dlEts56JKCazJhDuCCUeAF/OkXwNXcoBlHfFL2B1MythIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACJa4sB/dZbHRLKCd5QUk6DlAMioMUIOlCVFTS/76r4xErV116wzukneS7oBNNX3LCeaxKaxMPMvWjU/HiHHn+eADENyb3W2/aDeIs4ODfq2vMegX/lalrKJQkxfczZw2WL5tuC04sAZaN5cMkgqp9HQoJ1xeOyTuteFj5bmTwtI0dWKphxkrVIgQ9ecSAIhnlW6GXUa3+bDYyTT+2wtoJiS18GKk8Pa5YgJ+q7saoanj0s7xh8Z1ucGk1m79H5/kH"
1677
+ "verification_key": "AAAAAAAQAAAAAAAAAAAAFAAAAAAAAAAQAAAAAAADKLEBAAAAAAAAAAEAAAACAAAAAwAAAAQAAAAFAAAABgAAAAcAAAAIAAAACQAAAAoAAAALAAAADAAAAA0AAAAOAAAADwAAAAAAAAAAAAAADvm3BEg2KAfUbTMvT6xAaBKw1gGESPXpBgcD0B7JHB4hHasKmP183k4WNavRAsViANnEgIGKlUrAuwMKrtZzCBe49UUrSXt+tgjV2hi8NFqTzyuoR2w/gmEdUqxJik0JIsbdXYt/PSqc1WDh9EFn8V1FiWWmPu+t5gT+I+N6Ub8BOEgo69B9CryLIVys/BKkuOih0AXdX8HcRpZ4mQL7rRY3e+1JHRSCgw5TTrtK9RCEft5acInttpyhWX0H0kMNIBmnSkVH7RTy798QwqX6IWkmX0cKxsMVXDvtQDV1hNUX+EhUdXE1+a708Ug1Z8SHi0iCGSBsgdfHmqAI6y1VSi20iWEJLvoVrCCoj7xIfj15LSWG8esfH8DKuyRZH8H0Cr2CsGXSnrX4JmYXsOVvLG9fXXVn2NOQCwoj3rw2q4EfjEvhGQkM7d03rICuAGHTtCdceYoLn4nSa+K0ZEWc9RqNakWgM1hoUqVh+WPX8+f67so274FFXiT9Rq039lvDIuSmLVifXcWOAD4X0sKeZqqcjXq3WBuYEO2nPlPhfd8OP4PTyf+mJHwLpRXOLm9SrLCVbfb6d5ltuCSwof5icCmMMxH8kXD5LelAsEKquZDVPGo7JjOc2mtz35IIMUFZB7BfQIphKEclkBa5IErkvzdTfrGWsFwdmPpRAWqbrLsVg9eXZpUv1AmXOVQjcHMPjvYRxyRGkWIJEObc4kX3qy1i+Ledwsrx975JXtByFs703NdSxWwOQiflh0bLznZREGTk4Y/v7shGBH2iIMWWxOgT/CJaFJKRmKJvPI+KF/IKo5+TwV9U2eDrxZ35C+PXLvS4UQix6kxl8753VjSdnQCmHerHazcMpPQvc6Zly3Wp69xYzUvfivfn/P+jbVtxLll4nw2duz8VreU4S3hJDbHYM3nHO+QRI96/yIyfyNYrcq3BN0OMoNM3FEWlepaQ5kT1hLr6RUEkzwGtW+CxOQEZ4kHuu+v/XH1/INxsWtG2r3jcIG1/d4U/Bf3n69NyAv81eWr89ilQcB5sAM+P/+rmh4+CPDnlNMHi4kYqKTcPfntI+NNMrL3f/j1rkr82nU25+sRHjyZ+bCM9BAVWsCyIpmgYkr/QNboIl+qFWIH09iNrYeK0sSzHOqVHySzgFvnvbC8nG8ZS6NE2sORUUgYrTccj3uF2/wFnOTAr+9MXVbtH51ZVr8kp1lylDpliTIRiOOiFCQPfjt+til58ISHL9xVBNh+7ejthG1cRdhEFC9/vZCOtDbVdW/AxaOC3FfkXrYQcyl/TYO4ttlUobuQoPsDZ6ZYTQ0TOtLkwqcQh9PhJA/vTtusflztaLY59eQ3wub8ASnADaXJqPCD0nwTmDA36IbFQXKd72/t80qGrvcpnw4DzPVxvPREwoWavA1c8VGy8Z1pw1m60B+rl99PgHbXOaa7PFWCNTCg/wy4shLQU64fPCGY9ufoJHpYTDO+Z+hPq1tGiFIXdLLgH3BdijQ1eZq77hovFi764vedj5tSCERapCyMlYrvYII5kKW3rheOmhXGLm9bpFrppoWr+uVBr2YM8o/g7WrrJ3EYQ/wEkYNwiLwzkWzcatYZZtD3u+3syBnsvTRCPCYnezRbGE0Fa62lqvfEkYJp8/v90Xe3lIb8V6cqRgUeCd1ulI4Ls/aHW2VeIZNm+I0kWj12/PwEJSoj0znTo0Hin8O8Jsuj/pLCkjVT9mNehsygeJ+wlDR0tMQI9kTkIPKJYgQsKi9978fvXF47egCOmcac5x+4fkZa2Qa/hfuvfFASWDoo4RfPIKiJGovYdDK4CHcNdOoah1u3X0hf9coTLrNIhNEruydRD+T62dTaHEli4a2/dZpy0cuSrnqsdHmuVkgrcicSNdbVxY29bvrSoBvb0WWICMBtq5OsOu+rdIDNABm8oE1dI8RljHD/gf6nXAANOPidFTvmStL+EuXuqdHEuJXg1Ud9QwATsfNH03Ys7ZKZvKsSXm2XlZWjFoxsU7Rj3bPDO7MtHmN50GuibZOglj4RHfBtiVlpVm6e7OIMuLSmftoZ40BULzFsW3IJSNT1D+nDpkjnBwcZ+JxoO6sUV06xaGZq7dJM6TvyYxZsoFO3nzSfa7QDDPBKGC8SwRi041tS6Hkdjp07NsRyh80aWgMJw5VFRU0RZL1kYj6dlEts56JKCazJhDuCCUeAF/OkXwNXcoBlHfFL2B1MythIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACMFfLyuFRYM6TAPZBKeAJA/A4UmP/sUPzFFaKrk+pJo4bykxDn9qUvCzHB0dPKIoGL0+VBJPXad8ESPPcWtLcZQDENyb3W2/aDeIs4ODfq2vMegX/lalrKJQkxfczZw2WL5tuC04sAZaN5cMkgqp9HQoJ1xeOyTuteFj5bmTwtI0dWKphxkrVIgQ9ecSAIhnlW6GXUa3+bDYyTT+2wtoJiS18GKk8Pa5YgJ+q7saoanj0s7xh8Z1ucGk1m79H5/kH"
1678
1678
  },
1679
1679
  {
1680
1680
  "name": "_check_block_number",
@@ -1795,195 +1795,7 @@
1795
1795
  ]
1796
1796
  },
1797
1797
  {
1798
- "name": "process_log",
1799
- "is_unconstrained": true,
1800
- "custom_attributes": [],
1801
- "abi": {
1802
- "parameters": [
1803
- {
1804
- "name": "_log_ciphertext",
1805
- "type": {
1806
- "kind": "struct",
1807
- "path": "std::collections::bounded_vec::BoundedVec",
1808
- "fields": [
1809
- {
1810
- "name": "storage",
1811
- "type": {
1812
- "kind": "array",
1813
- "length": 18,
1814
- "type": {
1815
- "kind": "field"
1816
- }
1817
- }
1818
- },
1819
- {
1820
- "name": "len",
1821
- "type": {
1822
- "kind": "integer",
1823
- "sign": "unsigned",
1824
- "width": 32
1825
- }
1826
- }
1827
- ]
1828
- },
1829
- "visibility": "private"
1830
- },
1831
- {
1832
- "name": "_tx_hash",
1833
- "type": {
1834
- "kind": "field"
1835
- },
1836
- "visibility": "private"
1837
- },
1838
- {
1839
- "name": "_unique_note_hashes_in_tx",
1840
- "type": {
1841
- "kind": "struct",
1842
- "path": "std::collections::bounded_vec::BoundedVec",
1843
- "fields": [
1844
- {
1845
- "name": "storage",
1846
- "type": {
1847
- "kind": "array",
1848
- "length": 64,
1849
- "type": {
1850
- "kind": "field"
1851
- }
1852
- }
1853
- },
1854
- {
1855
- "name": "len",
1856
- "type": {
1857
- "kind": "integer",
1858
- "sign": "unsigned",
1859
- "width": 32
1860
- }
1861
- }
1862
- ]
1863
- },
1864
- "visibility": "private"
1865
- },
1866
- {
1867
- "name": "_first_nullifier_in_tx",
1868
- "type": {
1869
- "kind": "field"
1870
- },
1871
- "visibility": "private"
1872
- },
1873
- {
1874
- "name": "_recipient",
1875
- "type": {
1876
- "kind": "struct",
1877
- "path": "aztec::protocol_types::address::aztec_address::AztecAddress",
1878
- "fields": [
1879
- {
1880
- "name": "inner",
1881
- "type": {
1882
- "kind": "field"
1883
- }
1884
- }
1885
- ]
1886
- },
1887
- "visibility": "private"
1888
- }
1889
- ],
1890
- "return_type": null,
1891
- "error_types": {
1892
- "16775516380094354375": {
1893
- "error_kind": "fmtstring",
1894
- "length": 40,
1895
- "item_types": []
1896
- },
1897
- "17843811134343075018": {
1898
- "error_kind": "string",
1899
- "string": "Stack too deep"
1900
- }
1901
- }
1902
- },
1903
- "bytecode": "H4sIAAAAAAAA/+Wc6XLbNhDHKZu0TcmyZPmK3Svp3bRpKYnU0dNt0/u+lM+KYz8HHyPta7Rf2qer/jFXWsHojDteTPxPMMOhpYV2f1wuARBYuBadl8nsqFV/x9V5vTrj+060XKTucXXOrla6hrqyUIw1AsYVAsZVAsaYgDEhYFwjYFwnYNwgYEwJGOsEjA0Cxk0CxiYB4xYBY4uAsU3AuB2AMQRnh4Rzx5BTj+1D8e5G1z9G9wgY9wkYDwgYbxAwHhIwHhEwPkPA+CwB43MEjM8TML5AwHiTgPEWAeOLBIwvETC+TMD4CgHjqwSMrxEwvk7A+AYB420CxjcJGN8iYLxDwPg2AeM7BIwZAWOXgLFHwNgnYMwJGAsCxgEB45CAcUTAOCZgfJeA8T0CxvcJGD8gYPyQgPEjAsZjAsaPCRg/IWD8lIDxLgHjZwSMnxMwfkHA+CUB41cEjF8TMH5DwPgtAeN3BIzfEzD+QMD4IwHjTwSMPxMw/hKAMQTnryScv5FwTgJxRvcc6JXZgY1b2BiFjUfY2IONM9iYgo0f2FiBjQvYGIDEeyS2I3G8PTuQ+IykYiTsIgkWSaZI4kSSJJIQkeSHJDokqSEJDElWSGJCktDN2XFrdiCJBEkaSIJAkgEW8bFIjkVoLPJiERWLlFgExCIbFrGwSISrwiIHFhEwSY9JcEwyYxIXk6SYhMQkHybRMEmFSSBMsmASQyYJ8JKLl0i8pOElCC8ZGMRjkIxBKAZ5GERhkIJBADpZdGLoJNAIo5FDI4KHFA8AgmsS/XeRIPmnOqfVeUXJDTfRdVPHrqX+UTa+n3quz5C/n1Y6N4LoL4aiPw3Dn8lG27vlQr++FrG7Wp0n5cKXk3KZSeo8VHUeOnXkesLc7zwP669ur+n4KFLXIrbrYWz3a449fV+0TOzXo5Cxeb4pWdsTHtc/0nY0pU654Kk5sri8eB0iS5RM7i/s3Fb13NjacGTCgiLx21S+kXKvksk9jZVOu3gtRmHjNc8eX7zm3ScxXmNHFpcXr+P/xquOLTdek2hRpC0V2ZqS/e7I1pXsj3Jhu1Acg+rvsG3yeR+snz3rPmzHw69toayXC39IDK6q7xLlv0f+0fUdWapkcblsp159jpUdrUs4Eqd+Xn1uVec19Rv5fdtjf82xv8Tt+c71S+qpn3rqI9buVH83qgMx9Jf8Jrr47OI4rj5nVyrDwtdO2ukfdH1toaH+U9HfCKK/l4n+zTD8836qGeb+DkT/Vhj+efy0wvD3RH87DP+Z6N8Owz9/j+kE0V/Mx+U7Yfjn8b8bxv9z/r0w/HP9+2H45/f3IIz+sYw7bkSL4o4zD9X3dv1/b3zZcabYrzusocaZhw6P6x89zoTsyMPa9sjcZ/TIY+fIY8ena9NQ14Ghrm1DXQ1DXfuGutqGuuqGuvYMdbUMdaWGuizvo6W/LGN111CXZaxuGeq6ru2E5fNo6fvrGqsbhrosY8IyVi39tWOoy7KNthwDNA11WfYdls/QdY2vp6H9CtEPhV0PzDLfPFhkp987D2aoPxNfS6zquW9tU64vcer/6fh5M4ife1N5J5M2SPvCN1dlabvm2Isi//us2G96eIS77pFd5R/Mno5OTsf383wwzIuifzKsOfqF1f1OzzvrPkfX970b++bVDH098q3xtJRfUWIl23JkiZIJo17j8c07WvJfxv/aftsjc8del72XnWg51vTz2IgWz3Bc2l/7cHTeljxirPQn0fIabuTYT5z6f1ef3bbuqs/I2XDaPetPz6bF9MGD/GTacfRrH8JP/wJJ9PoyCV0AAA==",
1904
- "debug_symbols": "tZbRCoMgGIXfxWsv0qV/26uMMawsBLGwGozo3acjttiuz0105NfPCz84K2ttvfR3F7phYpfryvzQmNkNIaV146yOznvX34/LrMgfofR7wzSakPM0mzizizgJUpzZ0OZ/KVU6pHPeplScN/43T3IfJvpMlrTdeAIQGlChAWcwQBdogEADJBpwQgNKNEChAWiTNdpkjTZZo00mtMmENpnQJhPaZEKbTGiTCW0yoU0mqMlbSg8Tnam93RtOt4TmUHjm52h/us8Yh8a2S7S5BX0LUH6NpeRK5mtne0VVcFGpBEmgFw==",
1905
- "brillig_names": [
1906
- "process_log"
1907
- ]
1908
- },
1909
- {
1910
- "name": "public_dispatch",
1911
- "is_unconstrained": true,
1912
- "custom_attributes": [
1913
- "public"
1914
- ],
1915
- "abi": {
1916
- "parameters": [
1917
- {
1918
- "name": "selector",
1919
- "type": {
1920
- "kind": "field"
1921
- },
1922
- "visibility": "private"
1923
- }
1924
- ],
1925
- "return_type": null,
1926
- "error_types": {
1927
- "1433889167918961673": {
1928
- "error_kind": "fmtstring",
1929
- "length": 17,
1930
- "item_types": []
1931
- },
1932
- "2242946026394210301": {
1933
- "error_kind": "string",
1934
- "string": "Block number mismatch."
1935
- },
1936
- "2830029349304997821": {
1937
- "error_kind": "fmtstring",
1938
- "length": 27,
1939
- "item_types": [
1940
- {
1941
- "kind": "field"
1942
- }
1943
- ]
1944
- },
1945
- "5019202896831570965": {
1946
- "error_kind": "string",
1947
- "string": "attempt to add with overflow"
1948
- },
1949
- "8209322232883590150": {
1950
- "error_kind": "string",
1951
- "string": "Function _check_block_number can only be called internally"
1952
- },
1953
- "8443716675528357851": {
1954
- "error_kind": "string",
1955
- "string": "Timestamp mismatch."
1956
- },
1957
- "10421965853029650238": {
1958
- "error_kind": "string",
1959
- "string": "Function _check_block_number can only be called statically"
1960
- },
1961
- "11405868724477732285": {
1962
- "error_kind": "string",
1963
- "string": "Function _check_timestamp can only be called internally"
1964
- },
1965
- "13418685691864489983": {
1966
- "error_kind": "string",
1967
- "string": "Function _check_timestamp can only be called statically"
1968
- },
1969
- "16761564377371454734": {
1970
- "error_kind": "string",
1971
- "string": "Array index out of bounds"
1972
- },
1973
- "17843811134343075018": {
1974
- "error_kind": "string",
1975
- "string": "Stack too deep"
1976
- }
1977
- }
1978
- },
1979
- "bytecode": "JwACBAEoAAABBIBVJwAABAMnAgIEAScCAwQAHxgAAwACgFQuCIBUAAElAAAARSUAAAC9KAIAAQSAVScCAgQAOw0AAQACKACAQwIABCgAgEQCAAYoAIBFAgABKACARgIAAigAgEcCAAUoAIBIAgADKACASQEAACgAgEoEAAAoAIBLAQABKACATAQAASgAgE0CACAoAIBOAgBlKACATwIAbCgAgFACAG4oAIBRAgBvKACAUgIAcigAgFMCAHQmJQAABaUpAgACAFivKuAKOAECAycCBAQAJwIGBAMAOAQGBS0IAQIAEAEFAScDAgQBACgCAgUtDgQFACgFAgUtDgQFJwIFBAMAOAIFBCcCBAQCJwIFAAEkAgADAAABICMAAAJ8LQgBAycCBgQDABABBgEnAwMEAQAoAwIGHzSATAAEAAYtDQMGACgGAgYtDgYDLQgBBgAAAQIBLQ4DBi0IAQMAAAECAS4KgEoAAycCCAQJLQgACS0MBgotDAMLABAACAAlAAAFzi0EAAAtDAoHASgAB4BMAAktDQkIHAwICQIcDAkHABwMBwgCJwIJBAotCAAKLQwGCy0MAwwAEAAJACUAAAXOLQQAAC0MCwcBKAAHgEwABi0NBgMcDAMHBRwMBwYAHgIAAwEeAgAHAAo4AwcJJAIACQAAAfwlAAAGRx4CAAMJCjgDBQckAgAHAAACEyUAAAZZHgIAAwYcDAMHACcCCQQKLQgACi0MBwstDAgMLQwGDQAQAAkAJQAABmstBAAALQwLAyQCAAMAAAJRJQAACNAtDQIDACgDAgMtDgMCACgCAgctDQcGJwIIBAIAOAcIAzsNAAMABiMAAAJ8KQIAAwB57RaBCjgBAwYkAgAGAAAClyMAAAPXLQgBAycCBgQDABABBgEnAwMEAQAoAwIGHzSATAAEAAYtDQMEACgEAgQtDgQDLQgBBAAAAQIBLQ4DBC0IAQMAAAECAS4KgEoAAycCBwQILQgACC0MBAktDAMKABAABwAlAAAFzi0EAAAtDAkGASgABoBMAAgtDQgHHAwHCAIcDAgGABwMBgcCJwIIBAktCAAJLQwECi0MAwsAEAAIACUAAAXOLQQAAC0MCgYBKAAGgEwABC0NBAMeAgAEAR4CAAYACjgEBggkAgAIAAADaSUAAAjiHgIABAkKOAQFBiQCAAYAAAOAJQAACPQeAgAEBScCBgQILQgACC0MBAktDAcKLQwDCwAQAAYAJQAABmstBAAALQwJBSQCAAUAAAO5JQAACQYAKAICBS0NBQQnAgYEAgA4BQYDOw0AAwAEIwAAA9cnAgICeycCAwJjJwIEAnMnAgUCVScCBgJrJwIHAn0nAggCdy0IAQknAgoEHAAQAQoBJwMJBAEAKAkCCi0MCgstDgULACgLAgsuCoBQAAsAKAsCCy0OBgsAKAsCCy4KgFAACwAoCwILLgqAUQALACgLAgstDggLACgLAgsuCoBQAAsAKAsCCy4KgE0ACwAoCwILLQ4ECwAoCwILLgqATgALACgLAgsuCoBPAAsAKAsCCy4KgE4ACwAoCwILLQ4DCwAoCwILLgqAUwALACgLAgsuCoBRAAsAKAsCCy4KgFIACwAoCwILLgqATQALACgLAgstDgILACgLAgstDgQLACgLAgsuCoBOAAsAKAsCCy4KgE8ACwAoCwILLgqATgALACgLAgstDgMLACgLAgsuCoBTAAsAKAsCCy4KgFEACwAoCwILLgqAUgALACgLAgstDgcLCyCASYBLAAIkAgACAAAFpCcCAwQeLQgBBCcCBQQeABABBQEtDAQFKgMABQUnRkiy9UEXvQAoBQIFACgJAgYnAgcEGy4EAAaAAy4EAAWABC4EAAeABSUAAAkYJwIGBBsAOAUGBS4KgEwABQAoBQIFLQ4BBQAoBQIFPA0EAyYoAIAEBHgADQAAAIAEgAMkAIADAAAFzSoBAAEF96Hzr6Wt1Mo8AQECJiUAAAWlLQ0BAy0NAgQnAgYEAgw4BAYHJAIABwAABfIlAAAJXgAoAwIGADgGBActDQcFLQgBBicCBwQCABABBwEnAwYEAQAoBgIHLQwHCC0OBQgBKAAEgEwABQ44BAUHJAIABwAABjolAAAJcC0OAwEtDgUCLQwGASYqAQABBZ5JySyNO6W9PAEBAiYqAQABBbo4v4qgMx//PAEBAiYlAAAFpQo4AQMFDDgBAwYLKAACgEUAASQCAAEAAAjCIwAABo8LKAACgEYAAxYMBQckAgADAAAIsCMAAAaoCygAAoBIAAgkAgAIAAAIniMAAAa9CygAAoBDAAkkAgAJAAAIhyMAAAbSCygAAoBHAAkWDAYKJAIACQAACHAjAAAG6wsoAAKARAAHJAIABwAACF4jAAAHACcCAgJwJwIHAmQnAgkCYScCCgJJJwILAmknAgwCdi0IAQ0nAg4EEgAQAQ4BJwMNBAEAKA0CDi0MDg8tDgoPACgPAg8uCoBQAA8AKA8CDy0ODA8AKA8CDy0OCQ8AKA8CDy4KgE8ADwAoDwIPLQ4LDwAoDwIPLQ4HDwAoDwIPLgqATQAPACgPAg8uCoBRAA8AKA8CDy0OAg8AKA8CDy4KgE4ADwAoDwIPLgqAUgAPACgPAg8tDgkPACgPAg8uCoBTAA8AKA8CDy0OCw8AKA8CDy4KgFEADwAoDwIPLgqAUAAPCyCASYBLAAIkAgACAAAIUycCBwQTLQgBCScCCgQTABABCgEtDAkKKgMACgUT5jKZ5RcUCQAoCgIKACgNAgsnAgwEES4EAAuAAy4EAAqABC4EAAyABSUAAAkYJwILBBEAOAoLCi4KgEoACgAoCgIKPA0JBy4IgEkABiMAAAhnLQwKBiMAAAhnLQwGBSMAAAh+BDgKBwItDAIFIwAACH4tDAUIIwAACJUSOAYFAi0MAggjAAAIlS0MCAMjAAAIpy0MBgMjAAAIpy0MAwEjAAAIuS0MBwEjAAAIuS0MAQQjAAAIyy0MBQQjAAAIyy0MBAEmKgEAAQV1LhuUZOj32zwBAQImKgEAAQVx7V8Tcb40BjwBAQImKgEAAQWQokK5sxVPPjwBAQImKgEAAQUfIIuHAZnP/TwBAQImAQCAA4AFgAcuAIADgAguAIAEgAkLAIAIgAeACiQAgAoAAAldLgGACIAGLgKABoAJAQCACAACgAgBAIAJAAKACSMAAAksJioBAAEF6J0J/qERLQ48AQECJioBAAEFRafKcRlB5BU8AQECJg==",
1980
- "debug_symbols": "zV3RjhM7DP2XPu9D7Dixw69cXaEFFrTSakHLcqUrxL/f6dKZzrbujTjEQ19QCzk5PonjZOwM/b77cPfu26e3948fP3/dvfnr++7h8/vb5/vPj9O37z9udu+e7h8e7j+9Xf/1Lu3/oCYvgK9fbh/3378+3z49797kxO1md/f4YfpIRacuPt4/3O3eEKUff9/sOGUIZR6KleoBNX20MxRlCAVxMcTFiqAyQyiISyAuqQiqEIQqCKomBGWub5BIOqCoEL1C3Zy3TpJtbp5E29K+1heSxluQaDzJtKq3INlCCW2hhF2fpCKzT1KleuqTmQVCNQSVM4RSBOVHni6qIqgCjbwfeXqo6kY5aq3MkSdR7riS0bxdWpalbZb2k6FGM2gKZ5BwBotmsBzOEK7hwmY0kmGEtyZdGPQVw3nbZnxo29oxZOf8sjolyVVZY3/OGj2zhvJVWXNVY8PRa104eq1L5nCG6J1pOpCFM5RohhKuoUg4w8ark4xlPnVZzmfrs9brsmfICQq1R9K5PeW67DF3fKTND1BTskB6z1u58mzQ9FnKqr067WXy40NzMeH105mjtei8HVgxPXmUEysjzC90NF+pZ36tc3Opmnrmp7KYz3Rqfhs++ppfmf9CUuJJip9vHE1iv08iVJZcgpByZ7aV0hx+lbj8/2w3rsvZha2czHahPNx8ORsjsg1IuG5Akum3SZrqcpY8ti3iNK1c8qFt5SqdZd3SHMKsMZ9OdK4DLaeUytr0PYH8/tBQWnx1asBnDDWaoaRwBglnsGiGyuEMGs2g4Ro03Fst3Fst3JcaUjsrDaln1cQQyq9n1WpHVOsOwjE4T5/5NP1fibYgKRuQ+IWM0SRbKPF3zE65uvopgh6q5vgaU60bVMuq8hYkWyixLZTYFkoaUqyqDSkT6oUkeg9lCIoYQiElSWWCUMjIa04QKjrBqkLhDCWcoUUzlBzOEF0O0Bqu4cJmNJBBR3jrqHKearsma+yaynlq11TO03ZVY9Oi17qlHM4QvdaNKJwhemcyTuEM8Rqid1fLG69Ozm1JD8gq63lYnyZ0ZfYMr6xsWTyzMqT69KeKZ1Y2qGtZTVuQ2AYkOr76tGHxzHSDupbZBhU6a7QFyYCMeM2LR9VVHs0vnyWb12pNrXUWti05FLNymkJpacAA1SUHSFVtbfsLQ41moBTOIOEMFs3AHM6g0Qw5XEMO91YJ91YJ9yU/FTS2TtH8bNBgEr/mO5pENyDRLZTYL0/8C8oQVIO4GsJFKWUMhrERxkYYGzMGUwiWMbaMsQnGJhWClYTBCgSrhMEwbYppU0ybYdoM09YwL2mQT1IiDAZpI2IMhmnjjMGgyEVYLCEslpBg2gTT5t+Y68MaBKvQMiUsKJBi2hTTZpi2hmlr0DJlLChwglyZsaDA2AGDsaDA2AGDsaDAGZs3weZNMG0F01aweavYvFVomTIWFFgxbYZpM0xbg7TllDAYFPAyEQaDFs6F//kh57xcGMz6+rKPk9Ses9R6TImKHvq32P4vXJMc1r8fWAb2X2L7L8HzW6Ltb7H9+/mYgf1rbP8WbL8F2++njwb2H+s/kmL9XygF9x9sf/D+Ihwb/yVTcP/B4y/B4++XbstyqazY6g30n5do6ML7tz2Qu5IrzVXfmusZqCRBQAiTn6npgPycbw+EMGWEyT9claVEVZOeg3yP64EKACoIU0GYKsJUBQG55+Va5ltXdXXFZAH5L/t1QH5utwdqAMh/7OqBgIGofpIvL0MuafWGnZWfIL9MOu0sMyjzK5BzUSfbXI+bCser96vMaZyPHpBrWsVe775QnvJfc2Nev4rjNaZ9nv/Qevrc1loPUv2asyzjs743M4+Pn+8rS+goWc9B/rlRl7ql5nQGuvD2TlFZVowD8q+V1ry8u14dkF9Z6pjn54JVZ0exlM9B/nsAHZBfCemB9NdBlhgBIUyEMBHCxAiTf5DsgDIhIIRJECZBmPxdtQcSBNQAkF8i6YAU0aSIJkU0+VnQHsgAUEM0NUBTSxkBAZoaElgaElgaI5oY0ZQFASHzJIgmQTQhMaIhMaIhMaIhMaIhMaIhMaIZoqkhmpAY0YAYwSkVAEQJAbk7ocl8SDRNnTP+5SQIJ/8/wh7Vu//oPqx3jezdP7YM6z10Vkuo7X4eYlTvfhphVO/+izPDeg+13UJt9/Mjo3pvkT5z4ULcsN4j1ypRqO2huwcxh/YeGd/JT4yqLJDz5AuTvwTrwlPtJEv3Y/r6z+3T/e27h7vDzwN9/Pb4fvVrQc//frk7+eGgL0+f3999+PZ0t/8JoeOvB+25ZVIvJe8PLnv7We2G7eXr3o2k6PSvbWKdmP8D",
1981
- "brillig_names": [
1982
- "public_dispatch"
1983
- ]
1984
- },
1985
- {
1986
- "name": "check_block_number",
1798
+ "name": "check_timestamp",
1987
1799
  "is_unconstrained": false,
1988
1800
  "custom_attributes": [
1989
1801
  "private"
@@ -2483,7 +2295,9 @@
2483
2295
  {
2484
2296
  "name": "value",
2485
2297
  "type": {
2486
- "kind": "field"
2298
+ "kind": "integer",
2299
+ "sign": "unsigned",
2300
+ "width": 64
2487
2301
  },
2488
2302
  "visibility": "private"
2489
2303
  }
@@ -3571,13 +3385,199 @@
3571
3385
  }
3572
3386
  }
3573
3387
  },
3574
- "bytecode": "H4sIAAAAAAAA/+XdB3RTdf/H8bRpCwUKFAQFVAqobEiapE3Ye+8NLjpSQRFkKTjr3ntvnLj3nrgVt+JeqLgXe4//5/uQPFwu0XP+T2/0eZ/nnvM+bZP05vW7GU2TOzJ826d8v8+3MnP79xnKn/hqJxW4Tkt+dX6fneJyNVOclpfitDopTstPcVpD1cN1WtMUlytIcVqzFKc1T3FayxSntVLVfTtPGYmvPRJfQ4GicDheXBgPhoIlgcJYaTQSCEdKi6LBaDASjZQXRkOheDQcLY6VxooDsWA4FA9WRGKhisD2aWvmjnkFqjQVlqXTue0/d4bcJ5itnspyWG05bHUs9+T3rR3fb0tcJvl7dkNlqEzl9ztOT0yZrmUQqNoUbOnh8szye+dy3mdtvgW+9N5nsz2zF5am05njgbM4Fi8P6hrT6az2nzvD7hNSPbbs9ko+hnL8qR9n1fw7P7aq6+dcVUPVTPHY8ruWQaBqU7C1h/Oq7vfutqnl3eM05W1Ty3F75Dq+r+H4vqbrtsnTz7VVHVU3cdtkuW6XVFMPb8YRyviL66nqdbgfbxne2oOtvJtXIF3G1mkwpsOZ50+P89+T13/Aszx8YshP0x/w/MQf8KzEz1kplovXN2SG73/7Due1MyvNDwyvnKnmvcuDrqoPFC/BbXzpWbBej9nDB1SwLWTMmR6OuR1kzH4Px9z+bxpzoGpTsIOHy88HeULv6GM4AxBnEOIshDhDEGcY4oxAnEUQZzHEGYU4YxBnJ4izM8TZBeLsCnF2gzi7Q5w9IM6eEGcviLM3xNkH4uwLcfaDOPtDnAMgzoEQ5yCIczDEOQTiHApxDoM4h0OcIyDOkRDnKIhzNMQ5BuIcC3GOgzjHQ5wTIM6JEOckiHN/iPMAiPNAiPMgiPNgiHMyxFkCcZZCnGUQZznEGYc4KyDOQyDOKRDnVIjzUIjzMIhzGsR5OMQ5HeKcAXEeAXHOhDhnQZyzIc45EOdciPNIiPMoiHMexDkf4jwa4jwG4jwW4jwO4jwe4jwB4qyEOE+EOE+COE+GOE+BOE+FOE+DOE+HOM+AOM+EOM+COM+GOM+BOM+FOM+DOM+HOC+AOC+EOC+COC+GOC+BOC+FOC+DOC+HOK+AOK+EOK+COK+GOK+BOK+FOK+DOK+HOBdAnDdAnDdCnDdBnDdDnLdAnLdCnAshztsgztshzjsgzjshzrsgzrshznsgznshzvsgzvshzgcgzgchzocgzochzkcgzkchzscgzschzicgzichzqcgzqchzmcgzmchzkUQ53MQ5/MQ5wsQ54sQ50sQ58sQ5ysQ56sQ52sQ52KI83WI8w2I802I8y2I822I8x2I812I8z2I832IcwnE+QHE+SHE+RHE+THE+QnE+SnE+RnE+TnE+QXE+SXE+RXEuRTi/Bri/Abi/BbiXAZxfgdxfg9x/gBx/ghx/gRx/gxx/gJx/gpx/gZx/g5x/gFxLoc4V0CcKyHOVRDnaohzDcS5FuJcB3Guhzg3QJwbIc5NEOdmiHMLxLkV4twGcdoMCc4MiDMT4vRDnFkQZzbEmQNxVoM4q0OcuRBnDYizJsRZC+LMgzhrQ5x1IM66EGc+xFkP4qwPce4GcTaAOBtCnLtDnHtAnI0gzsYQZxOIc0+Icy+Ic2+IsynEWQBxNoM4m0OcLSDOfSDOfSHO/SDOlhBnK4izNcTZBuJsC3G2gzjbQ5wdIM6OEGcA4gxCnIUQZwjiDEOcEYizCOIshjijEGcM4uwEcXZOkzPT5QwFisLheHFhPBgKlgQKY6XRSCAcKS2KBqPBSDRSXhgNheLRcLQ4VhorDsSC4VA8WBGJhSoS887wcMxd/gfH3BVyf+yW4d3y+6vbJlC1KdjdQ2ee/++5PwaqNgV7eDjmLD/j/tgT8rjpBXH2hjj7QJx9Ic5+EGd/iHMAxDkQ4hwEcQ6GOIdAnEMhzmEQ53CIcwTEORLiHAVxjoY4x0CcYyHOcRDneIhzAsQ5EeKcBHHuD3EeAHEeCHEeBHEeDHFOhjhLIM5SiLMM4iyHOOMQZwXEeQjEOQXinApxHgpxHgZxToM4D4c4p0OcMyDOIyDOmRDnLIhzNsQ5B+KcC3EeCXEeBXHOgzjnQ5xHQ5zHQJzHQpzHQZzHQ5wnQJyVEOeJEOdJEOfJEOcpEOepEOdpEOfpEOcZEOeZEOdZEOfZEOc5EOe5EOd5EOf5EOcFEOeFEOdFEOfFEOclEOelEOdlEOflEOcVEOeVEOdVEOfVEOc1EOe1EOd1EOf1EOcCiPMGiPNGiPMmiPNmiPMWiPNWiHMhxHkbxHk7xHkHxHknxHkXxHk3xHkPxHkvxHkfxHk/xPkAxPkgxPkQxPkwxPkIxPkoxPkYxPk4xPkExPkkxPkUxPk0xPkMxPksxLkI4nwO4nwe4nwB4nwR4nwJ4nwZ4nwF4nwV4nwN4lwMcb4Ocb4Bcb4Jcb4Fcb4Ncb4Dcb4Lcb4Hcb4PcS6BOD+AOD+EOD+COD+GOD+BOD+FOD+DOD+HOL+AOL+EOL+COJdCnF9DnN9AnN9CnMsgzu8gzu8hzh8gzh8hzp8gzp8hzl8gzl8hzt8gzt8hzj8gzuUQ5wqIcyXEuQriXA1xroE410Kc6yDO9RDnBohzI8S5CeLcDHFugTi3QpzbIE5fJsOZAXFmQpx+iDML4syGOHMgzmoQZ3WIMxfirAFx1oQ4a0GceRBnbYizDsRZF+LMhzjrQZz1Ic7dIM4GEGdDiHN3iHMPiLMRxNkY4mwCce4Jce4Fce4NcTaFOAsgzmYQZ3OIswXEuQ/EuS/EuR/E2RLibAVxtoY420CcbSHOdhBne4izA8TZEeIMQJxBiLMQ4gxBnGGIMwJxFkGcxRBnFOKMQZydIM7OEGcXiLMrxNkN4uwOcfaAOHtCnL0gzt4QZx+Isy/E2Q/i7A9xDoA4B0KcgyDOwRDnEIhzKMQ5DOIcDnGOgDhHQpyjIM7REOcYiHMsxDkO4hwPcU6AOCdCnJMgzv0hzgMgzgMhzoMgzoMhzskQZwnEWQpxlkGc5RBnHOKsgDgPgTinQJxTIc5DIc7DIM5pEOfhEOd0iHMGxHkExDkT4pwFcc6GOOdAnHMhziMhzqMgznkQ53yI82iI8xiI81iI8ziI83iI8wSIsxLiPBHiPAniPBniPAXiPBXiPA3iPB3iPAPiPBPiPAviPBviPAfiPBfiPA/iPB/ivADivBDivAjivBjivATivBTivAzivBzivALivBLivArivBrivAbivBbivA7ivB7iXABx3gBx3ghx3gRx3gxx3gJx3gpxLoQ4b4M4b4c474A474Q474I474Y474E474U474M474c4H4A4H4Q4H4I4H4Y4H4E4H4U4H4M4H4c4n4A4n4Q4n4I4n4Y4n4E4n4U4F0Gcz0Gcz0OcL0CcL0KcL0GcL0Ocr0Ccr0Kcr0GciyHO1yHONyDONyHOtyDOtyHOdyDOdyHO9yDO9yHOJRDnBxDnhxDnRxDnx2lyZrqcoUBROBwvLowHQ8GSQGGsNBoJhCOlRdFgNBiJRsoLo6FQPBqOFsdKY8WBWDAcigcrIrFQRWLeLT0c8yd/05gDVZuCn2Z6t/zy/YzbOcvD5fcZ5L6d7eGYP4eMOcfDMX8BGXM1D8f8JWTM1T0c81eQMed6OOalkDHX8HDMX0PGXNPDMX8DGXMtD8f8LWTMeR6OeRlkzLU9HPN3kDHX8XDM30PGXNfDMf8AGXO+h2P+ETLmeh6O+SfImOt7OOafIWPezcMx/wIZcwMPx/wrZMwNPRzzb5Ax7+7hmH+HjHkPD8f8B2TMjTwc83LImBt7OOYVkDE38XDMKyFj3tPDMa+CjHkvD8e8GjLmvT0c8xrImJt6OOa1kDEXeDjmdZAxN/NwzOshY27u4Zg3QMbcwsMxb4SMeR8Px7wJMuZ9PRzzZsiY9/NwzFs8HLPft30dnyWJAbdRbVU71V51UB3telRQFdqyUGEVUUWqWEVVTHVSnVUX1VV1U90TY++peqneqo/qq/qp/mqAGqgGqcFqiBqqhqnhaoQaqUap0WqMGqvGqfFqgpqoJqn91QHqQHWQOlhNViWqVJWpchVXFeoQNUVNVYeqw9Q0dbiarmaoI9RMNUvNVnPUXHWkOkrNU/PV0eoYdaw6Th2vTlCV6kR1kjpZnaJOVaep09UZ6kx1ljpbnaPOVeep89UF6kJ1kbpYXaIuVZepy9UV6kp1lbpaXaOuVdep69UCdYO6Ud2kbla3qFvVQnWbul3doe5Ud6m71T3qXnWful89oB5UD6mH1SPqUfWYelw9oZ5UT6mn1TPqWbVIPaeeVy+oF9VL6mX1inpVvaYWq9fVG+pN9ZZ6W72j3lXvqffVEvWB+lB9pD5Wn6hP1Wfqc/WF+lJ9pZaqr9U36lu1TH2nvlc/qB/VT+pn9Yv6Vf2mfld/qOVqhVqpVqnVao1aq9ap9WqD2qg2qc1qi9qqtil7kGWoTOVXWSpb5ahqqrrKVTVUTVVL5anaqo6qq/JVPVVf7aYaqIZqd7WHaqQaqyZqT7WX2ls1VQWqmWquWqh91L5qP9VStVKtVRvVVrVT7VUH1VEFVFAVqpAKq4gqUsUqqmKqk+qsuqiuqpvqrnqonqqX6q36qL6qn+qvBqiBapAarIaooWqYGq5GqJFqlBqtxqixapwaryaoiWqS2l8doA5UB6mD1WRVokpVmSpXcVWhDlFT1FR1qDpMTVOHq+lqhjpCzVSz1Gw1R81VR6qj1Dw1Xx2tjlHHquPU8eoEValOVCepk9Up6lR1mjpdnaHOVGeps9U56lx1njpfXaAuVBepi9Ul6lJ1mbpcXaGuVFepq9U16lp1nbpeLVA3qBvVTepmdYu6VS1Ut6nb1R3qTnWXulvdo+5V96n71QPqQfWQelg9oh5Vj6nH1RPqSfWUelo9o55Vi9Rz6nn1gnpRvaReVq+oV9VrarF6Xb2h3lRvqbfVO+pd9Z56Xy1RH6gP1UfqY/WJ+lR9pj5XX6gv1VdqqfpafaO+VcvUd+p79YP6Uf2kfla/qF/Vb+p39YdarlaolWqVWq3WqLVqnVqvNqiNapParLaorWqbshcUGSpT+VWWylY5qpqqrnJVDVVT1VJ5qraqo+qqfFVP1Ve7qQaqodpd7aEaqcaqidpT7aX2Vk1VgWqmmqsWah+1r9pPtVStVGvVRrVV7VR71UF1VAEVVIUqpMIqoopUsYqqmOqkOqsuqqvqprrb6xXVU/VSvVUf1Vf1U/3VADVQDVKD1RA1VA1Tw9UINVKNUqPVGDVWjVPj1QQ1UU1Sdqx5O467HSPdjj9ux/aerOyY1Ha8ZzuWsh2n2I4BbMfXtWPX2nFh7ZirdjxTO1aoHYfTjnFpx4+0YzPacQ/tmIJ2vD47Fp4dZ86O4WbHR7Njj9lxveyYWXY8KjvWkx1HyY5RZMf/sWPrVCo7Jowdb8WOZWLHCbFjcNjxLezYEXZcBjvmgR1PwPbVb/vBt33M2/7bbd/ott9x26e37S/b9kVt+3m2fSjb/olt37+2X13bZ63tD9b2tWr7MbV9hNr+N23flguU7ZPR9ndo+xK0/fTZPvBs/3K27zbbL5rtc8z252X7yrL9UNk+nmz/SbZvItvvj+1Tx/ZXY/uCsf2s2D5MbP8gtu8N26+F7TPC9sdg+zqw/QjYNvq2/bttW75I2TbRtr2xbctr28naNqi2fadtO2nbJdo2f7Y9nW2rZtuB2TZWtv2SbRtk293YNi22vYhti2GvV20bAls/39Z9t/XKbT1rW4fZ1sO19VJtPU1bb9HW41uqbD0vW+/J1gOy9WJsPRFbb8LWI7DP1e1zZvvc1T6HtM/l7HMq+9zGPsew9/XtfW5739feB7X3Be19MnvfyN5HsfcV7P9s+7/T/g+z/0vsdXrm9j/9PlvP2KY2vh1T4mnB50+cb+vl2nqqtt6mrcdo6/XZem623petB2XrBdl6MrbeiK1HYesV2Ofs9rmzfQ5rn0va53T2uZV9jmOfa9j7/Pa+t70PbO+L2vuE9r5ZgWqmmiv7v9v+D7X/y+z/FFv3vZVq7dt1ynR8Xy/xtcGyno1mLl7Y13m5Jn9yXvL3Y4mvua7TMxLLo0fi50DVpmCuY75ezz8aCMdyfTtPHvtDub6d7z8ezz+SnH92eub/r3WQbepTuWP+zrEkr9fvupz7d+z8vMT3Gb5dL5McRzruR7qd072c/n07V0vT/JPLLcex7PwpxpS8/jzXbZU8P9XX5Lzc5yWvq4Yvrffh4F+NzelP3jfqui7vXgZ/Nq+c/+e8/snb1Lmsnbfpvy5TueO8TNd5WY7zclznZVfuOkb7O1XguJz7MZjlOi95P7FpQOWOebR1zK9d4vvk8kvnc3e6njNsqp/C77wum6pV7lgeyWXjd5yWXObJ26C68/Ku83Id52VV7nw9NRI/ZzmuxzmvpCPbdfnk65U6ia85jt9J/n7dFNef47r+ndwpTnMvl9wUl89NcXm7j7ZIfF8zkd2HQo75/dljxPlaJvl9Hd+uzwfJ303z47kwac1KYXU+vySv314TNkh8P3vOjFnxgdP7zouXzZ0zdcb03iVlU+I+1+R88DnvmO4Xqc4F4Bxoqnn4Hb+farIbJPkiKaty59/rkTg9UIWpOBoIJK87+YDIdjl9ruvPdl0+mvi5hmNcya9V2UCworgkWBEqqSiJlJSXh8tK6rnm7/PtuOPZckq+aIa/KI7+XS+K0/RiLJycf0565p/yRXGqJ5zkfbhf5Y5l2a9yZ1PyMv0dl+nvuIxNf/XC2f1H26a+rvOcj6V+rvOcT1bJ67Un4Hzfju+T9/s0/0GP/pN/0JN/eJJPyPbkXJD4fvqMOVMr5vedPnNufG68fMTc0mlTy/rNnV62/Yl62jSfa3K/6M5w/Zzp+tn9nJyVYj7uyfl7GY4x/Lc/VzdO/PxPP1f/H5osVbwPFAIA",
3575
- "debug_symbols": "7ZfbjuIwDIbfJde9iB3bSXiV1WhUoDOqVBVUYKUV4t03QYQAm4LQzu7MSL2p6vR3Yn9Oc9irZTPfvb+2/dtqo2Y/9qpbLeptu+qDtVdAx7bNuu6judnWw1bNkJyvVNMvwyszHSr11naNmgHYQ/WnGkknNQqe1c4VxEZ7PokNiLsvBvZMJ3V4v5CjpVIkgJIiAeKs9lDq3YhJnRPoK/VLpYAnNGNoZEIzhsaW0aDJaPgBGgJJIAl1VgsfR3D/fARfGgGMy4lfQOUSUxDLNqnFusyJi/UVg6m+FuBhfcHm+hr9oL4g7HIo9u/qi3piM8oGJjajbHBiM8rGfHU2n7efIE1sRtnwR7Dx+szGGfuAjU2znkwmA4THcOQDwnGUS+U83Q8HvDfn39B7vtrIS/Ctz/Qd3u77aL97Au5/J4Bay/kYqxHM/QRChqlvQHcxgfThJVjzoe269v316oqm44OKU50NnLpjK7fTkeR5F/u8i3vexT/pEiw4XlaLjmTTciVIN0iD+bMe2nreNZFl/LrrFwltMLe/1ulLgr8eVotmuRuaWIZcgbhHhYWRMB6Q4yGQoWLJscUmhApD0yGM/Bs=",
3388
+ "bytecode": "H4sIAAAAAAAA/+XdB3RTdf/H8bRpCwUKFARlKAVUNiRN0ibsvfcGFx2poAiyFJx17703Ttx7T9yKW3EvVNyTveH/+T4kD5dL9Jz/0xt93ue557xP2yS9ef1uRtPkjgzf9inf7/Otytz+fYbyJ77aSQWu05Jfnd9np7hczRSn5aU4rU6K0/JTnNZQ9XSd1izF5QpSnNY8xWktUpzWKsVprVV112ltEhbnlJH4mjw9FCgKh+PFhfFgKFgSKIyVRiOBcKS0KBqMBiPRSHlhNBSKR8PR4lhprDgQC4ZD8WBFJBaqCGyftmbumFegSlNhWTqd2/5zZ8h9gtnqqSyH1ZbDVsdtsdVxGyS/35a4TPL37IbKUJnK73ecnpgyXcsgULUp2MrD5Znl987lvM/afAt86b3PZntmLyxNpzPHA2ckWlJRWBIPpNNZ7T93ht0npHps2e2VfAzl+FM/zqr5d35sVdfPuaqGqpniseV3LYNA1aZgGw/nVd3v3W1Ty7vHacrbppbj9sh1fF/D8X1N122Tp59rqzqqbuK2yXLdLqmmnt6MI5TxF9dT1etwP94yvLUHW3s3r7QZ26TBmA5nnj89zn9PXv8Bz/LwiSE/TX/A8xN/wLMSP2elWC5e35AZvv/tO5zXzqw0PzC8cqaa9y4Puqo+ULwEt/WlZ8F6PWYPH1DBdpAxZ3o45vaQMfs9HHOHv2nMgapNwY4eLj8f5Am9k4/hDECcQYizEOIMQZxhiDMCcRZBnMUQZxTijEGcnSHOLhBnV4izG8TZHeLsAXH2hDh7QZy9Ic4+EGdfiLMfxNkf4hwAcQ6EOAdBnIMhziEQ51CIcxjEORziHAFxjoQ4R0GcoyHOMRDnWIhzHMQ5HuKcAHFOhDgnQZyTIc79IM79Ic4DIM4DIc6DIM4pEGcJxFkKcZZBnOUQZxzirIA4D4Y4p0Kc0yDOQyDOQyHO6RDnYRDnDIhzJsR5OMQ5C+KcDXHOgTjnQpzzIM4jIM4jIc75EOcCiPMoiPNoiPMYiPNYiPM4iPN4iLMS4jwB4jwR4jwJ4jwZ4jwF4jwV4jwN4jwd4jwD4jwT4jwL4jwb4jwH4jwX4jwP4jwf4rwA4rwQ4rwI4rwY4rwE4rwU4rwM4rwc4rwC4rwS4rwK4rwa4rwG4rwW4rwO4lwIcV4Pcd4Acd4Icd4Ecd4Mcd4CcS6COG+FOG+DOG+HOO+AOO+EOO+COO+GOO+BOO+FOO+DOO+HOB+AOB+EOB+COB+GOB+BOB+FOB+DOB+HOJ+AOJ+EOJ+COJ+GOJ+BOBdDnM9CnM9BnM9DnC9AnC9CnC9BnC9DnK9AnK9CnEsgztcgztchzjcgzjchzrcgzrchzncgznchzvcgzqUQ5/sQ5wcQ54cQ50cQ58cQ5ycQ56cQ52cQ5+cQ5xcQ55cQ5zKI8yuI82uI8xuIcznE+S3E+R3E+T3E+QPE+SPE+RPE+TPE+QvE+SvE+RvE+TvE+QfEuQLiXAlxroI4V0OcayDOtRDnOohzPcS5AeLcCHFugjg3Q5xbIM6tEOc2iNNmSHBmQJyZEKcf4syCOLMhzhyIsxrEWR3izIU4a0CcNSHOWhBnHsRZG+KsA3HWhTjzIc56EGd9iHM3iLMBxNkQ4twd4twD4mwEcTaGOJtAnE0hzj0hzr0gzmYQZwHE2RzibAFxtoQ494Y494E494U4W0GcrSHONhBnW4izHcTZHuLsAHF2hDg7QZwBiDMIcRZCnCGIMwxxRiDOIoizGOKMQpwxiLMzxNklTc5MlzMUKAqH48WF8WAoWBIojJVGI4FwpLQoGowGI9FIeWE0FIpHw9HiWGmsOBALhkPxYEUkFqpIzDvDwzF3/R8cczfI/bF7hnfL769um0DVpmAPD515/r/n/hio2hTs6eGYs/yM+2MvyOOmN8TZB+LsC3H2gzj7Q5wDIM6BEOcgiHMwxDkE4hwKcQ6DOIdDnCMgzpEQ5yiIczTEOQbiHAtxjoM4x0OcEyDOiRDnJIhzMsS5H8S5P8R5AMR5IMR5EMQ5BeIsgThLIc4yiLMc4oxDnBUQ58EQ51SIcxrEeQjEeSjEOR3iPAzinAFxzoQ4D4c4Z0GcsyHOORDnXIhzHsR5BMR5JMQ5H+JcAHEeBXEeDXEeA3EeC3EeB3EeD3FWQpwnQJwnQpwnQZwnQ5ynQJynQpynQZynQ5xnQJxnQpxnQZxnQ5znQJznQpznQZznQ5wXQJwXQpwXQZwXQ5yXQJyXQpyXQZyXQ5xXQJxXQpxXQZxXQ5zXQJzXQpzXQZwLIc7rIc4bIM4bIc6bIM6bIc5bIM5FEOetEOdtEOftEOcdEOedEOddEOfdEOc9EOe9EOd9EOf9EOcDEOeDEOdDEOfDEOcjEOejEOdjEOfjEOcTEOeTEOdTEOfTEOczEOdiiPNZiPM5iPN5iPMFiPNFiPMliPNliPMViPNViHMJxPkaxPk6xPkGxPkmxPkWxPk2xPkOxPkuxPkexLkU4nwf4vwA4vwQ4vwI4vwY4vwE4vwU4vwM4vwc4vwC4vwS4lwGcX4FcX4NcX4DcS6HOL+FOL+DOL+HOH+AOH+EOH+COH+GOH+BOH+FOH+DOH+HOP+AOFdAnCshzlUQ52qIcw3EuRbiXAdxroc4N0CcGyHOTRDnZohzC8S5FeLcBnH6MhnODIgzE+L0Q5xZEGc2xJkDcVaDOKtDnLkQZw2IsybEWQvizIM4a0OcdSDOuhBnPsRZD+KsD3HuBnE2gDgbQpy7Q5x7QJyNIM7GEGcTiLMpxLknxLkXxNkM4iyAOJtDnC0gzpYQ594Q5z4Q574QZyuIszXE2QbibAtxtoM420OcHSDOjhBnJ4gzAHEGIc5CiDMEcYYhzgjEWQRxFkOcUYgzBnF2hji7QJxdIc5uEGd3iLMHxNkT4uwFcfaGOPtAnH0hzn4QZ3+IcwDEORDiHARxDoY4h0CcQyHOYRDncIhzBMQ5EuIcBXGOhjjHQJxjIc5xEOd4iHMCxDkR4pwEcU6GOPeDOPeHOA+AOA+EOA+COKdAnCUQZynEWQZxlkOccYizAuI8GOKcCnFOgzgPgTgPhTinQ5yHQZwzIM6ZEOfhEOcsiHM2xDkH4pwLcc6DOI+AOI+EOOdDnAsgzqMgzqMhzmMgzmMhzuMgzuMhzkqI8wSI80SI8ySI82SI8xSI81SI8zSI83SI8wyI80yI8yyI82yI8xyI81yI8zyI83yI8wKI80KI8yKI82KI8xKI81KI8zKI83KI8wqI80qI8yqI82qI8xqI81qI8zqIcyHEeT3EeQPEeSPEeRPEeTPEeQvEuQjivBXivA3ivB3ivAPivBPivAvivBvivAfivBfivA/ivB/ifADifBDifAjifBjifATifBTifAzifBzifALifBLifArifBrifAbiXAxxPgtxPgdxPg9xvgBxvghxvgRxvgxxvgJxvgpxLoE4X4M4X4c434A434Q434I434Y434E434U434M4l0Kc70OcH0CcH0KcH6XJmelyhgJF4XC8uDAeDAVLAoWx0mgkEI6UFkWD0WAkGikvjIZC8Wg4WhwrjRUHYsFwKB6siMRCFYl5t/JwzB//TWMOVG0KfpLp3fLL9zNu5ywPl9+nkPt2todj/gwy5hwPx/w5ZMzVPBzzF5AxV/dwzF9Cxpzr4ZiXQcZcw8MxfwUZc00Px/w1ZMy1PBzzN5Ax53k45uWQMdf2cMzfQsZcx8MxfwcZc10Px/w9ZMz5Ho75B8iY63k45h8hY67v4Zh/gox5Nw/H/DNkzA08HPMvkDE39HDMv0LGvLuHY/4NMuY9PBzz75AxN/JwzH9AxtzYwzGvgIy5iYdjXgkZc1MPx7wKMuY9PRzzasiY9/JwzGsgY27m4ZjXQsZc4OGY10HG3NzDMa+HjLmFh2PeABlzSw/HvBEy5r09HPMmyJj38XDMmyFj3tfDMW/xcMx+3/Z1fJYmBtxWtVPtVQfVUXWy61FBVWjLQoVVRBWpYhVVMdVZdVFdVTfVXfVIjL2X6q36qL6qn+qvBqiBapAarIaooWqYGq5GqJFqlBqtxqixapwaryaoiWqSmqz2U/urA9SB6iA1RZWoUlWmylVcVaiD1VQ1TR2iDlXT1WFqhpqpDlez1Gw1R81V89QR6kg1Xy1QR6mj1THqWHWcOl5VqhPUieokdbI6RZ2qTlOnqzPUmeosdbY6R52rzlPnqwvUheoidbG6RF2qLlOXqyvUleoqdbW6Rl2rrlML1fXqBnWjukndrG5Ri9St6jZ1u7pD3anuUnere9S96j51v3pAPageUg+rR9Sj6jH1uHpCPameUk+rZ9Ri9ax6Tj2vXlAvqpfUy+oV9apaol5Tr6s31JvqLfW2eke9q95TS9X76gP1ofpIfaw+UZ+qz9Tn6gv1pVqmvlJfq2/UcvWt+k59r35QP6qf1M/qF/Wr+k39rv5QK9RKtUqtVmvUWrVOrVcb1Ea1SW1WW9RWtU3ZgyxDZSq/ylLZKkdVU9VVrqqhaqpaKk/VVnVUXZWv6qn6ajfVQDVUu6s9VCPVWDVRTdWeai/VTBWo5qqFaqn2VvuofVUr1Vq1UW1VO9VedVAdVScVUEFVqEIqrCKqSBWrqIqpzqqL6qq6qe6qh+qpeqneqo/qq/qp/mqAGqgGqcFqiBqqhqnhaoQaqUap0WqMGqvGqfFqgpqoJqnJaj+1vzpAHagOUlNUiSpVZapcxVWFOlhNVdPUIepQNV0dpmaomepwNUvNVnPUXDVPHaGOVPPVAnWUOlodo45Vx6njVaU6QZ2oTlInq1PUqeo0dbo6Q52pzlJnq3PUueo8db66QF2oLlIXq0vUpeoydbm6Ql2prlJXq2vUteo6tVBdr25QN6qb1M3qFrVI3apuU7erO9Sd6i51t7pH3avuU/erB9SD6iH1sHpEPaoeU4+rJ9ST6in1tHpGLVbPqufU8+oF9aJ6Sb2sXlGvqiXqNfW6ekO9qd5Sb6t31LvqPbVUva8+UB+qj9TH6hP1qfpMfa6+UF+qZeor9bX6Ri1X36rv1PfqB/Wj+kn9rH5Rv6rf1O/qD7VCrVSr1Gq1Rq1V69R6tUFtVJvUZrVFbVXblL2gyFCZyq+yVLbKUdVUdZWraqiaqpbKU7VVHVVX5at6qr7aTTVQDdXuag/VSDVWTVRTtafaSzVTBaq5aqFaqr3VPmpf1Uq1Vm1UW9VOtVcdVEfVSQVUUBWqkAqriCpSxSqqYqqz6qK6qm6qu+phr1dUL9Vb9VF9VT/VXw1QA9UgNVgNUUPVMDVcjVAj1Sg1Wo1RY9U4NV5NUBPVJDVZ2bHm7Tjudox0O/64Hdt7irJjUtvxnu1YynacYjsGsB1f145da8eFtWOu2vFM7VihdhxOO8alHT/Sjs1oxz20Ywra8frsWHh2nDk7hpsdH82OPWbH9bJjZtnxqOxYT3YcJTtGkR3/x46tU6nsmDB2vBU7lokdJ8SOwWHHt7BjR9hxGeyYB3Y8AdtXv+0H3/Yxb/tvt32j237HbZ/etr9s2xe17efZ9qFs+ye2ff/afnVtn7W2P1jb16rtx9T2EWr737R9Wy5Utk9G29+h7UvQ9tNn+8Cz/cvZvttsv2i2zzHbn5ftK8v2Q2X7eLL9J9m+iWy/P7ZPHdtfje0LxvazYvswsf2D2L43bL8Wts8I2x+D7evA9iNg2+jb9u+2bfliZdtE2/bGti2vbSdr26Da9p227aRtl2jb/Nn2dLatmm0HZttY2fZLtm2QbXdj27TY9iK2LYa9XrVtCGz9fFv33dYrt/WsbR1mWw/X1ku19TRtvUVbj2+ZsvW8bL0nWw/I1oux9URsvQlbj8A+V7fPme1zV/sc0j6Xs8+p7HMb+xzD3te397ntfV97H9TeF7T3yex9I3sfxd5XsP+z7f9O+z/M/i+x1+mZ2//0+2w9Y5va+nZMiacFnz9xvq2Xa+up2nqbth6jrddn67nZel+2HpStF2Trydh6I7Yeha1XYJ+z2+fO9jmsfS5pn9PZ51b2OY59rmHv89v73vY+sL0vau8T2vtmBaq5aqHs/277P9T+L7P/U2zd99aqjW/XKdPxff3E1wbLezWatWRRP+flmv7JecnfjyW+5rpOz0gsj56JnwNVm4K5jvl6Pf9oIBzL9e08eewP5fp2vv94PP9Icv7Z6Zn/v9ZBtqlv5Y75O8eSvF6/63Lu37Hz8xLfZ/h2vUxyHOm4H+l2Tvdy+vftXC1N808utxzHsvOnGFPy+vNct1Xy/FRfk/Nyn5e8rhq+tN6Hg381Nqc/ed+o67q8exn82bxy/p/z+idvU+eydt6m/7pM5Y7zMl3nZTnOy3Gdl1256xjt71SB43Lux2CW67zk/cSmgZU75tHOMb/2ie+Tyy+dz93pes6wqX4Kv/O6bKpWuWN5JJeN33Facpknb4Pqzsu7zst1nJdVufP11Ej8nOW4Hue8ko5s1+WTr1fqJL7mOH4n+ft1U1x/juv6d3KnOM29XHJTXD43xeXtPtoy8X3NRHYfCjnm92ePEedrmeT3dXy7Ph8kfzfNj+fCpDUrhdX5/JK8fntN2CDx/Zy5M2fHB83oNz9eNm/utJkz+pSUTY37XJPzwee8Y7pfpDoXgHOgqebhd/x+qslukOSLpKzKnX+vZ+L0QBWm4mggkLzu5AMi2+X0ua4/23X5aOLnGo5xJb9WZQPBiuKSYEWopKIkUlJeHi4rqeeav8+3445ny6lJ4nv4i+Lo3/WiOE0vxsLJ+eekZ/4pXxSnesJJ3of7V+5Ylv0rdzYlLzPAcZkBjsvY9FcvnN1/tG3q5zrP+Vjq7zrP+WSVvF57As737fg+eb9P8x/06D/5Bz35hyf5hGxPzgWJ72fMnDutYkG/GbPmxefFy0fOK50+raz/vBll25+op0/3uSb3i+4M18+Zrp/dz8lZKebjnpy/l+EYw3/7c3XjxM//9HP1/wEZa+J7IxQCAA==",
3389
+ "debug_symbols": "7ZffiuowEMbfJde9yExmMomvcliWqt2lUKpUPXAQ3/0kYsy6myoi+w96I530S/L5+9Im3atlM9+9Prf9y2qjZn/2qlst6m276kO1V8DHts267mO52dbDVs2QnK9U0y/DJTMdKvXSdo2aAcih+qhG0kmNFs9q5wpioz2fxAasuy4G9kwndbh+I0ehkhNAm5wAcVZ7KI1urEmDE+gL9VOlwE5oxtDIhGYMjSujQZPR8A00BDaBJNRZbfk4g//sGVCXZhCT8nKQ4+ISUbDCkiBZcZkSF9O1BlO6AnAzXZCcrtE30gXLLluRx9JFmMiMkMGJzAgZM5EZIUM/m8z37SLIE5kRMvZxMl6fyTgjN8hIWu9kMhcgPJqRh804yjE5T9fNgPfm/Ph5zxcbdwm8+Eze4Yd93v1u+/5r7aPW9nxk1Qjmuv3w/9LYgO7N0tGHp1DNh7br2tfni88xHX+o+PCzgdNwLPb9QiR7fxe5v4u7v4u/s0uo4PhhWuxIkl5TFukd0lD+rYe2nndNZBnv7vpFQhvK7b91upPgr4fVolnuhibGkBOIO3Z4IRLG43Y8DDNUbLO32IRQYWg6hJn/Aw==",
3576
3390
  "brillig_names": [
3577
3391
  "store_in_execution_cache_oracle_wrapper",
3578
3392
  "notify_enqueued_public_function_call_wrapper"
3579
3393
  ],
3580
- "verification_key": "AAAAAAAQAAAAAAAAAAAAFAAAAAAAAAAQAAAAAAADKLEBAAAAAAAAAAEAAAACAAAAAwAAAAQAAAAFAAAABgAAAAcAAAAIAAAACQAAAAoAAAALAAAADAAAAA0AAAAOAAAADwAAAAAAAAAAAAAADvm3BEg2KAfUbTMvT6xAaBKw1gGESPXpBgcD0B7JHB4hHasKmP183k4WNavRAsViANnEgIGKlUrAuwMKrtZzCBe49UUrSXt+tgjV2hi8NFqTzyuoR2w/gmEdUqxJik0JIsbdXYt/PSqc1WDh9EFn8V1FiWWmPu+t5gT+I+N6Ub8kEGMrL0LV2mYOo6+XfJ5qva83S9Xb4PodoRG8HDYyjBBxA9iu4XK0zsNagdiv/tBdhfr77kanu5lnJoEndbF0IBmnSkVH7RTy798QwqX6IWkmX0cKxsMVXDvtQDV1hNUX+EhUdXE1+a708Ug1Z8SHi0iCGSBsgdfHmqAI6y1VSi20iWEJLvoVrCCoj7xIfj15LSWG8esfH8DKuyRZH8H0Cr2CsGXSnrX4JmYXsOVvLG9fXXVn2NOQCwoj3rw2q4EfjEvhGQkM7d03rICuAGHTtCdceYoLn4nSa+K0ZEWc9RqNakWgM1hoUqVh+WPX8+f67so274FFXiT9Rq039lvDIuSmLVifXcWOAD4X0sKeZqqcjXq3WBuYEO2nPlPhfd8OP4PTyf+mJHwLpRXOLm9SrLCVbfb6d5ltuCSwof5icCmMMxH8kXD5LelAsEKquZDVPGo7JjOc2mtz35IIMUFZB7BfQIphKEclkBa5IErkvzdTfrGWsFwdmPpRAWqbrLsVg9eXZpUv1AmXOVQjcHMPjvYRxyRGkWIJEObc4kX3qy1i+Ledwsrx975JXtByFs703NdSxWwOQiflh0bLznZREGTk4Y/v7shGBH2iIMWWxOgT/CJaFJKRmKJvPI+KF/IKo5+TwV9U2eDrxZ35C+PXLvS4UQix6kxl8753VjSdnQCmHerHazcMpPQvc6Zly3Wp69xYzUvfivfn/P+jbVtxLll4nw2duz8VreU4S3hJDbHYM3nHO+QRI96/yIyfyNYrcq3BN0OMoNM3FEWlepaQ5kT1hLr6RUEkzwGtW+CxOQEZ4kHuu+v/XH1/INxsWtG2r3jcIG1/d4U/Bf3n69NyAv81eWr89ilQcB5sAM+P/+rmh4+CPDnlNMHi4kYqKTcPfntI+NNMrL3f/j1rkr82nU25+sRHjyZ+bCM9BAVWsCjZNG8jihsTTBeAO4/UmLEwCqzGKlx2Zs1KKhS6AkboKAdGZAv05LONeSmWPv/c5y6nyjZ53UMrnKn9tn5C7DEEVeTqJ/aRju3vBYmoLyb+BqjR0R9IWr5cxdc5fzeA/htbytapZu3cpmBpZ0shI/F8wpzsxoVCApeEjnhZWvsZDA+A5foWg5DCVUmhUf0EeRfwBGl95g8nwLPamY/1YrAXpovPIYNCvqd7u6mx/WWzI+DNy9Hzi56eANZ0hUa4ZwfNBvny0Z0u6xUfs41uVzoF4kIETTZ4TsIzmzaNaQFbI4TLnOWG5CcDviwgmDuxhZ9Q7/KWukBVIrwxyJtbxP4UDOiT4pWIlWdzlIhVKFfAj829hp18QoEk6Pmc7TcgLBkIPgsu2mCOypfvNlZlAHTae/SN0sd46NSQYQcRAyh8JcZhXg+MJw3xVeseJqMPiDd6R7XWAXm5/1nVMmbruKohjbRuu7pXASFsBBqAfFfxgC6hkoVhZT3oPaVS8o0+kgw5tunzoICXieswxnVbQZPWfWec6iRogyIlJSXK5OOCLcRoXmPzLMJnMAmVw3rO0Q+mNwibwC8UbLrQ+lv1MhEpRF0xyxSxIXRdqzk32YJDEGC8hNKimaQI2xW9Nbf0xC1D5MX+0wGKXN7x7R+A0G4TMyjsA9/AQ4TvWgeg88GxD/3Z9wf1B1uitmzL/e0iHmek6JqyxwSffKMe6iUKw3kX8oqs9gdqJo5fFuh06h4eq2vvhHrFBrwcF/rKNLvg8ArcicSNdbVxY29bvrSoBvb0WWICMBtq5OsOu+rdIDNABm8oE1dI8RljHD/gf6nXAANOPidFTvmStL+EuXuqdHEuJXg1Ud9QwATsfNH03Ys7ZKZvKsSXm2XlZWjFoxsU7Rj3bPDO7MtHmN50GuibZOglj4RHfBtiVlpVm6e7OIMuLSmftoZ40BULzFsW3IJSNT1D+nDpkjnBwcZ+JxoO6sUV06xaGZq7dJM6TvyYxZsoFO3nzSfa7QDDPBKGC8SwRi041tS6Hkdjp07NsRyh80aWgMJw5VFRU0RZL1kYj6dlEts56JKCazJhDuCCUeAF/OkXwNXcoBlHfFL2B1MythIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACJa4sB/dZbHRLKCd5QUk6DlAMioMUIOlCVFTS/76r4xErV116wzukneS7oBNNX3LCeaxKaxMPMvWjU/HiHHn+eADENyb3W2/aDeIs4ODfq2vMegX/lalrKJQkxfczZw2WL5tuC04sAZaN5cMkgqp9HQoJ1xeOyTuteFj5bmTwtI0dWKphxkrVIgQ9ecSAIhnlW6GXUa3+bDYyTT+2wtoJiS18GKk8Pa5YgJ+q7saoanj0s7xh8Z1ucGk1m79H5/kH"
3394
+ "verification_key": "AAAAAAAQAAAAAAAAAAAAFAAAAAAAAAAQAAAAAAADKLEBAAAAAAAAAAEAAAACAAAAAwAAAAQAAAAFAAAABgAAAAcAAAAIAAAACQAAAAoAAAALAAAADAAAAA0AAAAOAAAADwAAAAAAAAAAAAAAJh7dsPvffmpu9ROyqj5T/wGuAhr+eXH7Z9Y+rq8joRYoMy3OeLmiVdIHkSQUyO4/8F9aummTfLawPJyNp/nCMwR+sO0Yi78tcwi6mctUvI6fs3XrxtsXcWHRuKcu0kK3AZTVaEcRJid7qq3davy4WHdWCK+rgUElk42aj7V+FFAGvinUX2yRldJKCsLdNOTc2Ra/s1tZKj6Ovw4HBNw/yyknG4fCjj9lBuJHR0IqQhKtl8iKDE2PE8/tPhr/+qJ6Djpqr9d+dLsE/PNTJ0xfKwVMS3b9qvoWQjYKkSfGx/8h3GmZSPnSQ/RpCtbTqaptLdyaTMLO8adk5N96MfapFiAynkdY+jmqfgBRaa466RlN/olc3pcjw27oMqcLF7G7ED8doGhoskg/4nd9HoP5fTanNFcURudekLSn31Mm/mothY96KBmENl9866cgdK9W2HNdicGCiUjAsPTgtpG1FigQ0Fz9LIfhEdoVMzvnR8uCh1lkLIRJS4eWunZMA2EBIuSmLVifXcWOAD4X0sKeZqqcjXq3WBuYEO2nPlPhfd8OP4PTyf+mJHwLpRXOLm9SrLCVbfb6d5ltuCSwof5icCmMMxH8kXD5LelAsEKquZDVPGo7JjOc2mtz35IIMUFZB7BfQIphKEclkBa5IErkvzdTfrGWsFwdmPpRAWqbrLsbT9vHPvgyCPHIuwlg1yliWilWolRa3Ef7N2h3c0y/biQL/4K/f5M//kZCH7koNmXFGKBnhQ7e3PtFPqPApgFZAe7rkX5KtImbOL/BiKd/PvSmdwpPvbbnSYvX/gGlOY4Q1fG441JoUAPoG9hubACZUJ3jrVwWYL2TlWMyQa5OKQCmHerHazcMpPQvc6Zly3Wp69xYzUvfivfn/P+jbVtxLll4nw2duz8VreU4S3hJDbHYM3nHO+QRI96/yIyfyNYrcq3BN0OMoNM3FEWlepaQ5kT1hLr6RUEkzwGtW+CxOQEZ4kHuu+v/XH1/INxsWtG2r3jcIG1/d4U/Bf3n69NyAv81eWr89ilQcB5sAM+P/+rmh4+CPDnlNMHi4kYqKTcPfntI+NNMrL3f/j1rkr82nU25+sRHjyZ+bCM9BAVWsCyIpmgYkr/QNboIl+qFWIH09iNrYeK0sSzHOqVHySzgFvnvbC8nG8ZS6NE2sORUUgYrTccj3uF2/wFnOTAr+9MCBZRRI373CD627kH9pDcXpfm+BWq6pe7GL46trxKsRCXCYWy/DYBVZGZrV8Hdtkk5thbgnQWeQ7D83sRHHxUtBuQS8GrCepyciy5VTFZ6DfYmJGlM+F5BBMyHSd0xjp0otF8AkOR2uWUKLrPx/wR3h0Axk4z39oyOqNp2dan4MRxuRLkaBuCbM2hZntR8dvHFHtbCmCfvsVoYlZh2yH0nDeqScJrYa4XzqolBZFm2e2W1PBhl4Wh0z7oqI4kunhAKfHlhvWfJap0MaGqHgOf/C1i7ic3WDpy7bhP8fxj22RoWm5QvwKYEebTgAZp0fsLys+2MVrZBKz6ro/++tDLAIoqK7L1Jd2DYeRGMh2M6o0Eh2vTzn3U0zfCmE6S77rkkE/0jbzbrMqwGN3/A/g/oaOiltlsMK+x9lk21bQJjgwQvZ8iEmTDrruqtKU/1HBLGBBlToD1iqhrHBW3EJ77HEsfZ2DXYMxwbh9B4z86Q9Ktgghq/VolY1spxM05BeZMobNGvpSxegoprLbI/7hRxvnJ+OwPgU3u/JgnyuxbiaxG8ZHEnSGrdA7td2cUBBn0tz6WsFu4Q0r8wnvCdabx7K7QejssyZXyweMVHIpwncJfu2TQkSgTbpFVJbxvWfY4j40un7JYaAV13pmXdyBTz+hf/ayJwgKLsfgS/BUpX4QrcicSNdbVxY29bvrSoBvb0WWICMBtq5OsOu+rdIDNABm8oE1dI8RljHD/gf6nXAANOPidFTvmStL+EuXuqdHEuJXg1Ud9QwATsfNH03Ys7ZKZvKsSXm2XlZWjFoxsU7Rj3bPDO7MtHmN50GuibZOglj4RHfBtiVlpVm6e7OIMuLSmftoZ40BULzFsW3IJSNT1D+nDpkjnBwcZ+JxoO6sUV06xaGZq7dJM6TvyYxZsoFO3nzSfa7QDDPBKGC8SwRi041tS6Hkdjp07NsRyh80aWgMJw5VFRU0RZL1kYj6dlEts56JKCazJhDuCCUeAF/OkXwNXcoBlHfFL2B1MythIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACMFfLyuFRYM6TAPZBKeAJA/A4UmP/sUPzFFaKrk+pJo4bykxDn9qUvCzHB0dPKIoGL0+VBJPXad8ESPPcWtLcZQDENyb3W2/aDeIs4ODfq2vMegX/lalrKJQkxfczZw2WL5tuC04sAZaN5cMkgqp9HQoJ1xeOyTuteFj5bmTwtI0dWKphxkrVIgQ9ecSAIhnlW6GXUa3+bDYyTT+2wtoJiS18GKk8Pa5YgJ+q7saoanj0s7xh8Z1ucGk1m79H5/kH"
3395
+ },
3396
+ {
3397
+ "name": "process_log",
3398
+ "is_unconstrained": true,
3399
+ "custom_attributes": [],
3400
+ "abi": {
3401
+ "parameters": [
3402
+ {
3403
+ "name": "_log_ciphertext",
3404
+ "type": {
3405
+ "kind": "struct",
3406
+ "path": "std::collections::bounded_vec::BoundedVec",
3407
+ "fields": [
3408
+ {
3409
+ "name": "storage",
3410
+ "type": {
3411
+ "kind": "array",
3412
+ "length": 18,
3413
+ "type": {
3414
+ "kind": "field"
3415
+ }
3416
+ }
3417
+ },
3418
+ {
3419
+ "name": "len",
3420
+ "type": {
3421
+ "kind": "integer",
3422
+ "sign": "unsigned",
3423
+ "width": 32
3424
+ }
3425
+ }
3426
+ ]
3427
+ },
3428
+ "visibility": "private"
3429
+ },
3430
+ {
3431
+ "name": "_tx_hash",
3432
+ "type": {
3433
+ "kind": "field"
3434
+ },
3435
+ "visibility": "private"
3436
+ },
3437
+ {
3438
+ "name": "_unique_note_hashes_in_tx",
3439
+ "type": {
3440
+ "kind": "struct",
3441
+ "path": "std::collections::bounded_vec::BoundedVec",
3442
+ "fields": [
3443
+ {
3444
+ "name": "storage",
3445
+ "type": {
3446
+ "kind": "array",
3447
+ "length": 64,
3448
+ "type": {
3449
+ "kind": "field"
3450
+ }
3451
+ }
3452
+ },
3453
+ {
3454
+ "name": "len",
3455
+ "type": {
3456
+ "kind": "integer",
3457
+ "sign": "unsigned",
3458
+ "width": 32
3459
+ }
3460
+ }
3461
+ ]
3462
+ },
3463
+ "visibility": "private"
3464
+ },
3465
+ {
3466
+ "name": "_first_nullifier_in_tx",
3467
+ "type": {
3468
+ "kind": "field"
3469
+ },
3470
+ "visibility": "private"
3471
+ },
3472
+ {
3473
+ "name": "_recipient",
3474
+ "type": {
3475
+ "kind": "struct",
3476
+ "path": "aztec::protocol_types::address::aztec_address::AztecAddress",
3477
+ "fields": [
3478
+ {
3479
+ "name": "inner",
3480
+ "type": {
3481
+ "kind": "field"
3482
+ }
3483
+ }
3484
+ ]
3485
+ },
3486
+ "visibility": "private"
3487
+ }
3488
+ ],
3489
+ "return_type": null,
3490
+ "error_types": {
3491
+ "16775516380094354375": {
3492
+ "error_kind": "fmtstring",
3493
+ "length": 40,
3494
+ "item_types": []
3495
+ },
3496
+ "17843811134343075018": {
3497
+ "error_kind": "string",
3498
+ "string": "Stack too deep"
3499
+ }
3500
+ }
3501
+ },
3502
+ "bytecode": "H4sIAAAAAAAA/+Wc6XLbNhDHKZu0TcmyZPmK3Svp3bRpKYnU0dNt0/u+lM+KYz8HHyPta7Rf2qer/jFXWsHojDteTPxPMMOhpYV2f1wuARBYuBadl8nsqFV/x9V5vTrj+060XKTucXXOrla6hrqyUIw1AsYVAsZVAsaYgDEhYFwjYFwnYNwgYEwJGOsEjA0Cxk0CxiYB4xYBY4uAsU3AuB2AMQRnh4Rzx5BTj+1D8e5G1z9G9wgY9wkYDwgYbxAwHhIwHhEwPkPA+CwB43MEjM8TML5AwHiTgPEWAeOLBIwvETC+TMD4CgHjqwSMrxEwvk7A+AYB420CxjcJGN8iYLxDwPg2AeM7BIwZAWOXgLFHwNgnYMwJGAsCxgEB45CAcUTAOCZgfJeA8T0CxvcJGD8gYPyQgPEjAsZjAsaPCRg/IWD8lIDxLgHjZwSMnxMwfkHA+CUB41cEjF8TMH5DwPgtAeN3BIzfEzD+QMD4IwHjTwSMPxMw/hKAMQTnryScv5FwTgJxRvcc6JXZgY1b2BiFjUfY2IONM9iYgo0f2FiBjQvYGIDEeyS2I3G8PTuQ+IykYiTsIgkWSaZI4kSSJJIQkeSHJDokqSEJDElWSGJCktDN2XFrdiCJBEkaSIJAkgEW8bFIjkVoLPJiERWLlFgExCIbFrGwSISrwiIHFhEwSY9JcEwyYxIXk6SYhMQkHybRMEmFSSBMsmASQyYJ8JKLl0i8pOElCC8ZGMRjkIxBKAZ5GERhkIJBADpZdGLoJNAIo5FDI4KHFA8AgmsS/XeRIPmnOqfVeUXJDTfRdVPHrqX+UTa+n3quz5C/n1Y6N4LoL4aiPw3Dn8lG27vlQr++FrG7Wp0n5cKXk3KZSeo8VHUeOnXkesLc7zwP669ur+n4KFLXIrbrYWz3a449fV+0TOzXo5Cxeb4pWdsTHtc/0nY0pU654Kk5sri8eB0iS5RM7i/s3Fb13NjacGTCgiLx21S+kXKvksk9jZVOu3gtRmHjNc8eX7zm3ScxXmNHFpcXr+P/xquOLTdek2hRpC0V2ZqS/e7I1pXsj3Jhu1Acg+rvsG3yeR+snz3rPmzHw69toayXC39IDK6q7xLlv0f+0fUdWapkcblsp159jpUdrUs4Eqd+Xn1uVec19Rv5fdtjf82xv8Tt+c71S+qpn3rqI9buVH83qgMx9Jf8Jrr47OI4rj5nVyrDwtdO2ukfdH1toaH+U9HfCKK/l4n+zTD8836qGeb+DkT/Vhj+efy0wvD3RH87DP+Z6N8Owz9/j+kE0V/Mx+U7Yfjn8b8bxv9z/r0w/HP9+2H45/f3IIz+sYw7bkSL4o4zD9X3dv1/b3zZcabYrzusocaZhw6P6x89zoTsyMPa9sjcZ/TIY+fIY8ena9NQ14Ghrm1DXQ1DXfuGutqGuuqGuvYMdbUMdaWGuizvo6W/LGN111CXZaxuGeq6ru2E5fNo6fvrGqsbhrosY8IyVi39tWOoy7KNthwDNA11WfYdls/QdY2vp6H9CtEPhV0PzDLfPFhkp987D2aoPxNfS6zquW9tU64vcer/6fh5M4ife1N5J5M2SPvCN1dlabvm2Isi//us2G96eIS77pFd5R/Mno5OTsf383wwzIuifzKsOfqF1f1OzzvrPkfX970b++bVDH098q3xtJRfUWIl23JkiZIJo17j8c07WvJfxv/aftsjc8del72XnWg51vTz2IgWz3Bc2l/7cHTeljxirPQn0fIabuTYT5z6f1ef3bbuqs/I2XDaPetPz6bF9MGD/GTacfRrH8JP/wJJ9PoyCV0AAA==",
3503
+ "debug_symbols": "tZbRCoMgGIXfxWsv0qV/26uMMawsBLGwGozo3acjttiuz0105NfPCz84K2ttvfR3F7phYpfryvzQmNkNIaV146yOznvX34/LrMgfofR7wzSakPM0mzizizgJUpzZ0OZ/KVU6pHPeplScN/43T3IfJvpMlrTdeAIQGlChAWcwQBdogEADJBpwQgNKNEChAWiTNdpkjTZZo00mtMmENpnQJhPaZEKbTGiTCW0yoU0mqMlbSg8Tnam93RtOt4TmUHjm52h/us8Yh8a2S7S5BX0LUH6NpeRK5mtne0VVcFGpBEmgFw==",
3504
+ "brillig_names": [
3505
+ "process_log"
3506
+ ]
3507
+ },
3508
+ {
3509
+ "name": "sync_notes",
3510
+ "is_unconstrained": true,
3511
+ "custom_attributes": [],
3512
+ "abi": {
3513
+ "parameters": [],
3514
+ "return_type": null,
3515
+ "error_types": {
3516
+ "2920182694213909827": {
3517
+ "error_kind": "string",
3518
+ "string": "attempt to subtract with overflow"
3519
+ },
3520
+ "3305101268118424981": {
3521
+ "error_kind": "string",
3522
+ "string": "Attempted to delete past the length of a CapsuleArray"
3523
+ },
3524
+ "3367683922240523006": {
3525
+ "error_kind": "fmtstring",
3526
+ "length": 58,
3527
+ "item_types": [
3528
+ {
3529
+ "kind": "field"
3530
+ }
3531
+ ]
3532
+ },
3533
+ "5019202896831570965": {
3534
+ "error_kind": "string",
3535
+ "string": "attempt to add with overflow"
3536
+ },
3537
+ "5727012404371710682": {
3538
+ "error_kind": "string",
3539
+ "string": "push out of bounds"
3540
+ },
3541
+ "6753155520859132764": {
3542
+ "error_kind": "string",
3543
+ "string": "Failed to deliver note"
3544
+ },
3545
+ "8830323656616886390": {
3546
+ "error_kind": "string",
3547
+ "string": "Got a public log emitted by a different contract"
3548
+ },
3549
+ "13649294680379557736": {
3550
+ "error_kind": "string",
3551
+ "string": "extend_from_bounded_vec out of bounds"
3552
+ },
3553
+ "14657895983200220173": {
3554
+ "error_kind": "string",
3555
+ "string": "Attempted to read past the length of a CapsuleArray"
3556
+ },
3557
+ "16761564377371454734": {
3558
+ "error_kind": "string",
3559
+ "string": "Array index out of bounds"
3560
+ },
3561
+ "16775516380094354375": {
3562
+ "error_kind": "fmtstring",
3563
+ "length": 40,
3564
+ "item_types": []
3565
+ },
3566
+ "16954218183513903507": {
3567
+ "error_kind": "string",
3568
+ "string": "Attempted to read past end of BoundedVec"
3569
+ },
3570
+ "17843811134343075018": {
3571
+ "error_kind": "string",
3572
+ "string": "Stack too deep"
3573
+ }
3574
+ }
3575
+ },
3576
+ "bytecode": "H4sIAAAAAAAA/+1dXYhcyXWunu6eme6Z1rT+tV7J6/WPdjde2/03f5Jszb9GWv2sd9eGQCD0dLcUO+uVWWkNBkMmJBDyYkhiHPKSvDgEB4c4TmJsMAkO+SEQ/BQ2GILJQ1jIQyA4G5I8xLGudE/3N1+fW3175tRMa3cKhum+deo7p06dc+pU3bq3M65XMvH/nNtDEZBnCo/+x//cGNRnH/wtxd8reyvVAvG1xF+oNBYLSv8M5a8XYsxMGPyK4AfSf2Uixrm63cPHvgjfyQd/U/D5mOvZR6j+y/iF7P9xT5/Fdla3XbfY8G20BXttO0i/aoK/Hga/IfgbYfDrgn8lDH5F8DfD4FcjX4n85MuTj/CmH/wdibHvdO6vvHq39Ys33/jcVud1sTyRAi0Rr2ddf4lQj/VQV+++dv/1Zuv+crv9eufePUYYU5BdAmoRUH+h+ZnXrraT5BkS7dOd1+995u5rjJZLiSbxIA/00d9S/L2ypzLfjTfjQfBr3Xg+EQR/bk7wJ8PopzvfFcLIf1vwi2Hwq4I/FQa/LfjTYfAbgl8Kg9+1/yNB8Ge79j8TRv6ufZbD4HcE/2gY/FnBPxYEf74bH46HkX9e8E+Ekb9WivFOul6ROUN4n4LrdnN6ta3NzDwLIv8iyWqdY2SIn8jD+pF5X3R3WpG1rNRxDDit8Dmt8NGwjhpinTDEmjDEKoxoH6cMsUqGWGVDrOOGWOOGWJa6t/ShyRHFKhpiWdqEpe4t7WvaEMvSty1tYsYQyzJGHzPEGtX5UdbZYXOr3j7nmTD4dZ8usE/CX3KlI0CfSfgvWFwnvIqEZdy3qq9vKL9vnFEHe7UZwSoodSHG9JSn38w/iV7Ll4X+CQ8+0s+4fht+gnTxnjC6qPnG7QngKfyjeUNidLuz9cad63fvOCpZ0oPo7SzRyR7tmOvX95kELEffz9K1LOBhieSWGH7vi6+1bt6937nnBpSwmxrzW4J/Mgx+Wwu+hvgVzVEN8RtacLfDn2tJsEZHzdDYh3G86mLayUD4F12/U4aYDN5D8rB+eFPgSUXWslLHPvSkwudJhY+GddIQa9wQ65Qh1lFDrLIh1rQhVmlE+3jcEGtU7atoiHXCEOu0IZalfVnq64whlqV9WfpQwRDL0iYs46okwgWlzjBX6OYpnEBHRerOAW+eo98L9HIoJaNg8VEB7FPU169M9nCZjuXBvOkc4LOeMN8QPZ6FeutDY6gPY/zuwvKc26lT7tN7E3Ql9dp/weI64VV0/XoPkR9qfUP52V/QLlEHSVjnhsQqKHUhxvSsp9/Iv+SRVevHk6QTLR5p+bfQv9cjF9LPKLylrejwKagLscmg6RB9UfjvZpNB9HaG6OSg1pjrt8FzCViOvp+ha0mbDL71ZBp/FjmjUlawZMMk8KbQbW0+y5jhNxqB43xbiwnOhZ1HDPVTZ380lL27Z/O+MLJ3dfN0mLHt7pm9Pwz+guB/IAx+96DOB4PgN7rj+6Ew49s9CHQ+CP58Vz/PBMGvd/XzrOsVI910D3k9F0Y33UNSPxMEf7Yblz9srptKF/t5kN0QvzuuHwljN9249lHAN4wLLcH/WBj87gHNShj8blyouj3bTp0vCHYtyNjOdWN+PYzt1AS/EUb33bgzu3fd9wkv2HNBdDPbzTXnw+imKfgLYfC7MXnRXve1aG/vxzHWDOhe+sE3iXNB+lhvyrrmgusvUncRePP+0yWgH3b/Sfo07P4Trq1QNsTMu946FPWahXqk///4fzQuP4k/Rwf1ZGw+ARg8NkuEL98reyqNqvR32fUXqVsB3jw2q0A/7NgsxZ+HHZvLUIeyISaODer1MtQj/VSmJ8vXJnsyM79PuH75PkHfn1X4lYif1EdFxngZrhvu/1YyxE/6hteQf9GFtLneXuAyycP6EVuL9nPkQOurd5vt1ebn773xameMVInDhPAzBCc0SItlBkRCem7Pw/4epR0XUWWeZJb7+VFoOBl/LiXwiUrB9ffZcpmc1mSEf9H1u1oIk7lM8rB+ODwtKbKWlTrcumQz9JnmIdYh1kFhSdqgTU8+f7ns4aNNlSXAk7rnqS6ryCd1OU/dBU/dRaVfWkoo29pS93EFM4qrv5zpXU/SzRJck61/LT1LmmuSsNYIC9svE9bKAKwNwsL2nA6tDsBaJyxsv0pYax6s6PMH3E4sbL9GWOsDsCqEhe3XCWtjANYCYWH7DcK6MgDr/YSF7a8Q1uYArI8RFrbfJKyrA7DmCQvbXyWsawOwniYsbH+NsF4YgPVRwsL2LxDW9QFYZwkL20vbkoIlcUtyphtw/SByJuFfJFmN5enmTDdcv15RP5wz3VRkLSt1HGtuKnxuKnw0rFVDrDVDrHVDrA1DrCuGWJuGWFcNsa4ZYnGs8c2L0WfZavXNi9IO7Q3pskCjzYWIkTTvZp0+n15P0R+8xrq5nsAvSb4loJF1rm+en1HascxLHj6DZBY6LTflozQYgzmPxNyU813MTZep7qLSL85NcVy13FT0hrlpnvrzq/GHAslvPFdU8JnCJF0dwD5EJ0P8nDvYfQhtu5R1sRKEd6OaVhcrpIvlQLrwxQttT0botdx/WaHHbb87nfvX795Z+eIrzTsTQMquj+KUiO4yfV9KEGuJ6Fbou7gty4FYWFgO3lZk+qUB9FodY4gprhPtUvy9srfSvZt9JQx+99SktrTDPgl/ccs1RVdp3UZ4FQkrlNtofUP5efrD9DHNEnhjSKyCUhdiTNc9/Ub+JY+s5QRZo8JT6JNx56Np9vcyO7HZn1AP2SB6qM+ltUe5VnT9cS6EPWZJHtYPLxNziqxlpY5PkuUUPjmFj4ZVMMQ6b4hVNsSaNsQaH9E+Wo6jZR9nRrSPU4ZYpwyxzhhiHTXEOm2IVTLEsrQJS3+09CFLm7DU13FDrElDLEvdTxhiWer+hCGWpb4sY2HREMtSX6MaCy31ZRlz3g05k6VNWM7blrp/zhDL0u4tdV8zxLLUvWUfLeOEZQ5gqa8jhlj8dpu063q5flGhX1Po5RYP3iaRtrKHgrdCDPcsaj494a0Z4b+bJ4Ll+yzR8RPBqPsLCViOvs/StazTnwj2ndpPO774UxMo77hCj3h8ev2JeOAjPf5BrMyyIlMW8OXpA97Lc8Az7F5yvZYhfs7tHB9H/Iskq7HtdvfbtKNG2p6t6G5TkbWs1PFTxdoxpE2Fj4ZVMMSaMsQ6ZYh1xhDrqCHWaUOskiGWpU2UDbHGDbEsbcJSX8cNsSz1NWGIZamv84ZYlrY6bYj1bhjHE4ZYlvqynIeKhliW+hrVechSX5bx3tK+LGOOpT9a2oRlzmSp++cMsSzt3lL3NUMsS91b9tEyToxq/nXEEEv2j7THUtaIj7aGveLhg+2vpMDS1sNCrz3G4tun0h5jkb0HPB4eYp9KGw/tUZjd7FOJ3qpEx/tUOMZXE7Acfa/StaR9Kj5z9eVY+aLfNcJYir9X9li0Y8tsoxmQUfp7ZbtHczmhD78B+11/OLkTE+1MxhOPvPKjg5p8/D2v0I5RndB+FWT7o1i2NGfaAo1DK0P8RC8uoe/7daZNGyeUcYz0E2jPbyvj+uNZVuEp8spY+mKv+DO+6QLpN6CP7P8Yj/J07WuxUsoKJj/GnDb+R3Pd747t7Bv7gfZfcPmab14ROuGD503F7yN5vj62sw3HCWwbfX4a6pH+C5M9zG/EmNojwywj+yLGoqisbe+kF1lk355pOI4J/Z9ArPgmxbHLSp+f9sgsmHjPAx/9eD5Bhm/TfBDIz9T5QHjt9+Py/LwB9j/QufzUcVj4FxWdhIjD6yn1OipxWOTV4jCfvQ8Vh/8uUBz+PsUo7A+/1kAbt3UFt6y0Zx1iu73Ge01mn9/tlg9iYc6I45oUO/HeN45HDq6jzXHsFPp/hPj9p55cD+e2N8cGy5pRZM0T/c/C3PZDshu8z87PZeD4XKS6ywrfDNE6kBNpeD4SOccT6C8m9OtflHvZGUUX2rheTJAhl9Cv5xNk+NddjOtbY4NlxXHltYXQX4Jx/TcaV5TdN66XqA7HVXSk5UE85rhu0tZS7JPY/uAfUW2lfixzVF+VFXZt2KpkCB/lWVP0EzhHqmtzOs97g+b0NdAh0uNnaY/XsrFhaM+28ZkOrOP5fi/P+4XE8uUhOKZR3PkfWg+GmLe1GBFi3RkVidNaXsXrjGHzKmyfJq8Km0fPzqeNefxMbajnkX22rOlViwEbpHOsex98HmTnyEfDOj2iWEcNsaYMsU4ZYlnqq2SIVTbEOm6INT6ifSyMqFwzhliW/mg5jtOGWJY+NGmIZTmOlrZ6zBDL0r5OGGLlDbEs7X5UY45lH48YYj1jiHXSEMtSX5a5iaV9jWpeaGn3o5rLFQ2xzhhivRtyuVG1e8vc5HBOGw5rVHO5UY2FlrmcZSy0HEdLfY1q/vURQ6xRzb8mDLEsfdvShyz1ZTkPWfrQqOreMn5Z7suN6t6QpX1Z5r6jmmOO6txRN8Q6Se3wntQKYMg9K7yXannfV/CvBcIXXWk/1YF9Ev58D0rqtf+CxXXCq+j69R7i/prWN58d4DMXqIMkrKtDYhWUuhBjuunpN/IveWTV+rFhqJMxQ6wcYaW9ryr02rM5mp2805/NEb19mug2tnt6YN9I+2zOp+la1unP5mjnEfgM1rDnEbQzYvt17uGd1p80Z9fCnJuoLaadZ/i8eOiza5pefT/zmPYd4fzL93s5+1QzxCoZYk0aYo0bYs0YYhUMscqGWKcNsU4YYhUNsSzH0VJflrY6bYhlaatHDbFGNU5Y+qOl7kfVVs8bYlnahKWtWurrlCGWZYy2zAGOGWJZzh2WPjSq9vVuiF8h5qGDO89eT/3TrcL/cT/P/iH4jHXI5yDukView7G8f2B5v8Xy/Oy4Idao3s+z7OOongUZ1eclzhtijerZLEv7soyFlnIdntc7ON3XDLEs7cvyXr1lHy11P2GI9W44H3QYJw5O95Z9tHyGxjKfGFXdW56dOfSh4bDmDLEOfejgdG+5drdcI8v5s0Hv1vlWbidP2T9JerfOCtQj/X/me5h/ntvJ+wLwFizZ2wpzT71WyRA/5/S9LeFfJFlt5entbWnv/UH98N7WsiJrWal7Ej5jHfJZVvhoWCVDrElDrBlDrIIh1jFDrKOGWCdGVK5pQ6xxQ6ziiMp12hDL0u4t5bLU/RlDLMtxtNT9hCGWZR+PGGI9Y4h10hDLUl9lQ6xR9W3LuUPyCe0di5epDt+HtpbAD+miInnpKtRb5oGh3/OXof5in7FPfA53BegzCf8Fi+v4/fYrgXTn6xvKz/aD71tEHSRhrQ2JFfh3BrpjuurpN/IveWTV+rFMOtH4aGsUod/wyIX02tlyaRv291B7zz1o443nK4T/bp57EL09RXT8mySo+/UELEffn6JrWcDDov0+MZ/fv0B9SBrfstJe6NKs7cPEgXo9bVwS/vu1tl9JqVfR3aoia1mp47W95p+rCh8Nq2SINWmINWOIVTDEOmaIddQQ68SIyjVtiDVuiHXEEOsZQ6yThliW+iobYln642lDLEu7t4yFluM4YYhlOY6W8ctSX6cMsYqGWJb6svQhy3zCUl9nDLEO4+rBxVVL3T9niGVp95a6rxliWereso+WceK4Idao5qsfMcSSfDXwPmntcJ901+Vwn9TTb+S/133SvegkS1hZBcu355p2bGdc/3hK28A+1t1zXXbJekL+u9lzle81olvb7umBx241AcvR9xpdyzr/niviXUqQU/jyNbaVS8Q3KoPOcn01r/NMOsvFv50q9D+As1y/k9/ZR2z/RPxZ7ChHMi/F3yt7KvWmttfsSCf4+3S8z3oJ6Fe3e3RcsvQd+xTZ5Vfg9+qYjuVBW+DfzhPMpHHBcUP638/3ZPn2pI6Zcbp9yT0IoRddjgMd0rAMQv91kIF/V1docgn9yiVg/gXY2zfyOqZTMLV+XaR+sQwXSAah/yb0S34bMev6x49tkK9F35+FzxddMlZGwbqUAiujfOcx535Hfx+Pvyfphsdc6L/jGfOMIgP+niWPT5ZkYBr+7Uqh+Z4iQzRfyDOErbuf/+Jq8/P33ni146jk4DOGB/nOw8dDkFFwkoqIHHVPzNrnCtwOvz+ryBB1WcJPu/Nq534nodPcybEEZmNOLxzHpF1Uwsb7R3kD8nNOz6eFf9H1236IfDpH8iTN4TxfYduyUid90uZY9ueMIkNGkaHsBseDTMr+TLvefZ179+++nmRzbCtsWzj3sjzc3hGWFiujEjnaj+PP+5WHMdaY08diY/vRf/GXZcJair9X9lR6vzUq+X/e6fPBMtQj/ZsQW79L8X3Z9etLeycdy4D03O+oaOcUVtxg3lpOE3Yvov+3XPMJfVuFeqT/kUe/2lrVp981hR77LfKIfrV1b1r9rm0/+j/q+n3rAPWL/rVGdSg7xyFN98uKXFocWk6BdUnBwnzpQfLwmS90Xr95934HQxZ319HnAl3jtCJH3y8kiDpFdBfpO2+z8dSyRN8/rsinFZEDy5SHV1IRExRd/QeY4PfIBLUpB2WQMMbLe2yLy3sxLzwqx+Y17KNj2F7oND58xHZTaZehOpRh0yMDtt+fV103uqFHXn2ctCS/CvVI/xNP6NFeRb2s9J9lQPqrRBMVTffXqA7bsW0M+4psbH/Vw+fKHvlcUfhkE7CllBRcjFWoG1vbqTQyxE/kxWvIv+hC2nJvmeKzo6jwMuUFRdayUrcIn7EO+byg8NGwVg2xfPGK/WfYuKjZt+8nDEbV5gIdq/banKbXYW3uKfi8VzsJgTXj+sebY5Wmm2sePtiefzYD27HNBfrJgNm0Nif8iy6oD1R946fpVXR3XZG1rNSxnVxX+FxX+DxOWNX4s9ivFk936yfYXuhKSrtMwn/hw9d2Owdco/4MOwdovr3Xn7HR+Azr97vlg1hy+5B9xIIP2tvzbiefDUWGaI2zPt5rE/3diGkwL8e2ssWWJ/r/nuhhbsaYWs6KMmL7HFy/qvSD+d2IeUgsvgltDGNfBR9HcMQr8FqpXaI+Yykp/WbfvwV17EcvQh3b/iehDseLC6/bURfR0uwvU9y+1WzkBaq7ofRD6m4q/dDi1VWqQ9+/QXUYf25SHerjHHxGHlHJuv6xk32HNHmzfEe/eF7hnSf6e+QXYXKCWtM3vxQUXVnyThMfkb8vHykqdbk9yNpZaHUWtxqNufnG7Gy9NT9s7sBxEem1bdSw8a+2IL6b3e7h3wC9RiUHddepLg91ImMUFrKFnfLfCCR/Gv1rMQDpr0AfhhnLY64/DnFutFs///V98fN6++D8vN4eZT+vdbZac83m7XrrdqXVvN2x9PN1hT6snz868vVQhu0e/uPj5/WmhZ/z0Zm9rPf4PoxFzDjce+2W4HuvH4bPHP+G3bsaM8Ty7YNxDjnsPpj285gHuA+W2uYO98H2B0vbu+J8Zljb1n4C9eByjvR7r8K/6IL6QNU3fppeec8A25aVOrYTLR+5ofB5nLB47xVth+13WD/B9kl5qNRr/4UPX/P5I9971nxot3OAL+8IsSea1u93ywexeO/1hiEftLe0e69/S3uvkjen3XsV+m/B3uvfe/ZeUUZsn3bvVeh/QGtP3GcMvfcqvALvvXZ4fxWLtr/Kvp92f5Vt/yWow/HiEmrv9TrVafurUndL6YcWr3jv1be/ivHnFtWhPnjvVYtzOHa893qY63pL8Fx3Fj5jHfJJm59eMcTynbdK2rtDPr7zVtpaLc2aftRsLvSa/oWUen03rK94TT/s+kq7r3a4vuq3ucP11e6xfOsrtt9h/UTLTUKvr3xzAK+vhp0DNN/2zQG77c+wfr9bPqO8vjo30WsT/e12ffU5WF+9L/48Q+1ZRpzvcX21ofSDz7h/KOYxCmdbwvwUsu36iv0o1PpKdDHs+mpD6Ydv/15be/nyGv4JZi1n1eIPr7186ystzuE6gNdXG0q/+Hteod2kOqG9AD74WY8P+p6XWUvoE8YDpP9ggiyXY/6RCRwp6JhjCmZU+BHVMHlN7xG/60oftbkhT/Rr0Mfvkq3jPWJ8nXhUcttB+lONRDha6MnB9pcHvjwv+datrCek950f860/tdezow/wY7Rh1lM9G8Ax5nlP80ehfzGlDYheD8IG8Dww24AWs7Rzxz6bwbHhOOt71kHjjXbBNhBmH8dvA9o8wTbwcyltQPR6EDaAemUb0PYFkT6NDWhzdBob0M6941zA500Ee9zp85Hg8Xx0B8ZIXqUj8uFPsrD9rinYOL/64llG6UeJ6rAt/vQh59d3YW7/Y8p9A91b6L66TvLIpNh4y+2UWejvKX6RoTaoL9/c86JCf0vRoZYXvkh12p78DNFGn3mtIjlzTsGOPvNaRei/ROOF+XXotcpL1IcXoQ+sx6jw+k7ofxvs75cot9TWIJo+OXfX1iAzitwyDqK/V1wQ/XXt/VOup4OsIusrbqeOhP7XUs4DeH8uKrntIP1paPPAy65XeB54BeqyCj375KcUehwb0VmZ6Nk/8TtifRKu8TwgOhx3+hjhPgbS/6ZnHsB89WWSHfOAF6ku7XrxJZB5f2L4bIX3ArD4nmXR9gJ4D+FlqOM9BLSDYfcQRBfD7iFYxCE+zzsqfivjEBX2W/TRrELPfjvIz2V/sOz6x9L3rM9LVJfGZ6KySfzQXmRs0Gd8MUNbP3AOjG1xD5Rzrj+DOe/txyTn+s6QOZe2D88yIP3jknN9/x2Qc/0z2N9f7zLn4vMo77Sc6x8Oc66Rz7n+aZc5F+4pWORcbz+GORefu3pccy5fHDrMuexyrjQ+E5W0OdfbgXIuOdfL7yz4X5jzFmM7DHyPt87xLSnnSopv/+fJuTR9+XIuLUfDfnPOheN2i+rSnku9TjJgvuIUes65hH6cxgt9PHTO9Unqwy3oA+sxKpxzCf3TcR8i+ytM7tSZdq9Z0ye/fyFtHJRxEP29HEZ/dY5JaO8o68tup46E/misl0E5F56TiEpuO0h/DjR2a3E2aR7G74iFeQLnXBgztTESPF67noUx4pwLcyeeP/A+LZ8tv6bw1eYknD/2J4Y3bvN5GCzaeRjOndAP+T0wafOxYd8Dg8+AD5NzWcQhfjZ9VPwW1x/st+ij2nqF/XaQn3POhWPJ9o0+w2usND4TFc650F66c6jr+YwvZqTNuW4A7jo994TvUJX3KfjOC2Wov5o8QoOfN0EGjZ7v2Qr9ihLDwp4HqWyJzLt99+6GMjdmqA3qzffab4t374Y9O9HTl3Z2Qnt3HJ+duJEyl7gE/YlKbjtIf1paTMJx45iU9t0KrCek197lp8WdTarDn0jjMxfamQaR4ZIiQwau+c4qSNvIl9+KO6fFDI4n2vu6OT6gPNq7ldmPxhPok85H/rwnngTyj6bPP7BfSf7R8sQTzfbwnfXD2h7HE+0MZODnrbrxRDuTuanIw2cyP5synuzPmUw9nuznmUyOGb5nTjGe8Jlo9Nk0ZznTxhM8+/QmxROkW0vBE98Jtbb96L/YK9qO4fi2OSYl7R0lxaQvefxbi4u+fEHLL7DfvHekvVsxsL62fPpaT6GvX0np3xnoT1Ry20H60xr2rKU2pr6zloPGVHSm3XPnXAJ9iHOCjMIH/Yl9eJ3aRyXy4a/HHQip9/mFSkV4ypiLHXHJQT3S/1ZsO0Xoh/zfyzvvbs83q7frzdvN2Wa73Wg1ea8yKjLGU+6RHX8Z7Fj4O2onfpl39vqsDPHzdsK/SLIay9N95jRP8rB+RJfTrvebOa/ebbbjX4MbI1Vil1idCMfdRrVgXZauZej7GLUTN9JMleXMKBiaCvixoozCP0vfURdOuTam0GdSYMnnrEeWJIwMYZQ8GNFQW7tua2tuqxG9srLamKs3Ku1BrmvNvzHbnG8156vVxUa106jO7jf/zlZjcX5rsTVbaVcWq4v1/eY/31x4wH2x0WzMVVqV+bn95l9bWJhbrG1VGvPt1u12Y9/7v9Wea1UW69V2szn/oPsL+97/drtTbVTnFxc6jUZ7cf/tb2HxgeHd7jSr1WqtXensN//Z9tZCZb7WXGy35tr12dZupm6crmR7OUqL/opS+3gndkf6i2359qTQ/xBuT/4N3Z7EuUxknqH2GEOlbgLqslQ3CXUy50hfJcVzrj9NKRLmUvy9sreS+tUYwr9IsoZKU4okD+rcuf5XFE+Fkach8kwr8hQUeY4++Dvi+scM5RMszDnWtx/91+wLdc168OmmrLQfpzotFZW6MUUGqUMbmaA6TGHF3qcS+sb5o2Bpfsxtk3SBfi+5XJ7wfwR+n4k7p/kv+z36L/s9+wTWoS2IfsR2p6ndUvy9srfStV1ZzifpdNrt1JHQv+XZStH8YRKucR5aUuix33nSF/pLifRVCqOv7jGOIwP0VSJ9Cf2/e/Sl9X/Co68jCn3Joy/UJbZl3kmxaL9scZBu2RaF/r9SblNNQn+iktsO0p9ZbZtK9PpQfuCb5C9In2b8NX8pEz2OtxbjOVYj3ymqw9jM8R9jvMQ2jKWcv2Gs5vwtKhPbbkd/H/6Ha6JP6dsk0lNdAepy2zv5FOPvcoyNsUSOPNGXYI542AdoI+3LCv9x4r9DbuUajgdjZZVrQh/pdDyWMcha+sE+3Nzt+cpsrd3o1NoDt+E0PaGfRkV0jWMxrvQtT/QnC70+nwZ7e0ir8IvoznvoMgn/H2Io13LbO69pY4S2K/TCu7jdL6PUTUEdxpCoTMffUV+IJXLkif4DZLtob9K+rPCfJP475Fause1OKfRTCn00PmdjGcVuse/W64uHPAkfr7Fs58GvfgqOkDXzHoABAA==",
3577
+ "debug_symbols": "7V3bruvGkf2X8+yHvlTf5lcGg8BJnOAAhh04zgCDIP8+EilS2hap7q3dJKtY6yWw45Z21arFuiyRxX9/++tPf/7X3//0/Ze//frPb//13//+9vOvf/nx9++//nL5t3//54dvf/7t+88/f//7nx7/72/m+j+2DOf/+Y8ff7n+6z9///G337/9lyVn0w/ffvrlr8M/53z5jr99//mny7+Z8p8fns5nE26ns/Pz2ZgXjgY3HQ3B3L+W7H/+54dvznSxJsTJmpRfW0O+3I5SzE/W2B7WFONvp4tNr62JM4zRxSdrXBdryE7WBKpYk83taDLPkfKL1gTy0/fbEPLDx66+P1szQWPtnTaUhj9AW/+BsPUfiFv/gbT1H8hb/4Gy8R/wZus/YLf+A27rP7D1ley3vpL91ley3/pK9ltfyX7rK9lvfSXT1lcybX0l09ZXMm19JdPWVzJtfSXT1lcybX0l09ZXMm19JYetr+Sw9ZUctr6Sw9ZXctj6Sg5bX8lh6ys5bH0lh62v5LD1lRy3vpLj1ldy3PpKjltfyXHrKzlufSXHra/kuPWVHLe+kuPWV3La+kpOW1/JaesrOW19Jaetr+S09ZWctr6S09ZXctr6Sk5bX8l56ys5b30l562v5Lz1lZy3vpLz1ldy3vpKzltfyXnrKzlvfSWXra/ksvWVXLa+ksvWV3LZ+kouW1/JZesruWx9JZetr+Sy9ZVsTZdL2Uc//dTr48Mv28ksHLYp3846c7fHJb/48z3dzmZfKmdLnn5cL+Xj2cFRq8VRp8VRr8VR0uJo0OJo1OJo0uJo1uJoUeKo1dIZWS2dkT1RZxSns5cO3j17eqLWqOIpqfH0RM1RxdMTdUcVT0/UHlU87dQf5ek+dJ+tqXga7XTYRne/wX3RfDIThPR4g3uwo/V9mp483xDvSyivrffRTTe5++TvJiU3WOQMO4ssO4scO4s8O4uInUWBnUWRnUWJnUWZnUXscrZnl7M9u5zt2eVszy5ne3Y527PL2Z5dzvbscrZnl7M9u5xN7HI2scvZxC5nE7ucTexyNrHL2cQuZxO7nE3scjaxy9mBXc4O7HJ2YJezA7ucHdjl7MAuZwd2OTuwy9mBXc4O7HJ2ZJezI7ucHdnl7MguZ0d2OTuyy9mRXc6O7HJ2ZJezI7ucndjl7MQuZyd2OTuxy9mJXc5O7HJ2Ypez0wE5O5vp/j6fvX2yKLOzqHCzKBt2Fll2Fjl2Fnl2FhE7i8KxFpF7suiAnJ3IzxY9bLG9WPR8uN+d1Tmp8TSr8bRo8bQYNZ5aNZ46NZ56NZ6SGk+DGk/V9EhFTY9U1PRIRUuP5MyZeqSXjyo5c6YmqeLqmbqkiqtnapMqrpIeV8/UKFVcPaBTyrHMribzB33LmcTOoszNoiPuja5YdISWPPcWvlj7ZBGxsyiwsyiysyixsyizs6hws+iIe6MrFh3x+192d4v8k0WBnUUHXP1lfskeGRNetznuYv/tsPPlfqtAuL3PLsk2P8s2v4g2/4g7g3uab2Wb72Sb72WbT+zNN3fz85P5Qbb5/KvuS/O5V90wv3/40gSGR/OfD5OZGyQyCxcK9xL9OV+jfeUr93pOMcy+Prx0e9HX+x1Ume5G2ItYdnU1ca/9HV3l3id0dJV7T9HRVe79R0dXSY+r3Cvrp1wN09mc4gdXF77Yzpsm3XU34nSa4tLhPKHhzYejA4TcC7YACE/VBxwCYT5Vf3EMhKfqW46B8FT90DEQnqrPOgZCAoRfhZC73iUAQu6amwAIMZ18GUJMJ1+GENPJVyEsmE6+DCGmky9DiOnkyxBiOvkyhAQIvwohppMvQ4jp5MsQYjr5MoSYTr4MIaaTL0LoDaaTL0OI6eTLEGI6+TKEmE6+DCEBwi9CaNWy0BQ3Q2jiawhznm4jLdZVvtiWbKdvvvyze3ikOOcRc7W0PRBztVP4gZirHdsPxFztnH8g5mqFgQMxV6skHIe5Uys9HIi5Wq3iQMzVihsHYo45dH/MCZjvjjnm0P0xxxy6P+aYQ/fHHHPo/phjDt0dc485dH/MMYfujznm0P0xxxy6P+YEzHfHHHPo/phjDt0fc8yh+2OOOXR/zDGH7o45YQ7dH3PMoftjjjl0f8wxh+6POQHz3THHHLo/5phD98ccc+j+mGMO3R9zzKG7Yx4wh+6POebQ/THHHLo/5phD98ecgPnumGMO3R9zzKH7Y445dH/MMYfujznm0N0xZ//K0DNijjl0f8wxh+6POebQ/TEnYL475phD98ccc+j+mGMO3R9zzKH7Y445dHfMz/X6aiGYYw7dH3PMoftjjjl0f8xJLeap3DFPrzF/ueY56R0ru0God0rsBaGoF7V68xrCFKccl1J88lQSWb7mqaRB/mue7j8+k/Fh9rRUPPXeztee9/fr9PqCgMH+Itv+A97L2dd+K9x+J9x+L9x+Em5/EG5/FG5/Em6/8Pp7wMvvyNI0Wl/+inltfzY0zQT+/r0u+YWzJcdpwC8fz148pQPeUXeUp1aNp06Np16Np6TG06DG06jG06TG06zGUzU9klXTI1k1PZJV0yPZI+qpyZOn1n2YxQaLIjuLEjuLMjuLCjeLnGFnkWVnkWNnkWdnEbGziF3OduxytmOXsx27nO3Y5WzPLmd7djnbs8vZnl3O9uxytmeXsz27nO3Z5WzPLmd7djmb2OVsYpeziV3OJnY5m9jlbGKXs4ldziZ2OZvY5Wxil7MDu5wd2OXswC5nB3Y5O7DL2YFdzg7scnZgl7MDu5wd2OXsyC5nR3Y5O7LL2ZFdzo7scnZkl7Mju5wd2eXsyC5nR3Y5O7HL2Yldzk7scnZil7MTu5yd2OXsxC5nJ3Y5O7HL2Yldzs7scnZml7Mzu5yd2eXszC5nZ3Y5O7PL2Zldzs7scnZml7MLu5xd2OXswi5nF3Y5u7DL2YVdzi7scnZhl7MLu5xduOXsYLjl7GC45exguOXsYLjl7GC45exguOXsYLjl7GC45exguOXsYNjlbMsuZ1t2Oduyy9mWXc627HI2u+cgA7vnIAO75yADu+cgA7vnIAO75yADu+cgA7vnIAO75yADu+cgA7vnIIM7086WOJ21xrgPhwdXz7S0peLqmba2VFw909qW1676M+1tqbh6psUtFVdZbW4ZLDqgkntHs0UPCywni4idRYGdRZGdRYmdRYWbRUc8i1qxyLKzyLGziF2GJHYZkthlSGKXIYldhjziWdSKRexydmCXswO7nB3Y5ezALmcHdjk7sMvZgV3ODuxydmCXswO7nB3Z5ezILmdHdjk7ssvZkV3OjuxydmSXsyO7nB3Z5ezILmcndjk7scvZiV3OTuxydmKXsxO7nJ3Y5ezELmcndjk7scvZmV3OzuxydmaXszO7nJ3Z5ezMLmdndjk7s8vZmV3OzuxydmGXswu7nF3Y5ezCLmcXdjm7sMvZhV3OLuxydmGXswu3nB0Nt5wdDbecHQ23nB0Nt5wdDbecHQ23nB0Nt5wdDbecHQ23nB0Nu5xt2eVsyy5nW3Y527LL2ZZdzrbscrZll7Mtu5xt2eVsyy5nO3Y527HL2Y5dznbscrZjl7Mdu5zt2OVsxy5nO3Y527HL2Z5dzvbscrZnl7PZPXUY2T11GNk9dRjZPXUY2T11GD27nM3uOcjI7jnIyO45yHjEc5AxhMmibMujRc+HP/VQfI63s6V8PDt46tV4Smo8DSfy9OVKh3jEg6ZHuZr0uJr1uFrUuHrEw7xHuXpAR5PJz66GiqspTmdTivNRiqPxTrLxXrLxtLvxwcbpu4N9+OpF470r04Y77y3Nh2/WB9HWR9HWJ+bW+1hm63N6sH7herKzp+Rs+qOnWY2n5VBPnct/HIsPeLS7ZpFlZ9H+1TMkM42DIaX8mp+W0ty6BOvvdmRaOB3nlaaX34wezo5tzgEPjR/nKynyNSjyNSryNSnyNSvytejx9YBVBcf5ahX5qqhvSor6pgNWQhznq6K+KSnqm5Kivikp6pvyueorTYcvvz88+3quPByntfqXRv/ZV+55ONgwG+Lpg6+D/dxza81+7vmyZj/3HFizn/08SHdDfKhc67a4PKeG4sofdfLCfiLs6i37mtXVW/ZTYVdv2c+FXb0lTt4OFrHqGwaLWHUCg0UH1PZsp59UQwnpNUepTF8c7GNlXPpil8zURrrk3B/5mdV4WpR4mg5Y5nKUp1aNp06Np16Np6TG06DG06jGUy09UjJaeqRk1PRIVk2PZMX2SIP1YvuewXqxvcxgPYm2XmzPMVgvto8YrBfbGwzWi633g/Via/jVese8Lgc33xdPuVKXrcl+ehDq8s/B/KEyO+aVuauvzOt4V1+ZV/2uvjKvU5/ztYTZalOi/aOvzDPrJ33NZrLaGhP/4Ks/VR6u+HqqPFzxlXseDnN3kKnqayrhnpvsk6/c83BPX0mRr8wnu66+cq+vn/L1dS/hmU+NXX1lPmN29ZV739TRVzpVfX3dD9Op8vDrvolOlYcrvp4qD1d8ZZWHB4tYZcurRYHVLDhYdMDEVuY+LfqHtL98D2lKM+nSw36UZD/9890Bi6oOc9XrcZX0uBr0uBr1uJr0uJr1uFrUuHrEmq+jXNXTLUU93VLU0y0dsZbsKFf1dEtRT7cU9XRLUU+3FPV0S0lPt5TkdkuD+XI7oMF8uV3NYD7JNl9u9zGYL7ejGMyX2yUM5sut/IP5cqv51fwst0IP5suuull21c2yq+4Ra996mi+76mbZVTfLrrpZdtXNsqtukV11i+yqW2RX3SK76h6x2qyn+bKrbpFddYvsqltkV90iuupmI7rqZiO66mYjuupmI7rqZiO66mYjuupmI7rqZiO66mYjuupmI7vqWtlV18quulZ21bWyq+4Rq7B6mi+76lrZVdfKrrpWdtW1squuk111neyq62RXXSe76jrZVdfJrrpOdtV1squuk111neyq62VXXS+76nrZVdfLrrpHrBLrab7squtlV10vu+p62VXXy666JLvqkuyqS7KrLsmuuiS76pLsqkuyqy7Jrroku+qS7KobZFddwbvgBvNlV13BO9sG82VXXcG71QbzZVddwTvQBvNlV13Bu8qu5gvePzaYL7vqCt4TNpgvu+oK3uc1mC+76greuzWYL7vqCt6PNZgvu+oK3mM1mC+76sreTZVl76bKsndTZdm7qbLs3VRZ9m6qLHs3VZa9myrL3k2VZe+myrJ3U2XZu6my7N1UWfZuqix7N1WWvZsqy95NlWXvpsqyd1Nl2bupsuzdVFn2bqosezdVlr2bKsveTZVl76bKsndTZdm7qYrs3VRF9m6qIns3VZG9m6oY0VW3yN5NVWTvpiqyd1MV2bupiuzdVEX2bqoiezdVkb2bqsjeTVVk76YqsndTFdm7qYrs3VRF9m6qIns3VZG9m6rI3k1VZO+mKrJ3UxXZu6mK7N1URfZuqiJ7N1WRvZuqyN5NVWTvpiqyd1MV2bupiuzdVEX2bqoiezdVkb2bqsjeTVVk76YqsndTFdm7qYrs3VRF9m6qIns3VZG9m6rI3k1VZO+mKrJ3UxXZu6mK7N1URfZuqiJ7N1WRvZuqyN5NVWTvpiqyd1MV2bupCvvdVJffPidDSshP5rOvuoVuh50x5dH858PZTGezvx91yS+cLTnezpby8ewAC/tqfggs/HdpHQML++7jGFjYdzXHwMK+WzoGFgIsS7Cw7+6OgYV913gMLOw1oGNgQZe7CAu63CVY+O+uOwYWdLmLsKDLXYQFXe4iLARYlmBBl7sIi9ouN05nrTHuGRe1bW4FF7V9bgUXtY3ua1z474s8CBe1rW4FF7m97mC+3J50MJ9kmy+3xxvMl9uLDebLbZkG8+V2NoP5chuQq/n8N1y+Nl9uOR/Ml111+W+4fG0+86rrbMm3w5RNfN0Lkp/PRrqbnBe/+H7nkLfOvv7i13gMODIv/2JwZN6HiMGReUMkBkfmnZkYHJm3iEJwvOgWzJtVOUAyb5vlAMm8gZcDJPNRQg6QBCD7AImpphOQGGs6AYm5phOQGGw6AYnJpg+Q3JdvywESk00nIDHZdAISk00nIAlA9gESk00nIDHZdAISk00nIDHZdAISk00fILm/4EAOkJhsOgGJyaYTkJhsOgFJALIPkJhsOgGJyaYTkJhsOgGJyaYTkJhs+gDJ/SUycoDEZNMJSEw2nYDEZNMJSAKQfYDEZNMJSEw2nYDEZNMJSEw2nYDEZNMHSO4v6pIDJCabTkBisukEJCabTkASgOwDJCabTkBisukEJCabTkBisukEJCabPkByfxmiHCAx2XQCEpNNJyAx2XQCkgBkHyAx2XQCEpNNJyAx2XQCEpNNJyAx2fQBkvsLXOUAicmmE5CYbDoBicmmE5AEIPsAicmmE5CYbDoBicmmE5CYbDoBicmmD5DcX9orB0hMNp2AxGTTCUhMNp2AJADZB0hMNp2AxGTTCUhMNp2AxGTTCUhMNk9ADsBwf+nyccBg8lgBBpPECjCYDFaAIQCzDAw69xVg0ImvAIPOegUYdMorwKDzXQaG+2vEjwMGne8KMOh8V4BB57sCDAGYZWDQ+a4Ag853BRh0vivAoPNdAQad7yIwFu8kXwMGne8KMOh8V4BB57sCDAGYZWDQ+a4Ag853BRh0vivAoPNdAQad7zIweGf1GjDofFeAQee7Agw63xVgCMAsA4POdwUYdL4rwKDzXQEGne8KMOh8l4HBO43XgEHnuwIMOt8VYND5rgBDAGYZGHS+K8Cg810BBp3vCjDofFeAQee7DAzeebsGDDrfFWDQ+a4Ag853BRgCMMvAoPNdAQad7wow6HxXgEHnuwIMOt9lYPBO1DVg0PmuAIPOdwUYdL4rwBCAWQYGne8KMOh8V4BB57sCDDrfFWDQ+S4Dg3dmrgGDzncFGHS+K8Cg810BhgDMMjDofFeAQee7Agw63xVg0PmuAIPOdxkYvFNxDRh0vivAoPNdAQad7wowBGCWgUHnuwIMOt8VYND5rgCDzncFGHS+y8DgnXtrwKDzXQEGne8KMOh8V4AhALMMDDrfFWDQ+a4Ag853BRh0vivAoPNdBgbvcFsDBp3vCjDofFeAQee7AgwBmGVg0PmuAIPOdwUYdL4rwKDzXQEGne8yMHiH2xow6HxXgEHnuwIMOt8VYAjALAODzncFGHS+K8Cg810BBp3vCjDofBeBced6I5edz7r0AZjRV7mFZrRfbj0Y7Zebtkf75WbX0X65SXCwX/Bbd0b75Q7To/1ya8Vov9zRdLSfhNsvvP4Kfr/KaL/w+iv4bSWj/cLrr+B3f4z2C6+/gt+kMdovvP4Kfi/FaL/w+iv4LQ+j/cLrr+B3Joz2C6+/gt9AMNovvP4K3uc/2i+8/grejj/aL7z+Ct41P9ovvP4K3tw+2i+8/gregz7aL7z+Ct4qPtovvP4K3tE92i+8/greeD3aL7z+Ct4fPdovvP4K3sY82i+8/grebTzaL7z+Ct4UPNovvP4K3rs72i+8/greYjvaL7z+Ct4JO9ovvP4K3rA62i+8/greVzraL7z+Ct7+OdovvP4K3qU52i+8/greTDnaL7z+Ct7zONovvP5y35pIOfvJ/mLp2X7m9Zeyvdvv3KP9z4ezodvZ7O9GXDi2cLbkeDtbysezIy7M6/phuDDvFw7DhXkfchguzPubo3DhvtfwMFyY92OH4cK8zzsMF+b942G4EHBZxAX97jIu6HeXcUG/u4wL+t1lXNT2u3E6a41xz8BwX2d4HDBqO94aMGpb3howanveGjAEYJaBYdX1jiaxajhHk1j1eqNJrNqs0SRWHc7VJG9Y9RajSayq+mgSq3o6msSqko0msaoho0nssrfntfZvNIld9va8lvONJvHL3rxW6I0m8cvevBbdjSbxy9681tGNJvHL3ryWxo0m8cvevFa7jSbxy968FrCNJvHL3rzWpI0m8cvevJaZjSbxy968Vo6NJvHL3rwWg40m8cvevNZ3jSbxy968lmyNJvHL3rxWYY0m8cvevBZWjSbxy9681kqNJvHL3ryWP40m8cvevFY0jSbxy968FimNJvHL3rzWHY0m8cvevJYSjSbxy968VgeNJvHL3rwW/Iwm8cvevNbwjCbxy968luWMJvHL3rxW2owm8cvevBbPjCbxy9681sOMJvHL3ryWuIwm8cvevFatjCbxy968FqKMJvHL3rzWlowm8cvevJaLjCbxy968VoCMJvHL3rwWaowm8cvevNZIjCbxy968lieMJvHL3rxWBowm8cvevB6UH03il715PR4+msQve/N6KHo0iV/25vUk8GgSv+zN6+nX0SR+2ZvXE5+jSfyyN79nLT2/Zy09v2ctPb9nLYnfs5bE71lL4vesJR3wrGW8yMiTSSH6R5OeD/dbwkKG9Lga9Lga9bia9Lia9bha1Lh6wDO9h7lq9bjq9Liqp1s64Jnpw1zV0y1ZPd2S1dMtWT3dkj1Tt/R6Pxu5M7VLNV/P1C/VfD1Tw1Tz9UwdU81XUuQrq55pNIlVbzOaxKoHGUw64Nn+GNL0tqwUfHpN0kszczt7Qe9uRZ7M95zMH03a/7JPZT6cCoXXiLo0H3bJ3Q+HdLM/CLc/Crc/Cbc/C7e/yLb/gOf9+9pvhdvvuNtPNNsf47P9Xrj97OtvxX7m9dfbOBnibSrP9jOvv1X7mdffqv3M62/Vfub119vgXtkfmOd/7+P0fgnvk3u2n3n+r9rPPP9X7eee/2v2c8//PpjZ/vjB/gX5weTpYidTnot14F4sPufsnJmXneVeWXyZKwsZ/8XIci9Dn3P2dWQj85nRk8uzsw+3rc72M58Zq/Zz7xlq9nPvGWr2kyT76dl+7j1DzX7uPUPNfu5tQM1+7pXdpTLbH8vrYmdjnnoem+je89jLr5yDt4l7tUt+7rATha/1MYl7afycs6/7mMS9jsZyd/aj9rfAYzMfttabBR5zr7opTTdv+fyx6i6Fdvpich+v2QVkfJnS2fXW6vm0v6A0IsO9nh+HDPdO4ThkuPcgxyHDvbs5DhnufdNxyHCXTw5DJrPvPrsgM/rKvvns6Cv33rOnr6fqPP00Ll7y+YKvpMjXA+6Z7Xg36AHbnrqan2WbX5ibTzP3w0fzl1wtd1/t/XQcXS3c75ru6KrV46rT4yqr++a3dZX0uBr0uMq9U+noKveupqOr3Dugjq6q6ZaCUdMtBaOmWwpGTbcUjJpuKRjS46qabikYNd1SMGq6pWDUdEvB6OmWrJ5uyerplqyebsly75b8bH2kiqu1ewnDEXvxjnOWe8fU1VnuPdMnnI33/T2JHm4lXPxim/30g6Iz7sHBYG/IcG+xjkOGe0fWB5nRV+4tWUdfHfeebNXX0XxW72R5PuweGops7rdFJ7vYfbz6FTocsHXtOF9ZvUVmY19ZvZ5mY19ZvfdmY19ZvVBnY19ZvalnW189q1cAfdXXftOxZ/UeIka4sHoZEiNcTtW7dcSFgMsiLqfqCTvicqr+sSMup+o1PzHzV1ZaB3+qxrQnMKfqYjsCQ6dqeXsCc6qetycwp2p6ewJzqq73E8C4EKfDLj5U68UvtiVMv0dc7LEPMNINRgKMDTDmedGGM/4jjM+ns53fqJCdKZXTF7fmJynzw09Gnm79F52qXz9niE41OpwzRFqnGEEh0jpPCQqR1slOToiC1hlTUIi0TruCQqR17hYUIigA7ENECBH3EEFd2DVEI+jQCw4AHQrAAaBjpu8PurN30IOrnL7uh7udTqX4ymk//15AD9XC0TJ082vqnHWvDwc3fW94uBfQTSyBrACWVFkSoWyAJXWWQFwBS+osgb4DltRZAokJLKmzhMASsKTKEghtYEmdJVAGwZI6SyBlgiV1lkB7BUvqLIH2CpZcgxKnJwYvEtoTSxK0V7CkzhJor2BJnSXQXsGSISjT2fjx6MgSaK9gSZ0lBJaAJVWWQHsFS+osgfYKltRZAu0VLKmzBNorWFJnCbRXsKTKkgztFSypswTaK1hSZwm0V7CkzhJor2BJnSUEloAlVZZAe1XIkjH0EFTVhh4qqdrQQ/pUG3romVpDXyBSqg09lEe1oYecqDb00AjVhp4Qeq2hh5qnNvRQ89SGHmqe2tBDzVMbeqh5SkMfDdQ8taGHmqc29FDz1IYec/1pQ+/8PfQUnkOPDv+0oU+2TEYn798+PPIE4wB4cvUwxslDG/PTepdoMTuAJy08waABnrTwBFMJeNLCE9yQAJ5cPUxp+mKbyvO8Ywk8AU8aeAJJBDxp4QnuiwBPWniCmyjAkxaeQI8FT1p4Aj0WPGngiYMeC5608AR6LHjSwhPoseBJC0+gx4InLTwh8AQ8aeAJ9FjwpIUn0GPBkxaeQI8FT1p4Aj0WPGnhCfRY8OTqYbFuCnhxzzzx0GPBkxaeqNVjy4yit85WeGJofr315Z/T3Q5rylLsJ8zTnYCUboirVTYPQ1ytRngY4gTEd0ZcrW51GOJqFaDDEFerpRyGuFpV4jDE1c73RyFOaiflwxDHzLk34pg590YcM+feiBMQ3xlxzJx7I46Zc2/EMXPujThmzr0Rx8y5M+IBM+feiGPmvCD+sJhv5ffweYufzZTvKMYbipgje6CI2bAHigQUO6CIGa4HipjLeqCIWasHipifeqCImagDihFzTg8UMbv0QBGzSw8UMbv0QJGAYgcUMbv0QBGzSw8UMbv0QBGzSw8UMbt0QDFhdumBImaXHihidumBotbZxTuafkf1vvbFzrvJZEdUfSb2IpXdTmdnSuX0xa00e/jwnKufQ0QIEfcQaZ26BIVI60gnKERa50VBIdI6jAoKkdZJV06IstYxWlCItM7ogkKkVQAQFCKoC+xDRAjRniEaQYdecADoUAAOAB0zfX/QmexctGX6acE5614fDvNTS8Glx6MjSyArgCV1lkDZAEuqLCkQV8CSOkug74AldZZAYgJL6iyBygWW1FlCYAlYUmUJlEGwpM4SSJlgSZ0l0F7BkjpLoL2CJdegRDOxJNpnlkB7BUtqLEkG2itYUmcJtFewZAjKdDZ+PDqyBNorWFJnCbRXsKTOEgJLwJIqS6C9giV1lkB7BUvqLIH2CpbUWQLtFSypswTaK1hSZYmF9gqW1FkC7RUsqbME2itYUmcJtFewpM4SAkv0sWQMPQRVtaGHSqo29JA+1YYeeqba0EOk1Bp6B+VRbeghJ6oNPTRCtaGH8Kc29ITQaw091Dy1oYeapzb0UPPUhh5qntrQQ83TGnoPNU9t6KHmqQ09IfRnDb3z99A/vC92Dj06/NOGPs2vCnbJ+7cPjzzBOACeXCMeo58CHvPzeheP2QE8aeAJYdAAT1p4gqkEPGnhCW5IAE+uEU9p+mKbyvO8Q7h7ATxp4QmBJ+BJA09wXwR40sIT3EQBnrTwBHoseNLCE+ix4EkLT6DHgicNPAnQY8GTFp5AjwVPWngCPRY8aeEJ9FjwpIUnBJ6AJw08gR4LnrTwBHoseNLCE+ix4EkLT6DHgifXiBfrpoAXt8AT6LHgSQNPolo91tN0o58n4yo8sXHmifOpxpP76exMqZy+uJVmDx9i7yneQqRWCpUTIrUqpJwQqRUA5YSIECLuIVIre8kJkVrFSU6I1Io9ckKkVmeREyK1EoeYECWoC+xDBHVh1xCNoEMvOAB0KAAHgE4AvTvoEl/f56bvDS49Hh1ZAlkBLKmzBMoGWFJnCcQVsKTOEug7YEmdJZCYwJIqSzJULrCkzhIIbWBJnSVQBsGSOksgZYIldZYQWAKWVFkC7RUsuQYlmokl8XnvbYb2CpbUWQLtFSypswTaK1gyBGU6GxdeFpWhvYIlVZYUaK9gSZ0l0F7BkjpLoL2CJXWWQHsFS+osIbAELKmyBNorWFJnCbRXsKTOEmivYEmdJdBewZI6S6C9giU1lmQD7RUsqbME2qtCloyhh6CqNvRQSdWGnhB6raGHnqk29BAp1YYeyqPa0ENOVBt6aIRaQ28h/KkNPdQ8taGHmqc29FDz1IaeEHqtoYeapzb0UPPUhh5qntrQQ83TGnqHuf60oXf+HnoKz6EnhP6sof/Mq4JfHB55gnEAPLlGPMYJDhuzfeYJZgfwpIUnGDTAkxaeYCoBT1p4ghsSwJNrxFOavvj6hP0TTzzuXgBPWngCSQQ8aeEJ7osAT1p4gpsowJMWnhB4Ap408AR6LHjSwhPoseBJC0+gx4InLTyBHguetPAEeix40sATgh4LnrTwBHoseNLCE+ix4EkLT6DHgictPCHwBDxp4An0WPDkGvFi3RTw4hZ4Aj0WPGnhiVo99oLzzJMYHr94ACZoFQzoIqrdqUiVL14/PKKodZzui6LWYfNTKMYc5hXhOd1v3Y03ELVOYl1BJID4dRC19vCfA7GY2eTi0hOIWhvcriBq7f66gqj1p+quIGr9HbcniBEzSwcQMbJ0ABETSwcQMbF0AJEA4tdBxMTSAURMLB1AxMTSAURMLB1AxMTydRATJpYOIGJi6QAiJpYOIGJi6QAiAcSvg4iJpQOImFg6gIiJpQOImFg6gIiJ5esgZkwsHUDExNIBREwsHUDExNIBRAKIXwcRE0sHEDGxdAARE0sHEDGxdAARE8vXQSyYWDqAiImlCUSab3wv4RlETCwdQMTE0gFEAohfBxETSwcQMbF0AFFHs331tRhslDntk/3eTGedt/R4eAy91qqF0BvsfVEbeqxyURt6bMtWG3oswFYbeuy01hp6izXVpw29K24OvQmvD1sz73izJuZnnmBNNXjSwhOsqQZPrhG3fn6tsQ32mScQFcGTFp4QeAKeNPAEciV40sITaJvgycCT2UNr80IfC0kEPLlGnMy0tfvyj8/5xEE/AU9aeAL9BDxp4Qn0E/CkhSfQT8CTIeLO3wNunnlC4Al40sAT6CfgSQtPoJ+AJy08wY1k4EkLT3DXGXjSwhPoseBJA0889FjwpIUn0GPBkxaeQI8FT1p4Aj0WPGnhCYEn4Mk1yml+TXoo7pkn0GPBkxaeQI8FT1p4Aj0WPGnhCfRY8KSFJ9BjwZMGnhD0WPCkhSfQY8GTFp5AZwNPrhH3duaJ98/3xxKBJ+BJA0+gs4EnLTyBzgaetPAEOht40sIT6GzgSQtPoLOBJw08CdDZwJMWnkBnA09aeIL7HsGTFp5AjwVPWnhC4Al40sAT6LHgycATSjNP4vN91AF6LHjSwhPoseBJC0+gx4InLTyBHgueNPAkQo8FT1p4Aj0WPGnhCfRY8OQa8cpe0Ag9Fjxp4QmBJ+BJA0+gx4InLTyBzqaQJ0Pok9rW1NEEove1L3bezaEnskJCX3l7bFLbbSL0hNBrDb3anhChV/uzO0KvtsNH6NX+OI7Qq/29+/yh/5T+Y2yZAm7i8/tSs9rfu8GTT/FE7e/d4MmHiFfe050hKoInLTyBAgmetPCEwBPwpIEn0DbBk4En8y+11uaFPhaSCHjye/2+iAz9BDxp4EmBfgKetPAE+gl40sIT6CfgyRDx1+8jK9BPwJMWnhB4Ap408AT6CXjSwhPcSAaetPAEd52BJy08gR4LnrTwBHoseFLliTMGeix40sIT6LHgSQtPoMeCJy08gR4LngwRf/UezAtPCDwBTxp4Aj0WPGnhCfRY8KSFJ9BjwZMWnkCPBU9aeAI9Fjxp4ImFHguetPAEOht4co34y/dMXXgCnQ08aeEJgSfgSQNPoLOBJy08gc4GnrTwBDobeNLCE+hs4EkLT6CzgScNPHHQ2cCTFp7gvkfwpIUn0GPBkxaeQI8FT1p4QuAJePKt8r7UC0+gx4InLTyBHguetPAEeix40sIT6LHgSQtPoMeCJw088dBjwZMWnkCPBU+uEX+5F/TCE+ix4EkLT6DHgictPCHwBDxp4Al0NoU8GUJPWltTF+J02MWrU6++2OYyLYa5dvNCQv/y7bGX0GvtNhF60tpAIvRECL3W0Gv92R2hJ60dPkJPWn8cR+hJ6+/dCkL/Kf3H2DIF3MT8zBOtv3eDJ5/iSdD6ezd48tHDl+/pvvAEoiJ40sITKJDgSQtPIFeCJy08IfAEPLnGNYaZJ3mhj4UkAp78Xr8vIkA/AU9aeAL9BDxp4EmEfgKetPAE+gl4MkT89fvIIvQT8KSFJ9BPwJMWnhB4Ap408AQ3koEnLTzBXWfgSQtPoMeCJy08gR4LnrTwBHoseNLAkwQ9Fjxp4Qn0WPCkhSfQY8GTIeKv34OZoMeCJy08IfAEPGngCfRY8KSFJ9BjwZMWnkCPBU9aeAI9Fjxp4Qn0WPCkgScZOht4cvWw8p6pDJ0NPGnhCXQ28KSFJwSegCcNPIHOBp608AQ6G3jSwhPobOBJC0+gs4EnLTyBzgaeNPCk4L5H8KSFJ9BjwZMWnkCPBU9aeAI9FjwZePL6famFwBPwpIEn0GPBkxaeQI8FT1p4Aj0WPGnhCfRY8KSFJ9BjwZM6T6yBHgueXD18vRfUGuix4EkLT6DHgictPIEeC5608AQ6m0KejKE/YNTN81sIQwnpdehDmL445MdoLn2xvQjGs9UXUfAeonhztihy1ppTOVvub4YyDzyenLWanHWanPWanKUTOXtxsNyddfHB2YWq/VDi3UMlnoAJAGYZmAhgloFJAGYZmDN1fF2BOVN32BMYd6ZOsisw5+o6s3noTeKTs+fqOivOnqvrrDhLmpw9UydZdfZM3WHV2TN1fFVnz6XbVZw9l2732ll/Lt2u4qymDspr6qC8pg7KkyZnuddZN9kRKNedff0riudeZ7s6y73Ofs7Z11o7ca+zXZ3lXme7Osu9znZ1lnud/YyzPcU54l6TDwOGuwJyGDDc1ZLDgDlTx9cVmDN1h12BOVMn2ROYcK6u8/WkGM7VdVacPVfXWXH2TF1n1VnS5OyZusOqs2fq+KrOnku3qzh7Lt2u4uy5dLvXzkZNHVTU1EFFTR1U1NRBxQPqbDLTQ1Ihpfza2YvCQbMh1j+4u/RMVaTpcAz24ay/OZtO5Wyan9PLYcHZfC5n7exsXHC2KHI2GU3OWk3OOk3Oek3OkiZnw6mcjdNz2jHmBWfP1UFVnD1XB1Vx9lwdVMXZc3VQr53N5+qgKs6eq4OqOHuuDqri7Lk6qIqzpMlZTR1U1tRBZU0d1Npa5zApV5ffDO4fC0ue5tn2THc/rS+3v5A3/wtl47/g1paQdvwLdvO/4Db/C/7rf2E+m1P88Beez17frXM77OyDbk5LtxblPN0JXKyrfbEvk5+OHu4a9t7cHCUtjgYtjkYtjtbzvfvg6Pip/NanyjufWn4CIfnp57dEDyv+6PaZRZ4WmkAuITx/Jr7xmfTGZ/Ibn1lGzsy/QV5Ik58+tXJ/ZO1T9q1Pubc+5d/6FL31qfDWp+Jbn0pvfSq/9am3uBHf4kZ8ixvxLW7Et7gRw+ezxfIv6sVMXXVxC59548pf/hXw9d9Z/jGt8hn3xmf8G5+hNzB4IzOnNzJzeic+b2TmZRH29WeWtczKZ5Z5ECZel+SeP+Pe+Ix/4zP0xmfCG5+Jb3wmvfGZGg+WPvMGD8obPFh+zWzlM+6Nz/g3PvNGPihv5IPyRj4ob+SD8kY+KJ/ngTfmjc/YNz7j3vjMJ3nwn8u//e+Pv33/8c8///TPyyeu//Ffv/zl9++//nL719//7x/Tf/nzb99//vn73//0j99+/ctPf/3Xbz/96edf/3L9b9/M7X/+23lnf3Ce3MUaP/y7SZd/t+ny78NW5ovcY364/E+4/h92OGHz5YQzF1su9vw/",
3578
+ "brillig_names": [
3579
+ "sync_notes"
3580
+ ]
3581
3581
  }
3582
3582
  ],
3583
3583
  "outputs": {
@@ -3601,19 +3601,17 @@
3601
3601
  {
3602
3602
  "name": "value",
3603
3603
  "type": {
3604
- "kind": "integer",
3605
- "sign": "unsigned",
3606
- "width": 64
3604
+ "kind": "field"
3607
3605
  }
3608
3606
  }
3609
3607
  ],
3610
3608
  "kind": "struct",
3611
- "path": "Router::_check_timestamp_parameters"
3609
+ "path": "Router::_check_block_number_parameters"
3612
3610
  }
3613
3611
  }
3614
3612
  ],
3615
3613
  "kind": "struct",
3616
- "path": "Router::_check_timestamp_abi"
3614
+ "path": "Router::_check_block_number_abi"
3617
3615
  },
3618
3616
  {
3619
3617
  "fields": [
@@ -3632,17 +3630,19 @@
3632
3630
  {
3633
3631
  "name": "value",
3634
3632
  "type": {
3635
- "kind": "field"
3633
+ "kind": "integer",
3634
+ "sign": "unsigned",
3635
+ "width": 64
3636
3636
  }
3637
3637
  }
3638
3638
  ],
3639
3639
  "kind": "struct",
3640
- "path": "Router::_check_block_number_parameters"
3640
+ "path": "Router::_check_timestamp_parameters"
3641
3641
  }
3642
3642
  }
3643
3643
  ],
3644
3644
  "kind": "struct",
3645
- "path": "Router::_check_block_number_abi"
3645
+ "path": "Router::_check_timestamp_abi"
3646
3646
  },
3647
3647
  {
3648
3648
  "fields": [
@@ -3709,35 +3709,35 @@
3709
3709
  },
3710
3710
  "file_map": {
3711
3711
  "109": {
3712
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec.nr",
3712
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec.nr",
3713
3713
  "source": "use crate::{\n discovery::private_notes::MAX_NOTE_PACKED_LEN,\n macros::{\n dispatch::generate_public_dispatch,\n functions::{\n stub_registry,\n utils::{create_message_discovery_call, find_and_transform_top_level_unconstrained_fns},\n },\n notes::{generate_note_export, NOTES},\n storage::STORAGE_LAYOUT_NAME,\n utils::{get_trait_impl_method, module_has_storage},\n },\n};\n\n/// Marks a contract as an Aztec contract, generating the interfaces for its functions and notes, as well as injecting\n/// the `process_log` and `sync_notes` functions PXE requires in order to discover notes.\n/// Note: This is a module annotation, so the returned quote gets injected inside the module (contract) itself.\npub comptime fn aztec(m: Module) -> Quoted {\n let interface = generate_contract_interface(m);\n\n find_and_transform_top_level_unconstrained_fns(m);\n\n let contract_library_method_compute_note_hash_and_nullifier =\n generate_contract_library_method_compute_note_hash_and_nullifier();\n let process_log = generate_process_log();\n let note_exports = generate_note_exports();\n let public_dispatch = generate_public_dispatch(m);\n let sync_notes = generate_sync_notes();\n\n quote {\n $note_exports\n $interface\n $contract_library_method_compute_note_hash_and_nullifier\n $process_log\n $public_dispatch\n $sync_notes\n }\n}\n\ncomptime fn generate_contract_interface(m: Module) -> Quoted {\n let module_name = m.name();\n let contract_stubs = stub_registry::get(m);\n let fn_stubs_quote = if contract_stubs.is_some() {\n contract_stubs.unwrap().join(quote {})\n } else {\n quote {}\n };\n\n let has_storage_layout = module_has_storage(m) & STORAGE_LAYOUT_NAME.get(m).is_some();\n let storage_layout_getter = if has_storage_layout {\n let storage_layout_name = STORAGE_LAYOUT_NAME.get(m).unwrap();\n quote {\n pub fn storage_layout() -> StorageLayoutFields {\n $storage_layout_name.fields\n }\n }\n } else {\n quote {}\n };\n\n let library_storage_layout_getter = if has_storage_layout {\n quote {\n #[contract_library_method]\n $storage_layout_getter\n }\n } else {\n quote {}\n };\n\n quote {\n pub struct $module_name {\n pub target_contract: dep::aztec::protocol_types::address::AztecAddress\n }\n\n impl $module_name {\n $fn_stubs_quote\n\n pub fn at(\n addr: aztec::protocol_types::address::AztecAddress\n ) -> Self {\n Self { target_contract: addr }\n }\n\n pub fn interface() -> Self {\n Self { target_contract: aztec::protocol_types::address::AztecAddress::zero() }\n }\n\n $storage_layout_getter\n }\n\n #[contract_library_method]\n pub fn at(\n addr: aztec::protocol_types::address::AztecAddress\n ) -> $module_name {\n $module_name { target_contract: addr }\n }\n\n #[contract_library_method]\n pub fn interface() -> $module_name {\n $module_name { target_contract: aztec::protocol_types::address::AztecAddress::zero() }\n }\n\n $library_storage_layout_getter\n\n }\n}\n\n/// Generates a contract library method called `_compute_note_hash_and_nullifier` which is used for note\n/// discovery (to create the `aztec::discovery::ComputeNoteHashAndNullifier` function) and to implement the\n/// `compute_note_hash_and_nullifier` unconstrained contract function.\ncomptime fn generate_contract_library_method_compute_note_hash_and_nullifier() -> Quoted {\n let notes = NOTES.entries();\n\n if notes.len() > 0 {\n let max_note_packed_len = notes.fold(\n 0,\n |acc, (_, (_, len, _, _)): (Type, (TypeDefinition, u32, Field, [(Quoted, u32, bool)]))| {\n if len > acc {\n len\n } else {\n acc\n }\n },\n );\n\n if max_note_packed_len > MAX_NOTE_PACKED_LEN {\n panic(\n f\"One of the notes has packed len {max_note_packed_len} but the maximum is {MAX_NOTE_PACKED_LEN}\",\n );\n }\n\n // Contracts that do define notes produce an if-else chain where `note_type_id` is matched against the\n // `get_note_type_id()` function of each note type that we know of, in order to identify the note type. Once we\n // know it we call we correct `unpack` method from the `Packable` trait to obtain the underlying note type, and\n // compute the note hash (non-siloed) and inner nullifier (also non-siloed).\n\n let mut if_note_type_id_match_statements_list = &[];\n for i in 0..notes.len() {\n let (typ, (_, packed_note_length, _, _)) = notes[i];\n\n let get_note_type_id = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteType },\n quote { get_id },\n );\n let unpack = get_trait_impl_method(\n typ,\n quote { crate::protocol_types::traits::Packable<_> },\n quote { unpack },\n );\n\n let compute_note_hash = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteHash },\n quote { compute_note_hash },\n );\n\n let compute_nullifier_unconstrained = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteHash },\n quote { compute_nullifier_unconstrained },\n );\n\n let if_or_else_if = if i == 0 {\n quote { if }\n } else {\n quote { else if }\n };\n\n if_note_type_id_match_statements_list = if_note_type_id_match_statements_list.push_back(\n quote {\n $if_or_else_if note_type_id == $get_note_type_id() {\n // As an extra safety check we make sure that the packed_note BoundedVec has the expected\n // length, since we're about to interpret it's raw storage as a fixed-size array by calling the\n // unpack function on it.\n let expected_len = $packed_note_length;\n let actual_len = packed_note.len();\n assert(\n actual_len == expected_len,\n f\"Expected packed note of length {expected_len} but got {actual_len} for note type id {note_type_id}\"\n );\n\n let note = $unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n\n let note_hash = $compute_note_hash(note, storage_slot);\n \n // The message discovery process finds settled notes, that is, notes that were created in prior\n // transactions and are therefore already part of the note hash tree. We therefore compute the\n // nullification note hash by treating the note as a settled note with the provided nonce.\n let note_hash_for_nullify = aztec::note::utils::compute_note_hash_for_nullify(\n aztec::note::retrieved_note::RetrievedNote{ \n note, \n contract_address, \n metadata: aztec::note::note_metadata::SettledNoteMetadata::new(nonce).into() \n }, \n storage_slot,\n );\n\n let inner_nullifier = $compute_nullifier_unconstrained(note, note_hash_for_nullify);\n\n Option::some(\n aztec::discovery::NoteHashAndNullifier {\n note_hash, inner_nullifier\n }\n )\n }\n },\n );\n }\n\n let if_note_type_id_match_statements = if_note_type_id_match_statements_list.join(quote {});\n\n quote {\n /// Unpacks an array into a note corresponding to `note_type_id` and then computes its note hash\n /// (non-siloed) and inner nullifier (non-siloed) assuming the note has been inserted into the note hash\n /// tree with `nonce`.\n ///\n /// The signature of this function notably matches the `aztec::discovery::ComputeNoteHashAndNullifier` type,\n /// and so it can be used to call functions from that module such as `discover_new_messages`, \n /// `do_process_log` and `attempt_note_discovery`.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_hash_and_nullifier(\n packed_note: BoundedVec<Field, aztec::discovery::private_notes::MAX_NOTE_PACKED_LEN>,\n storage_slot: Field,\n note_type_id: Field,\n contract_address: aztec::protocol_types::address::AztecAddress,\n nonce: Field,\n ) -> Option<aztec::discovery::NoteHashAndNullifier> {\n $if_note_type_id_match_statements\n else {\n Option::none()\n }\n }\n }\n } else {\n // Contracts with no notes still implement this function to avoid having special-casing, the implementation\n // simply throws immediately.\n quote {\n /// This contract does not use private notes, so this function should never be called as it will\n /// unconditionally fail.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_hash_and_nullifier(\n _packed_note: BoundedVec<Field, aztec::discovery::private_notes::MAX_NOTE_PACKED_LEN>,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: aztec::protocol_types::address::AztecAddress,\n _nonce: Field,\n ) -> Option<aztec::discovery::NoteHashAndNullifier> {\n panic(f\"This contract does not use private notes\")\n }\n }\n }\n}\n\ncomptime fn generate_process_log() -> Quoted {\n // This mandatory function processes a log emitted by the contract. This is currently used to process private logs\n // and perform message discovery, resulting in new private notes, partial notes and events.\n // The bulk of the work of this function is done by aztec::discovery::do_process_log, so all we need to do is call\n // that function.\n\n // We'll produce the entire body of the function in one go and then insert it into the function.\n let notes = NOTES.entries();\n\n if notes.len() > 0 {\n quote {\n unconstrained fn process_log(\n log_ciphertext: BoundedVec<Field, dep::aztec::protocol_types::constants::PRIVATE_LOG_SIZE_IN_FIELDS>,\n tx_hash: Field,\n unique_note_hashes_in_tx: BoundedVec<Field, dep::aztec::protocol_types::constants::MAX_NOTE_HASHES_PER_TX>,\n first_nullifier_in_tx: Field,\n recipient: aztec::protocol_types::address::AztecAddress,\n ) {\n // Because this unconstrained function is injected after the contract is processed by the macros, it'll\n // not be modified by the macros that alter unconstrained functions. As such, we need to manually inject\n // the unconstrained execution context since it will not be available otherwise.\n let context = dep::aztec::context::unconstrained_context::UnconstrainedContext::new();\n\n // TODO(#10727): allow other contracts to process logs and deliver notes\n let contract_address = context.this_address();\n\n aztec::discovery::private_logs::do_process_log(\n contract_address,\n log_ciphertext,\n tx_hash,\n unique_note_hashes_in_tx,\n first_nullifier_in_tx,\n recipient,\n _compute_note_hash_and_nullifier,\n );\n }\n }\n } else {\n // Contracts with no notes still implement this function to avoid having special-casing, the implementation\n // simply throws immediately.\n quote {\n unconstrained fn process_log(\n _log_ciphertext: BoundedVec<Field, dep::aztec::protocol_types::constants::PRIVATE_LOG_SIZE_IN_FIELDS>,\n _tx_hash: Field,\n _unique_note_hashes_in_tx: BoundedVec<Field, dep::aztec::protocol_types::constants::MAX_NOTE_HASHES_PER_TX>,\n _first_nullifier_in_tx: Field,\n _recipient: aztec::protocol_types::address::AztecAddress,\n ) {\n panic(f\"This contract does not use private notes\")\n }\n }\n }\n}\n\ncomptime fn generate_note_exports() -> Quoted {\n let notes = NOTES.values();\n // Second value in each tuple is `note_packed_len` and that is ignored here because it's only used when\n // generating partial note helper functions.\n notes\n .map(|(s, _, note_type_id, fields): (TypeDefinition, u32, Field, [(Quoted, u32, bool)])| {\n generate_note_export(s, note_type_id, fields)\n })\n .join(quote {})\n}\n\ncomptime fn generate_sync_notes() -> Quoted {\n let message_discovery_call = create_message_discovery_call();\n quote {\n unconstrained fn sync_notes() {\n // Because this unconstrained function is injected after the contract is processed by the macros, it'll not\n // be modified by the macros that alter unconstrained functions. As such, we need to manually inject the\n // unconstrained execution context since it will not be available otherwise.\n let context = dep::aztec::context::unconstrained_context::UnconstrainedContext::new();\n\n $message_discovery_call\n }\n }\n}\n"
3714
3714
  },
3715
3715
  "110": {
3716
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/dispatch.nr",
3716
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/dispatch.nr",
3717
3717
  "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 name = function.name();\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 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"
3718
3718
  },
3719
3719
  "117": {
3720
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/functions/utils.nr",
3720
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/functions/utils.nr",
3721
3721
  "source": "use crate::macros::{\n functions::{abi_export::create_fn_abi_export, call_interface_stubs::stub_fn, stub_registry},\n notes::NOTES,\n utils::{\n add_to_hasher, fn_has_noinitcheck, get_fn_visibility, is_fn_initializer, is_fn_internal,\n is_fn_private, is_fn_public, is_fn_view, modify_fn_body, module_has_initializer,\n module_has_storage,\n },\n};\nuse protocol_types::meta::generate_serialize_to_fields;\nuse std::meta::type_of;\n\npub(crate) comptime fn transform_private(f: FunctionDefinition) -> Quoted {\n let fn_abi = create_fn_abi_export(f);\n let fn_stub = stub_fn(f);\n stub_registry::register(f.module(), fn_stub);\n\n // If a function is further modified as unconstrained, we throw an error\n if f.is_unconstrained() {\n let name = f.name();\n panic(\n f\"Function {name} is annotated with #[private] but marked as unconstrained, remove unconstrained keyword\",\n );\n }\n\n let module_has_initializer = module_has_initializer(f.module());\n let module_has_storage = module_has_storage(f.module());\n\n // Private functions undergo a lot of transformations from their Aztec.nr form into a circuit that can be fed to the\n // Private Kernel Circuit.\n // First we change the function signature so that it also receives `PrivateContextInputs`, which contain information\n // about the execution context (e.g. the caller).\n let original_params = f.parameters();\n f.set_parameters(&[(\n quote { inputs },\n quote { crate::context::inputs::private_context_inputs::PrivateContextInputs }.as_type(),\n )]\n .append(original_params));\n\n let mut body = f.body().as_block().unwrap();\n\n // The original params are hashed and passed to the `context` object, so that the kernel can verify we've received\n // the correct values.\n // TODO: Optimize args_hasher for small number of arguments\n let args_hasher_name = quote { args_hasher };\n let args_hasher = original_params.fold(\n quote {\n let mut $args_hasher_name = dep::aztec::hash::ArgsHasher::new();\n },\n |args_hasher, param: (Quoted, Type)| {\n let (name, typ) = param;\n let appended_arg = add_to_hasher(args_hasher_name, name, typ);\n quote {\n $args_hasher\n $appended_arg\n }\n },\n );\n\n let context_creation = quote {\n let mut context = dep::aztec::context::private_context::PrivateContext::new(inputs, dep::aztec::protocol_types::traits::Hash::hash($args_hasher_name));\n };\n\n // Modifications introduced by the different marker attributes.\n let internal_check = if is_fn_internal(f) {\n create_internal_check(f)\n } else {\n quote {}\n };\n\n let view_check = if is_fn_view(f) {\n create_view_check(f)\n } else {\n quote {}\n };\n\n let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n (create_assert_correct_initializer_args(f), create_mark_as_initialized(f))\n } else {\n (quote {}, quote {})\n };\n\n let storage_init = if module_has_storage {\n quote {\n // Some functions don't access storage, but it'd be quite difficult to only inject this variable if it is\n // referenced. We instead ignore 'unused variable' warnings for it.\n #[allow(unused_variables)]\n let storage = Storage::init(&mut context);\n }\n } else {\n quote {}\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !is_fn_initializer(f) & !fn_has_noinitcheck(f) {\n create_init_check(f)\n } else {\n quote {}\n };\n\n // All private functions perform message discovery, since they may need to access notes. This is slightly\n // inefficient and could be improved by only doing it once we actually attempt to read any.\n let message_discovery_call = if NOTES.len() > 0 {\n create_message_discovery_call()\n } else {\n quote {}\n };\n\n // Finally, we need to change the return type to be `PrivateCircuitPublicInputs`, which is what the Private Kernel\n // circuit expects.\n let return_value_var_name = quote { macro__returned__values };\n\n let return_value_type = f.return_type();\n let return_value = if body.len() == 0 {\n quote {}\n } else if return_value_type != type_of(()) {\n // The original return value is passed to a second args hasher which the context receives.\n let (body_without_return, last_body_expr) = body.pop_back();\n let return_value = last_body_expr.quoted();\n let return_value_assignment =\n quote { let $return_value_var_name: $return_value_type = $return_value; };\n let return_hasher_name = quote { return_hasher };\n let return_value_into_hasher =\n add_to_hasher(return_hasher_name, return_value_var_name, return_value_type);\n\n body = body_without_return;\n\n quote {\n let mut $return_hasher_name = dep::aztec::hash::ArgsHasher::new();\n $return_value_assignment\n $return_value_into_hasher\n context.set_return_hash($return_hasher_name);\n }\n } else {\n let (body_without_return, last_body_expr) = body.pop_back();\n if !last_body_expr.has_semicolon()\n & last_body_expr.as_for().is_none()\n & last_body_expr.as_assert().is_none()\n & last_body_expr.as_for_range().is_none()\n & last_body_expr.as_assert_eq().is_none()\n & last_body_expr.as_let().is_none() {\n let unused_return_value_name = f\"_{return_value_var_name}\".quoted_contents();\n body = body_without_return.push_back(\n quote { let $unused_return_value_name = $last_body_expr; }.as_expr().unwrap(),\n );\n }\n quote {}\n };\n\n let context_finish = quote { context.finish() };\n\n let to_prepend = quote {\n $args_hasher\n $context_creation\n $assert_initializer\n $init_check\n $internal_check\n $view_check\n $storage_init\n $message_discovery_call\n };\n\n let to_append = quote {\n $return_value\n $mark_as_initialized\n $context_finish\n };\n let modified_body = modify_fn_body(body, to_prepend, to_append);\n f.set_body(modified_body);\n f.set_return_type(\n quote { dep::protocol_types::abis::private_circuit_public_inputs::PrivateCircuitPublicInputs }\n .as_type(),\n );\n f.set_return_data();\n\n fn_abi\n}\n\npub(crate) comptime fn transform_public(f: FunctionDefinition) -> Quoted {\n let fn_abi = create_fn_abi_export(f);\n let fn_stub = stub_fn(f);\n stub_registry::register(f.module(), fn_stub);\n\n // If a function is further modified as unconstrained, we throw an error\n if f.is_unconstrained() {\n let name = f.name();\n panic(\n f\"Function {name} is annotated with #[public] but marked as unconstrained, remove unconstrained keyword\",\n );\n }\n\n let module_has_initializer = module_has_initializer(f.module());\n let module_has_storage = module_has_storage(f.module());\n\n // Public functions undergo a lot of transformations from their Aztec.nr form.\n let original_params = f.parameters();\n let args_len = original_params\n .map(|(name, typ): (Quoted, Type)| {\n generate_serialize_to_fields(name, typ, &[], false).0.len()\n })\n .fold(0, |acc: u32, val: u32| acc + val);\n\n // Unlike in the private case, in public the `context` does not need to receive the hash of the original params.\n let context_creation = quote {\n let mut context = dep::aztec::context::public_context::PublicContext::new(|| {\n // We start from 1 because we skip the selector for the dispatch function.\n let serialized_args : [Field; $args_len] = dep::aztec::context::public_context::calldata_copy(1, $args_len);\n dep::aztec::hash::hash_args_array(serialized_args)\n });\n };\n\n // Modifications introduced by the different marker attributes.\n let internal_check = if is_fn_internal(f) {\n create_internal_check(f)\n } else {\n quote {}\n };\n\n let view_check = if is_fn_view(f) {\n create_view_check(f)\n } else {\n quote {}\n };\n\n let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n (create_assert_correct_initializer_args(f), create_mark_as_initialized(f))\n } else {\n (quote {}, quote {})\n };\n\n let storage_init = if module_has_storage {\n // Some functions don't access storage, but it'd be quite difficult to only inject this variable if it is\n // referenced. We instead ignore 'unused variable' warnings for it.\n quote {\n #[allow(unused_variables)]\n let storage = Storage::init(&mut context);\n }\n } else {\n quote {}\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !fn_has_noinitcheck(f) & !is_fn_initializer(f) {\n create_init_check(f)\n } else {\n quote {}\n };\n\n let to_prepend = quote {\n $context_creation\n $assert_initializer\n $init_check\n $internal_check\n $view_check\n $storage_init\n };\n\n let to_append = quote {\n $mark_as_initialized\n };\n\n let body = f.body().as_block().unwrap();\n let modified_body = modify_fn_body(body, to_prepend, to_append);\n f.set_body(modified_body);\n\n // All public functions are automatically made unconstrained, even if they were not marked as such. This is because\n // instead of compiling into a circuit, they will compile to bytecode that will be later transpiled into AVM\n // bytecode.\n f.set_unconstrained(true);\n f.set_return_public(true);\n\n fn_abi\n}\n\npub(crate) comptime fn find_and_transform_top_level_unconstrained_fns(m: Module) {\n // Top-level unconstrained fns are contract entrypoints, but they're not explicitly designated in any way. They're\n // the fallback case for a function that matches no other rules.\n // TODO(#12743): improve this\n\n // We first find non-standard contract entrypoints, i.e. functions in the `contract` mod that are not private or\n // public, but which *are* contract entrypoints (i.e. they're not opting out via the #[test] or\n // #[contract_library_method] attributes). Ideally entrypoints would be explicitly designated instead.\n let non_private_public_entrypoint_functions = m.functions().filter(|f: FunctionDefinition| {\n !is_fn_private(f)\n & !is_fn_public(f)\n & !f.has_named_attribute(\"contract_library_method\")\n & !f.has_named_attribute(\"test\")\n });\n\n // TODO: uncomment the code below and emit a warning once support for them is added to Noir (tracked in\n // https://github.com/noir-lang/noir/issues/7714). We can't simply print a message since that'd otherwise break the\n // output of utils such as `nargo test --list-tests`.\n // // We don't expect to see any custom constrained entrypoints (i.e. private functions created outside of aztec-nr's\n // // #[private] macro, possibly resulting in a non-standard interface).\n // for f in non_private_public_entrypoint_functions.filter(|f: FunctionDefinition| {\n // !f.is_unconstrained()\n // }) {\n // let name = f.name();\n // warn(\n // f\"found private contract function '{name}' which does not have the #[private] attribute - make sure you know what you're doing!\",\n // );\n // }\n\n // An unconstrained contract entrypoints is what we call a top-level unconstrained function, to which we apply the\n // appropriate transformation. Ideally these would be explicitly designated as such instead.\n for f in non_private_public_entrypoint_functions.filter(|f: FunctionDefinition| {\n f.is_unconstrained()\n }) {\n transform_top_level_unconstrained(f);\n }\n}\n\npub(crate) comptime fn transform_top_level_unconstrained(f: FunctionDefinition) {\n let context_creation = quote { let mut context = dep::aztec::context::unconstrained_context::UnconstrainedContext::new(); };\n let module_has_storage = module_has_storage(f.module());\n\n let storage_init = if module_has_storage {\n quote {\n // Some functions don't access storage, but it'd be quite difficult to only inject this variable if it is\n // referenced. We instead ignore 'unused variable' warnings for it.\n #[allow(unused_variables)]\n let storage = Storage::init(context);\n }\n } else {\n quote {}\n };\n\n // All unconstrained functions perform message discovery, since they may need to access private notes that would be\n // found during this process. This is slightly inefficient and could be improved by only doing it once we actually\n // attempt to read any.\n let message_discovery_call = if NOTES.len() > 0 {\n create_message_discovery_call()\n } else {\n quote {}\n };\n\n let to_prepend = quote {\n $context_creation\n $storage_init\n $message_discovery_call\n };\n let body = f.body().as_block().unwrap();\n let modified_body = modify_fn_body(body, to_prepend, quote {});\n f.set_return_public(true);\n f.set_body(modified_body);\n}\n\ncomptime fn create_internal_check(f: FunctionDefinition) -> Quoted {\n let name = f.name();\n let assertion_message = f\"Function {name} can only be called internally\";\n quote { assert(context.msg_sender() == context.this_address(), $assertion_message); }\n}\n\ncomptime fn create_view_check(f: FunctionDefinition) -> Quoted {\n let name = f.name();\n let assertion_message = f\"Function {name} can only be called statically\";\n if is_fn_private(f) {\n // Here `context` is of type context::PrivateContext\n quote { assert(context.inputs.call_context.is_static_call == true, $assertion_message); }\n } else {\n // Here `context` is of type context::PublicContext\n quote { assert(context.is_static_call(), $assertion_message); }\n }\n}\n\ncomptime fn create_assert_correct_initializer_args(f: FunctionDefinition) -> Quoted {\n let fn_visibility = get_fn_visibility(f);\n f\"dep::aztec::macros::functions::initialization_utils::assert_initialization_matches_address_preimage_{fn_visibility}(context);\"\n .quoted_contents()\n}\n\ncomptime fn create_mark_as_initialized(f: FunctionDefinition) -> Quoted {\n let fn_visibility = get_fn_visibility(f);\n f\"dep::aztec::macros::functions::initialization_utils::mark_as_initialized_{fn_visibility}(&mut context);\"\n .quoted_contents()\n}\n\ncomptime fn create_init_check(f: FunctionDefinition) -> Quoted {\n let fn_visibility = get_fn_visibility(f);\n f\"dep::aztec::macros::functions::initialization_utils::assert_is_initialized_{fn_visibility}(&mut context);\"\n .quoted_contents()\n}\n\n/// Injects a call to `aztec::discovery::discover_new_messages`, causing for new notes to be added to PXE and made\n/// available for the current execution.\npub(crate) comptime fn create_message_discovery_call() -> Quoted {\n quote {\n /// Safety: message discovery returns nothing and is performed solely for its side-effects. It is therefore\n /// always safe to call.\n unsafe {\n dep::aztec::discovery::discover_new_messages(\n context.this_address(),\n _compute_note_hash_and_nullifier,\n );\n };\n }\n}\n"
3722
3722
  },
3723
3723
  "139": {
3724
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/capsules.nr",
3724
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/capsules.nr",
3725
3725
  "source": "use protocol_types::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Stores arbitrary information in a per-contract non-volatile database, which can later be retrieved with `load`. If\n/// data was already stored at this slot, it is overwritten.\npub unconstrained fn store<T, let N: u32>(contract_address: AztecAddress, slot: Field, value: T)\nwhere\n T: Serialize<N>,\n{\n let serialized = value.serialize();\n store_oracle(contract_address, slot, serialized);\n}\n\n/// Returns data previously stored via `storeCapsule` in the per-contract non-volatile database. Returns Option::none() if\n/// nothing was stored at the given slot.\npub unconstrained fn load<T, let N: u32>(contract_address: AztecAddress, slot: Field) -> Option<T>\nwhere\n T: Deserialize<N>,\n{\n let serialized_option = load_oracle::<N>(contract_address, slot, N);\n serialized_option.map(|arr| Deserialize::deserialize(arr))\n}\n\n/// Deletes data in the per-contract non-volatile database. Does nothing if no data was present.\npub unconstrained fn delete(contract_address: AztecAddress, slot: Field) {\n delete_oracle(contract_address, slot);\n}\n\n/// Copies a number of contiguous entries in the per-contract non-volatile database. This allows for efficient data\n/// structures by avoiding repeated calls to `loadCapsule` and `storeCapsule`.\n/// Supports overlapping source and destination regions (which will result in the overlapped source values being\n/// overwritten). All copied slots must exist in the database (i.e. have been stored and not deleted)\npub unconstrained fn copy(\n contract_address: AztecAddress,\n src_slot: Field,\n dst_slot: Field,\n num_entries: u32,\n) {\n copy_oracle(contract_address, src_slot, dst_slot, num_entries);\n}\n\n#[oracle(storeCapsule)]\nunconstrained fn store_oracle<let N: u32>(\n contract_address: AztecAddress,\n slot: Field,\n values: [Field; N],\n) {}\n\n/// We need to pass in `array_len` (the value of N) as a parameter to tell the oracle how many fields the response must\n/// have.\n///\n/// Note that the oracle returns an Option<[Field; N]> because we cannot return an Option<T> directly. That would\n/// require for the oracle resolver to know the shape of T (e.g. if T were a struct of 3 u32 values then the expected\n/// response shape would be 3 single items, whereas it were a struct containing `u32, [Field;10], u32` then the expected\n/// shape would be single, array, single.). Instead, we return the serialization and deserialize in Noir.\n#[oracle(loadCapsule)]\nunconstrained fn load_oracle<let N: u32>(\n contract_address: AztecAddress,\n slot: Field,\n array_len: u32,\n) -> Option<[Field; N]> {}\n\n#[oracle(deleteCapsule)]\nunconstrained fn delete_oracle(contract_address: AztecAddress, slot: Field) {}\n\n#[oracle(copyCapsule)]\nunconstrained fn copy_oracle(\n contract_address: AztecAddress,\n src_slot: Field,\n dst_slot: Field,\n num_entries: u32,\n) {}\n\nmod test {\n // These tests are sort of redundant since we already test the oracle implementation directly in TypeScript, but\n // they are cheap regardless and help ensure both that the TXE implementation works accordingly and that the Noir\n // oracles are hooked up correctly.\n\n use crate::{\n oracle::capsules::{copy, delete, load, store},\n test::{helpers::test_environment::TestEnvironment, mocks::mock_struct::MockStruct},\n };\n use protocol_types::{address::AztecAddress, traits::{FromField, ToField}};\n\n unconstrained fn setup() -> AztecAddress {\n let env = TestEnvironment::new();\n env.contract_address()\n }\n\n global SLOT: Field = 1;\n\n #[test]\n unconstrained fn stores_and_loads() {\n let contract_address = setup();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value);\n\n assert_eq(load(contract_address, SLOT).unwrap(), value);\n }\n\n #[test]\n unconstrained fn store_overwrites() {\n let contract_address = setup();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value);\n\n let new_value = MockStruct::new(7, 8);\n store(contract_address, SLOT, new_value);\n\n assert_eq(load(contract_address, SLOT).unwrap(), new_value);\n }\n\n #[test]\n unconstrained fn loads_empty_slot() {\n let contract_address = setup();\n\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n }\n\n #[test]\n unconstrained fn deletes_stored_value() {\n let contract_address = setup();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value);\n delete(contract_address, SLOT);\n\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n }\n\n #[test]\n unconstrained fn deletes_empty_slot() {\n let contract_address = setup();\n\n delete(contract_address, SLOT);\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n }\n\n #[test]\n unconstrained fn copies_non_overlapping_values() {\n let contract_address = setup();\n\n let src = 5;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0]);\n store(contract_address, src + 1, values[1]);\n store(contract_address, src + 2, values[2]);\n\n let dst = 10;\n copy(contract_address, src, dst, 3);\n\n assert_eq(load(contract_address, dst).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n }\n\n #[test]\n unconstrained fn copies_overlapping_values_with_src_ahead() {\n let contract_address = setup();\n\n let src = 1;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0]);\n store(contract_address, src + 1, values[1]);\n store(contract_address, src + 2, values[2]);\n\n let dst = 2;\n copy(contract_address, src, dst, 3);\n\n assert_eq(load(contract_address, dst).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n\n // src[1] and src[2] should have been overwritten since they are also dst[0] and dst[1]\n assert_eq(load(contract_address, src).unwrap(), values[0]); // src[0] (unchanged)\n assert_eq(load(contract_address, src + 1).unwrap(), values[0]); // dst[0]\n assert_eq(load(contract_address, src + 2).unwrap(), values[1]); // dst[1]\n }\n\n #[test]\n unconstrained fn copies_overlapping_values_with_dst_ahead() {\n let contract_address = setup();\n\n let src = 2;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0]);\n store(contract_address, src + 1, values[1]);\n store(contract_address, src + 2, values[2]);\n\n let dst = 1;\n copy(contract_address, src, dst, 3);\n\n assert_eq(load(contract_address, dst).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n\n // src[0] and src[1] should have been overwritten since they are also dst[1] and dst[2]\n assert_eq(load(contract_address, src).unwrap(), values[1]); // dst[1]\n assert_eq(load(contract_address, src + 1).unwrap(), values[2]); // dst[2]\n assert_eq(load(contract_address, src + 2).unwrap(), values[2]); // src[2] (unchanged)\n }\n\n #[test(should_fail_with = \"copy empty slot\")]\n unconstrained fn cannot_copy_empty_values() {\n let contract_address = setup();\n\n copy(contract_address, SLOT, SLOT, 1);\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_store_other_contract() {\n let contract_address = setup();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n let value = MockStruct::new(5, 6);\n store(other_contract_address, SLOT, value);\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_load_other_contract() {\n let contract_address = setup();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n let _: Option<MockStruct> = load(other_contract_address, SLOT);\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_delete_other_contract() {\n let contract_address = setup();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n delete(other_contract_address, SLOT);\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_copy_other_contract() {\n let contract_address = setup();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n copy(other_contract_address, SLOT, SLOT, 0);\n }\n}\n"
3726
3726
  },
3727
3727
  "140": {
3728
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/enqueue_public_function_call.nr",
3728
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/enqueue_public_function_call.nr",
3729
3729
  "source": "use dep::protocol_types::address::AztecAddress;\n\n#[oracle(notifyEnqueuedPublicFunctionCall)]\nunconstrained fn notify_enqueued_public_function_call_oracle(\n _contract_address: AztecAddress,\n _calldata_hash: Field,\n _side_effect_counter: u32,\n _is_static_call: bool,\n) {}\n\nunconstrained fn notify_enqueued_public_function_call_wrapper(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n notify_enqueued_public_function_call_oracle(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n}\n\npub fn notify_enqueued_public_function_call(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n // Safety: Notifies the simulator that a public call has been enqueued, allowing it to prepare hints for the AVM to process this call.\n unsafe {\n notify_enqueued_public_function_call_wrapper(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n }\n}\n\n#[oracle(notifySetPublicTeardownFunctionCall)]\nunconstrained fn notify_set_public_teardown_function_call_oracle(\n _contract_address: AztecAddress,\n _calldata_hash: Field,\n _side_effect_counter: u32,\n _is_static_call: bool,\n) {}\n\nunconstrained fn notify_set_public_teardown_function_call_wrapper(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n notify_set_public_teardown_function_call_oracle(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n}\n\npub fn notify_set_public_teardown_function_call(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n // Safety: Notifies the simulator that a teardown call has been set, allowing it to prepare hints for the AVM to process this call.\n unsafe {\n notify_set_public_teardown_function_call_wrapper(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n }\n}\n\npub fn notify_set_min_revertible_side_effect_counter(counter: u32) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call.\n unsafe { notify_set_min_revertible_side_effect_counter_oracle_wrapper(counter) };\n}\n\npub unconstrained fn notify_set_min_revertible_side_effect_counter_oracle_wrapper(counter: u32) {\n notify_set_min_revertible_side_effect_counter_oracle(counter);\n}\n\n#[oracle(notifySetMinRevertibleSideEffectCounter)]\nunconstrained fn notify_set_min_revertible_side_effect_counter_oracle(_counter: u32) {}\n"
3730
3730
  },
3731
3731
  "141": {
3732
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution.nr",
3732
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution.nr",
3733
3733
  "source": "use dep::protocol_types::address::AztecAddress;\n\n#[oracle(getContractAddress)]\nunconstrained fn get_contract_address_oracle() -> AztecAddress {}\n\n#[oracle(getBlockNumber)]\nunconstrained fn get_block_number_oracle() -> u32 {}\n\n#[oracle(getChainId)]\nunconstrained fn get_chain_id_oracle() -> Field {}\n\n#[oracle(getVersion)]\nunconstrained fn get_version_oracle() -> Field {}\n\npub unconstrained fn get_contract_address() -> AztecAddress {\n get_contract_address_oracle()\n}\n\npub unconstrained fn get_block_number() -> u32 {\n get_block_number_oracle()\n}\n\npub unconstrained fn get_chain_id() -> Field {\n get_chain_id_oracle()\n}\n\npub unconstrained fn get_version() -> Field {\n get_version_oracle()\n}\n"
3734
3734
  },
3735
3735
  "142": {
3736
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution_cache.nr",
3736
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution_cache.nr",
3737
3737
  "source": "/// Stores values represented as slice in execution cache to be later obtained by its hash.\npub fn store(values: [Field], hash: Field) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call. When loading the values, however, the caller must check that the values are indeed the preimage.\n unsafe { store_in_execution_cache_oracle_wrapper(values, hash) };\n}\n\nunconstrained fn store_in_execution_cache_oracle_wrapper(values: [Field], hash: Field) {\n store_in_execution_cache_oracle(values, hash);\n}\n\npub unconstrained fn load<let N: u32>(hash: Field) -> [Field; N] {\n load_from_execution_cache_oracle(hash)\n}\n\n#[oracle(storeInExecutionCache)]\nunconstrained fn store_in_execution_cache_oracle(_values: [Field], _hash: Field) {}\n\n#[oracle(loadFromExecutionCache)]\nunconstrained fn load_from_execution_cache_oracle<let N: u32>(_hash: Field) -> [Field; N] {}\n"
3738
3738
  },
3739
3739
  "151": {
3740
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/message_discovery.nr",
3740
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/message_discovery.nr",
3741
3741
  "source": "use crate::discovery::private_notes::MAX_NOTE_PACKED_LEN;\nuse dep::protocol_types::{\n address::AztecAddress,\n constants::{MAX_NOTE_HASHES_PER_TX, PUBLIC_LOG_DATA_SIZE_IN_FIELDS},\n};\n\n/// Finds new notes that may have been sent to all registered accounts in PXE in the current contract and makes them\n/// available for later querying via the `get_notes` oracle.\npub unconstrained fn sync_notes() {\n sync_notes_oracle();\n}\n\n#[oracle(syncNotes)]\nunconstrained fn sync_notes_oracle() {}\n\n/// Informs PXE of a note's existence so that it can later be retrieved by the `getNotes` oracle. The note will be\n/// scoped to `contract_address`, meaning other contracts will not be able to access it unless authorized.\n///\n/// The packed note is what `getNotes` will later return. PXE indexes notes by `storage_slot`, so this value\n/// is typically used to filter notes that correspond to different state variables. `note_hash` and `nullifier` are\n/// the inner hashes, i.e. the raw hashes returned by `NoteHash::compute_note_hash` and\n/// `NoteHash::compute_nullifier`. PXE will verify that the siloed unique note hash was inserted into the tree\n/// at `tx_hash`, and will store the nullifier to later check for nullification.\n///\n/// `recipient` is the account to which the note was sent to. Other accounts will not be able to access this note (e.g.\n/// other accounts will not be able to see one another's token balance notes, even in the same PXE) unless authorized.\n///\n/// Returns true if the note was successfully delivered and added to PXE's database.\npub unconstrained fn deliver_note(\n contract_address: AztecAddress,\n storage_slot: Field,\n nonce: Field,\n packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n note_hash: Field,\n nullifier: Field,\n tx_hash: Field,\n recipient: AztecAddress,\n) -> bool {\n deliver_note_oracle(\n contract_address,\n storage_slot,\n nonce,\n packed_note,\n note_hash,\n nullifier,\n tx_hash,\n recipient,\n )\n}\n\n/// The contents of a public log, plus contextual information about the transaction in which the log was emitted. This\n/// is the data required in order to discover notes that are being delivered in a log.\n// TODO(#11639): this could also be used to fetch private logs, but the `BoundedVec` maximum length is that of a public\n// log.\npub struct LogWithTxData {\n pub log_content: BoundedVec<Field, PUBLIC_LOG_DATA_SIZE_IN_FIELDS>,\n pub tx_hash: Field,\n /// The array of new note hashes created by `tx_hash`\n pub unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n /// The first nullifier created by `tx_hash`\n pub first_nullifier_in_tx: Field,\n}\n\n/// Fetches a log from the node that has the corresponding `tag`. The log can be either a public or a private log, and\n/// the tag is the first field in the log's content. Returns `Option::none` if no such log exists. Throws if more than\n/// one log with that tag exists.\n/// Public logs have an extra field included at the beginning with the address of the contract that emitted them.\n// TODO(#11627): handle multiple logs with the same tag.\n// TODO(#10273): improve contract siloing of logs, don't introduce an extra field.\npub unconstrained fn get_log_by_tag(tag: Field) -> Option<LogWithTxData> {\n get_log_by_tag_oracle(tag)\n}\n\n#[oracle(deliverNote)]\nunconstrained fn deliver_note_oracle(\n contract_address: AztecAddress,\n storage_slot: Field,\n nonce: Field,\n packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n note_hash: Field,\n nullifier: Field,\n tx_hash: Field,\n recipient: AztecAddress,\n) -> bool {}\n\n#[oracle(getLogByTag)]\nunconstrained fn get_log_by_tag_oracle(tag: Field) -> Option<LogWithTxData> {}\n"
3742
3742
  },
3743
3743
  "17": {
@@ -3749,23 +3749,23 @@
3749
3749
  "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"
3750
3750
  },
3751
3751
  "180": {
3752
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/append.nr",
3752
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/append.nr",
3753
3753
  "source": "/// Appends two `BoundedVec`s together, returning one that contains all of the elements of the first one followed by all\n/// of the elements of the second one. The resulting `BoundedVec` can have any arbitrary maximum length, but it must be\n/// large enough to fit all of the elements of both the first and second vectors.\npub fn append<T, let A_LEN: u32, let B_LEN: u32, let DST_LEN: u32>(\n a: BoundedVec<T, A_LEN>,\n b: BoundedVec<T, B_LEN>,\n) -> BoundedVec<T, DST_LEN> {\n let mut dst = BoundedVec::new();\n\n dst.extend_from_bounded_vec(a);\n dst.extend_from_bounded_vec(b);\n\n dst\n}\n\nmod test {\n use super::append;\n\n #[test]\n unconstrained fn append_empty_vecs() {\n let a: BoundedVec<_, 3> = BoundedVec::new();\n let b: BoundedVec<_, 14> = BoundedVec::new();\n\n let result: BoundedVec<Field, 5> = append(a, b);\n\n assert_eq(result.len(), 0);\n assert_eq(result.storage(), std::mem::zeroed());\n }\n\n #[test]\n unconstrained fn append_non_empty_vecs() {\n let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n let result: BoundedVec<Field, 8> = append(a, b);\n\n assert_eq(result.len(), 6);\n assert_eq(result.storage(), [1, 2, 3, 4, 5, 6, std::mem::zeroed(), std::mem::zeroed()]);\n }\n\n #[test(should_fail_with = \"out of bounds\")]\n unconstrained fn append_non_empty_vecs_insufficient_max_len() {\n let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n let _: BoundedVec<Field, 5> = append(a, b);\n }\n}\n"
3754
3754
  },
3755
3755
  "182": {
3756
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/mod.nr",
3756
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/mod.nr",
3757
3757
  "source": "pub mod append;\npub mod collapse;\npub mod subarray;\npub mod subbvec;\n\npub use append::append;\npub use collapse::collapse;\npub use subarray::subarray;\npub use subbvec::subbvec;\n\n// This will eventually be replaced by `BoundedVec::for_each`, once that's implemented.\npub unconstrained fn for_each_in_bounded_vec<T, let MaxLen: u32, Env>(\n vec: BoundedVec<T, MaxLen>,\n f: fn[Env](T, u32) -> (),\n) {\n for i in 0..vec.len() {\n f(vec.get_unchecked(i), i);\n }\n}\n"
3758
3758
  },
3759
3759
  "183": {
3760
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subarray.nr",
3760
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subarray.nr",
3761
3761
  "source": "/// Returns `DST_LEN` elements from a source array, starting at `offset`. `DST_LEN` must not be larger than the number\n/// of elements past `offset`.\n///\n/// Examples:\n/// ```\n/// let foo: [Field; 2] = subarray([1, 2, 3, 4, 5], 2);\n/// assert_eq(foo, [3, 4]);\n///\n/// let bar: [Field; 5] = subarray([1, 2, 3, 4, 5], 2); // fails - we can't return 5 elements since only 3 remain\n/// ```\npub fn subarray<T, let SRC_LEN: u32, let DST_LEN: u32>(\n src: [T; SRC_LEN],\n offset: u32,\n) -> [T; DST_LEN] {\n assert(offset + DST_LEN <= SRC_LEN, \"DST_LEN too large for offset\");\n\n let mut dst: [T; DST_LEN] = std::mem::zeroed();\n for i in 0..DST_LEN {\n dst[i] = src[i + offset];\n }\n\n dst\n}\n\nmod test {\n use super::subarray;\n\n #[test]\n unconstrained fn subarray_into_empty() {\n // In all of these cases we're setting DST_LEN to be 0, so we always get back an emtpy array.\n assert_eq(subarray::<Field, _, _>([], 0), []);\n assert_eq(subarray([1, 2, 3, 4, 5], 0), []);\n assert_eq(subarray([1, 2, 3, 4, 5], 2), []);\n }\n\n #[test]\n unconstrained fn subarray_complete() {\n assert_eq(subarray::<Field, _, _>([], 0), []);\n assert_eq(subarray([1, 2, 3, 4, 5], 0), [1, 2, 3, 4, 5]);\n }\n\n #[test]\n unconstrained fn subarray_different_end_sizes() {\n // We implicitly select how many values to read in the size of the return array\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4, 5]);\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4]);\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3]);\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2]);\n }\n\n #[test(should_fail_with = \"DST_LEN too large for offset\")]\n unconstrained fn subarray_offset_too_large() {\n // With an offset of 1 we can only request up to 4 elements\n let _: [_; 5] = subarray([1, 2, 3, 4, 5], 1);\n }\n\n #[test(should_fail)]\n unconstrained fn subarray_bad_return_value() {\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [3, 3, 4, 5]);\n }\n}\n"
3762
3762
  },
3763
3763
  "184": {
3764
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subbvec.nr",
3764
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subbvec.nr",
3765
3765
  "source": "use crate::utils::array;\n\n/// Returns `DST_MAX_LEN` elements from a source BoundedVec, starting at `offset`. `offset` must not be larger than the\n/// original length, and `DST_LEN` must not be larger than the total number of elements past `offset` (including the\n/// zeroed elements past `len()`).\n///\n/// Only elements at the beginning of the vector can be removed: it is not possible to also remove elements at the end\n/// of the vector by passing a value for `DST_LEN` that is smaller than `len() - offset`.\n///\n/// Examples:\n/// ```\n/// let foo = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n/// assert_eq(subbvec(foo, 2), BoundedVec::<_, 8>::from_array([3, 4, 5]));\n///\n/// let bar: BoundedVec<_, 1> = subbvec(foo, 2); // fails - we can't return just 1 element since 3 remain\n/// let baz: BoundedVec<_, 10> = subbvec(foo, 3); // fails - we can't return 10 elements since only 7 remain\n/// ```\npub fn subbvec<T, let SRC_MAX_LEN: u32, let DST_MAX_LEN: u32>(\n bvec: BoundedVec<T, SRC_MAX_LEN>,\n offset: u32,\n) -> BoundedVec<T, DST_MAX_LEN> {\n // from_parts_unchecked does not verify that the elements past len are zeroed, but that is not an issue in our case\n // because we're constructing the new storage array as a subarray of the original one (which should have zeroed\n // storage past len), guaranteeing correctness. This is because `subarray` does not allow extending arrays past\n // their original length.\n BoundedVec::from_parts_unchecked(array::subarray(bvec.storage(), offset), bvec.len() - offset)\n}\n\nmod test {\n use super::subbvec;\n\n #[test]\n unconstrained fn subbvec_empty() {\n let bvec = BoundedVec::<Field, 0>::from_array([]);\n assert_eq(subbvec(bvec, 0), bvec);\n }\n\n #[test]\n unconstrained fn subbvec_complete() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n assert_eq(subbvec(bvec, 0), bvec);\n\n let smaller_capacity = BoundedVec::<_, 5>::from_array([1, 2, 3, 4, 5]);\n assert_eq(subbvec(bvec, 0), smaller_capacity);\n }\n\n #[test]\n unconstrained fn subbvec_partial() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n assert_eq(subbvec(bvec, 2), BoundedVec::<_, 8>::from_array([3, 4, 5]));\n assert_eq(subbvec(bvec, 2), BoundedVec::<_, 3>::from_array([3, 4, 5]));\n }\n\n #[test]\n unconstrained fn subbvec_into_empty() {\n let bvec: BoundedVec<_, 10> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n assert_eq(subbvec(bvec, 5), BoundedVec::<_, 5>::from_array([]));\n }\n\n #[test(should_fail)]\n unconstrained fn subbvec_offset_past_len() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n let _: BoundedVec<_, 1> = subbvec(bvec, 6);\n }\n\n #[test(should_fail)]\n unconstrained fn subbvec_insufficient_dst_len() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n // We're not providing enough space to hold all of the items inside the original BoundedVec. subbvec can cause\n // for the capacity to reduce, but not the length (other than by len - offset).\n let _: BoundedVec<_, 1> = subbvec(bvec, 2);\n }\n\n #[test(should_fail_with = \"DST_LEN too large for offset\")]\n unconstrained fn subbvec_dst_len_causes_enlarge() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n // subbvec does not supprt capacity increases\n let _: BoundedVec<_, 11> = subbvec(bvec, 0);\n }\n\n #[test(should_fail_with = \"DST_LEN too large for offset\")]\n unconstrained fn subbvec_dst_len_too_large_for_offset() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n // This effectively requests a capacity increase, since there'd be just one element plus the 5 empty slots,\n // which is less than 7.\n let _: BoundedVec<_, 7> = subbvec(bvec, 4);\n }\n}\n"
3766
3766
  },
3767
3767
  "185": {
3768
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/comparison.nr",
3768
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/comparison.nr",
3769
3769
  "source": "struct ComparatorEnum {\n pub EQ: u8,\n pub NEQ: u8,\n pub LT: u8,\n pub LTE: u8,\n pub GT: u8,\n pub GTE: u8,\n}\n\npub global Comparator: ComparatorEnum =\n ComparatorEnum { EQ: 1, NEQ: 2, LT: 3, LTE: 4, GT: 5, GTE: 6 };\n\npub fn compare(lhs: Field, operation: u8, rhs: Field) -> bool {\n // Values are computed ahead of time because circuits evaluate all branches\n let is_equal = lhs == rhs;\n let is_lt = lhs.lt(rhs);\n\n if (operation == Comparator.EQ) {\n is_equal\n } else if (operation == Comparator.NEQ) {\n !is_equal\n } else if (operation == Comparator.LT) {\n is_lt\n } else if (operation == Comparator.LTE) {\n is_lt | is_equal\n } else if (operation == Comparator.GT) {\n !is_lt & !is_equal\n } else if (operation == Comparator.GTE) {\n !is_lt\n } else {\n panic(f\"Invalid operation\")\n }\n}\n\nmod test {\n use super::Comparator;\n use super::compare;\n\n #[test]\n unconstrained fn test_compare() {\n let lhs = 10;\n let rhs = 10;\n assert(compare(lhs, Comparator.EQ, rhs), \"Expected lhs to be equal to rhs\");\n\n let lhs = 10;\n let rhs = 11;\n assert(compare(lhs, Comparator.NEQ, rhs), \"Expected lhs to be not equal to rhs\");\n\n let lhs = 10;\n let rhs = 11;\n assert(compare(lhs, Comparator.LT, rhs), \"Expected lhs to be less than rhs\");\n\n let lhs = 10;\n let rhs = 10;\n assert(compare(lhs, Comparator.LTE, rhs), \"Expected lhs to be less than or equal to rhs\");\n\n let lhs = 11;\n let rhs = 10;\n assert(compare(lhs, Comparator.GT, rhs), \"Expected lhs to be greater than rhs\");\n\n let lhs = 10;\n let rhs = 10;\n assert(\n compare(lhs, Comparator.GTE, rhs),\n \"Expected lhs to be greater than or equal to rhs\",\n );\n\n let lhs = 11;\n let rhs = 10;\n assert(\n compare(lhs, Comparator.GTE, rhs),\n \"Expected lhs to be greater than or equal to rhs\",\n );\n\n let lhs = 10;\n let rhs = 11;\n assert(!compare(lhs, Comparator.EQ, rhs), \"Expected lhs to be not equal to rhs\");\n\n let lhs = 10;\n let rhs = 10;\n assert(!compare(lhs, Comparator.NEQ, rhs), \"Expected lhs to not be not equal to rhs\");\n\n let lhs = 11;\n let rhs = 10;\n assert(!compare(lhs, Comparator.LT, rhs), \"Expected lhs to not be less than rhs\");\n\n let lhs = 11;\n let rhs = 10;\n assert(\n !compare(lhs, Comparator.LTE, rhs),\n \"Expected lhs to not be less than or equal to rhs\",\n );\n\n let lhs = 10;\n let rhs = 10;\n assert(!compare(lhs, Comparator.GT, rhs), \"Expected lhs to not be greater than rhs\");\n\n let lhs = 10;\n let rhs = 11;\n assert(\n !compare(lhs, Comparator.GTE, rhs),\n \"Expected lhs to not be greater than or equal to rhs\",\n );\n\n let lhs = 10;\n let rhs = 11;\n assert(\n !compare(lhs, Comparator.GTE, rhs),\n \"Expected lhs to not be greater than or equal to rhs\",\n );\n }\n}\n"
3770
3770
  },
3771
3771
  "24": {
@@ -3773,31 +3773,31 @@
3773
3773
  "source": "use crate::default::Default;\nuse crate::hash::Hasher;\n\ncomptime global RATE: u32 = 3;\n\npub struct Poseidon2 {\n cache: [Field; 3],\n state: [Field; 4],\n cache_size: u32,\n squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2 {\n #[no_predicates]\n pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n Poseidon2::hash_internal(input, message_size, message_size != N)\n }\n\n pub fn new(iv: Field) -> Poseidon2 {\n let mut result =\n Poseidon2 { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n result.state[RATE] = iv;\n result\n }\n\n fn perform_duplex(&mut self) {\n // add the cache into sponge state\n for i in 0..RATE {\n // We effectively zero-pad the cache by only adding to the state\n // cache that is less than the specified `cache_size`\n if i < self.cache_size {\n self.state[i] += self.cache[i];\n }\n }\n self.state = crate::hash::poseidon2_permutation(self.state, 4);\n }\n\n fn absorb(&mut self, input: Field) {\n assert(!self.squeeze_mode);\n if self.cache_size == RATE {\n // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n self.perform_duplex();\n self.cache[0] = input;\n self.cache_size = 1;\n } else {\n // If we're absorbing, and the cache is not full, add the input into the cache\n self.cache[self.cache_size] = input;\n self.cache_size += 1;\n }\n }\n\n fn squeeze(&mut self) -> Field {\n assert(!self.squeeze_mode);\n // If we're in absorb mode, apply sponge permutation to compress the cache.\n self.perform_duplex();\n self.squeeze_mode = true;\n\n // Pop one item off the top of the permutation and return it.\n self.state[0]\n }\n\n fn hash_internal<let N: u32>(\n input: [Field; N],\n in_len: u32,\n is_variable_length: bool,\n ) -> Field {\n let two_pow_64 = 18446744073709551616;\n let iv: Field = (in_len as Field) * two_pow_64;\n let mut sponge = Poseidon2::new(iv);\n for i in 0..input.len() {\n if i < in_len {\n sponge.absorb(input[i]);\n }\n }\n\n // In the case where the hash preimage is variable-length, we append `1` to the end of the input, to distinguish\n // from fixed-length hashes. (the combination of this additional field element + the hash IV ensures\n // fixed-length and variable-length hashes do not collide)\n if is_variable_length {\n sponge.absorb(1);\n }\n sponge.squeeze()\n }\n}\n\npub struct Poseidon2Hasher {\n _state: [Field],\n}\n\nimpl Hasher for Poseidon2Hasher {\n fn finish(self) -> Field {\n let iv: Field = (self._state.len() as Field) * 18446744073709551616; // iv = (self._state.len() << 64)\n let mut sponge = Poseidon2::new(iv);\n for i in 0..self._state.len() {\n sponge.absorb(self._state[i]);\n }\n sponge.squeeze()\n }\n\n fn write(&mut self, input: Field) {\n self._state = self._state.push_back(input);\n }\n}\n\nimpl Default for Poseidon2Hasher {\n fn default() -> Self {\n Poseidon2Hasher { _state: &[] }\n }\n}\n"
3774
3774
  },
3775
3775
  "273": {
3776
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/debug_log.nr",
3776
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/debug_log.nr",
3777
3777
  "source": "/// Utility function to console.log data in the acir simulator.\n/// Example:\n/// debug_log(\"blah blah this is a debug string\");\npub fn debug_log<let N: u32>(msg: str<N>) {\n debug_log_format(msg, []);\n}\n\n/// Utility function to console.log data in the acir simulator. This variant receives a format string in which the\n/// `${k}` tokens will be replaced with the k-eth value in the `args` array.\n/// Examples:\n/// debug_log_format(\"get_2(slot:{0}) =>\\n\\t0:{1}\\n\\t1:{2}\", [storage_slot, note0_hash, note1_hash]);\n/// debug_log_format(\"whole array: {}\", [e1, e2, e3, e4]);\npub fn debug_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call.\n unsafe { debug_log_oracle_wrapper(msg, args) };\n}\n\npub unconstrained fn debug_log_oracle_wrapper<let M: u32, let N: u32>(\n msg: str<M>,\n args: [Field; N],\n) {\n debug_log_oracle(msg, args.as_slice());\n}\n\n// WARNING: sometimes when using debug logs the ACVM errors with: `thrown: \"solver opcode resolution error: cannot solve opcode: expression has too many unknowns x155\"`\n#[oracle(debugLog)]\nunconstrained fn debug_log_oracle<let M: u32>(_msg: str<M>, args: [Field]) {}\n"
3778
3778
  },
3779
3779
  "274": {
3780
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
3780
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
3781
3781
  "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 FUNCTION_TREE_HEIGHT, GENERATOR_INDEX__NOTE_HASH_NONCE, GENERATOR_INDEX__OUTER_NULLIFIER,\n GENERATOR_INDEX__SILOED_NOTE_HASH, 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::{\n arrays::{array_concat, unsafe_padded_array_length},\n field::{field_from_bytes, field_from_bytes_32_trunc},\n },\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 { fields }\n }\n}\n\nfn 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(contract_class_log: ContractClassLog) -> Field {\n let array = contract_class_log.log.fields;\n // Safety: The below length is constrained in the base rollup.\n let length = unsafe { unsafe_padded_array_length(array) };\n if length == 0 {\n 0\n } else {\n poseidon2_hash(array)\n }\n}\n\npub fn merkle_hash(left: Field, right: Field) -> Field {\n poseidon2_hash([left, right])\n}\n\npub fn compute_l2_to_l1_hash(\n contract_address: AztecAddress,\n recipient: EthAddress,\n content: Field,\n rollup_version_id: Field,\n chain_id: Field,\n) -> Field {\n let mut bytes: [u8; 160] = std::mem::zeroed();\n\n let inputs =\n [contract_address.to_field(), rollup_version_id, recipient.to_field(), chain_id, content];\n for i in 0..5 {\n // TODO are bytes be in fr.to_buffer() ?\n let item_bytes: [u8; 32] = inputs[i].to_be_bytes();\n for j in 0..32 {\n bytes[32 * i + j] = item_bytes[j];\n }\n }\n\n sha256_to_field(bytes)\n}\n\npub fn silo_l2_to_l1_message(\n msg: ScopedL2ToL1Message,\n rollup_version_id: Field,\n chain_id: Field,\n) -> Field {\n if msg.contract_address.is_zero() {\n 0\n } else {\n compute_l2_to_l1_hash(\n msg.contract_address,\n msg.message.recipient,\n msg.message.content,\n rollup_version_id,\n chain_id,\n )\n }\n}\n\n// Computes sha256 hash of 2 input hashes.\n//\n// NB: This method now takes in two 31 byte fields - it assumes that any input\n// is the result of a sha_to_field hash and => is truncated\n//\n// TODO(Jan and David): This is used for the encrypted_log hashes.\n// Can we check to see if we can just use hash_to_field or pedersen_compress here?\n//\npub fn accumulate_sha256(input: [Field; 2]) -> Field {\n // This is a note about the cpp code, since it takes an array of Fields\n // instead of a u128.\n // 4 Field elements when converted to bytes will usually\n // occupy 4 * 32 = 128 bytes.\n // However, this function is making the assumption that each Field\n // only occupies 128 bits.\n //\n // TODO(David): This does not seem to be getting guaranteed anywhere in the code?\n // Concatentate two fields into 32x2 = 64 bytes\n // accumulate_sha256 assumes that the inputs are pre-truncated 31 byte numbers\n let mut hash_input_flattened = [0; 64];\n for offset in 0..input.len() {\n let input_as_bytes: [u8; 32] = input[offset].to_be_bytes();\n for byte_index in 0..32 {\n hash_input_flattened[offset * 32 + byte_index] = input_as_bytes[byte_index];\n }\n }\n\n sha256_to_field(hash_input_flattened)\n}\n\npub fn verification_key_hash<let N: u32>(key: [Field; N]) -> Field {\n crate::hash::poseidon2_hash(key)\n}\n\n#[inline_always]\npub fn pedersen_hash<let N: u32>(inputs: [Field; N], hash_index: u32) -> Field {\n std::hash::pedersen_hash_with_separator(inputs, hash_index)\n}\n\npub fn poseidon2_hash<let N: u32>(inputs: [Field; N]) -> Field {\n std::hash::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n T: ToField,\n{\n let inputs_with_separator = array_concat([separator.to_field()], inputs);\n poseidon2_hash(inputs_with_separator)\n}\n\n// Performs a fixed length hash with a subarray of the given input.\n// Useful for SpongeBlob in which we aborb M things and want to check it vs a hash of M elts of an N-len array.\n// Using stdlib poseidon, this will always absorb an extra 1 as a 'variable' hash, and not match spongeblob.squeeze()\n// or any ts implementation. Also checks that any remaining elts not hashed are empty.\n#[no_predicates]\npub fn poseidon2_hash_subarray<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let mut sponge = poseidon2_absorb_chunks(input, in_len, false);\n sponge.squeeze()\n}\n\n// NB the below is the same as std::hash::poseidon2::Poseidon2::hash(), but replacing a range check with a bit check,\n// and absorbing in chunks of 3 below.\n#[no_predicates]\npub fn poseidon2_cheaper_variable_hash<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let mut sponge = poseidon2_absorb_chunks(input, in_len, true);\n // In the case where the hash preimage is variable-length, we append `1` to the end of the input, to distinguish\n // from fixed-length hashes. (the combination of this additional field element + the hash IV ensures\n // fixed-length and variable-length hashes do not collide)\n if in_len != N {\n sponge.absorb(1);\n }\n sponge.squeeze()\n}\n\n// The below fn reduces gates of a conditional poseidon2 hash by approx 3x (thank you ~* Giant Brain Dev @IlyasRidhuan *~ for the idea)\n// Why? Because when we call stdlib poseidon, we call absorb for each item. When absorbing is conditional, it seems the compiler does not know\n// what cache_size will be when calling absorb, so it assigns the permutation gates for /each i/ rather than /every 3rd i/, which is actually required.\n// The below code forces the compiler to:\n// - absorb normally up to 2 times to set cache_size to 1\n// - absorb in chunks of 3 to ensure perm. only happens every 3rd absorb\n// - absorb normally up to 2 times to add any remaining values to the hash\n// In fixed len hashes, the compiler is able to tell that it will only need to perform the permutation every 3 absorbs.\n// NB: it also replaces unnecessary range checks (i < thing) with a bit check (&= i != thing), which alone reduces the gates of a var. hash by half.\n\n#[no_predicates]\nfn poseidon2_absorb_chunks<let N: u32>(\n input: [Field; N],\n in_len: u32,\n variable: bool,\n) -> Poseidon2Sponge {\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n // Even though shift is always 1 here, if we input in_len = 0 we get an underflow\n // since we cannot isolate computation branches. The below is just to avoid that.\n let shift = if in_len == 0 { 0 } else { 1 };\n if in_len != 0 {\n // cache_size = 0, init absorb\n sponge.cache[0] = input[0];\n sponge.cache_size = 1;\n // shift = num elts already added to make cache_size 1 = 1 for a fresh sponge\n // M = max_chunks = (N - 1 - (N - 1) % 3) / 3: (must be written as a fn of N to compile)\n // max_remainder = (N - 1) % 3;\n // max_chunks = (N - 1 - max_remainder) / 3;\n sponge = poseidon2_absorb_chunks_loop::<N, (N - 1 - (N - 1) % 3) / 3>(\n sponge,\n input,\n in_len,\n variable,\n shift,\n );\n }\n sponge\n}\n\n// NB: If it's not required to check that the non-absorbed elts of 'input' are 0s, set skip_0_check=true\n#[no_predicates]\npub fn poseidon2_absorb_chunks_existing_sponge<let N: u32>(\n in_sponge: Poseidon2Sponge,\n input: [Field; N],\n in_len: u32,\n skip_0_check: bool,\n) -> Poseidon2Sponge {\n let mut sponge = in_sponge;\n // 'shift' is to account for already added inputs\n let mut shift = 0;\n // 'stop' is to avoid an underflow when inputting in_len = 0\n let mut stop = false;\n for i in 0..3 {\n if shift == in_len {\n stop = true;\n }\n if (sponge.cache_size != 1) & (!stop) {\n sponge.absorb(input[i]);\n shift += 1;\n }\n }\n sponge = if stop {\n sponge\n } else {\n // max_chunks = (N - (N % 3)) / 3;\n poseidon2_absorb_chunks_loop::<N, (N - (N % 3)) / 3>(\n sponge,\n input,\n in_len,\n skip_0_check,\n shift,\n )\n };\n sponge\n}\n\n// The below is the loop to absorb elts into a poseidon sponge in chunks of 3\n// shift - the num of elts already absorbed to ensure the sponge's cache_size = 1\n// M - the max number of chunks required to absorb N things (must be comptime to compile)\n// NB: The 0 checks ('Found non-zero field...') are messy, but having a separate loop over N to check\n// for 0s costs 3N gates. Current approach is approx 2N gates.\n#[no_predicates]\nfn poseidon2_absorb_chunks_loop<let N: u32, let M: u32>(\n in_sponge: Poseidon2Sponge,\n input: [Field; N],\n in_len: u32,\n variable: bool,\n shift: u32,\n) -> Poseidon2Sponge {\n assert(in_len <= N, \"Given in_len to absorb is larger than the input array len\");\n // When we have an existing sponge, we may have a shift of 0, and the final 'k+2' below = N\n // The below avoids an overflow\n let skip_last = 3 * M == N;\n // Writing in_sponge: &mut does not compile\n let mut sponge = in_sponge;\n let mut should_add = true;\n // The num of things left over after absorbing in 3s\n let remainder = (in_len - shift) % 3;\n // The num of chunks of 3 to absorb (maximum M)\n let chunks = (in_len - shift - remainder) / 3;\n for i in 0..M {\n // Now we loop through cache size = 1 -> 3\n should_add &= i != chunks;\n // This is the index at the start of the chunk (for readability)\n let k = 3 * i + shift;\n if should_add {\n // cache_size = 1, 2 => just assign\n sponge.cache[1] = input[k];\n sponge.cache[2] = input[k + 1];\n // cache_size = 3 => duplex + perm\n for j in 0..3 {\n sponge.state[j] += sponge.cache[j];\n }\n sponge.state = std::hash::poseidon2_permutation(sponge.state, 4);\n sponge.cache[0] = input[k + 2];\n // cache_size is now 1 again, repeat loop\n } else if (!variable) & (i != chunks) {\n // if we are hashing a fixed len array which is a subarray, we check the remaining elts are 0\n // NB: we don't check at i == chunks, because that chunk contains elts to be absorbed or checked below\n let last_0 = if (i == M - 1) & (skip_last) {\n 0\n } else {\n input[k + 2]\n };\n let all_0 = (input[k] == 0) & (input[k + 1] == 0) & (last_0 == 0);\n assert(all_0, \"Found non-zero field after breakpoint\");\n }\n }\n // we have 'remainder' num of items left to absorb\n should_add = true;\n // below is to avoid overflows (i.e. if inlen is close to N)\n let mut should_check = !variable;\n for i in 0..3 {\n should_add &= i != remainder;\n should_check &= in_len - remainder + i != N;\n if should_add {\n // we want to absorb the final 'remainder' items\n sponge.absorb(input[in_len - remainder + i]);\n } else if should_check {\n assert(input[in_len - remainder + i] == 0, \"Found non-zero field after breakpoint\");\n }\n }\n sponge\n}\n\npub fn poseidon2_hash_with_separator_slice<T>(inputs: [Field], separator: T) -> Field\nwhere\n T: ToField,\n{\n let in_len = inputs.len() + 1;\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n sponge.absorb(separator.to_field());\n\n for i in 0..inputs.len() {\n sponge.absorb(inputs[i]);\n }\n\n sponge.squeeze()\n}\n\n#[no_predicates]\npub fn poseidon2_hash_bytes<let N: u32>(inputs: [u8; N]) -> Field {\n let mut fields = [0; (N + 30) / 31];\n let mut field_index = 0;\n let mut current_field = [0; 31];\n for i in 0..inputs.len() {\n let index = i % 31;\n current_field[index] = inputs[i];\n if index == 30 {\n fields[field_index] = field_from_bytes(current_field, false);\n current_field = [0; 31];\n field_index += 1;\n }\n }\n if field_index != fields.len() {\n fields[field_index] = field_from_bytes(current_field, false);\n }\n poseidon2_hash(fields)\n}\n\n#[test]\nfn poseidon_chunks_matches_fixed() {\n let in_len = 501;\n let mut input: [Field; 4096] = [0; 4096];\n let mut fixed_input = [3; 501];\n assert(in_len == fixed_input.len()); // sanity check\n for i in 0..in_len {\n input[i] = 3;\n }\n let sub_chunk_hash = poseidon2_hash_subarray(input, in_len);\n let fixed_len_hash = std::hash::poseidon2::Poseidon2::hash(fixed_input, fixed_input.len());\n assert(sub_chunk_hash == fixed_len_hash);\n}\n\n#[test]\nfn poseidon_chunks_matches_variable() {\n let in_len = 501;\n let mut input: [Field; 4096] = [0; 4096];\n for i in 0..in_len {\n input[i] = 3;\n }\n let variable_chunk_hash = poseidon2_cheaper_variable_hash(input, in_len);\n let variable_len_hash = std::hash::poseidon2::Poseidon2::hash(input, in_len);\n assert(variable_chunk_hash == variable_len_hash);\n}\n\n#[test]\nfn existing_sponge_poseidon_chunks_matches_fixed() {\n let in_len = 501;\n let mut input: [Field; 4096] = [0; 4096];\n let mut fixed_input = [3; 501];\n assert(in_len == fixed_input.len()); // sanity check\n for i in 0..in_len {\n input[i] = 3;\n }\n // absorb 250 of the 501 things\n let empty_sponge = Poseidon2Sponge::new((in_len as Field) * TWO_POW_64);\n let first_sponge = poseidon2_absorb_chunks_existing_sponge(empty_sponge, input, 250, true);\n // now absorb the final 251 (since they are all 3s, im being lazy and not making a new array)\n let mut final_sponge = poseidon2_absorb_chunks_existing_sponge(first_sponge, input, 251, true);\n let fixed_len_hash = Poseidon2Sponge::hash(fixed_input, fixed_input.len());\n assert(final_sponge.squeeze() == fixed_len_hash);\n}\n\n#[test]\nfn poseidon_chunks_empty_inputs() {\n let in_len = 0;\n let mut input: [Field; 4096] = [0; 4096];\n let mut constructed_empty_sponge = poseidon2_absorb_chunks(input, in_len, true);\n let mut first_sponge =\n poseidon2_absorb_chunks_existing_sponge(constructed_empty_sponge, input, in_len, true);\n assert(first_sponge.squeeze() == constructed_empty_sponge.squeeze());\n}\n\n#[test]\nfn smoke_sha256_to_field() {\n let full_buffer = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70,\n 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93,\n 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112,\n 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130,\n 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148,\n 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159,\n ];\n let result = sha256_to_field(full_buffer);\n\n assert(result == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184c7);\n\n // to show correctness of the current ver (truncate one byte) vs old ver (mod full bytes):\n let result_bytes = sha256::digest(full_buffer);\n let truncated_field = crate::utils::field::field_from_bytes_32_trunc(result_bytes);\n assert(truncated_field == result);\n let mod_res = result + (result_bytes[31] as Field);\n assert(mod_res == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184e0);\n}\n\n#[test]\nfn compute_l2_l1_hash() {\n // All zeroes\n let hash_result =\n compute_l2_to_l1_hash(AztecAddress::from_field(0), EthAddress::zero(), 0, 0, 0);\n assert(hash_result == 0xb393978842a0fa3d3e1470196f098f473f9678e72463cb65ec4ab5581856c2);\n\n // Non-zero case\n let hash_result = compute_l2_to_l1_hash(\n AztecAddress::from_field(1),\n EthAddress::from_field(3),\n 5,\n 2,\n 4,\n );\n assert(hash_result == 0x3f88c1044a05e5340ed20466276500f6d45ca5603913b9091e957161734e16);\n}\n\n#[test]\nfn silo_l2_to_l1_message_matches_typescript() {\n let version = 4;\n let chainId = 5;\n\n let hash = silo_l2_to_l1_message(\n ScopedL2ToL1Message {\n message: L2ToL1Message { recipient: EthAddress::from_field(1), content: 2, counter: 0 },\n contract_address: AztecAddress::from_field(3),\n },\n version,\n chainId,\n );\n\n // The following value was generated by `l2_to_l1_message.test.ts`\n let hash_from_typescript = 0x00c6155d69febb9d5039b374dd4f77bf57b7c881709aa524a18acaa0bd57476a;\n\n assert_eq(hash, hash_from_typescript);\n}\n"
3782
3782
  },
3783
3783
  "288": {
3784
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/meta/mod.nr",
3784
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/meta/mod.nr",
3785
3785
  "source": "use super::traits::{Deserialize, Packable, Serialize};\n\n/// Returns the typed expression of a trait method implementation.\n///\n/// This helper function is preferred over directly inlining with `$typ::target_method()` in a quote,\n/// as direct inlining would result in missing import warnings in the generated code (specifically,\n/// warnings that the trait implementation is not in scope).\n///\n/// # Note\n/// A copy of this function exists in `aztec-nr/aztec/src/macros/utils.nr`. We maintain separate copies\n/// because importing it there from here would cause the `target_trait` to be interpreted in the context\n/// of this crate, making it impossible to compile code for traits from that crate (e.g. NoteType).\ncomptime fn get_trait_impl_method(\n typ: Type,\n target_trait: Quoted,\n target_method: Quoted,\n) -> TypedExpr {\n let trait_constraint = target_trait.as_trait_constraint();\n typ\n .get_trait_impl(trait_constraint)\n .expect(f\"Could not find impl for {target_trait} for type {typ}\")\n .methods()\n .filter(|m| m.name() == target_method)[0]\n .as_typed_expr()\n}\n\n/// Generates code that deserializes a struct, primitive type, array or string from a field array.\n///\n/// # Parameters\n/// - `name`: The name of the current field being processed, used to identify fields for replacement.\n/// - `typ`: The type of the struct or field being deserialized (e.g., a custom struct, array, or primitive).\n/// - `field_array_name`: The name of the field array containing serialized field data (e.g., `\"values\"`).\n/// - `num_already_consumed`: The number of fields already processed in previous recursion calls.\n/// - `should_unpack`: A boolean indicating whether the type should be unpacked (see description of `Packable`\n/// and `Serialize` trait for more information about the difference between packing and serialization).\n///\n/// # Returns\n/// A tuple containing:\n/// - `Quoted`: A code that deserializes a given struct, primitive type, array, or string from the field array.\n/// - `u32`: The total number of fields consumed during deserialization (used for recursion).\n///\n/// # Nested Struct Example\n/// Given the following setup:\n/// ```\n/// struct UintNote {\n/// value: u128,\n/// owner: AztecAddress,\n/// randomness: Field,\n/// }\n///\n/// struct AztecAddress {\n/// inner: Field,\n/// }\n/// ```\n///\n/// If `UintNote` is the input type, the function will generate the following deserialization code:\n/// ```\n/// UintNote {\n/// value: fields[0] as u128,\n/// owner: AztecAddress {\n/// inner: fields[1],\n/// },\n/// randomness: fields[2],\n/// }\n/// ```\n/// # Nested Struct Example with Unpacking\n/// - given the same setup as above and given that u128, AztecAddress and Field implement the `Packable` trait\n/// the result we get is:\n/// ```\n/// UintNote {\n/// value: aztec::protocol_types::traits::Packable::unpack([fields[0]]),\n/// owner: aztec::protocol_types::traits::Packable::unpack([fields[1]]),\n/// randomness: aztec::protocol_types::traits::Packable::unpack([fields[2]]),\n/// }\n/// ```\n///\n/// # Panics\n/// - If the deserialization logic encounters a type it does not support.\n/// - If an incorrect number of fields are consumed when deserializing a string.\npub comptime fn generate_deserialize_from_fields(\n name: Quoted,\n typ: Type,\n field_array_name: Quoted,\n num_already_consumed: u32,\n should_unpack: bool,\n) -> (Quoted, u32) {\n let mut result = quote {};\n // Counter for the number of fields consumed\n let mut consumed_counter: u32 = 0;\n\n // If the type implements `Packable`, its length will be assigned to the `maybe_packed_len_typ` variable.\n let maybe_packed_len_typ = std::meta::typ::fresh_type_variable();\n let packable_constraint = quote { Packable<$maybe_packed_len_typ> }.as_trait_constraint();\n\n if (should_unpack & typ.implements(packable_constraint)) {\n // Unpacking is enabled and the given type implements the `Packable` trait so we call the `unpack()`\n // method, add the resulting field array to `aux_vars` and each field to `fields`.\n let packed_len = maybe_packed_len_typ.as_constant().unwrap();\n\n // We copy the packed fields into a new array and pass that to the unpack function in a quote\n let mut packed_fields_quotes = &[];\n for i in 0..packed_len {\n let index_in_field_array = i + num_already_consumed;\n packed_fields_quotes =\n packed_fields_quotes.push_back(quote { $field_array_name[$index_in_field_array] });\n }\n let packed_fields = packed_fields_quotes.join(quote {,});\n\n // Now we call unpack on the type\n let unpack_method = get_trait_impl_method(typ, quote { Packable<_> }, quote { unpack });\n result = quote { $unpack_method([ $packed_fields ]) };\n\n consumed_counter = packed_len;\n } else if typ.is_field() | typ.as_integer().is_some() | typ.is_bool() {\n // The field is a primitive so we just reference it in the field array\n result = quote { $field_array_name[$num_already_consumed] as $typ };\n consumed_counter = 1;\n } else if typ.as_data_type().is_some() {\n // The field is a struct so we iterate over each struct field and recursively call\n // `generate_deserialize_from_fields`\n let (nested_def, generics) = typ.as_data_type().unwrap();\n let nested_name = nested_def.name();\n let mut deserialized_fields_list = &[];\n\n // Iterate over each field in the struct\n for field in nested_def.fields(generics) {\n let (field_name, field_type) = field;\n // Recursively call `generate_deserialize_from_fields` for each field in the struct\n let (deserialized_field, num_consumed_in_recursion) = generate_deserialize_from_fields(\n field_name,\n field_type,\n field_array_name,\n consumed_counter + num_already_consumed,\n should_unpack,\n );\n // We increment the consumed counter by the number of fields consumed in the recursion\n consumed_counter += num_consumed_in_recursion;\n // We add the deserialized field to the list of deserialized fields.\n // E.g. `value: u128 { lo: fields[0], hi: fields[1] }`\n deserialized_fields_list =\n deserialized_fields_list.push_back(quote { $field_name: $deserialized_field });\n }\n\n // We can construct the struct from the deserialized fields\n let deserialized_fields = deserialized_fields_list.join(quote {,});\n result = quote {\n $nested_name {\n $deserialized_fields\n }\n };\n } else if typ.as_array().is_some() {\n // The field is an array so we iterate over each element and recursively call\n // `generate_deserialize_from_fields`\n let (element_type, array_len) = typ.as_array().unwrap();\n let array_len = array_len.as_constant().unwrap();\n let mut array_fields_list = &[];\n\n // Iterate over each element in the array\n for _ in 0..array_len {\n // Recursively call `generate_deserialize_from_fields` for each element in the array\n let (deserialized_field, num_consumed_in_recursion) = generate_deserialize_from_fields(\n name,\n element_type,\n field_array_name,\n consumed_counter + num_already_consumed,\n should_unpack,\n );\n // We increment the consumed counter by the number of fields consumed in the recursion\n consumed_counter += num_consumed_in_recursion;\n // We add the deserialized field to the list of deserialized fields.\n array_fields_list = array_fields_list.push_back(deserialized_field);\n }\n\n // We can construct the array from the deserialized fields\n let array_fields = array_fields_list.join(quote {,});\n result = quote { [ $array_fields ] };\n } else if typ.as_str().is_some() {\n // The field is a string and we expect each byte of the string to be represented as 1 field in the field\n // array. So we iterate over the string length and deserialize each character as u8 in the recursive call\n // to `generate_deserialize_from_fields`.\n let length_type = typ.as_str().unwrap();\n let str_len = length_type.as_constant().unwrap();\n let mut byte_list = &[];\n\n // Iterate over each character in the string\n for _ in 0..str_len {\n // Recursively call `generate_deserialize_from_fields` for each character in the string\n let (deserialized_field, num_consumed_in_recursion) = generate_deserialize_from_fields(\n name,\n quote {u8}.as_type(),\n field_array_name,\n consumed_counter + num_already_consumed,\n should_unpack,\n );\n\n // We should consume just one field in the recursion so we sanity check that\n assert_eq(\n num_consumed_in_recursion,\n 1,\n \"Incorrect number of fields consumed in string deserialization\",\n );\n\n // We increment the consumed counter by 1 as we have consumed one field\n consumed_counter += 1;\n\n // We add the deserialized field to the list of deserialized fields.\n // E.g. `fields[6] as u8`\n byte_list = byte_list.push_back(deserialized_field);\n }\n\n // We construct the string from the deserialized fields\n let bytes = byte_list.join(quote {,});\n result = quote { [ $bytes ].as_str_unchecked() };\n } else {\n panic(\n f\"Unsupported type for serialization of argument {name} and type {typ}\",\n )\n }\n\n (result, consumed_counter)\n}\n\n/// Generates code that serializes a type into an array of fields. Also generates auxiliary variables if necessary\n/// for serialization. If `should_pack` is true, we check if the type implements the `Packable` trait and pack it\n/// if it does.\n///\n/// # Parameters\n/// - `name`: The base identifier (e.g., `self`, `some_var`).\n/// - `typ`: The type being serialized (e.g., a custom struct, array, or primitive type).\n/// - `omit`: A list of field names (as `Quoted`) to be excluded from the serialized output.\n/// - `should_pack`: A boolean indicating whether the type should be packed.\n///\n/// # Returns\n/// A tuple containing:\n/// - A flattened array of `Quoted` field references representing the serialized fields.\n/// - An array of `Quoted` auxiliary variables needed for serialization, such as byte arrays for strings.\n///\n/// # Examples\n///\n/// ## Struct\n/// Given the following struct:\n/// ```rust\n/// struct MockStruct {\n/// a: Field,\n/// b: Field,\n/// }\n/// ```\n///\n/// Serializing the struct:\n/// ```rust\n/// generate_serialize_to_fields(quote { my_mock_struct }, MockStruct, &[], false)\n/// // Returns:\n/// // ([`my_mock_struct.a`, `my_mock_struct.b`], [])\n/// ```\n///\n/// ## Nested Struct\n/// For a more complex struct:\n/// ```rust\n/// struct NestedStruct {\n/// m1: MockStruct,\n/// m2: MockStruct,\n/// }\n/// ```\n///\n/// Serialization output:\n/// ```rust\n/// generate_serialize_to_fields(quote { self }, NestedStruct, &[], false)\n/// // Returns:\n/// // ([`self.m1.a`, `self.m1.b`, `self.m2.a`, `self.m2.b`], [])\n/// ```\n///\n/// ## Array\n/// For an array type:\n/// ```rust\n/// generate_serialize_to_fields(quote { my_array }, [Field; 3], &[], false)\n/// // Returns:\n/// // ([`my_array[0]`, `my_array[1]`, `my_array[2]`], [])\n/// ```\n///\n/// ## String\n/// For a string field, where each character is serialized as a `Field`:\n/// ```rust\n/// generate_serialize_to_fields(quote { my_string }, StringType, &[], false)\n/// // Returns:\n/// // ([`my_string_as_bytes[0] as Field`, `my_string_as_bytes[1] as Field`, ...],\n/// // [`let my_string_as_bytes = my_string.as_bytes()`])\n/// ```\n///\n/// ## Nested Struct with Omitted Field and packing enabled\n/// - u128 has a `Packable` implementation hence it will be packed.\n///\n/// For a more complex struct:\n/// ```rust\n/// struct MyStruct {\n/// value: u128,\n/// value2: Field,\n/// }\n/// ```\n///\n/// Serializing while omitting `value2`:\n/// ```rust\n/// generate_serialize_to_fields(quote { self }, MyStruct, &[quote { self.value2 }], true)\n/// // Returns:\n/// // ([`value_packed[0]`], [`let value_packed = self.value.pack()`])\n/// ```\n///\n/// # Panics\n/// - If the type is unsupported for serialization.\n/// - If the provided `typ` contains invalid constants or incompatible structures.\npub comptime fn generate_serialize_to_fields(\n name: Quoted,\n typ: Type,\n omit: [Quoted],\n should_pack: bool,\n) -> ([Quoted], [Quoted]) {\n let mut fields = &[];\n let mut aux_vars = &[];\n\n // Proceed if none of the omit rules omits this name\n if !omit.any(|to_omit| to_omit == name) {\n // If the type implements `Packable`, its length will be assigned to the `maybe_packed_len_typ` variable.\n let maybe_packed_len_typ = std::meta::typ::fresh_type_variable();\n let packable_constraint =\n quote { crate::traits::Packable<$maybe_packed_len_typ> }.as_trait_constraint();\n\n if (should_pack & typ.implements(packable_constraint)) {\n // Packing is enabled and the given type implements the `Packable` trait so we call the `pack()`\n // method, add the resulting field array to `aux_vars` and each field to `fields`.\n let packed_len = maybe_packed_len_typ.as_constant().unwrap();\n\n // We collapse the name to a one that gets tokenized as a single token (e.g. \"self.value\" -> \"self_value\").\n let name_at_one_token = collapse_to_one_token(name);\n let packed_struct_name = f\"{name_at_one_token}_aux_var\".quoted_contents();\n\n // We add the individual fields to the fields array\n let pack_method = get_trait_impl_method(\n typ,\n quote { crate::traits::Packable<$packed_len> },\n quote { pack },\n );\n let packed_struct = quote { let $packed_struct_name = $pack_method($name) };\n for i in 0..packed_len {\n fields = fields.push_back(quote { $packed_struct_name[$i] });\n }\n\n // We add the new auxiliary variable to the aux_vars array\n aux_vars = aux_vars.push_back(packed_struct);\n } else if typ.is_field() {\n // For field we just add the value to fields\n fields = fields.push_back(name);\n } else if typ.as_integer().is_some() | typ.is_bool() {\n // For integer and bool we just cast to Field and add the value to fields\n fields = fields.push_back(quote { $name as Field });\n } else if typ.as_data_type().is_some() {\n // For struct we pref\n let nested_struct = typ.as_data_type().unwrap();\n let params = nested_struct.0.fields(nested_struct.1);\n let struct_flattened = params.map(|(param_name, param_type): (Quoted, Type)| {\n let maybe_prefixed_name = if name == quote {} {\n // Triggered when the param name is of a value available in the current scope (e.g. a function\n // argument) --> then we don't prefix the name with anything.\n param_name\n } else {\n // Triggered when we want to prefix the param name with the `name` from function input. This\n // can typically be `self` when implementing a method on a struct.\n quote { $name.$param_name }\n };\n generate_serialize_to_fields(\n quote {$maybe_prefixed_name},\n param_type,\n omit,\n should_pack,\n )\n });\n let struct_flattened_fields = struct_flattened.fold(\n &[],\n |acc: [Quoted], (fields, _): (_, [Quoted])| acc.append(fields),\n );\n let struct_flattened_aux_vars = struct_flattened.fold(\n &[],\n |acc: [Quoted], (_, aux_vars): ([Quoted], _)| acc.append(aux_vars),\n );\n fields = fields.append(struct_flattened_fields);\n aux_vars = aux_vars.append(struct_flattened_aux_vars);\n } else if typ.as_array().is_some() {\n // For array we recursively call `generate_serialize_to_fields(...)` for each element\n let (element_type, array_len) = typ.as_array().unwrap();\n let array_len = array_len.as_constant().unwrap();\n for i in 0..array_len {\n let (element_fields, element_aux_vars) = generate_serialize_to_fields(\n quote { $name[$i] },\n element_type,\n omit,\n should_pack,\n );\n fields = fields.append(element_fields);\n aux_vars = aux_vars.append(element_aux_vars);\n }\n } else if typ.as_str().is_some() {\n // For string we convert the value to bytes, we store the `as_bytes` in an auxiliary variables and\n // then we add each byte to fields as a Field\n let length_type = typ.as_str().unwrap();\n let str_len = length_type.as_constant().unwrap();\n let as_member = name.as_expr().unwrap().as_member_access();\n let var_name = if as_member.is_some() {\n as_member.unwrap().1\n } else {\n name\n };\n let as_bytes_name = f\"{var_name}_as_bytes\".quoted_contents();\n let as_bytes = quote { let $as_bytes_name = $name.as_bytes() };\n for i in 0..str_len {\n fields = fields.push_back(quote { $as_bytes_name[$i] as Field });\n }\n aux_vars = aux_vars.push_back(as_bytes);\n } else {\n panic(\n f\"Unsupported type for serialization of argument {name} and type {typ}\",\n )\n }\n }\n (fields, aux_vars)\n}\n\n/// From a quote that gets tokenized to a multiple tokens we collapse it to a single token by replacing all `.` with `_`.\n/// E.g. \"self.values[0]\" -> \"self_values_0_\"\ncomptime fn collapse_to_one_token(q: Quoted) -> Quoted {\n let tokens = q.tokens();\n\n let mut single_token = quote {};\n for token in tokens {\n let new_token = if ((token == quote {.}) | (token == quote {[}) | (token == quote {]})) {\n quote {_}\n } else {\n token\n };\n single_token = f\"{single_token}{new_token}\".quoted_contents();\n }\n single_token\n}\n\npub(crate) comptime fn derive_serialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let (fields, aux_vars) = generate_serialize_to_fields(quote { self }, typ, &[], false);\n let aux_vars_for_serialization = if aux_vars.len() > 0 {\n let joint = aux_vars.join(quote {;});\n quote { $joint; }\n } else {\n quote {}\n };\n\n let field_serializations = fields.join(quote {,});\n let serialized_len = fields.len();\n quote {\n impl Serialize<$serialized_len> for $typ {\n fn serialize(self) -> [Field; $serialized_len] {\n $aux_vars_for_serialization\n [ $field_serializations ]\n }\n }\n }\n}\n\npub(crate) comptime fn derive_deserialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let (fields, _) = generate_serialize_to_fields(quote { self }, typ, &[], false);\n let serialized_len = fields.len();\n let (deserialized, _) =\n generate_deserialize_from_fields(quote { self }, typ, quote { serialized }, 0, false);\n quote {\n impl Deserialize<$serialized_len> for $typ {\n fn deserialize(serialized: [Field; $serialized_len]) -> Self {\n $deserialized\n }\n }\n }\n}\n\n/// Generates `Packable` implementation for a given struct and returns the packed length.\n///\n/// Note: We are having this function separate from `derive_packable` because we use this in the note macros to get\n/// the packed length of a note as well as the `Packable` implementation. We need the length to be able to register\n/// the note in the global `NOTES` map. There the length is used to generate partial note helper functions.\npub comptime fn derive_packable_and_get_packed_len(s: TypeDefinition) -> (Quoted, u32) {\n let packing_enabled = true;\n\n let typ = s.as_type();\n let (fields, aux_vars) =\n generate_serialize_to_fields(quote { self }, typ, &[], packing_enabled);\n let aux_vars_for_packing = if aux_vars.len() > 0 {\n let joint = aux_vars.join(quote {;});\n quote { $joint; }\n } else {\n quote {}\n };\n\n let (unpacked, _) =\n generate_deserialize_from_fields(quote { self }, typ, quote { packed }, 0, packing_enabled);\n\n let field_packings = fields.join(quote {,});\n let packed_len = fields.len();\n let packable_trait: TraitConstraint = quote { Packable<$packed_len> }.as_trait_constraint();\n (\n quote {\n impl $packable_trait for $typ {\n fn pack(self) -> [Field; $packed_len] {\n $aux_vars_for_packing\n [ $field_packings ]\n }\n\n fn unpack(packed: [Field; $packed_len]) -> Self {\n $unpacked\n }\n }\n },\n packed_len,\n )\n}\n\npub(crate) comptime fn derive_packable(s: TypeDefinition) -> Quoted {\n let (packable_impl, _) = derive_packable_and_get_packed_len(s);\n packable_impl\n}\n\n#[derive(Packable, Serialize, Deserialize, Eq)]\npub struct Smol {\n a: Field,\n b: Field,\n}\n\n#[derive(Serialize, Deserialize, Eq)]\npub struct HasArray {\n a: [Field; 2],\n b: bool,\n}\n\n#[derive(Serialize, Deserialize, Eq)]\npub struct Fancier {\n a: Smol,\n b: [Field; 2],\n c: [u8; 3],\n d: str<16>,\n}\n\nfn main() {\n assert(false);\n}\n\n#[test]\nfn smol_test() {\n let smol = Smol { a: 1, b: 2 };\n let serialized = smol.serialize();\n assert(serialized == [1, 2], serialized);\n let deserialized = Smol::deserialize(serialized);\n assert(deserialized == smol);\n\n // None of the struct members implements the `Packable` trait so the packed and serialized data should be the same\n let packed = smol.pack();\n assert_eq(packed, serialized, \"Packed does not match serialized\");\n}\n\n#[test]\nfn has_array_test() {\n let has_array = HasArray { a: [1, 2], b: true };\n let serialized = has_array.serialize();\n assert(serialized == [1, 2, 1], serialized);\n let deserialized = HasArray::deserialize(serialized);\n assert(deserialized == has_array);\n}\n\n#[test]\nfn fancier_test() {\n let fancier =\n Fancier { a: Smol { a: 1, b: 2 }, b: [0, 1], c: [1, 2, 3], d: \"metaprogramming!\" };\n let serialized = fancier.serialize();\n assert(\n serialized\n == [\n 1, 2, 0, 1, 1, 2, 3, 0x6d, 0x65, 0x74, 0x61, 0x70, 0x72, 0x6f, 0x67, 0x72, 0x61,\n 0x6d, 0x6d, 0x69, 0x6e, 0x67, 0x21,\n ],\n serialized,\n );\n let deserialized = Fancier::deserialize(serialized);\n assert(deserialized == fancier);\n}\n"
3786
3786
  },
3787
3787
  "291": {
3788
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/poseidon2.nr",
3788
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/poseidon2.nr",
3789
3789
  "source": "use crate::constants::TWO_POW_64;\n\n// NB: This is a clone of noir/noir-repo/noir_stdlib/src/hash/poseidon2.nr\n// It exists as we sometimes need to perform custom absorption, but the stdlib version\n// has a private absorb() method (it's also designed to just be a hasher)\n// Can be removed when standalone noir poseidon lib exists: See noir#6679\n\ncomptime global RATE: u32 = 3;\n\npub struct Poseidon2Sponge {\n pub cache: [Field; 3],\n pub state: [Field; 4],\n pub cache_size: u32,\n pub squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2Sponge {\n #[no_predicates]\n pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n Poseidon2Sponge::hash_internal(input, message_size, message_size != N)\n }\n\n pub(crate) fn new(iv: Field) -> Poseidon2Sponge {\n let mut result =\n Poseidon2Sponge { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n result.state[RATE] = iv;\n result\n }\n\n fn perform_duplex(&mut self) {\n // add the cache into sponge state\n for i in 0..RATE {\n // We effectively zero-pad the cache by only adding to the state\n // cache that is less than the specified `cache_size`\n if i < self.cache_size {\n self.state[i] += self.cache[i];\n }\n }\n self.state = std::hash::poseidon2_permutation(self.state, 4);\n }\n\n pub fn absorb(&mut self, input: Field) {\n assert(!self.squeeze_mode);\n if self.cache_size == RATE {\n // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n self.perform_duplex();\n self.cache[0] = input;\n self.cache_size = 1;\n } else {\n // If we're absorbing, and the cache is not full, add the input into the cache\n self.cache[self.cache_size] = input;\n self.cache_size += 1;\n }\n }\n\n pub fn squeeze(&mut self) -> Field {\n assert(!self.squeeze_mode);\n // If we're in absorb mode, apply sponge permutation to compress the cache.\n self.perform_duplex();\n self.squeeze_mode = true;\n\n // Pop one item off the top of the permutation and return it.\n self.state[0]\n }\n\n fn hash_internal<let N: u32>(\n input: [Field; N],\n in_len: u32,\n is_variable_length: bool,\n ) -> Field {\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n for i in 0..input.len() {\n if i < in_len {\n sponge.absorb(input[i]);\n }\n }\n\n // In the case where the hash preimage is variable-length, we append `1` to the end of the input, to distinguish\n // from fixed-length hashes. (the combination of this additional field element + the hash IV ensures\n // fixed-length and variable-length hashes do not collide)\n if is_variable_length {\n sponge.absorb(1);\n }\n sponge.squeeze()\n }\n}\n"
3790
3790
  },
3791
3791
  "330": {
3792
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/type_serialization.nr",
3792
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/type_serialization.nr",
3793
3793
  "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"
3794
3794
  },
3795
3795
  "346": {
3796
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/arrays.nr",
3796
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/arrays.nr",
3797
3797
  "source": "pub mod assert_array_appended;\npub mod assert_array_prepended;\npub mod assert_combined_array;\npub mod assert_combined_transformed_array;\npub mod assert_exposed_sorted_transformed_value_array;\npub mod assert_sorted_array;\npub mod assert_sorted_transformed_value_array;\npub mod assert_split_sorted_transformed_value_arrays;\npub mod assert_split_transformed_value_arrays;\npub mod get_sorted_result;\npub mod get_sorted_tuple;\npub mod sort_by;\npub mod sort_by_counter;\n\n// Re-exports.\npub use assert_array_appended::{\n assert_array_appended, assert_array_appended_and_scoped, assert_array_appended_reversed,\n assert_array_appended_scoped,\n};\npub use assert_array_prepended::assert_array_prepended;\npub use assert_combined_array::{assert_combined_array, combine_arrays};\npub use assert_combined_transformed_array::{\n assert_combined_transformed_array, combine_and_transform_arrays,\n};\npub use assert_exposed_sorted_transformed_value_array::{\n assert_exposed_sorted_transformed_value_array,\n get_order_hints::{get_order_hints_asc, get_order_hints_desc, OrderHint},\n};\npub use assert_sorted_array::assert_sorted_array;\npub use assert_sorted_transformed_value_array::{\n assert_sorted_transformed_value_array, assert_sorted_transformed_value_array_capped_size,\n};\npub use assert_split_sorted_transformed_value_arrays::{\n assert_split_sorted_transformed_value_arrays_asc,\n assert_split_sorted_transformed_value_arrays_desc,\n get_split_order_hints::{get_split_order_hints_asc, get_split_order_hints_desc, SplitOrderHints},\n};\npub use assert_split_transformed_value_arrays::assert_split_transformed_value_arrays;\npub use get_sorted_result::{get_sorted_result, SortedResult};\npub use sort_by_counter::{sort_by_counter_asc, sort_by_counter_desc};\n\nuse crate::traits::{Empty, is_empty};\n\npub fn subarray<let SRC_LEN: u32, let DST_LEN: u32>(\n src: [Field; SRC_LEN],\n offset: u32,\n) -> [Field; DST_LEN] {\n assert(offset + DST_LEN <= SRC_LEN, \"offset too large\");\n\n let mut dst: [Field; DST_LEN] = std::mem::zeroed();\n for i in 0..DST_LEN {\n dst[i] = src[i + offset];\n }\n\n dst\n}\n\n// Helper function to convert a validated array to BoundedVec.\n// Important: Only use it for validated arrays: validate_array(array) should be true.\npub unconstrained fn array_to_bounded_vec<T, let N: u32>(array: [T; N]) -> BoundedVec<T, N>\nwhere\n T: Empty + Eq,\n{\n let len = array_length(array);\n BoundedVec::from_parts_unchecked(array, len)\n}\n\n// Helper function to find the index of the first element in an array that satisfies a given predicate. If the element\n// is not found, the function returns N as the index.\npub unconstrained fn find_index_hint<T, let N: u32, Env>(\n array: [T; N],\n find: fn[Env](T) -> bool,\n) -> u32 {\n let mut index = N;\n for i in 0..N {\n // We check `index == N` to ensure that we only update the index if we haven't found a match yet.\n if (index == N) & find(array[i]) {\n index = i;\n }\n }\n index\n}\n\n// Routine which validates that all zero values of an array form a contiguous region at the end, i.e.,\n// of the form: [*,*,*...,0,0,0,0] where any * is non-zero. Note that a full array of non-zero values is\n// valid.\npub fn validate_array<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty + Eq,\n{\n let mut seen_empty = false;\n let mut length = 0;\n for i in 0..N {\n if is_empty(array[i]) {\n seen_empty = true;\n } else {\n assert(seen_empty == false, \"invalid array\");\n length += 1;\n }\n }\n length\n}\n\n// Helper function to count the number of non-empty elements in a validated array.\n// Important: Only use it for validated arrays where validate_array(array) returns true,\n// which ensures that:\n// 1. All elements before the first empty element are non-empty\n// 2. All elements after and including the first empty element are empty\n// 3. The array forms a contiguous sequence of non-empty elements followed by empty elements\npub fn array_length<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty + Eq,\n{\n // We get the length by checking the index of the first empty element.\n\n // Safety: This is safe because we have validated the array (see function doc above) and the emptiness\n // of the element and non-emptiness of the previous element is checked below.\n let length = unsafe { find_index_hint(array, |elem: T| is_empty(elem)) };\n if length != 0 {\n assert(!is_empty(array[length - 1]));\n }\n if length != N {\n assert(is_empty(array[length]));\n }\n length\n}\n\npub fn array_concat<T, let N: u32, let M: u32>(array1: [T; N], array2: [T; M]) -> [T; N + M] {\n let mut result = [array1[0]; N + M];\n for i in 1..N {\n result[i] = array1[i];\n }\n for i in 0..M {\n result[i + N] = array2[i];\n }\n result\n}\n/// This function assumes that `array1` and `array2` contain no more than N non-empty elements between them,\n/// if this is not the case then elements from the end of `array2` will be dropped.\npub fn array_merge<T, let N: u32>(array1: [T; N], array2: [T; N]) -> [T; N]\nwhere\n T: Empty + Eq,\n{\n // Safety: we constrain this array below\n let result = unsafe { array_merge_helper(array1, array2) };\n // We assume arrays have been validated. The only use cases so far are with previously validated arrays.\n let array1_len = array_length(array1);\n let mut add_from_left = true;\n for i in 0..N {\n add_from_left &= i != array1_len;\n if add_from_left {\n assert_eq(result[i], array1[i]);\n } else {\n assert_eq(result[i], array2[i - array1_len]);\n }\n }\n result\n}\n\nunconstrained fn array_merge_helper<T, let N: u32>(array1: [T; N], array2: [T; N]) -> [T; N]\nwhere\n T: Empty + Eq,\n{\n let mut result: [T; N] = [T::empty(); N];\n let mut i = 0;\n for elem in array1 {\n if !is_empty(elem) {\n result[i] = elem;\n i += 1;\n }\n }\n for elem in array2 {\n if !is_empty(elem) {\n result[i] = elem;\n i += 1;\n }\n }\n result\n}\n\n// Helper fn to create a subarray from a given array\npub fn array_splice<T, let N: u32, let M: u32>(array: [T; N], offset: u32) -> [T; M]\nwhere\n T: Empty,\n{\n assert(M + offset <= N, \"Subarray length larger than array length\");\n let mut result: [T; M] = [T::empty(); M];\n for i in 0..M {\n result[i] = array[offset + i];\n }\n result\n}\n\npub fn check_permutation<T, let N: u32>(\n original_array: [T; N],\n permuted_array: [T; N],\n original_indexes: [u32; N],\n)\nwhere\n T: Eq + Empty,\n{\n let mut seen_value = [false; N];\n for i in 0..N {\n let index = original_indexes[i];\n let original_value = original_array[index];\n assert(permuted_array[i].eq(original_value), \"Invalid index\");\n assert(!seen_value[index], \"Duplicated index\");\n seen_value[index] = true;\n }\n}\n\n// Helper function to find the index of the last element in an array, allowing empty elements.\n// e.g. useful for removing trailing 0s from [1, 0, 2, 0, 0, 0] -> [1, 0, 2]\n// Nothing to do with validated arrays. Correctness constrained by padded_array_length.\npub unconstrained fn find_last_value_index<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty + Eq,\n{\n let mut index = N;\n for i in 0..N {\n let j = N - i - 1;\n // We check `index == N` to ensure that we only update the index if we haven't found a match yet.\n if (index == N) & !is_empty(array[j]) {\n index = j;\n }\n }\n index\n}\n\n// Routine which returns the length of an array right padded by empty elements\n// of the form: [*,*,*...,0,0,0,0] where * is any value (zeroes allowed).\n// See smoke_validate_array_trailing for examples.\n// Nothing to do with validated arrays. Correctness constrained by padded_array_length.\npub unconstrained fn unsafe_padded_array_length<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty + Eq,\n{\n let index = find_last_value_index(array);\n if index == N {\n 0\n } else {\n index + 1\n }\n}\n\n// Routine which validates that zero values of an array form a contiguous region at the end, i.e.,\n// of the form: [*,*,*...,0,0,0,0] where * is any value (zeroes allowed).\npub fn padded_array_length<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty + Eq,\n{\n // Safety: this value is constrained in the below loop.\n let length = unsafe { unsafe_padded_array_length(array) };\n // Check the elt just before length is non-zero:\n if length != 0 {\n assert(!is_empty(array[length - 1]), \"invalid right padded array\");\n }\n // Check all beyond length are zero:\n let mut check_zero = false;\n for i in 0..N {\n check_zero |= i == length;\n if check_zero {\n assert(is_empty(array[i]), \"invalid right padded array\");\n }\n }\n length\n}\n\n#[test]\nfn smoke_validate_array() {\n let valid_array: [Field; 0] = [];\n assert(validate_array(valid_array) == 0);\n\n let valid_array = [0];\n assert(validate_array(valid_array) == 0);\n\n let valid_array = [3];\n assert(validate_array(valid_array) == 1);\n\n let valid_array = [1, 2, 3];\n assert(validate_array(valid_array) == 3);\n\n let valid_array = [1, 2, 3, 0];\n assert(validate_array(valid_array) == 3);\n\n let valid_array = [1, 2, 3, 0, 0];\n assert(validate_array(valid_array) == 3);\n}\n\n#[test]\nfn smoke_validate_array_trailing() {\n let valid_array: [Field; 0] = [];\n assert(padded_array_length(valid_array) == 0);\n\n let valid_array = [0];\n assert(padded_array_length(valid_array) == 0);\n\n let valid_array = [3];\n assert(padded_array_length(valid_array) == 1);\n\n let valid_array = [1, 0, 3];\n assert(padded_array_length(valid_array) == 3);\n\n let valid_array = [1, 0, 3, 0];\n assert(padded_array_length(valid_array) == 3);\n\n let valid_array = [1, 2, 3, 0, 0];\n assert(padded_array_length(valid_array) == 3);\n\n let valid_array = [0, 0, 3, 0, 0];\n assert(padded_array_length(valid_array) == 3);\n}\n\n#[test(should_fail_with = \"invalid array\")]\nfn smoke_validate_array_invalid_case0() {\n let invalid_array = [0, 1];\n let _ = validate_array(invalid_array);\n}\n\n#[test(should_fail_with = \"invalid array\")]\nfn smoke_validate_array_invalid_case1() {\n let invalid_array = [1, 0, 0, 1, 0];\n let _ = validate_array(invalid_array);\n}\n\n#[test(should_fail_with = \"invalid array\")]\nfn smoke_validate_array_invalid_case2() {\n let invalid_array = [0, 0, 0, 0, 1];\n let _ = validate_array(invalid_array);\n}\n\n#[test]\nfn test_empty_array_length() {\n assert_eq(array_length([0]), 0);\n assert_eq(array_length([0, 0, 0]), 0);\n}\n\n#[test]\nfn test_array_length() {\n assert_eq(array_length([123]), 1);\n assert_eq(array_length([123, 0, 0]), 1);\n assert_eq(array_length([123, 456]), 2);\n assert_eq(array_length([123, 456, 0]), 2);\n}\n\n#[test]\nfn test_array_length_invalid_arrays() {\n // Result can be misleading (but correct) for invalid arrays.\n assert_eq(array_length([0, 0, 123]), 0);\n assert_eq(array_length([0, 123, 0]), 0);\n assert_eq(array_length([0, 123, 456]), 0);\n assert_eq(array_length([123, 0, 456]), 1);\n}\n\n#[test]\nunconstrained fn find_index_greater_than_min() {\n let values = [10, 20, 30, 40];\n let min = 22;\n let index = find_index_hint(values, |v: Field| min.lt(v));\n assert_eq(index, 2);\n}\n\n#[test]\nunconstrained fn find_index_not_found() {\n let values = [10, 20, 30, 40];\n let min = 100;\n let index = find_index_hint(values, |v: Field| min.lt(v));\n assert_eq(index, 4);\n}\n\n#[test]\nfn test_array_concat() {\n let array0 = [1, 2, 3];\n let array1 = [4, 5];\n let concatenated = array_concat(array0, array1);\n assert_eq(concatenated, [1, 2, 3, 4, 5]);\n}\n\n#[test]\nfn check_permutation_basic_test() {\n let original_array = [1, 2, 3];\n let permuted_array = [3, 1, 2];\n let indexes = [2, 0, 1];\n check_permutation(original_array, permuted_array, indexes);\n}\n\n#[test(should_fail_with = \"Duplicated index\")]\nfn check_permutation_duplicated_index() {\n let original_array = [0, 1, 0];\n let permuted_array = [1, 0, 0];\n let indexes = [1, 0, 0];\n check_permutation(original_array, permuted_array, indexes);\n}\n\n#[test(should_fail_with = \"Invalid index\")]\nfn check_permutation_invalid_index() {\n let original_array = [0, 1, 2];\n let permuted_array = [1, 0, 0];\n let indexes = [1, 0, 2];\n check_permutation(original_array, permuted_array, indexes);\n}\n"
3798
3798
  },
3799
3799
  "349": {
3800
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/reader.nr",
3800
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/reader.nr",
3801
3801
  "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"
3802
3802
  },
3803
3803
  "46": {
@@ -3809,15 +3809,15 @@
3809
3809
  "source": "pub fn panic<T, U, let N: u32>(message: fmtstr<N, T>) -> U {\n assert(false, message);\n crate::mem::zeroed()\n}\n"
3810
3810
  },
3811
3811
  "54": {
3812
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/noir-contracts/contracts/router_contract/src/main.nr",
3812
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/router_contract/src/main.nr",
3813
3813
  "source": "mod test;\nmod utils;\n\nuse dep::aztec::macros::aztec;\n\n/// The purpose of this contract is to perform a check in public without revealing what contract enqueued the public\n/// call. This is achieved by having a private function on this contract that enqueues the public call and hence\n/// the `msg_sender` in the public call is the address of this contract.\n#[aztec]\npub contract Router {\n use aztec::{macros::functions::{internal, private, public, view}, utils::comparison::compare};\n\n // docs:start:check_timestamp\n /// Asserts that the current timestamp in the enqueued public call satisfies the `operation` with respect\n /// to the `value.\n #[private]\n fn check_timestamp(operation: u8, value: u64) {\n Router::at(context.this_address())._check_timestamp(operation, value).enqueue_view(\n &mut context,\n );\n }\n\n #[public]\n #[internal]\n #[view]\n fn _check_timestamp(operation: u8, value: u64) {\n let lhs_field = context.timestamp() as Field;\n let rhs_field = value as Field;\n assert(compare(lhs_field, operation, rhs_field), \"Timestamp mismatch.\");\n }\n // docs:end:check_timestamp\n\n /// Asserts that the current block number in the enqueued public call satisfies the `operation` with respect\n /// to the `value.\n #[private]\n fn check_block_number(operation: u8, value: Field) {\n Router::at(context.this_address())._check_block_number(operation, value).enqueue_view(\n &mut context,\n );\n }\n\n #[public]\n #[internal]\n #[view]\n fn _check_block_number(operation: u8, value: Field) {\n assert(compare(context.block_number(), operation, value), \"Block number mismatch.\");\n }\n}\n"
3814
3814
  },
3815
3815
  "57": {
3816
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/capsules/mod.nr",
3816
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/capsules/mod.nr",
3817
3817
  "source": "use crate::oracle::capsules;\nuse protocol_types::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// A dynamically sized array backed by PXE's non-volatile database (called capsules). Values are persisted until\n/// deleted, so they can be e.g. stored during simulation of a transaction and later retrieved during witness\n/// generation. All values are scoped per contract address, so external contracts cannot access them.\npub struct CapsuleArray<T> {\n contract_address: AztecAddress,\n /// The base slot is where the array length is stored in capsules. Array elements are stored in consecutive slots\n /// after the base slot. For example, with base slot 5: the length is at slot 5, the first element (index 0) is at\n /// slot 6, the second element (index 1) is at slot 7, and so on.\n base_slot: Field,\n}\n\nimpl<T, let N: u32> CapsuleArray<T>\nwhere\n T: Serialize<N> + Deserialize<N>,\n{\n /// Returns a CapsuleArray connected to a contract's capsules at a base slot. Array elements are stored in\n /// contiguous slots following the base slot, so there should be sufficient space between array base slots to\n /// accommodate elements. A reasonable strategy is to make the base slot a hash of a unique value.\n pub unconstrained fn at(contract_address: AztecAddress, base_slot: Field) -> Self {\n Self { contract_address, base_slot }\n }\n\n /// Returns the number of elements stored in the array.\n pub unconstrained fn len(self) -> u32 {\n // An uninitialized array defaults to a length of 0.\n capsules::load(self.contract_address, self.base_slot).unwrap_or(0) as u32\n }\n\n /// Stores a value at the end of the array.\n pub unconstrained fn push(self, value: T) {\n let current_length = self.len();\n\n // The slot corresponding to the index `current_length` is the first slot immediately after the end of the\n // array, which is where we want to place the new value.\n capsules::store(self.contract_address, self.slot_at(current_length), value);\n\n // Then we simply update the length.\n let new_length = current_length + 1;\n capsules::store(self.contract_address, self.base_slot, new_length);\n }\n\n /// Retrieves the value stored in the array at `index`. Throws if the index is out of bounds.\n pub unconstrained fn get(self, index: u32) -> T {\n assert(index < self.len(), \"Attempted to read past the length of a CapsuleArray\");\n\n capsules::load(self.contract_address, self.slot_at(index)).unwrap()\n }\n\n /// Deletes the value stored in the array at `index`. Throws if the index is out of bounds.\n pub unconstrained fn remove(self, index: u32) {\n let current_length = self.len();\n assert(index < current_length, \"Attempted to delete past the length of a CapsuleArray\");\n\n // In order to be able to remove elements at arbitrary indices, we need to shift the entire contents of the\n // array past the removed element one slot backward so that we don't end up with a gap and preserve the\n // contiguous slots. We can skip this when deleting the last element however.\n if index != current_length - 1 {\n // The source and destination regions overlap, but `copy` supports this.\n capsules::copy(\n self.contract_address,\n self.slot_at(index + 1),\n self.slot_at(index),\n current_length - index - 1,\n );\n }\n\n // We can now delete the last element (which has either been copied to the slot immediately before it, or was\n // the element we meant to delete in the first place) and update the length.\n capsules::delete(self.contract_address, self.slot_at(current_length - 1));\n capsules::store(self.contract_address, self.base_slot, current_length - 1);\n }\n\n unconstrained fn slot_at(self, index: u32) -> Field {\n // Elements are stored immediately after the base slot, so we add 1 to it to compute the slot for the first\n // element.\n self.base_slot + 1 + index as Field\n }\n}\n\nmod test {\n use crate::test::helpers::test_environment::TestEnvironment;\n use super::CapsuleArray;\n use protocol_types::address::AztecAddress;\n\n global SLOT: Field = 1230;\n\n unconstrained fn setup() -> AztecAddress {\n TestEnvironment::new().unkonstrained().this_address()\n }\n\n #[test]\n unconstrained fn empty_array() {\n let contract_address = setup();\n\n let array: CapsuleArray<Field> = CapsuleArray::at(contract_address, SLOT);\n assert_eq(array.len(), 0);\n }\n\n #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n unconstrained fn empty_array_read() {\n let contract_address = setup();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n let _: Field = array.get(0);\n }\n\n #[test]\n unconstrained fn array_push() {\n let contract_address = setup();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n array.push(5);\n\n assert_eq(array.len(), 1);\n assert_eq(array.get(0), 5);\n }\n\n #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n unconstrained fn read_past_len() {\n let contract_address = setup();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n array.push(5);\n\n let _ = array.get(1);\n }\n\n #[test]\n unconstrained fn array_remove_last() {\n let contract_address = setup();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(5);\n array.remove(0);\n\n assert_eq(array.len(), 0);\n }\n\n #[test]\n unconstrained fn array_remove_some() {\n let contract_address = setup();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(7);\n array.push(8);\n array.push(9);\n\n assert_eq(array.len(), 3);\n assert_eq(array.get(0), 7);\n assert_eq(array.get(1), 8);\n assert_eq(array.get(2), 9);\n\n array.remove(1);\n\n assert_eq(array.len(), 2);\n assert_eq(array.get(0), 7);\n assert_eq(array.get(1), 9);\n }\n\n #[test]\n unconstrained fn array_remove_all() {\n let contract_address = setup();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(7);\n array.push(8);\n array.push(9);\n\n array.remove(1);\n array.remove(1);\n array.remove(0);\n\n assert_eq(array.len(), 0);\n }\n}\n"
3818
3818
  },
3819
3819
  "58": {
3820
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/context/call_interfaces.nr",
3820
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/call_interfaces.nr",
3821
3821
  "source": "use dep::protocol_types::{\n abis::function_selector::FunctionSelector,\n address::AztecAddress,\n traits::{Deserialize, ToField},\n};\n\nuse crate::context::{gas::GasOpts, private_context::PrivateContext, public_context::PublicContext};\n\nuse crate::hash::{hash_args, hash_calldata};\nuse crate::oracle::execution_cache;\n\npub trait CallInterface<let N: u32> {\n fn get_args(self) -> [Field];\n fn get_selector(self) -> FunctionSelector;\n fn get_name(self) -> str<N>;\n fn get_contract_address(self) -> AztecAddress;\n fn get_is_static(self) -> bool;\n}\n\n// PrivateCallInterface\n\npub struct PrivateCallInterface<let N: u32, T> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args_hash: Field,\n args: [Field],\n return_type: T,\n is_static: bool,\n}\n\nimpl<let N: u32, T> PrivateCallInterface<N, T> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n is_static: bool,\n ) -> Self {\n let args_hash = hash_args(args);\n Self {\n target_contract,\n selector,\n name,\n args_hash,\n args,\n return_type: std::mem::zeroed(),\n is_static,\n }\n }\n\n pub fn call<let M: u32>(self, context: &mut PrivateContext) -> T\n where\n T: Deserialize<M>,\n {\n execution_cache::store(self.args, self.args_hash);\n let returns_hash = context.call_private_function_with_args_hash(\n self.target_contract,\n self.selector,\n self.args_hash,\n false,\n );\n let returns: T = returns_hash.get_preimage();\n returns\n }\n\n pub fn view<let M: u32>(self, context: &mut PrivateContext) -> T\n where\n T: Deserialize<M>,\n {\n execution_cache::store(self.args, self.args_hash);\n let returns_hash = context.call_private_function_with_args_hash(\n self.target_contract,\n self.selector,\n self.args_hash,\n true,\n );\n returns_hash.get_preimage()\n }\n}\n\nimpl<let N: u32, T> CallInterface<N> for PrivateCallInterface<N, T> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n\n// PrivateVoidCallInterface\n\npub struct PrivateVoidCallInterface<let N: u32> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args_hash: Field,\n args: [Field],\n return_type: (), // Unit type () indicates this interface is for functions that return nothing (void)\n is_static: bool,\n}\n\nimpl<let N: u32> PrivateVoidCallInterface<N> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n is_static: bool,\n ) -> Self {\n let args_hash = hash_args(args);\n Self { target_contract, selector, name, args_hash, args, return_type: (), is_static }\n }\n\n pub fn call(self, context: &mut PrivateContext) {\n execution_cache::store(self.args, self.args_hash);\n context\n .call_private_function_with_args_hash(\n self.target_contract,\n self.selector,\n self.args_hash,\n false,\n )\n .assert_empty();\n }\n\n pub fn view(self, context: &mut PrivateContext) {\n execution_cache::store(self.args, self.args_hash);\n context\n .call_private_function_with_args_hash(\n self.target_contract,\n self.selector,\n self.args_hash,\n true,\n )\n .assert_empty();\n }\n}\n\nimpl<let N: u32> CallInterface<N> for PrivateVoidCallInterface<N> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n\n// PrivateStaticCallInterface\n\npub struct PrivateStaticCallInterface<let N: u32, T> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args_hash: Field,\n args: [Field],\n return_type: T,\n is_static: bool,\n}\n\nimpl<let N: u32, T> PrivateStaticCallInterface<N, T> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n ) -> Self {\n let args_hash = hash_args(args);\n Self {\n target_contract,\n selector,\n name,\n args_hash,\n args,\n return_type: std::mem::zeroed(),\n is_static: true,\n }\n }\n\n pub fn view<let M: u32>(self, context: &mut PrivateContext) -> T\n where\n T: Deserialize<M>,\n {\n execution_cache::store(self.args, self.args_hash);\n let returns = context.call_private_function_with_args_hash(\n self.target_contract,\n self.selector,\n self.args_hash,\n true,\n );\n returns.get_preimage()\n }\n}\n\nimpl<let N: u32, T> CallInterface<N> for PrivateStaticCallInterface<N, T> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n\n// PrivateStaticVoidCallInterface\n\npub struct PrivateStaticVoidCallInterface<let N: u32> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args_hash: Field,\n args: [Field],\n return_type: (), // Unit type () indicates this interface is for functions that return nothing (void)\n is_static: bool,\n}\n\nimpl<let N: u32> PrivateStaticVoidCallInterface<N> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n ) -> Self {\n let args_hash = hash_args(args);\n Self { target_contract, selector, name, args_hash, args, return_type: (), is_static: true }\n }\n\n pub fn view(self, context: &mut PrivateContext) {\n execution_cache::store(self.args, self.args_hash);\n context\n .call_private_function_with_args_hash(\n self.target_contract,\n self.selector,\n self.args_hash,\n true,\n )\n .assert_empty();\n }\n}\n\nimpl<let N: u32> CallInterface<N> for PrivateStaticVoidCallInterface<N> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n\n// PublicCallInterface\n\npub struct PublicCallInterface<let N: u32, T> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n gas_opts: GasOpts,\n return_type: T,\n is_static: bool,\n}\n\nimpl<let N: u32, T> PublicCallInterface<N, T> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n is_static: bool,\n ) -> Self {\n Self {\n target_contract,\n selector,\n name,\n args,\n gas_opts: GasOpts::default(),\n return_type: std::mem::zeroed(),\n is_static,\n }\n }\n\n pub fn with_gas(self: &mut Self, gas_opts: GasOpts) -> &mut Self {\n self.gas_opts = gas_opts;\n self\n }\n\n pub unconstrained fn call<let M: u32>(self, context: &mut PublicContext) -> T\n where\n T: Deserialize<M>,\n {\n let returns = context.call_public_function(\n self.target_contract,\n self.selector,\n self.args,\n self.gas_opts,\n );\n Deserialize::deserialize(returns.as_array::<M>())\n }\n\n pub unconstrained fn view<let M: u32>(self, context: &mut PublicContext) -> T\n where\n T: Deserialize<M>,\n {\n let returns = context.static_call_public_function(\n self.target_contract,\n self.selector,\n self.args,\n self.gas_opts,\n );\n Deserialize::deserialize(returns.as_array::<M>())\n }\n\n pub fn enqueue(self, context: &mut PrivateContext) {\n let calldata = self.args.push_front(self.selector.to_field());\n let calldata_hash = hash_calldata(calldata);\n execution_cache::store(calldata, calldata_hash);\n context.call_public_function_with_calldata_hash(\n self.target_contract,\n calldata_hash,\n /*static=*/\n false,\n )\n }\n\n pub fn enqueue_view(self, context: &mut PrivateContext) {\n let calldata = self.args.push_front(self.selector.to_field());\n let calldata_hash = hash_calldata(calldata);\n execution_cache::store(calldata, calldata_hash);\n context.call_public_function_with_calldata_hash(\n self.target_contract,\n calldata_hash,\n /*static=*/\n true,\n )\n }\n}\n\nimpl<let N: u32, T> CallInterface<N> for PublicCallInterface<N, T> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n\n// PublicVoidCallInterface\n\npub struct PublicVoidCallInterface<let N: u32> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n return_type: (), // Unit type () indicates this interface is for functions that return nothing (void)\n is_static: bool,\n gas_opts: GasOpts,\n}\n\nimpl<let N: u32> PublicVoidCallInterface<N> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n is_static: bool,\n ) -> Self {\n Self {\n target_contract,\n selector,\n name,\n args,\n return_type: (),\n is_static,\n gas_opts: GasOpts::default(),\n }\n }\n\n pub fn with_gas(self: &mut Self, gas_opts: GasOpts) -> &mut Self {\n self.gas_opts = gas_opts;\n self\n }\n\n pub unconstrained fn call(self, context: &mut PublicContext) {\n let returns = context.call_public_function(\n self.target_contract,\n self.selector,\n self.args,\n self.gas_opts,\n );\n assert(returns.len() == 0);\n }\n\n pub unconstrained fn view(self, context: &mut PublicContext) {\n let returns = context.static_call_public_function(\n self.target_contract,\n self.selector,\n self.args,\n self.gas_opts,\n );\n assert(returns.len() == 0);\n }\n\n pub fn enqueue(self, context: &mut PrivateContext) {\n let calldata = self.args.push_front(self.selector.to_field());\n let calldata_hash = hash_calldata(calldata);\n execution_cache::store(calldata, calldata_hash);\n context.call_public_function_with_calldata_hash(\n self.target_contract,\n calldata_hash,\n /*static=*/\n false,\n )\n }\n\n pub fn enqueue_view(self, context: &mut PrivateContext) {\n let calldata = self.args.push_front(self.selector.to_field());\n let calldata_hash = hash_calldata(calldata);\n execution_cache::store(calldata, calldata_hash);\n context.call_public_function_with_calldata_hash(\n self.target_contract,\n calldata_hash,\n /*static=*/\n true,\n )\n }\n\n pub fn set_as_teardown(self, context: &mut PrivateContext) {\n let calldata = self.args.push_front(self.selector.to_field());\n let calldata_hash = hash_calldata(calldata);\n execution_cache::store(calldata, calldata_hash);\n context.set_public_teardown_function_with_calldata_hash(\n self.target_contract,\n calldata_hash,\n false,\n )\n }\n}\n\nimpl<let N: u32> CallInterface<N> for PublicVoidCallInterface<N> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n\n// PublicStaticCallInterface\n\npub struct PublicStaticCallInterface<let N: u32, T> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n return_type: T,\n is_static: bool,\n gas_opts: GasOpts,\n}\n\nimpl<let N: u32, T> PublicStaticCallInterface<N, T> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n ) -> Self {\n Self {\n target_contract,\n selector,\n name,\n args,\n return_type: std::mem::zeroed(),\n is_static: true,\n gas_opts: GasOpts::default(),\n }\n }\n\n pub fn with_gas(self: &mut Self, gas_opts: GasOpts) -> &mut Self {\n self.gas_opts = gas_opts;\n self\n }\n\n pub unconstrained fn view<let M: u32>(self, context: &mut PublicContext) -> T\n where\n T: Deserialize<M>,\n {\n let returns = context.static_call_public_function(\n self.target_contract,\n self.selector,\n self.args,\n self.gas_opts,\n );\n Deserialize::deserialize(returns.as_array::<M>())\n }\n\n pub fn enqueue_view(self, context: &mut PrivateContext) {\n let calldata = self.args.push_front(self.selector.to_field());\n let calldata_hash = hash_calldata(calldata);\n execution_cache::store(calldata, calldata_hash);\n context.call_public_function_with_calldata_hash(\n self.target_contract,\n calldata_hash,\n /*static=*/\n true,\n )\n }\n}\n\nimpl<let N: u32, T> CallInterface<N> for PublicStaticCallInterface<N, T> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n\n// PublicStaticVoidCallInterface\n\npub struct PublicStaticVoidCallInterface<let N: u32> {\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n return_type: (), // Unit type () indicates this interface is for functions that return nothing (void)\n is_static: bool,\n gas_opts: GasOpts,\n}\n\nimpl<let N: u32> PublicStaticVoidCallInterface<N> {\n pub fn new(\n target_contract: AztecAddress,\n selector: FunctionSelector,\n name: str<N>,\n args: [Field],\n ) -> Self {\n Self {\n target_contract,\n selector,\n name,\n args,\n return_type: (),\n is_static: true,\n gas_opts: GasOpts::default(),\n }\n }\n\n pub fn with_gas(self: &mut Self, gas_opts: GasOpts) -> &mut Self {\n self.gas_opts = gas_opts;\n self\n }\n\n pub unconstrained fn view(self, context: &mut PublicContext) {\n let returns = context.static_call_public_function(\n self.target_contract,\n self.selector,\n self.args,\n self.gas_opts,\n );\n assert(returns.len() == 0);\n }\n\n pub fn enqueue_view(self, context: &mut PrivateContext) {\n let calldata = self.args.push_front(self.selector.to_field());\n let calldata_hash = hash_calldata(calldata);\n execution_cache::store(calldata, calldata_hash);\n context.call_public_function_with_calldata_hash(\n self.target_contract,\n calldata_hash,\n /*static=*/\n true,\n )\n }\n}\n\nimpl<let N: u32> CallInterface<N> for PublicStaticVoidCallInterface<N> {\n fn get_args(self) -> [Field] {\n self.args\n }\n\n fn get_selector(self) -> FunctionSelector {\n self.selector\n }\n\n fn get_name(self) -> str<N> {\n self.name\n }\n\n fn get_contract_address(self) -> AztecAddress {\n self.target_contract\n }\n\n fn get_is_static(self) -> bool {\n self.is_static\n }\n}\n"
3822
3822
  },
3823
3823
  "6": {
@@ -3825,35 +3825,35 @@
3825
3825
  "source": "use crate::{cmp::Eq, convert::From, runtime::is_unconstrained, static_assert};\n\n/// A `BoundedVec<T, MaxLen>` is a growable storage similar to a `Vec<T>` except that it\n/// is bounded with a maximum possible length. Unlike `Vec`, `BoundedVec` is not implemented\n/// via slices and thus is not subject to the same restrictions slices are (notably, nested\n/// slices - and thus nested vectors as well - are disallowed).\n///\n/// Since a BoundedVec is backed by a normal array under the hood, growing the BoundedVec by\n/// pushing an additional element is also more efficient - the length only needs to be increased\n/// by one.\n///\n/// For these reasons `BoundedVec<T, N>` should generally be preferred over `Vec<T>` when there\n/// is a reasonable maximum bound that can be placed on the vector.\n///\n/// Example:\n///\n/// ```noir\n/// let mut vector: BoundedVec<Field, 10> = BoundedVec::new();\n/// for i in 0..5 {\n/// vector.push(i);\n/// }\n/// assert(vector.len() == 5);\n/// assert(vector.max_len() == 10);\n/// ```\npub struct BoundedVec<T, let MaxLen: u32> {\n storage: [T; MaxLen],\n len: u32,\n}\n\nimpl<T, let MaxLen: u32> BoundedVec<T, MaxLen> {\n /// Creates a new, empty vector of length zero.\n ///\n /// Since this container is backed by an array internally, it still needs an initial value\n /// to give each element. To resolve this, each element is zeroed internally. This value\n /// is guaranteed to be inaccessible unless `get_unchecked` is used.\n ///\n /// Example:\n ///\n /// ```noir\n /// let empty_vector: BoundedVec<Field, 10> = BoundedVec::new();\n /// assert(empty_vector.len() == 0);\n /// ```\n ///\n /// Note that whenever calling `new` the maximum length of the vector should always be specified\n /// via a type signature:\n ///\n /// ```noir\n /// fn good() -> BoundedVec<Field, 10> {\n /// // Ok! MaxLen is specified with a type annotation\n /// let v1: BoundedVec<Field, 3> = BoundedVec::new();\n /// let v2 = BoundedVec::new();\n ///\n /// // Ok! MaxLen is known from the type of `good`'s return value\n /// v2\n /// }\n ///\n /// fn bad() {\n /// // Error: Type annotation needed\n /// // The compiler can't infer `MaxLen` from the following code:\n /// let mut v3 = BoundedVec::new();\n /// v3.push(5);\n /// }\n /// ```\n ///\n /// This defaulting of `MaxLen` (and numeric generics in general) to zero may change in future noir versions\n /// but for now make sure to use type annotations when using bounded vectors. Otherwise, you will receive a\n /// constraint failure at runtime when the vec is pushed to.\n pub fn new() -> Self {\n let zeroed = crate::mem::zeroed();\n BoundedVec { storage: [zeroed; MaxLen], len: 0 }\n }\n\n /// Retrieves an element from the vector at the given index, starting from zero.\n ///\n /// If the given index is equal to or greater than the length of the vector, this\n /// will issue a constraint failure.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n /// let first = v.get(0);\n /// let last = v.get(v.len() - 1);\n /// assert(first != last);\n /// }\n /// ```\n pub fn get(self, index: u32) -> T {\n assert(index < self.len, \"Attempted to read past end of BoundedVec\");\n self.get_unchecked(index)\n }\n\n /// Retrieves an element from the vector at the given index, starting from zero, without\n /// performing a bounds check.\n ///\n /// Since this function does not perform a bounds check on length before accessing the element,\n /// it is unsafe! Use at your own risk!\n ///\n /// Example:\n ///\n /// ```noir\n /// fn sum_of_first_three<let N: u32>(v: BoundedVec<u32, N>) -> u32 {\n /// // Always ensure the length is larger than the largest\n /// // index passed to get_unchecked\n /// assert(v.len() > 2);\n /// let first = v.get_unchecked(0);\n /// let second = v.get_unchecked(1);\n /// let third = v.get_unchecked(2);\n /// first + second + third\n /// }\n /// ```\n pub fn get_unchecked(self, index: u32) -> T {\n self.storage[index]\n }\n\n /// Writes an element to the vector at the given index, starting from zero.\n ///\n /// If the given index is equal to or greater than the length of the vector, this will issue a constraint failure.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n /// let first = v.get(0);\n /// assert(first != 42);\n /// v.set(0, 42);\n /// let new_first = v.get(0);\n /// assert(new_first == 42);\n /// }\n /// ```\n pub fn set(&mut self, index: u32, value: T) {\n assert(index < self.len, \"Attempted to write past end of BoundedVec\");\n self.set_unchecked(index, value)\n }\n\n /// Writes an element to the vector at the given index, starting from zero, without performing a bounds check.\n ///\n /// Since this function does not perform a bounds check on length before accessing the element, it is unsafe! Use at your own risk!\n ///\n /// Example:\n ///\n /// ```noir\n /// fn set_unchecked_example() {\n /// let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n /// vec.extend_from_array([1, 2]);\n ///\n /// // Here we're safely writing within the valid range of `vec`\n /// // `vec` now has the value [42, 2]\n /// vec.set_unchecked(0, 42);\n ///\n /// // We can then safely read this value back out of `vec`.\n /// // Notice that we use the checked version of `get` which would prevent reading unsafe values.\n /// assert_eq(vec.get(0), 42);\n ///\n /// // We've now written past the end of `vec`.\n /// // As this index is still within the maximum potential length of `v`,\n /// // it won't cause a constraint failure.\n /// vec.set_unchecked(2, 42);\n /// println(vec);\n ///\n /// // This will write past the end of the maximum potential length of `vec`,\n /// // it will then trigger a constraint failure.\n /// vec.set_unchecked(5, 42);\n /// println(vec);\n /// }\n /// ```\n pub fn set_unchecked(&mut self, index: u32, value: T) {\n self.storage[index] = value;\n }\n\n /// Pushes an element to the end of the vector. This increases the length\n /// of the vector by one.\n ///\n /// Panics if the new length of the vector will be greater than the max length.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n ///\n /// v.push(1);\n /// v.push(2);\n ///\n /// // Panics with failed assertion \"push out of bounds\"\n /// v.push(3);\n /// ```\n pub fn push(&mut self, elem: T) {\n assert(self.len < MaxLen, \"push out of bounds\");\n\n self.storage[self.len] = elem;\n self.len += 1;\n }\n\n /// Returns the current length of this vector\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 4> = BoundedVec::new();\n /// assert(v.len() == 0);\n ///\n /// v.push(100);\n /// assert(v.len() == 1);\n ///\n /// v.push(200);\n /// v.push(300);\n /// v.push(400);\n /// assert(v.len() == 4);\n ///\n /// let _ = v.pop();\n /// let _ = v.pop();\n /// assert(v.len() == 2);\n /// ```\n pub fn len(self) -> u32 {\n self.len\n }\n\n /// Returns the maximum length of this vector. This is always\n /// equal to the `MaxLen` parameter this vector was initialized with.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n ///\n /// assert(v.max_len() == 5);\n /// v.push(10);\n /// assert(v.max_len() == 5);\n /// ```\n pub fn max_len(_self: BoundedVec<T, MaxLen>) -> u32 {\n MaxLen\n }\n\n /// Returns the internal array within this vector.\n ///\n /// Since arrays in Noir are immutable, mutating the returned storage array will not mutate\n /// the storage held internally by this vector.\n ///\n /// Note that uninitialized elements may be zeroed out!\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n ///\n /// assert(v.storage() == [0, 0, 0, 0, 0]);\n ///\n /// v.push(57);\n /// assert(v.storage() == [57, 0, 0, 0, 0]);\n /// ```\n pub fn storage(self) -> [T; MaxLen] {\n self.storage\n }\n\n /// Pushes each element from the given array to this vector.\n ///\n /// Panics if pushing each element would cause the length of this vector\n /// to exceed the maximum length.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n /// vec.extend_from_array([2, 4]);\n ///\n /// assert(vec.len == 2);\n /// assert(vec.get(0) == 2);\n /// assert(vec.get(1) == 4);\n /// ```\n pub fn extend_from_array<let Len: u32>(&mut self, array: [T; Len]) {\n let new_len = self.len + array.len();\n assert(new_len <= MaxLen, \"extend_from_array out of bounds\");\n for i in 0..array.len() {\n self.storage[self.len + i] = array[i];\n }\n self.len = new_len;\n }\n\n /// Pushes each element from the given slice to this vector.\n ///\n /// Panics if pushing each element would cause the length of this vector\n /// to exceed the maximum length.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n /// vec.extend_from_slice(&[2, 4]);\n ///\n /// assert(vec.len == 2);\n /// assert(vec.get(0) == 2);\n /// assert(vec.get(1) == 4);\n /// ```\n pub fn extend_from_slice(&mut self, slice: [T]) {\n let new_len = self.len + slice.len();\n assert(new_len <= MaxLen, \"extend_from_slice out of bounds\");\n for i in 0..slice.len() {\n self.storage[self.len + i] = slice[i];\n }\n self.len = new_len;\n }\n\n /// Pushes each element from the other vector to this vector. The length of\n /// the other vector is left unchanged.\n ///\n /// Panics if pushing each element would cause the length of this vector\n /// to exceed the maximum length.\n ///\n /// ```noir\n /// let mut v1: BoundedVec<Field, 5> = BoundedVec::new();\n /// let mut v2: BoundedVec<Field, 7> = BoundedVec::new();\n ///\n /// v2.extend_from_array([1, 2, 3]);\n /// v1.extend_from_bounded_vec(v2);\n ///\n /// assert(v1.storage() == [1, 2, 3, 0, 0]);\n /// assert(v2.storage() == [1, 2, 3, 0, 0, 0, 0]);\n /// ```\n pub fn extend_from_bounded_vec<let Len: u32>(&mut self, vec: BoundedVec<T, Len>) {\n let append_len = vec.len();\n let new_len = self.len + append_len;\n assert(new_len <= MaxLen, \"extend_from_bounded_vec out of bounds\");\n\n if is_unconstrained() {\n for i in 0..append_len {\n self.storage[self.len + i] = vec.get_unchecked(i);\n }\n } else {\n let mut exceeded_len = false;\n for i in 0..Len {\n exceeded_len |= i == append_len;\n if !exceeded_len {\n self.storage[self.len + i] = vec.get_unchecked(i);\n }\n }\n }\n self.len = new_len;\n }\n\n /// Creates a new vector, populating it with values derived from an array input.\n /// The maximum length of the vector is determined based on the type signature.\n ///\n /// Example:\n ///\n /// ```noir\n /// let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array([1, 2, 3])\n /// ```\n pub fn from_array<let Len: u32>(array: [T; Len]) -> Self {\n static_assert(Len <= MaxLen, \"from array out of bounds\");\n let mut vec: BoundedVec<T, MaxLen> = BoundedVec::new();\n vec.extend_from_array(array);\n vec\n }\n\n /// Pops the element at the end of the vector. This will decrease the length\n /// of the vector by one.\n ///\n /// Panics if the vector is empty.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n /// v.push(1);\n /// v.push(2);\n ///\n /// let two = v.pop();\n /// let one = v.pop();\n ///\n /// assert(two == 2);\n /// assert(one == 1);\n ///\n /// // error: cannot pop from an empty vector\n /// let _ = v.pop();\n /// ```\n pub fn pop(&mut self) -> T {\n assert(self.len > 0);\n self.len -= 1;\n\n let elem = self.storage[self.len];\n self.storage[self.len] = crate::mem::zeroed();\n elem\n }\n\n /// Returns true if the given predicate returns true for any element\n /// in this vector.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<u32, 3> = BoundedVec::new();\n /// v.extend_from_array([2, 4, 6]);\n ///\n /// let all_even = !v.any(|elem: u32| elem % 2 != 0);\n /// assert(all_even);\n /// ```\n pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n let mut ret = false;\n if is_unconstrained() {\n for i in 0..self.len {\n ret |= predicate(self.storage[i]);\n }\n } else {\n let mut ret = false;\n let mut exceeded_len = false;\n for i in 0..MaxLen {\n exceeded_len |= i == self.len;\n if !exceeded_len {\n ret |= predicate(self.storage[i]);\n }\n }\n }\n ret\n }\n\n /// Creates a new vector of equal size by calling a closure on each element in this vector.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let result = vec.map(|value| value * 2);\n ///\n /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n /// assert_eq(result, expected);\n /// ```\n pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> BoundedVec<U, MaxLen> {\n let mut ret = BoundedVec::new();\n ret.len = self.len();\n\n if is_unconstrained() {\n for i in 0..self.len() {\n ret.storage[i] = f(self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n ret.storage[i] = f(self.get_unchecked(i));\n }\n }\n }\n\n ret\n }\n\n /// Creates a new vector of equal size by calling a closure on each element\n /// in this vector, along with its index.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let result = vec.mapi(|i, value| i + value * 2);\n ///\n /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n /// assert_eq(result, expected);\n /// ```\n pub fn mapi<U, Env>(self, f: fn[Env](u32, T) -> U) -> BoundedVec<U, MaxLen> {\n let mut ret = BoundedVec::new();\n ret.len = self.len();\n\n if is_unconstrained() {\n for i in 0..self.len() {\n ret.storage[i] = f(i, self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n ret.storage[i] = f(i, self.get_unchecked(i));\n }\n }\n }\n\n ret\n }\n\n /// Calls a closure on each element in this vector.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let mut result = BoundedVec::<u32, 4>::new();\n /// vec.for_each(|value| result.push(value * 2));\n ///\n /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n /// assert_eq(result, expected);\n /// ```\n pub fn for_each<Env>(self, f: fn[Env](T) -> ()) {\n if is_unconstrained() {\n for i in 0..self.len() {\n f(self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n f(self.get_unchecked(i));\n }\n }\n }\n }\n\n /// Calls a closure on each element in this vector, along with its index.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let mut result = BoundedVec::<u32, 4>::new();\n /// vec.for_eachi(|i, value| result.push(i + value * 2));\n ///\n /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n /// assert_eq(result, expected);\n /// ```\n pub fn for_eachi<Env>(self, f: fn[Env](u32, T) -> ()) {\n if is_unconstrained() {\n for i in 0..self.len() {\n f(i, self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n f(i, self.get_unchecked(i));\n }\n }\n }\n }\n\n /// Creates a new BoundedVec from the given array and length.\n /// The given length must be less than or equal to the length of the array.\n ///\n /// This function will zero out any elements at or past index `len` of `array`.\n /// This incurs an extra runtime cost of O(MaxLen). If you are sure your array is\n /// zeroed after that index, you can use `from_parts_unchecked` to remove the extra loop.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n /// assert_eq(vec.len(), 3);\n /// ```\n pub fn from_parts(mut array: [T; MaxLen], len: u32) -> Self {\n assert(len <= MaxLen);\n let zeroed = crate::mem::zeroed();\n\n if is_unconstrained() {\n for i in len..MaxLen {\n array[i] = zeroed;\n }\n } else {\n for i in 0..MaxLen {\n if i >= len {\n array[i] = zeroed;\n }\n }\n }\n\n BoundedVec { storage: array, len }\n }\n\n /// Creates a new BoundedVec from the given array and length.\n /// The given length must be less than or equal to the length of the array.\n ///\n /// This function is unsafe because it expects all elements past the `len` index\n /// of `array` to be zeroed, but does not check for this internally. Use `from_parts`\n /// for a safe version of this function which does zero out any indices past the\n /// given length. Invalidating this assumption can notably cause `BoundedVec::eq`\n /// to give incorrect results since it will check even elements past `len`.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n /// assert_eq(vec.len(), 3);\n ///\n /// // invalid use!\n /// let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n /// let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n ///\n /// // both vecs have length 3 so we'd expect them to be equal, but this\n /// // fails because elements past the length are still checked in eq\n /// assert_eq(vec1, vec2); // fails\n /// ```\n pub fn from_parts_unchecked(array: [T; MaxLen], len: u32) -> Self {\n assert(len <= MaxLen);\n BoundedVec { storage: array, len }\n }\n}\n\nimpl<T, let MaxLen: u32> Eq for BoundedVec<T, MaxLen>\nwhere\n T: Eq,\n{\n fn eq(self, other: BoundedVec<T, MaxLen>) -> bool {\n // TODO: https://github.com/noir-lang/noir/issues/4837\n //\n // We make the assumption that the user has used the proper interface for working with `BoundedVec`s\n // rather than directly manipulating the internal fields as this can result in an inconsistent internal state.\n if self.len == other.len {\n self.storage == other.storage\n } else {\n false\n }\n }\n}\n\nimpl<T, let MaxLen: u32, let Len: u32> From<[T; Len]> for BoundedVec<T, MaxLen> {\n fn from(array: [T; Len]) -> BoundedVec<T, MaxLen> {\n BoundedVec::from_array(array)\n }\n}\n\nmod bounded_vec_tests {\n\n mod get {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n fn panics_when_reading_elements_past_end_of_vec() {\n let vec: BoundedVec<Field, 5> = BoundedVec::new();\n\n crate::println(vec.get(0));\n }\n }\n\n mod set {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn set_updates_values_properly() {\n let mut vec = BoundedVec::from_array([0, 0, 0, 0, 0]);\n\n vec.set(0, 42);\n assert_eq(vec.storage, [42, 0, 0, 0, 0]);\n\n vec.set(1, 43);\n assert_eq(vec.storage, [42, 43, 0, 0, 0]);\n\n vec.set(2, 44);\n assert_eq(vec.storage, [42, 43, 44, 0, 0]);\n\n vec.set(1, 10);\n assert_eq(vec.storage, [42, 10, 44, 0, 0]);\n\n vec.set(0, 0);\n assert_eq(vec.storage, [0, 10, 44, 0, 0]);\n }\n\n #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n fn panics_when_writing_elements_past_end_of_vec() {\n let mut vec: BoundedVec<Field, 5> = BoundedVec::new();\n vec.set(0, 42);\n\n // Need to use println to avoid DIE removing the write operation.\n crate::println(vec.get(0));\n }\n }\n\n mod map {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn applies_function_correctly() {\n // docs:start:bounded-vec-map-example\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.map(|value| value * 2);\n // docs:end:bounded-vec-map-example\n let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.map(|value| (value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = vec.map(|value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n }\n\n mod mapi {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn applies_function_correctly() {\n // docs:start:bounded-vec-mapi-example\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.mapi(|i, value| i + value * 2);\n // docs:end:bounded-vec-mapi-example\n let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.mapi(|i, value| (i + value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = vec.mapi(|_, value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n }\n\n mod for_each {\n use crate::collections::bounded_vec::BoundedVec;\n\n // map in terms of for_each\n fn for_each_map<T, U, Env, let MaxLen: u32>(\n input: BoundedVec<T, MaxLen>,\n f: fn[Env](T) -> U,\n ) -> BoundedVec<U, MaxLen> {\n let mut output = BoundedVec::<U, MaxLen>::new();\n let output_ref = &mut output;\n input.for_each(|x| output_ref.push(f(x)));\n output\n }\n\n #[test]\n fn smoke_test() {\n let mut acc = 0;\n let acc_ref = &mut acc;\n // docs:start:bounded-vec-for-each-example\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n vec.for_each(|value| { *acc_ref += value; });\n // docs:end:bounded-vec-for-each-example\n assert_eq(acc, 6);\n }\n\n #[test]\n fn applies_function_correctly() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_each_map(vec, |value| value * 2);\n let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_each_map(vec, |value| (value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = for_each_map(vec, |value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n }\n\n mod for_eachi {\n use crate::collections::bounded_vec::BoundedVec;\n\n // mapi in terms of for_eachi\n fn for_eachi_mapi<T, U, Env, let MaxLen: u32>(\n input: BoundedVec<T, MaxLen>,\n f: fn[Env](u32, T) -> U,\n ) -> BoundedVec<U, MaxLen> {\n let mut output = BoundedVec::<U, MaxLen>::new();\n let output_ref = &mut output;\n input.for_eachi(|i, x| output_ref.push(f(i, x)));\n output\n }\n\n #[test]\n fn smoke_test() {\n let mut acc = 0;\n let acc_ref = &mut acc;\n // docs:start:bounded-vec-for-eachi-example\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n vec.for_eachi(|i, value| { *acc_ref += i * value; });\n // docs:end:bounded-vec-for-eachi-example\n\n // 0 * 1 + 1 * 2 + 2 * 3\n assert_eq(acc, 8);\n }\n\n #[test]\n fn applies_function_correctly() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_eachi_mapi(vec, |i, value| i + value * 2);\n let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_eachi_mapi(vec, |i, value| (i + value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = for_eachi_mapi(vec, |_, value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n }\n\n mod from_array {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn empty() {\n let empty_array: [Field; 0] = [];\n let bounded_vec = BoundedVec::from_array([]);\n\n assert_eq(bounded_vec.max_len(), 0);\n assert_eq(bounded_vec.len(), 0);\n assert_eq(bounded_vec.storage(), empty_array);\n }\n\n #[test]\n fn equal_len() {\n let array = [1, 2, 3];\n let bounded_vec = BoundedVec::from_array(array);\n\n assert_eq(bounded_vec.max_len(), 3);\n assert_eq(bounded_vec.len(), 3);\n assert_eq(bounded_vec.storage(), array);\n }\n\n #[test]\n fn max_len_greater_then_array_len() {\n let array = [1, 2, 3];\n let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array(array);\n\n assert_eq(bounded_vec.max_len(), 10);\n assert_eq(bounded_vec.len(), 3);\n assert_eq(bounded_vec.get(0), 1);\n assert_eq(bounded_vec.get(1), 2);\n assert_eq(bounded_vec.get(2), 3);\n }\n\n #[test(should_fail_with = \"from array out of bounds\")]\n fn max_len_lower_then_array_len() {\n let _: BoundedVec<Field, 2> = BoundedVec::from_array([0; 3]);\n }\n }\n\n mod trait_from {\n use crate::collections::bounded_vec::BoundedVec;\n use crate::convert::From;\n\n #[test]\n fn simple() {\n let array = [1, 2];\n let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from(array);\n\n assert_eq(bounded_vec.max_len(), 10);\n assert_eq(bounded_vec.len(), 2);\n assert_eq(bounded_vec.get(0), 1);\n assert_eq(bounded_vec.get(1), 2);\n }\n }\n\n mod trait_eq {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn empty_equality() {\n let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n\n assert_eq(bounded_vec1, bounded_vec2);\n }\n\n #[test]\n fn inequality() {\n let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n bounded_vec1.push(1);\n bounded_vec2.push(2);\n\n assert(bounded_vec1 != bounded_vec2);\n }\n }\n\n mod from_parts {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn from_parts() {\n // docs:start:from-parts\n let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n assert_eq(vec.len(), 3);\n\n // Any elements past the given length are zeroed out, so these\n // two BoundedVecs will be completely equal\n let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 1], 3);\n let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 2], 3);\n assert_eq(vec1, vec2);\n // docs:end:from-parts\n }\n\n #[test]\n fn from_parts_unchecked() {\n // docs:start:from-parts-unchecked\n let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n assert_eq(vec.len(), 3);\n\n // invalid use!\n let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n\n // both vecs have length 3 so we'd expect them to be equal, but this\n // fails because elements past the length are still checked in eq\n assert(vec1 != vec2);\n // docs:end:from-parts-unchecked\n }\n }\n}\n"
3826
3826
  },
3827
3827
  "65": {
3828
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/context/private_context.nr",
3828
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/private_context.nr",
3829
3829
  "source": "use dep::protocol_types::debug_log::debug_log_format;\n\nuse crate::{\n context::{inputs::PrivateContextInputs, returns_hash::ReturnsHash},\n hash::{ArgsHasher, hash_args_array, hash_calldata_array},\n keys::constants::{NULLIFIER_INDEX, NUM_KEY_TYPES, OUTGOING_INDEX, sk_generators},\n messaging::process_l1_to_l2_message,\n oracle::{\n block_header::get_block_header_at,\n call_private_function::call_private_function_internal,\n enqueue_public_function_call::{\n notify_enqueued_public_function_call, notify_set_min_revertible_side_effect_counter,\n notify_set_public_teardown_function_call,\n },\n execution_cache,\n key_validation_request::get_key_validation_request,\n notes::{notify_created_nullifier, notify_nullified_note},\n },\n};\nuse dep::protocol_types::{\n abis::{\n call_context::CallContext,\n function_selector::FunctionSelector,\n gas_settings::GasSettings,\n log::Log,\n log_hash::LogHash,\n max_block_number::MaxBlockNumber,\n note_hash::NoteHash,\n nullifier::Nullifier,\n private_call_request::PrivateCallRequest,\n private_circuit_public_inputs::PrivateCircuitPublicInputs,\n private_log::PrivateLogData,\n public_call_request::PublicCallRequest,\n read_request::ReadRequest,\n side_effect::Counted,\n validation_requests::{KeyValidationRequest, KeyValidationRequestAndGenerator},\n },\n address::{AztecAddress, EthAddress},\n block_header::BlockHeader,\n constants::{\n MAX_CONTRACT_CLASS_LOGS_PER_CALL, MAX_ENQUEUED_CALLS_PER_CALL,\n MAX_KEY_VALIDATION_REQUESTS_PER_CALL, MAX_L2_TO_L1_MSGS_PER_CALL,\n MAX_NOTE_HASH_READ_REQUESTS_PER_CALL, MAX_NOTE_HASHES_PER_CALL,\n MAX_NULLIFIER_READ_REQUESTS_PER_CALL, MAX_NULLIFIERS_PER_CALL,\n MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL, MAX_PRIVATE_LOGS_PER_CALL,\n PRIVATE_LOG_SIZE_IN_FIELDS,\n },\n messaging::l2_to_l1_message::L2ToL1Message,\n traits::{Empty, Hash, ToField},\n utils::arrays::array_concat,\n};\n\n// When finished, one can call .finish() to convert back to the abi\npub struct PrivateContext {\n // docs:start:private-context\n pub inputs: PrivateContextInputs,\n pub side_effect_counter: u32,\n\n pub min_revertible_side_effect_counter: u32,\n pub is_fee_payer: bool,\n\n pub args_hash: Field,\n pub return_hash: Field,\n\n pub max_block_number: MaxBlockNumber,\n\n pub note_hash_read_requests: BoundedVec<ReadRequest, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>,\n pub nullifier_read_requests: BoundedVec<ReadRequest, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n key_validation_requests_and_generators: BoundedVec<KeyValidationRequestAndGenerator, MAX_KEY_VALIDATION_REQUESTS_PER_CALL>,\n\n pub note_hashes: BoundedVec<NoteHash, MAX_NOTE_HASHES_PER_CALL>,\n pub nullifiers: BoundedVec<Nullifier, MAX_NULLIFIERS_PER_CALL>,\n\n pub private_call_requests: BoundedVec<PrivateCallRequest, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL>,\n pub public_call_requests: BoundedVec<Counted<PublicCallRequest>, MAX_ENQUEUED_CALLS_PER_CALL>,\n pub public_teardown_call_request: PublicCallRequest,\n pub l2_to_l1_msgs: BoundedVec<L2ToL1Message, MAX_L2_TO_L1_MSGS_PER_CALL>,\n // docs:end:private-context\n\n // Header of a block whose state is used during private execution (not the block the transaction is included in).\n pub historical_header: BlockHeader,\n\n pub private_logs: BoundedVec<PrivateLogData, MAX_PRIVATE_LOGS_PER_CALL>,\n pub contract_class_logs_hashes: BoundedVec<LogHash, MAX_CONTRACT_CLASS_LOGS_PER_CALL>,\n\n // Contains the last key validation request for each key type. This is used to cache the last request and avoid\n // fetching the same request multiple times.\n // The index of the array corresponds to the key type (0 nullifier, 1 incoming, 2 outgoing, 3 tagging).\n pub last_key_validation_requests: [Option<KeyValidationRequest>; NUM_KEY_TYPES],\n}\n\nimpl PrivateContext {\n pub fn new(inputs: PrivateContextInputs, args_hash: Field) -> PrivateContext {\n PrivateContext {\n inputs,\n side_effect_counter: inputs.start_side_effect_counter + 1,\n min_revertible_side_effect_counter: 0,\n is_fee_payer: false,\n args_hash,\n return_hash: 0,\n max_block_number: MaxBlockNumber::empty(),\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_generators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n historical_header: inputs.historical_header,\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n }\n }\n\n pub fn msg_sender(self) -> AztecAddress {\n self.inputs.call_context.msg_sender\n }\n\n pub fn this_address(self) -> AztecAddress {\n self.inputs.call_context.contract_address\n }\n\n pub fn chain_id(self) -> Field {\n self.inputs.tx_context.chain_id\n }\n\n pub fn version(self) -> Field {\n self.inputs.tx_context.version\n }\n\n pub fn gas_settings(self) -> GasSettings {\n self.inputs.tx_context.gas_settings\n }\n\n pub fn selector(self) -> FunctionSelector {\n self.inputs.call_context.function_selector\n }\n\n pub fn get_args_hash(self) -> Field {\n self.args_hash\n }\n\n pub fn push_note_hash(&mut self, note_hash: Field) {\n self.note_hashes.push(NoteHash { value: note_hash, counter: self.next_counter() });\n\n // WARNING(https://github.com/AztecProtocol/aztec-packages/issues/10558): if you delete this debug_log_format line, some tests fail.\n debug_log_format(\n \"Context.note_hashes, after pushing new note hash: {0}\",\n self.note_hashes.storage().map(|nh: NoteHash| nh.value),\n );\n }\n\n pub fn push_nullifier(&mut self, nullifier: Field) {\n notify_created_nullifier(nullifier);\n self.nullifiers.push(\n Nullifier { value: nullifier, note_hash: 0, counter: self.next_counter() },\n );\n }\n\n pub fn push_nullifier_for_note_hash(&mut self, nullifier: Field, nullified_note_hash: Field) {\n let nullifier_counter = self.next_counter();\n notify_nullified_note(nullifier, nullified_note_hash, nullifier_counter);\n self.nullifiers.push(\n Nullifier {\n value: nullifier,\n note_hash: nullified_note_hash,\n counter: nullifier_counter,\n },\n );\n }\n\n // Returns the header of a block whose state is used during private execution (not the block the transaction is\n // included in).\n pub fn get_block_header(self) -> BlockHeader {\n self.historical_header\n }\n\n // Returns the header of an arbitrary block whose block number is less than or equal to the block number\n // of historical header.\n pub fn get_block_header_at(self, block_number: u32) -> BlockHeader {\n get_block_header_at(block_number, self)\n }\n\n pub fn set_return_hash(&mut self, returns_hasher: ArgsHasher) {\n self.return_hash = returns_hasher.hash();\n execution_cache::store(returns_hasher.fields, self.return_hash);\n }\n\n pub fn finish(self) -> PrivateCircuitPublicInputs {\n PrivateCircuitPublicInputs {\n call_context: self.inputs.call_context,\n args_hash: self.args_hash,\n returns_hash: self.return_hash,\n min_revertible_side_effect_counter: self.min_revertible_side_effect_counter,\n is_fee_payer: self.is_fee_payer,\n max_block_number: self.max_block_number,\n note_hash_read_requests: self.note_hash_read_requests.storage(),\n nullifier_read_requests: self.nullifier_read_requests.storage(),\n key_validation_requests_and_generators: self\n .key_validation_requests_and_generators\n .storage(),\n note_hashes: self.note_hashes.storage(),\n nullifiers: self.nullifiers.storage(),\n private_call_requests: self.private_call_requests.storage(),\n public_call_requests: self.public_call_requests.storage(),\n public_teardown_call_request: self.public_teardown_call_request,\n l2_to_l1_msgs: self.l2_to_l1_msgs.storage(),\n start_side_effect_counter: self.inputs.start_side_effect_counter,\n end_side_effect_counter: self.side_effect_counter,\n private_logs: self.private_logs.storage(),\n contract_class_logs_hashes: self.contract_class_logs_hashes.storage(),\n historical_header: self.historical_header,\n tx_context: self.inputs.tx_context,\n }\n }\n\n pub fn set_as_fee_payer(&mut self) {\n dep::protocol_types::debug_log::debug_log_format(\n \"Setting {0} as fee payer\",\n [self.this_address().to_field()],\n );\n self.is_fee_payer = true;\n }\n\n pub fn end_setup(&mut self) {\n // dep::protocol_types::debug_log::debug_log_format(\n // \"Ending setup at counter {0}\",\n // [self.side_effect_counter as Field]\n // );\n self.min_revertible_side_effect_counter = self.side_effect_counter;\n notify_set_min_revertible_side_effect_counter(self.min_revertible_side_effect_counter);\n }\n\n // docs:start:max-block-number\n pub fn set_tx_max_block_number(&mut self, max_block_number: u32) {\n // docs:end:max-block-number\n self.max_block_number =\n MaxBlockNumber::min_with_u32(self.max_block_number, max_block_number);\n }\n\n pub fn push_note_hash_read_request(&mut self, note_hash: Field) {\n let side_effect = ReadRequest { value: note_hash, counter: self.next_counter() };\n self.note_hash_read_requests.push(side_effect);\n }\n\n pub fn push_nullifier_read_request(&mut self, nullifier: Field) {\n let request = ReadRequest { value: nullifier, counter: self.next_counter() };\n self.nullifier_read_requests.push(request);\n }\n\n pub fn request_nsk_app(&mut self, npk_m_hash: Field) -> Field {\n self.request_sk_app(npk_m_hash, NULLIFIER_INDEX)\n }\n\n pub fn request_ovsk_app(&mut self, ovpk_m_hash: Field) -> Field {\n self.request_sk_app(ovpk_m_hash, OUTGOING_INDEX)\n }\n\n fn request_sk_app(&mut self, pk_m_hash: Field, key_index: Field) -> Field {\n let cached_request =\n self.last_key_validation_requests[key_index].unwrap_or(KeyValidationRequest::empty());\n\n if cached_request.pk_m.hash() == pk_m_hash {\n // We get a match so the cached request is the latest one\n cached_request.sk_app\n } else {\n // We didn't get a match meaning the cached result is stale\n // Typically we'd validate keys by showing that they are the preimage of `pk_m_hash`, but that'd require\n // the oracle returning the master secret keys, which could cause malicious contracts to leak it or learn\n // about secrets from other contracts. We therefore silo secret keys, and rely on the private kernel to\n // validate that we siloed secret key corresponds to correct siloing of the master secret key that hashes\n // to `pk_m_hash`.\n\n // Safety: Kernels verify that the key validation request is valid and below we verify that a request\n // for the correct public key has been received.\n let request = unsafe { get_key_validation_request(pk_m_hash, key_index) };\n assert_eq(request.pk_m.hash(), pk_m_hash, \"Obtained invalid key validation request\");\n\n self.key_validation_requests_and_generators.push(\n KeyValidationRequestAndGenerator {\n request,\n sk_app_generator: sk_generators[key_index],\n },\n );\n self.last_key_validation_requests[key_index] = Option::some(request);\n request.sk_app\n }\n }\n\n // docs:start:context_message_portal\n pub fn message_portal(&mut self, recipient: EthAddress, content: Field) {\n // docs:end:context_message_portal\n let message = L2ToL1Message { recipient, content, counter: self.next_counter() };\n self.l2_to_l1_msgs.push(message);\n }\n\n // docs:start:context_consume_l1_to_l2_message\n // docs:start:consume_l1_to_l2_message\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 // docs:end:context_consume_l1_to_l2_message\n let nullifier = process_l1_to_l2_message(\n self.historical_header.state.l1_to_l2_message_tree.root,\n self.this_address(),\n sender,\n self.chain_id(),\n self.version(),\n content,\n secret,\n leaf_index,\n );\n\n // Push nullifier (and the \"commitment\" corresponding to this can be \"empty\")\n self.push_nullifier(nullifier)\n }\n // docs:end:consume_l1_to_l2_message\n\n pub fn emit_private_log(&mut self, log: [Field; PRIVATE_LOG_SIZE_IN_FIELDS]) {\n let counter = self.next_counter();\n let private_log = PrivateLogData { log: Log::new(log), note_hash_counter: 0, counter };\n self.private_logs.push(private_log);\n }\n\n pub fn emit_raw_note_log(\n &mut self,\n log: [Field; PRIVATE_LOG_SIZE_IN_FIELDS],\n note_hash_counter: u32,\n ) {\n let counter = self.next_counter();\n let private_log = PrivateLogData { log: Log::new(log), note_hash_counter, counter };\n self.private_logs.push(private_log);\n }\n\n pub fn call_private_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) -> ReturnsHash {\n let args_hash = hash_args_array(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(\n contract_address,\n function_selector,\n args_hash,\n false,\n )\n }\n\n pub fn static_call_private_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) -> ReturnsHash {\n let args_hash = hash_args_array(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(\n contract_address,\n function_selector,\n args_hash,\n true,\n )\n }\n\n pub fn call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, false)\n }\n\n pub fn static_call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, true)\n }\n\n pub fn call_private_function_with_args_hash(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args_hash: Field,\n is_static_call: bool,\n ) -> ReturnsHash {\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n let start_side_effect_counter = self.side_effect_counter;\n\n // Safety: The oracle simulates the private call and returns the value of the side effects counter after\n // execution of the call (which means that end_side_effect_counter - start_side_effect_counter is\n // the number of side effects that took place), along with the hash of the return values. We validate these\n // by requesting a private kernel iteration in which the return values are constrained to hash\n // to `returns_hash` and the side effects counter to increment from start to end.\n let (end_side_effect_counter, returns_hash) = unsafe {\n call_private_function_internal(\n contract_address,\n function_selector,\n args_hash,\n start_side_effect_counter,\n is_static_call,\n )\n };\n\n self.private_call_requests.push(\n PrivateCallRequest {\n call_context: CallContext {\n msg_sender: self.this_address(),\n contract_address,\n function_selector,\n is_static_call,\n },\n args_hash,\n returns_hash,\n start_side_effect_counter,\n end_side_effect_counter,\n },\n );\n\n // TODO (fees) figure out why this crashes the prover and enable it\n // we need this in order to pay fees inside child call contexts\n // assert(\n // (item.public_inputs.min_revertible_side_effect_counter == 0 as u32)\n // | (item.public_inputs.min_revertible_side_effect_counter\n // > self.min_revertible_side_effect_counter)\n // );\n // if item.public_inputs.min_revertible_side_effect_counter\n // > self.min_revertible_side_effect_counter {\n // self.min_revertible_side_effect_counter = item.public_inputs.min_revertible_side_effect_counter;\n // }\n self.side_effect_counter = end_side_effect_counter + 1;\n ReturnsHash::new(returns_hash)\n }\n\n pub fn call_public_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) {\n let calldata = array_concat([function_selector.to_field()], args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false)\n }\n\n pub fn static_call_public_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) {\n let calldata = array_concat([function_selector.to_field()], args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true)\n }\n\n pub fn call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false)\n }\n\n pub fn static_call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true)\n }\n\n pub fn call_public_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n ) {\n let counter = self.next_counter();\n\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n notify_enqueued_public_function_call(\n contract_address,\n calldata_hash,\n counter,\n is_static_call,\n );\n\n let call_request = PublicCallRequest {\n msg_sender: self.this_address(),\n contract_address,\n is_static_call,\n calldata_hash,\n };\n\n self.public_call_requests.push(Counted::new(call_request, counter));\n }\n\n pub fn set_public_teardown_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) {\n let calldata = array_concat([function_selector.to_field()], args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.set_public_teardown_function_with_calldata_hash(contract_address, calldata_hash, false)\n }\n\n pub fn set_public_teardown_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n ) {\n let counter = self.next_counter();\n\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n notify_set_public_teardown_function_call(\n contract_address,\n calldata_hash,\n counter,\n is_static_call,\n );\n\n self.public_teardown_call_request = PublicCallRequest {\n msg_sender: self.this_address(),\n contract_address,\n is_static_call,\n calldata_hash,\n };\n }\n\n fn next_counter(&mut self) -> u32 {\n let counter = self.side_effect_counter;\n self.side_effect_counter += 1;\n counter\n }\n}\n\nimpl Empty for PrivateContext {\n fn empty() -> Self {\n PrivateContext {\n inputs: PrivateContextInputs::empty(),\n side_effect_counter: 0 as u32,\n min_revertible_side_effect_counter: 0 as u32,\n is_fee_payer: false,\n args_hash: 0,\n return_hash: 0,\n max_block_number: MaxBlockNumber::empty(),\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_generators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n historical_header: BlockHeader::empty(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n }\n }\n}\n"
3830
3830
  },
3831
3831
  "66": {
3832
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/context/public_context.nr",
3832
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/public_context.nr",
3833
3833
  "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(gas_for_call(gas_opts), contract_address, calldata);\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(gas_for_call(gas_opts), contract_address, calldata);\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// Helper functions\nfn gas_for_call(user_gas: GasOpts) -> [Field; 2] {\n // It's ok to use the max possible gas here, because the gas will be\n // capped by the gas left in the (STATIC)CALL instruction.\n [user_gas.l2_gas.unwrap_or(MAX_FIELD_VALUE), user_gas.da_gas.unwrap_or(MAX_FIELD_VALUE)]\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(gas: [Field; 2], address: AztecAddress, args: [Field]) {\n call_opcode(gas, address, args)\n}\n\nunconstrained fn call_static(gas: [Field; 2], address: AztecAddress, args: [Field]) {\n call_static_opcode(gas, 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 gas: [Field; 2], // gas allocation: [l2_gas, da_gas]\n address: AztecAddress,\n args: [Field],\n) {}\n\n#[oracle(avmOpcodeStaticCall)]\nunconstrained fn call_static_opcode(\n gas: [Field; 2], // gas allocation: [l2_gas, da_gas]\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"
3834
3834
  },
3835
3835
  "68": {
3836
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/context/unconstrained_context.nr",
3836
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/unconstrained_context.nr",
3837
3837
  "source": "use crate::oracle::{\n execution::{get_block_number, get_chain_id, get_contract_address, get_version},\n storage::storage_read,\n};\nuse dep::protocol_types::{address::AztecAddress, traits::Packable};\n\npub struct UnconstrainedContext {\n block_number: u32,\n contract_address: AztecAddress,\n version: Field,\n chain_id: Field,\n}\n\nimpl UnconstrainedContext {\n pub unconstrained fn new() -> Self {\n // We could call these oracles on the getters instead of at creation, which makes sense given that they might\n // not even be accessed. However any performance gains are minimal, and we'd rather fail early if a user\n // incorrectly attempts to create an UnconstrainedContext in an environment in which these oracles are not\n // available.\n let block_number = get_block_number();\n let contract_address = get_contract_address();\n let chain_id = get_chain_id();\n let version = get_version();\n Self { block_number, contract_address, version, chain_id }\n }\n\n pub unconstrained fn at(contract_address: AztecAddress) -> Self {\n let block_number = get_block_number();\n let chain_id = get_chain_id();\n let version = get_version();\n Self { block_number, contract_address, version, chain_id }\n }\n\n pub unconstrained fn at_historical(contract_address: AztecAddress, block_number: u32) -> Self {\n let chain_id = get_chain_id();\n let version = get_version();\n Self { block_number, contract_address, version, chain_id }\n }\n\n pub fn block_number(self) -> u32 {\n self.block_number\n }\n\n pub fn this_address(self) -> AztecAddress {\n self.contract_address\n }\n\n pub fn version(self) -> Field {\n self.version\n }\n\n pub fn chain_id(self) -> Field {\n self.chain_id\n }\n\n pub unconstrained fn raw_storage_read<let N: u32>(\n self: Self,\n storage_slot: Field,\n ) -> [Field; N] {\n storage_read(self.this_address(), storage_slot, self.block_number())\n }\n\n pub unconstrained 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"
3838
3838
  },
3839
3839
  "70": {
3840
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/discovery/mod.nr",
3840
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/discovery/mod.nr",
3841
3841
  "source": "// TODO(#12750): don't make this value assume we're using AES.\nuse crate::encrypted_logs::log_assembly_strategies::default_aes128::note::encryption::PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS;\nuse dep::protocol_types::{address::AztecAddress, debug_log::debug_log};\n\npub mod private_logs;\npub mod private_notes;\npub mod partial_notes;\npub mod nonce_discovery;\n\n/// We reserve two fields in the note private log that are not part of the note content: one for the storage slot, and\n/// one for the combined log and note type ID.\nglobal PRIVATE_LOG_EXPANDED_METADATA_LEN: u32 = 1;\n\n/// The maximum length of the log's content, i.e. after log type ID and metadata extraction.\npub global MAX_LOG_CONTENT_LEN: u32 =\n PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS - PRIVATE_LOG_EXPANDED_METADATA_LEN;\n\nuse private_notes::MAX_NOTE_PACKED_LEN;\n\npub struct NoteHashAndNullifier {\n /// The result of NoteHash::compute_note_hash\n pub note_hash: Field,\n /// The result of NoteHash::compute_nullifier_unconstrained (since all of message discovery is unconstrained)\n pub inner_nullifier: Field,\n}\n\n/// A function which takes a note's packed content, address of the emitting contract, nonce, storage slot and note type\n/// ID and attempts to compute its note hash (not siloed by nonce nor address) and inner nullifier (not siloed by\n/// address).\n///\n/// This function must be user-provided as its implementation requires knowledge of how note type IDs are allocated in a\n/// contract. The `#[aztec]` macro automatically creates such a contract library method called\n/// `_compute_note_hash_and_nullifier`, which looks something like this:\n///\n/// ```\n/// |packed_note, contract_address, nonce, storage_slot, note_type_id| {\n/// if note_type_id == MyNoteType::get_id() {\n/// assert(packed_note.len() == MY_NOTE_TYPE_SERIALIZATION_LENGTH);\n///\n/// let note = MyNoteType::unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n///\n/// let note_hash = note.compute_note_hash(storage_slot);\n/// let note_hash_for_nullify = aztec::note::utils::compute_note_hash_for_nullify(\n/// RetrievedNote{ note, contract_address, metadata: SettledNoteMetadata::new(nonce).into() },\n/// storage_slot\n/// );\n///\n/// let inner_nullifier = note.compute_nullifier_unconstrained(note_hash_for_nullify);\n///\n/// Option::some(\n/// aztec::discovery::NoteHashAndNullifier {\n/// note_hash, inner_nullifier\n/// }\n/// )\n/// } else if note_type_id == MyOtherNoteType::get_id() {\n/// ... // Similar to above but calling MyOtherNoteType::unpack_content\n/// } else {\n/// Option::none() // Unknown note type ID\n/// };\n/// }\n/// ```\ntype ComputeNoteHashAndNullifier<Env> = unconstrained fn[Env](/* packed_note */BoundedVec<Field, MAX_NOTE_PACKED_LEN>, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress, /* nonce */ Field) -> Option<NoteHashAndNullifier>;\n\n/// Performs the message discovery process, in which private are downloaded and inspected to find new private notes,\n/// partial notes and events, etc., and pending partial notes are processed to search for their completion logs.\n/// This is the mechanism via which a contract updates its knowldge of its private state.\n///\n/// Receives the address of the contract on which discovery is performed along with its\n/// `compute_note_hash_and_nullifier` function.\npub unconstrained fn discover_new_messages<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n) {\n debug_log(\"Performing message discovery\");\n\n private_logs::fetch_and_process_private_tagged_logs(\n contract_address,\n compute_note_hash_and_nullifier,\n );\n\n partial_notes::fetch_and_process_public_partial_note_completion_logs(\n contract_address,\n compute_note_hash_and_nullifier,\n );\n}\n"
3842
3842
  },
3843
3843
  "71": {
3844
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/discovery/nonce_discovery.nr",
3844
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/discovery/nonce_discovery.nr",
3845
3845
  "source": "use crate::{\n discovery::{ComputeNoteHashAndNullifier, private_notes::MAX_NOTE_PACKED_LEN},\n utils::array,\n};\n\nuse dep::protocol_types::{\n address::AztecAddress,\n constants::MAX_NOTE_HASHES_PER_TX,\n debug_log::debug_log_format,\n hash::{compute_note_hash_nonce, compute_siloed_note_hash, compute_unique_note_hash},\n traits::ToField,\n};\n\n/// A struct with the discovered information of a complete note, required for delivery to PXE. Note that this is *not*\n/// the complete note information, since it does not include content, storage slot, etc.\npub struct DiscoveredNoteInfo {\n pub nonce: Field,\n pub note_hash: Field,\n pub inner_nullifier: Field,\n}\n\n/// Searches for note nonces that will result in a note that was emitted in a transaction. While rare, it is possible\n/// for multiple notes to have the exact same packed content and storage slot but different nonces, resulting in\n/// different unique note hashes. Because of this this function returns a *vector* of discovered notes, though in most\n/// cases it will contain a single element.\n///\n/// Due to how nonces are computed, this function requires knowledge of the transaction in which the note was created,\n/// more specifically the list of all unique note hashes in it plus the value of its first nullifier.\npub unconstrained fn attempt_note_nonce_discovery<Env>(\n unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n first_nullifier_in_tx: Field,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n contract_address: AztecAddress,\n storage_slot: Field,\n note_type_id: Field,\n packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n) -> BoundedVec<DiscoveredNoteInfo, MAX_NOTE_HASHES_PER_TX> {\n let discovered_notes = &mut BoundedVec::new();\n\n debug_log_format(\n \"Attempting nonce discovery on {0} potential notes on contract {1} for storage slot {2}\",\n [unique_note_hashes_in_tx.len() as Field, contract_address.to_field(), storage_slot],\n );\n\n // We need to find nonces (typically just one) that result in a note hash that, once siloed into a unique note hash,\n // is one of the note hashes created by the transaction.\n array::for_each_in_bounded_vec(\n unique_note_hashes_in_tx,\n |expected_unique_note_hash, i| {\n // Nonces are computed by hashing the first nullifier in the transaction with the index of the note in the\n // new note hashes array. We therefore know for each note in every transaction what its nonce is.\n let candidate_nonce = compute_note_hash_nonce(first_nullifier_in_tx, i);\n\n // Given nonce, note content and metadata, we can compute the note hash and silo it to check if it matches\n // the note hash at the array index we're currently processing.\n // TODO(#11157): handle failed note_hash_and_nullifier computation\n let hashes = compute_note_hash_and_nullifier(\n packed_note,\n storage_slot,\n note_type_id,\n contract_address,\n candidate_nonce,\n )\n .expect(f\"Failed to compute a note hash for note type {note_type_id}\");\n\n let siloed_note_hash = compute_siloed_note_hash(contract_address, hashes.note_hash);\n let unique_note_hash = compute_unique_note_hash(candidate_nonce, siloed_note_hash);\n\n if unique_note_hash == expected_unique_note_hash {\n // Note that while we did check that the note hash is the preimage of the expected unique note hash, we\n // perform no validations on the nullifier - we fundamentally cannot, since only the application knows\n // how to compute nullifiers. We simply trust it to have provided the correct one: if it hasn't, then\n // PXE may fail to realize that a given note has been nullified already, and calls to the application\n // could result in invalid transactions (with duplicate nullifiers). This is not a concern because an\n // application already has more direct means of making a call to it fail the transaction.\n discovered_notes.push(\n DiscoveredNoteInfo {\n nonce: candidate_nonce,\n note_hash: hashes.note_hash,\n inner_nullifier: hashes.inner_nullifier,\n },\n );\n\n // We don't exit the loop - it is possible (though rare) for the exact same note content to be present\n // multiple times in the same transaction with different nonces. This typically doesn't happen due to\n // notes containing random values in order to hide their contents.\n }\n },\n );\n\n debug_log_format(\n \"Discovered a total of {0} notes\",\n [discovered_notes.len() as Field],\n );\n\n *discovered_notes\n}\n"
3846
3846
  },
3847
3847
  "72": {
3848
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/discovery/partial_notes.nr",
3848
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/discovery/partial_notes.nr",
3849
3849
  "source": "use crate::{\n capsules::CapsuleArray,\n discovery::{\n ComputeNoteHashAndNullifier,\n MAX_LOG_CONTENT_LEN,\n nonce_discovery::{attempt_note_nonce_discovery, DiscoveredNoteInfo},\n },\n oracle::message_discovery::{deliver_note, get_log_by_tag},\n utils::array,\n};\n\nuse dep::protocol_types::{\n address::AztecAddress,\n constants::PUBLIC_LOG_DATA_SIZE_IN_FIELDS,\n debug_log::debug_log_format,\n traits::{Deserialize, Serialize, ToField},\n};\n\nglobal PARTIAL_NOTE_PRIVATE_LOG_CONTENT_NON_NOTE_FIELDS_LEN: u32 = 2;\n\n/// Partial notes have a maximum packed length of their private fields bound by extra content in their private log (e.g.\n/// the storage slot, note completion log tag, etc.).\npub global MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN: u32 =\n MAX_LOG_CONTENT_LEN - PARTIAL_NOTE_PRIVATE_LOG_CONTENT_NON_NOTE_FIELDS_LEN;\n\n/// The slot in the PXE capsules where we store a `CapsuleArray` of `DeliveredPendingPartialNote`.\n// TODO(#11630): come up with some sort of slot allocation scheme.\npub global DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT: Field = 77;\n\n/// Public logs contain an extra field at the beginning with the address of the contract that emitted them, and partial\n/// notes emit their completion tag in the log, resulting in the first two fields in the public log not being part of\n/// the packed public content.\n// TODO(#10273): improve how contract log siloing is handled\npub global NON_PACKED_CONTENT_FIELDS_IN_PUBLIC_LOG: u32 = 2;\n\n/// The maximum length of the packed representation of public fields in a partial note. This is limited by public log\n/// size and extra fields in the log (e.g. the tag).\npub global MAX_PUBLIC_PARTIAL_NOTE_PACKED_CONTENT_LENGTH: u32 =\n PUBLIC_LOG_DATA_SIZE_IN_FIELDS - NON_PACKED_CONTENT_FIELDS_IN_PUBLIC_LOG;\n\n/// A partial note that was delivered but is still pending completion. Contains the information necessary to find the\n/// log that will complete it and lead to a note being discovered and delivered.\n#[derive(Serialize, Deserialize)]\npub(crate) struct DeliveredPendingPartialNote {\n pub(crate) note_completion_log_tag: Field,\n pub(crate) storage_slot: Field,\n pub(crate) note_type_id: Field,\n pub(crate) packed_private_note_content: BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>,\n pub(crate) recipient: AztecAddress,\n}\n\npub unconstrained fn process_partial_note_private_log(\n contract_address: AztecAddress,\n recipient: AztecAddress,\n log_metadata: u64,\n log_content: BoundedVec<Field, MAX_LOG_CONTENT_LEN>,\n) {\n let (note_type_id, storage_slot, note_completion_log_tag, packed_private_note_content) =\n decode_partial_note_private_log(log_metadata, log_content);\n\n // We store the information of the partial note we found in a persistent capsule in PXE, so that we can later search\n // for the public log that will complete it.\n let pending = DeliveredPendingPartialNote {\n note_completion_log_tag,\n storage_slot,\n note_type_id,\n packed_private_note_content,\n recipient,\n };\n\n CapsuleArray::at(\n contract_address,\n DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n )\n .push(pending);\n}\n\n/// Searches for public logs that would result in the completion of pending partial notes, ultimately resulting in the\n/// notes being delivered to PXE if completed.\npub unconstrained fn fetch_and_process_public_partial_note_completion_logs<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n) {\n let pending_partial_notes = CapsuleArray::at(\n contract_address,\n DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n );\n\n debug_log_format(\n \"{} pending partial notes\",\n [pending_partial_notes.len() as Field],\n );\n\n let mut i = 0;\n while i < pending_partial_notes.len() {\n let pending_partial_note: DeliveredPendingPartialNote = pending_partial_notes.get(i);\n\n let maybe_log = get_log_by_tag(pending_partial_note.note_completion_log_tag);\n if maybe_log.is_none() {\n debug_log_format(\n \"Found no completion logs for partial note with tag {}\",\n [pending_partial_note.note_completion_log_tag],\n );\n i += 1 as u32;\n // Note that we're not removing the pending partial note from the PXE DB, so we will continue searching\n // for this tagged log when performing message discovery in the future until we either find it or the\n // entry is somehow removed from the PXE DB.\n } else {\n debug_log_format(\n \"Completion log found for partial note with tag {}\",\n [pending_partial_note.note_completion_log_tag],\n );\n let log = maybe_log.unwrap();\n\n // Public logs have an extra field at the beginning with the contract address, which we use to verify\n // that we're getting the logs from the expected contract.\n // TODO(#10273): improve how contract log siloing is handled\n assert_eq(\n log.log_content.get(0),\n contract_address.to_field(),\n \"Got a public log emitted by a different contract\",\n );\n\n // Public fields are assumed to all be placed at the end of the packed representation, so we combine the\n // private and public packed fields (i.e. the contents of the log sans the extra fields) to get the\n // complete packed content.\n let packed_public_note_content: BoundedVec<_, MAX_PUBLIC_PARTIAL_NOTE_PACKED_CONTENT_LENGTH> =\n array::subbvec(log.log_content, NON_PACKED_CONTENT_FIELDS_IN_PUBLIC_LOG);\n let complete_packed_note = array::append(\n pending_partial_note.packed_private_note_content,\n packed_public_note_content,\n );\n\n let discovered_notes = attempt_note_nonce_discovery(\n log.unique_note_hashes_in_tx,\n log.first_nullifier_in_tx,\n compute_note_hash_and_nullifier,\n contract_address,\n pending_partial_note.storage_slot,\n pending_partial_note.note_type_id,\n complete_packed_note,\n );\n\n debug_log_format(\n \"Discovered {0} notes for partial note with tag {1}\",\n [discovered_notes.len() as Field, pending_partial_note.note_completion_log_tag],\n );\n\n array::for_each_in_bounded_vec(\n discovered_notes,\n |discovered_note: DiscoveredNoteInfo, _| {\n // TODO:(#10728): decide how to handle notes that fail delivery. This could be due to e.g. a\n // temporary node connectivity issue - is simply throwing good enough here?\n assert(\n deliver_note(\n contract_address,\n pending_partial_note.storage_slot,\n discovered_note.nonce,\n complete_packed_note,\n discovered_note.note_hash,\n discovered_note.inner_nullifier,\n log.tx_hash,\n pending_partial_note.recipient,\n ),\n \"Failed to deliver note\",\n );\n },\n );\n\n // Because there is only a single log for a given tag, once we've processed the tagged log then we\n // simply delete the pending work entry, regardless of whether it was actually completed or not.\n // TODO(#11627): only remove the pending entry if we actually process a log that results in the note\n // being completed.\n pending_partial_notes.remove(i);\n\n // We don't increment `i` here, because CapsuleArray is contiguous and its `remove(...)` function\n // shifts the elements to the left if the removed element is not the last element.\n }\n }\n}\n\nfn decode_partial_note_private_log(\n log_metadata: u64,\n log_content: BoundedVec<Field, MAX_LOG_CONTENT_LEN>,\n) -> (Field, Field, Field, BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>) {\n let note_type_id = log_metadata as Field; // TODO: make note type id not be a full field\n\n assert(\n log_content.len() > PARTIAL_NOTE_PRIVATE_LOG_CONTENT_NON_NOTE_FIELDS_LEN,\n f\"Invalid private note log: all partial note private logs must have at least {PARTIAL_NOTE_PRIVATE_LOG_CONTENT_NON_NOTE_FIELDS_LEN} fields\",\n );\n\n // If PARTIAL_NOTE_PRIVATE_LOG_CONTENT_NON_NOTE_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // destructuring of the partial note private log encoding below must be updated as well.\n std::static_assert(\n PARTIAL_NOTE_PRIVATE_LOG_CONTENT_NON_NOTE_FIELDS_LEN == 2,\n \"unexpected value for PARTIAL_NOTE_PRIVATE_LOG_CONTENT_NON_NOTE_FIELDS_LEN\",\n );\n\n // We currently have two fields that are not the partial note's packed representation, which are the storage slot\n // and the note completion log tag.\n let storage_slot = log_content.get(0);\n let note_completion_log_tag = log_content.get(1);\n\n let packed_private_note_content = array::subbvec(log_content, 2);\n\n (note_type_id, storage_slot, note_completion_log_tag, packed_private_note_content)\n}\n"
3850
3850
  },
3851
3851
  "73": {
3852
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/discovery/private_logs.nr",
3852
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/discovery/private_logs.nr",
3853
3853
  "source": "use crate::{oracle::message_discovery::sync_notes, utils::array};\n\nuse dep::protocol_types::{\n address::AztecAddress,\n constants::{MAX_NOTE_HASHES_PER_TX, PRIVATE_LOG_SIZE_IN_FIELDS},\n debug_log::{debug_log, debug_log_format},\n};\n\nuse crate::discovery::{\n ComputeNoteHashAndNullifier, MAX_LOG_CONTENT_LEN,\n partial_notes::process_partial_note_private_log, PRIVATE_LOG_EXPANDED_METADATA_LEN,\n private_notes::process_private_note_log,\n};\nuse crate::encrypted_logs::log_assembly_strategies::default_aes128::note::encryption::decrypt_log;\n// TODO(#12750): don't make this value assume we're using AES.\nuse crate::encrypted_logs::log_assembly_strategies::default_aes128::note::encryption::PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS;\n\n/// Searches for private logs that signal new private notes that are then delivered to PXE, or new partial notes that\n/// are stored in the PXE capsules so that `fetch_and_process_public_partial_note_completion_logs` can later search for\n/// public logs that will complete them.\npub unconstrained fn fetch_and_process_private_tagged_logs<Env>(\n _contract_address: AztecAddress,\n _compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n) {\n // We will eventually fetch tagged logs, decrypt and process them here, but for now we simply call the `syncNotes`\n // oracle. This has PXE perform tag synchronization, log download, decryption, and finally calls to the the\n // `process_log` contract function with the decrypted payload, which will in turn call `do_process_log` with a\n // decrypted log, letting us continue the work outside of PXE.\n sync_notes();\n}\n\n/// Processes a log's ciphertext by decrypting it and then searching the plaintext for private notes or partial notes.\n///\n/// Private notes result in nonce discovery being performed prior to delivery, which requires knowledge of the\n/// transaction hash in which the notes would've been created (typically the same transaction in which the log was\n/// emitted), along with the list of unique note hashes in said transaction and the `compute_note_hash_and_nullifier`\n/// function.\n///\n/// Partial notes result in a pending partial note entry being stored in a PXE capsule, which will later be retrieved to\n/// search for the note's completion public log.\npub unconstrained fn do_process_log<Env>(\n contract_address: AztecAddress,\n log: BoundedVec<Field, PRIVATE_LOG_SIZE_IN_FIELDS>,\n tx_hash: Field,\n unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n first_nullifier_in_tx: Field,\n recipient: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n) {\n debug_log_format(\"Processing log with tag {0}\", [log.get(0)]);\n\n let log_plaintext = decrypt_log(log, recipient);\n\n // The first thing to do after decrypting the log is to determine what type of private log we're processing. We\n // currently just have two log types: 0 for private notes and 1 for partial notes. This will likely be expanded and\n // improved upon in the future to also handle events, etc.\n\n let (log_type_id, log_metadata, log_content) = decode_log_plaintext(log_plaintext);\n\n if log_type_id == 0 {\n debug_log(\"Processing private note log\");\n\n process_private_note_log(\n contract_address,\n tx_hash,\n unique_note_hashes_in_tx,\n first_nullifier_in_tx,\n recipient,\n compute_note_hash_and_nullifier,\n log_metadata,\n log_content,\n );\n } else if log_type_id == 1 {\n debug_log(\"Processing partial note private log\");\n\n process_partial_note_private_log(contract_address, recipient, log_metadata, log_content);\n } else {\n // TODO(#11569): handle events\n debug_log_format(\n \"Unknown log type id {0} (probably belonging to an event log)\",\n [log_type_id as Field],\n );\n }\n}\n\n/// Decodes a log's plaintext following aztec-nr's standard log encoding.\n///\n/// The standard private log layout is composed of:\n/// - an initial field called the 'expanded metadata'\n/// - an arbitrary number of fields following that called the 'log content'\n///\n/// ```\n/// log_plainext: [ log_expanded_metadata, ...log_content ]\n/// ```\n///\n/// The expanded metadata itself is (currently) interpreted as a u64, of which:\n/// - the upper 57 bits are the log type id\n/// - the remaining 7 bits are called the 'log metadata'\n///\n/// ```\n/// log_expanded_metadata: [ log_type_id | log_metadata ]\n/// <--- 57 bits --->|<--- 7 bits --->\n/// ```\n///\n/// The meaning of the log metadata and log content depend on the value of the log type id. Note that there is\n/// nothing special about the log metadata, it _can_ be considered part of the content. It just has a different name\n/// to make it distinct from the log content given that it is not a full field.\nunconstrained fn decode_log_plaintext(\n log_plaintext: BoundedVec<Field, PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS>,\n) -> (u64, u64, BoundedVec<Field, MAX_LOG_CONTENT_LEN>) {\n assert(\n log_plaintext.len() >= PRIVATE_LOG_EXPANDED_METADATA_LEN,\n f\"Invalid log plaintext: all logs must be decrypted into at least {PRIVATE_LOG_EXPANDED_METADATA_LEN} fields\",\n );\n\n // If PRIVATE_LOG_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring of\n // the log encoding below must be updated as well.\n std::static_assert(\n PRIVATE_LOG_EXPANDED_METADATA_LEN == 1,\n \"unexpected value for PRIVATE_LOG_EXPANDED_METADATA_LEN\",\n );\n\n // See the documentation of this function for a description of the log layout\n let expanded_log_metadata = log_plaintext.get(0);\n\n let log_type_id = ((expanded_log_metadata as u64) / 128);\n let log_metadata = ((expanded_log_metadata as u64) % 128);\n\n let log_content = array::subbvec(log_plaintext, PRIVATE_LOG_EXPANDED_METADATA_LEN);\n\n (log_type_id, log_metadata, log_content)\n}\n"
3854
3854
  },
3855
3855
  "88": {
3856
- "path": "/mnt/user-data/esau/code/aztec-packages/noir-projects/aztec-nr/aztec/src/hash.nr",
3856
+ "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/hash.nr",
3857
3857
  "source": "use dep::protocol_types::{\n address::{AztecAddress, EthAddress},\n constants::{\n GENERATOR_INDEX__FUNCTION_ARGS, GENERATOR_INDEX__MESSAGE_NULLIFIER,\n GENERATOR_INDEX__PUBLIC_CALLDATA, GENERATOR_INDEX__SECRET_HASH,\n },\n hash::{poseidon2_hash_with_separator, poseidon2_hash_with_separator_slice, sha256_to_field},\n point::Point,\n traits::{Hash, ToField},\n};\n\npub use dep::protocol_types::hash::{compute_siloed_nullifier, pedersen_hash};\n\npub fn pedersen_commitment<let N: u32>(inputs: [Field; N], hash_index: u32) -> Point {\n std::hash::pedersen_commitment_with_separator(inputs, hash_index)\n}\n\npub fn compute_secret_hash(secret: Field) -> Field {\n poseidon2_hash_with_separator([secret], GENERATOR_INDEX__SECRET_HASH)\n}\n\npub fn compute_l1_to_l2_message_hash(\n sender: EthAddress,\n chain_id: Field,\n recipient: AztecAddress,\n version: Field,\n content: Field,\n secret_hash: Field,\n leaf_index: Field,\n) -> Field {\n let mut hash_bytes = [0 as u8; 224];\n let sender_bytes: [u8; 32] = sender.to_field().to_be_bytes();\n let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n let recipient_bytes: [u8; 32] = recipient.to_field().to_be_bytes();\n let version_bytes: [u8; 32] = version.to_be_bytes();\n let content_bytes: [u8; 32] = content.to_be_bytes();\n let secret_hash_bytes: [u8; 32] = secret_hash.to_be_bytes();\n let leaf_index_bytes: [u8; 32] = leaf_index.to_be_bytes();\n\n for i in 0..32 {\n hash_bytes[i] = sender_bytes[i];\n hash_bytes[i + 32] = chain_id_bytes[i];\n hash_bytes[i + 64] = recipient_bytes[i];\n hash_bytes[i + 96] = version_bytes[i];\n hash_bytes[i + 128] = content_bytes[i];\n hash_bytes[i + 160] = secret_hash_bytes[i];\n hash_bytes[i + 192] = leaf_index_bytes[i];\n }\n\n sha256_to_field(hash_bytes)\n}\n\n// The nullifier of a l1 to l2 message is the hash of the message salted with the secret\npub fn compute_l1_to_l2_message_nullifier(message_hash: Field, secret: Field) -> Field {\n poseidon2_hash_with_separator([message_hash, secret], GENERATOR_INDEX__MESSAGE_NULLIFIER)\n}\n\npub struct ArgsHasher {\n pub fields: [Field],\n}\n\nimpl Hash for ArgsHasher {\n fn hash(self) -> Field {\n hash_args(self.fields)\n }\n}\n\nimpl ArgsHasher {\n pub fn new() -> Self {\n Self { fields: [] }\n }\n\n pub fn add(&mut self, field: Field) {\n self.fields = self.fields.push_back(field);\n }\n\n pub fn add_multiple<let N: u32>(&mut self, fields: [Field; N]) {\n for i in 0..N {\n self.fields = self.fields.push_back(fields[i]);\n }\n }\n}\n\n// Computes the hash of input arguments or return values for private functions, or for authwit creation.\npub fn hash_args_array<let N: u32>(args: [Field; N]) -> Field {\n if args.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator(args, GENERATOR_INDEX__FUNCTION_ARGS)\n }\n}\n\n// Same as `hash_args_array`, but takes a slice instead of an array.\npub fn hash_args(args: [Field]) -> Field {\n if args.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator_slice(args, GENERATOR_INDEX__FUNCTION_ARGS)\n }\n}\n\n// Computes the hash of calldata for public functions.\npub fn hash_calldata_array<let N: u32>(calldata: [Field; N]) -> Field {\n if calldata.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator(calldata, GENERATOR_INDEX__PUBLIC_CALLDATA)\n }\n}\n\n// Same as `hash_calldata_array`, but takes a slice instead of an array.\npub fn hash_calldata(calldata: [Field]) -> Field {\n if calldata.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator_slice(calldata, GENERATOR_INDEX__PUBLIC_CALLDATA)\n }\n}\n\n#[test]\nunconstrained fn compute_var_args_hash() {\n let mut input = ArgsHasher::new();\n for i in 0..100 {\n input.add(i as Field);\n }\n let hash = input.hash();\n dep::std::println(hash);\n assert(hash == 0x19b0d74feb06ebde19edd85a28986c97063e84b3b351a8b666c7cac963ce655f);\n}\n"
3858
3858
  }
3859
3859
  }