@aztec/protocol-contracts 0.55.0 → 0.55.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 (8) hide show
  1. package/artifacts/AuthRegistry.json +1 -1
  2. package/artifacts/ContractClassRegisterer.json +1 -1
  3. package/artifacts/ContractInstanceDeployer.json +1 -1
  4. package/artifacts/FeeJuice.json +1 -1
  5. package/artifacts/KeyRegistry.json +1 -1
  6. package/artifacts/MultiCallEntrypoint.json +1 -1
  7. package/artifacts/Router.json +1 -1
  8. package/package.json +4 -4
package/artifacts/KeyRegistry.json CHANGED
@@ -1 +1 @@
1
- {"transpiled":true,"noir_version":"0.33.0+cb20e078dd909656110d133339b2b425e6c3ebb0","name":"KeyRegistry","functions":[{"name":"register_initial_keys","is_unconstrained":true,"custom_attributes":["aztec(public)"],"abi":{"error_types":{},"parameters":[{"name":"inputs","type":{"fields":[{"name":"calldata_length","type":{"kind":"field"}},{"name":"is_static_call","type":{"kind":"boolean"}}],"kind":"struct","path":"aztec::context::inputs::public_context_inputs::PublicContextInputs"},"visibility":"private"},{"name":"account","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::aztec_address::AztecAddress"},"visibility":"private"},{"name":"partial_address","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::partial_address::PartialAddress"},"visibility":"private"},{"name":"keys","type":{"fields":[{"name":"npk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::NpkM"}},{"name":"ivpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::IvpkM"}},{"name":"ovpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::OvpkM"}},{"name":"tpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::TpkM"}}],"kind":"struct","path":"aztec::keys::public_keys::PublicKeys"},"visibility":"private"}],"return_type":null},"bytecode":"H4sIAAAAAAAC/5VYTYg0Rxl+u6q7t3d3dvZnenpmeqenp6e7Z2Z3+0u+aOhVwUNIzI/5YswXvIheBD1oUDwJHjx5EcVDCEiQIBIFbwYJBPSWY0AQQ5DgwZNHTyqiYPB5qrprV7P7gQvV+1bV+1dvvfXUW3NXtKceER29KHJX9NEIH4nPBH8x2kgkejyTMHoieuIF9KMnbBOF5nHimegZM/GMbVcT96J7ZuKebVcTz0fPm4nnbbuauB/dNxP3bbMTl3BA9CWt+vh+SgJ8n5QQ36dkB9+nJbqk6V18Py17+D4r+5e0OcD3OTnA9zMyvKSxQ3w/K0f4viDHl7Ry8hCMFE/S7ItcNJbvjVuzeC1jaZWOOaT7IY0h3wz5/ZAPIU/8fvwa610JRVNFIt5uPJcwjl/oIxv3C9yTcEePffHicQI6MnQypsxgDJnx2MiMu9bL7OkEfONkAnrfyEzGHImTMSQPE0gmiZFMutZLHuiYFmJKDg09iTtdkDx5gORR7xvoY91Zs5ZN3PDxJ49i0fbvQPo/BkamCJM3Q0weTdEdnOKj53fEe0mSRr4Aq7s0PcjwOVzgc5JTaYFwLhnOwuzNCt2C3ZXpluiu2C1Nt0K3ZLdi16/Rrdit5a6HWZCVwmC9blW6Rm+tQOlrVKuqJSSDB0nqGyV7KqaOolXjFRKibOR7rUyrRr4/gIbT+o7I+1I38sPWKxd74i38DEMvS/aUJwLOvJFXwJnPFxh+QxaN/Kj1ihVdyvtA5MYlkivFEPkLkEuVPasR6Rwta73lykzDh9WSPXXVU0t4NyuNDCNZTFettyrBVYCrUJgtlq2Uo8b7OiYWdGdBL9+UrJF34c4CLaPhinMVF/VrqbkCqMtUjW+dV61XJVBKRm0Z12B8W9aO0cTMMEIkTGqjMyFrQtZ3LOulyCLSgCgJIh+n1V/h4AZirHQqklZlaHUB/zCQjxfD3uk/9KFdMLQwcLBGHCksaxPHTk8r602rdjbobRSoyFGJo/Ycte+ozFEHjho6auGoI0cdOyrf8BxsmBmbLXz9l2y72NRqi++22rTeZo1UqZEqtQ8ez7M82BiM6XrOsVS2jRcg1jWGIbLaMubn0Ls9v8D8QC66QNY2kP71QALr9Zm6wPdie96q9TndG68Rwc2a2iedRXWG3FmvGu+TyNO68eYD2t+A43HZNF5u7RdcU3CGGHMFUM4Yb82Kz7i91L5VFyZXectctN7WBWSzbb16o/pezTnX297iv5U2/k+N/+CFp1tzBuEtj+64xnKqGlnlPWazCkeZp5IB4zoYf+8pxvErXAPa1njLORPD52wMrfe0VZ+33vkZFu2CXZ83YPycNI6xwbcxjBAJzy6MzjOynpH1i5YV69rckODGSqfiDOtBuyjgH9NjvBn2Tn+12x7ZcE9a0Ty3xMKsNeCtJTPQuEA3Y3dhukSTRYcm6OLAEzo0EIY+XgfdDmsAFq0QicLDslWlwxd9jQK2JFfwrx38G0gtemy2OkmWVud/K/kwtUQrM2znApCaN96rSMBl4/0YWlWBaC6L1R3Rrwt2+yetl4c4LKG/RGxel2WHqwjKz8E5mofg/LaEjfeL1st4awVha8ocDb/pF8lEhYwClz1ShclVLqpovVFipgE2yYg9ddVTI7g4y40MA51NAX8JjsUoU0Q7zGYjXJx5MIJrb8uIrjF3Rn3sR8YBkrnC4Ah4GHpUbtRRQZCZycys/DkfPk1tkcatlQLaRzrA8gM/h413JacNFh8B7tMgMJd60LWr4iPHFR7ktvgIeMGjA9R4gIwtPoKkMMUH6SKhZB4kLD5ySOa5kcy7dlV8WL7CFB+ki4D2E4ii+HiA5JGxkxubx53NznPsqY8iwvsbiwjWDwNWEochi4jgw+n9f9UU/vWawuUtBqsaRYS9PUDpaxSylfdyQEVppwiSJFOFwbICly0pbqFitBQgNgaI+auGx2SaNqpECqen8R1R35S4waXlrVLsduojAupcki7Zs0Y14MzmKYafFgg+zNudLmV9IDKXa4VJJ39uMis1yc5kSnGSJhibqEmrJjl76qqncng3WxkZc06nLDNm4LoqNQAxs0WjQ4BpSndSenkP+6S+Bl7oX/L8+SHnwgBz9yXooDNRyDZ4C9kwhlIyasvog/Hz4jtGHALtG0aIhHFgdMZkjcn6JcsKjE1vwFhjpVMR46ChBUv4x/M2Toe909/oQ5sytCwiyr7It1tLMu63dsdtY+SozFF7jtp3VOKoA0cNHRU66shRx44KKhYRLLBSVmLqZVeJxbYSS1lgobxboWr3Yp88r1oebAzGdDzn2K9QlqrXEGvEu4BIUTPm7nJUP7P3DAIZ33AJ2/LXFC01LutyY27dkrduSe2/7CyqNXKnLBr1HvIUKfzmgPYrcPxRqka9Ze0vuabghkKtUmtu78aWSCZXYVlYNriA4Fx6caX6Xsw516tv8d9KG/+nxn/wwtPanEF4y6M7jrGcNC7h7PtS2oSIeSoZMK7DxP9PjOMHXAMLIuMt50wM//y/BV7cFXi5C3a8OQPjX+TMMZr6zDBCJFxvjc41Wddk/btlxbqqGxLcWOlU4GHC58sWCf4B02NcDTunteq2RyruCYoInltiYYo9IDIAx9AdznpEm11DtBkPhIGK2QRHngV8MuHzNb7tyQuLM8FZ091t2uhj4N2c6J0SvXeJ3gOi96GBM73keT6dQe5xmTUaEZ+nV0d6eH3FM6icKePOKe7OBdpsbrU8REfnBhlPoeqjctrojzwMM7gycHPO+SI9sFA1xfzHZdptwkzhmtXTDJiVzj/BIQjIqUGJ+bDX95ic2iDOaQsumsAkCBm9wTXMkFlIxSCxZsfiBqjIUamj9hy176hdRx04auiogaOOHHXsqEO+wgcWGk/g75flpFvfRJ3gewIIxIOeTp+Q6QQXjX5J4i69ZjcE267GWMhOgGMnJiQJQ5Jwt74lM3vsJ9iChBvZegvi+ChEfaa/I8tGA3MI3xmLRH/FuRWOmP6uPWKm8jR37ojPVJRgCRm1ZQRw6B9I5RjNMTaMEAmL0uhkiTgqyPqKZcViwhvOSnezGxWFfSaXcPk1VnTjcNg7/dO+qAxZVBpfrtUP2GLzqMYNKHhUq5HVCiosWbXxCl+WdOYN53dhjS6R1iV8z1HheIVPnrcsD4KGMV0QKPXvAJT6N4gDYrGAyIJgqQkI1RqvMf22bLpFFjcAnS1TzJupAhisCNzluMDqSlNF/1ZWdsdqHJwCMPBXnJ2i0b8f0D435p9SNvo9az8rb/mxpFQWpgysbgxQw7JseBX1ASl5y5Sq7xWcc73qFv+ttPF/avwHLzytzPMA3jINzHLso+Af3XKk4IOBAeM6TPz/jTj6c64BrepBtWAMfW1jaL2nrQIgvcbFkrhgF3wc+/sO0bvbwzBCJKw3VQ/+BcHfH7kLtLz15wyrgpcPWp01piorzD1qnMaTxCaElNyTSy/SUbiPX29DUdEO5tfRTuPjpYzxoPE/dsnfNQOPT7EIVc4jhtg9gMBu5Ed7E/GivWiPv73in/ntdc+2Hqf9NtqDeESBfZjbjyJ2A9NVURTts7sL67uNf/GIp6GRhh++lOk703f+A/S1AyteFgAA","debug_symbols":"7V3tjtzGEXwX/faPmZ6eL79KEARy4gQCBDmwlQCBoXfP3p6X3Fsup0GJFqu7+SeRrLm9qiK3q6ZJNn9/94+ff/rPv/724dM/f/nt3Y9/+f3dx1/+/v7zh18+Xf72+5cf3v3064ePHz/862/3//ldePmflK7rf/v3+08vf/3t8/tfP7/7Mfzw7udP/7j8/+Vn//nh48/vfuQQv/z1h3eJty3P25aXbcvrtuVt2/K+aTmHbcvjtuW0bfm2o8rbjipvO6q87ajytqPK244qbzuqedtRzU+Paqyh//ETscb25od+WKwmKrfPJ6o8rW75yeIY023x5Y91WkyFn63uKd9W90rCR9dSJtS9zx/NV6ZsiGkLfFvcYn1kmk0d0zwzbY9Mi6VjSjQxTfmRaTV6TFN5ZNrAmbYbEArUvqUiFfTau4XpsCIVMnVMBxWpJEvHdFSRCrqffu0xXVSkAu+nPDPt9x/9Ah7bIilwnsA3/vIt5bQbYjospzWYOqaDclqxLXLjMR2V04ptkV9/TBfltKJb5F05bfmhnFZs16MY4u2jY/qmdFqxdxzbmI7LKfaOY+sxHZVTcIvcdkxH5bSBW+RXH9NFOW3wHTyemT6m076H66U8gU9FAE9lalRQeduoeIGTvjecmm8nMdUeHuHw94bT6rS4h/YIJ39vOL3dDCoFSo9w9tjZJJrgcIzCiR/uzvxw+UV3p36/IqpwiBocoo6GKIaAByniQSI8SAkPEuNByniQ4Ep3DHC1O4YDinctM6TW30B6sr7kdFte6uzPiV/xd934Y1COPyrHT8rxJ+X4WTn+rBx/UY6/Ksev3H+jcv8l5f5Lyv2XlPsvKfdfUu6/pNx/Sbn/knL/JeX+S8r9Nyn336Tcf5Ny/03K/Tcp99+k3H/T96+fdNeSJaYvjy1Z/v5fycuF2AlSCixJOlx/pZDQKVSebtaphR7PCmbl+LNy/A0df8v1trzVco9/ubhNQBrxI9UcLVF9qW7zZ5cFWfjStons5ar+bXHkviALXwT3JAtfMfckC19e9yRbPJGtnsiaclmJbHdEtgRPZG0lKIGspwRVPCWoXZ51VUPWU4IqihPUFb/iUHTFD59zer/tmimEJX746DLGX+HTiIAfPmAI+OEzg4AfPgYI+E3toIfdzGpq/9zb9ExkCAuuzdQmS+Bqao8lcLW1xRp35JutLZZAlj2RtbXFEsjaalILZG01qQWytprUAllbTeox2W6rSR14/uy8uM+oG7vMPyZrLEGNyRpLUGOy7ImssQQ1JmssQY3J2k1QT8h6SlDdUYKiYCxBjck6ulGSgqMeFAVHPSgK7Imsox4UBUc9KAqOelAUHCUoCp4SVPQUKqKnUBE9hYoDpigdSPYA6ykT+kB38P943pEOmOIjQupwkA6YtSNCiniQCA9SwoPEeJAyHqSCBwmvehNe9Sa86p3wqnfCq94Jr3onvOqd8Kp3wqveCa96J7zqnfCqd8Kr3oxXvRmvejNe9Wa86s141ZvxqjfjVW/Gq96MV70Zr3pnvOqd8ap3xqveR8wAmufdXeC9hfRk/fDRZTpirM82/Jfe92355Rct8Gfl+Ity/FU5/gaPn6dpmNcVb/EfMRtlG35ut5dUXv640P+IcSe74oev/wJ++Ppf5rfulhQX+OHrv4Afvv4L+OHrv4Afvv4L+Ltu/EeMDtkVP7z/Cvjh/VfAD++/An7l/lvx/Xc0Hp4qvv+O8eP77xg/vv+O8eP77xB/w/ffMX74+pmm0VGR45v913LxaPQSNfiv+haqcXwPaIOvC3uShS8im8iOO84dvuLsSRZ+e7AnWfi9xJ5k4Tcee5I15bISWfgtzZ5k4fc/e5K1laAEsrYSlEDWUYJKwVGCSsFRgkrBUYJKwVGCSoE9kXWUoFKAT1BMbSLLcYEfPhQJ+OFzjoAfPrqM8Uf4NCLgx7+Daowf/w6qMX7dd1ClI0Yz7Iof3qwF/Fj+dYWEZUlXSFgu8wKJsIzjCsnUlmR0NTERfNnaQnX4wo9Epvp+AldTbT+Bq62u3/AicUq2un4CWVtdP4Gsra6fQNZW108ga8pkJbK2un4CWVvXTQWyxu48G706ICVjd56NyRpLUEOybCxBjckaS1BjssYS1JissQQ1JstmffYJWU8Jij0lKHZ0735iR/fuJ/bUg8qeelDZUw8qe+pB4Q9t2pMseyLrKUHhz47ak6ynUJE9hYriKVTgz+vak+zzAlXaNFOxJolsvOydbqtzvPsV9JxtTHM74SLrG7ZXTBUQUwPE1PEwrQwLOhZTBMREgJgSICYGxJQBMQHW8QpYx+sRdbyWGVPrkrsPp6mk2pUTaEE7gaidAGknkLQTYO0EsnYCRTuBqp2Adidu2p24a3firt2Ju3Yn7tqduGt34q7dibt2J+7anbhrd+Ku3Ik5KHdiDsqdmINyJ+ag3Ik5KHdiDsqdmINyJ+ag3Ik5HlBG6a5jTkxfHjrmHAkQ0wFfNeozpnT3oPPKgR6uv3Io8BwqT++VqIUWJ2vVTqApJ0ARnkDL06e3+ubuk+Xi0TAMJjbFdXxbDhN+gdvEdjifjwm/FO7JFr9u7skWv8juybZ7YpuCK7a23FZiS67YJlds2RVbV1kqucpSyVWWSq6yVNKcpV4IsOZ4dCWAn3j69CgMhbAkgB9iBAL4uUQgwNoJ4KcHgQB+IBAIrAzmyNPc0drSGwLXn2pf9VP9a35qZeZC47viGgSJe7wt7qVOa+PLw4DLT86TvH0+dJTbs8/N0/Cenrt0feqyejpw4e66y+sli5VxC/Z4khOeyQlPdsIzO+FZnPCsTng2Jzy7D57FSR4qTvJQcZKHyg55KAam6Vfc4VlhGurcAgtJ+OxSbvealbtdyGUr94qeVaPPqtEX1ehXckabbm3soUroab4Rkvr81WrPOr9EZRqPQ3XuDzwfj3P3TH9M9e4b/rSp3NO0V++VhI+uky6x3heP187DyjATB7q0MNXJFutCl+j3fMmzLm2hC7k9X2gqXS3lhS7pPF8uupSFLmxJl9anJi61b6u7pvxoiy5C3W1+z5dh3e1uz5dh3W2m8svXni/Lutts5Reeden3H32laiiSUOA8UW0sngIji1kZYONAl7HFrMzFcXG+jCymGYokG8+XscUYiiRff748sRhTkeTOYlp+tJhuKGVQDLcXmVNM37aL6YZ2vdt0GVtMN7Tr3Xq+jCymW4ok286XocV0S5Hkq8+XpcV0W117nnV53MXk8N0tJk2XICkVgSqVqSVI5W1L8Ao+QoOv+fblo9rDAjxBg2/TRTDqoS3AJ2jwfcKRAqUF+O9uk9veWSFM2s4hK8dflOOvyvE35fi7bvwxKMcfleMn5fiTcvzK/Tcq99+I7r87Dn7LEd2sdyWL7uy7kkWPAXuSJfTMsCtZ9ICxK1n0NLIrWfTositZ9kQWPRTtStZTgiJPCYo8JSjylKCSpwSVPCWo5ClBJU8JKnlKUMlTgkqeElTylKCSpwSVPCUo9pSg2FOCYk8Jij0lKAa3HuF9NDmD15yd312TM3jZ2fMtKzmDl519yYKXnX3Jgsf7g961kzN4XjzsvTy52Cr0+03rzsWWJeypjC3/2FMZW2azpzJ8KrOiDHj/8UBl/KYZSRn07eVxyoC3QQ9UxnEGHitTzwy8psyZgdeUOTPwmjJnBl5Thp0ocyXrJdZeydpKqsPX1+RqK3wKZG3lSYGsrYg4JttspT6BrK0gJ5D14rMbr4I0v52m3qbBMyEshfHbNBCE8dszGAvTHbcMxhcUu+OWgaCM45aBoIzjloGgDJ/KrCjj+LKZoIzjy2aCMo4vmwnKOL5sFnj+7Ly4k7d7vnVspEwJnjPwWBnPGXisjOcMPFbGcwYeK8OnMivKnBl4TZkzAz9PegV9iuqBynjOwGNlzscnVpRBnyl7oDJnH3hNmbMPvKbM2QdeU4ZPZVaUOTPwmjJnBl5T5szAa8qcSW9FGfRJwAcqcya9NWXOpLemDLprl4lqoDuuf8wLKeiTaEX86A4o4Ufv1Uj40X1WwI8+1VXEj+5ZEn50Z5Hwo+/0JfysHL9y/0WfYyriV+6/6NNGRfzK/Rd9JqiIX7n/ok/uFPEr919W7r+s3H9Zuf/Cz2eV8Cv3X1buv/DzcSX8yv0XfoSthF+5/2bl/puV+y/8oF8Jv3L/zcr9F34gsoAffmyxhB/df+e3G1y4vMX/ZP1w7lWBnxe8jSzFaQT75RctyKI7+65k2RNZ9MywK1n0gLGRLM9IyrJAobvhNrLc4m05t8WRhZ92uitZWz4rkLXlsyVMBepyvX5B1pbPCmRt+axA1pbPCmRt+axAFn3XvytZ9BbBrmRtJagxWfjJobuStZWgBLKeElQzlqBGL+Qs8DNhdyVrLEGNyRpLUGOyxhLUmKyxBDUkCz8ddBvZNE3ojhzfdCqWi0dDqwv8nMc/T5c4foYKfs7jccrYqpKblBlfioOf83icMrZ2sPspU+HnPB6njK298Z7K+E0zkjK2dt17KsOnMivKOM7AgjKOM7CgzJmB15Q5M/CaMmcGXlEGfs7jccqcGXhNmTMDrylzZuA1ZdjW/WrUJmU4LsjairUCWVtJVSBrK3wKZG3lSYGssVulh2ThZz7uStbRrdIVfjLjrmRtxS2BrOJQccWvOCdc8Su2/it+xW7+gh9+suEx95FU+ImJf54uw1dZV/hRgIcJ4/fagiCM40sLwxuPKvxYxOOUcXxpYawM/CjH45RxfGlBUMbxpQVBGceXFgRl+FRmRRnPt5iPXjBb4cd8HqeM5ww8VsZzBh4r4zkDD5WBH6d6nDKeM/BYmTMDrylzZuCVpAc/tvY4Zc7HLNeUOR+zXFPm7AOvKXP2gdeUOfvAK8rAjzQ+TpmzD7ymzJmB15Q5M/CaMnwqs6LMmfTWlDmT3poyZ9JbU+ZMeivKrE3z5fn16i+YBWW4T8rUeXUs7cnqktpNmpL63epYnn12pUn1SvVe9Sv8rBt+0Q2/6obfdMPvquGvTa7VAj/qhk+64Sfd8HW7btPtuk236zbddb/rrvtdd93vuut+1133O3zdn59nbKEKe9ySbk9mUKl0v8e9coU3iS1ca6Yb10sFW3CFd5QtXFudehc9tAVX+E3fFq59agGlS6PkgWsL6F7V0sw100O5aQG9Wrb51aTt7rNv8NGrZY8Tks5L9dELoAAfvaYJ8NHLlAAfvTclwEffo4zhR/S6L8BH36MI8A+o+5wm+EWCX+IUBi9/TG9WX/Fn5fg7Ov5+Q1LoLuHd8FNAx99oiD+C46fQJ/yxLfGTcvxJOX70+inhR6+fEv6iHH9Vjr+h1//SZvxdWN15QtL5rvU0sYV363W2L/gTvFsL+NHdWsKP7tYSfvQ2y7hHl9DbLK1OkzpbLwv46G0WAT56m0WAj95mGcNn+Pb6GD56m0WAj34pWIAPf3FjDJ91w4d33TF83a7Lul2Xdbsu63bdrNt1s27XzbpdN+t23azbdbNu1826XTfrdt2s23Wzbtctul236Hbdott1i27XLbpdt+h23aLbdYtu1y26Xbfodt2q23Wrbtet8K47vP+86r59Hn60gwAf3nXH8OFddwwf3nXH8OFddwwf3nWH8OFHOwjw4V13DF+368KPdhDg63Zd+NEOAnzdrtt0u+7KaIfSph+qqUnw00w2x3lLkSg/Wx2oz4P50937AVdGp12a+DOBu0/f+g7PtjIHQivX4VsW28rcAqNksyeyxRTZ8bTDtjK7wCrb5optd8S2B1tWK7G1ZbYSW3LFNrliy8bYjt6L1YOtKCWxtZalxmytZakxW2tZaszWWpYaso3WstSYreEs9YStqywVXWWpaC1Ljdlay1Jjtp76Uj166kv16Kkv1aOrvhS56kuRq74UucpS5CpLkat0Qa7SBblKF+QqXaQjHGi+CSTQHf4XtldMBIgpAWJiQEwZEFMBxFQBMTVATB0PEwdATIB1nAHrOAPWcQas4wxYxxmwjvMRdXzb235jmMJl5P4YALnBE6DIt+WUaEGgKyeQg3YCUTsBwifA88vDy+JLnDM8AZ7fqsVteQSKdgL4PiAQwPeBEqYvcUlxQQDfB8YECr4PCATwfUAggO8DAoGknQBrJ4DvxAIBfCcWCOA7sUBAuxMXBU48Ly91cdNfVeDEYwIKnHhMQIETjwkocOIxAQVOPCaAX0ZTn5ZzfLMjWy4ePUzeG/73fQtX4Zp1wy8Oe7LFrySb2I7b0Q2/7OzJFn+3sCdb/K3Fnmzx9yF7srXlthJb/B3Ojmw7/nZoT7bGspTA1liWEti6ylKHTF06jq2rLNVdZanuKkt1V1mqe8pSl3/ED1NM01B25rhkgB+QJAb4oUdigB9kJAasnoGCm64EBgruuhIYKL/t6sIA3+wlBvgGLjCIYI72CgrMpF5BgfnOKygwK3kFZWvLMrr8eCFra8cyHHl8+W22OoQSW1sdQomtsQ7h8Nry5V/xU/iudI31CCW6xpqEEl1jXUKJrrE2oUTXWJ9QoJuMXXSV6Fq7g200Q/VC19otbAJda6lKoMu+6FpLVQJda6lKoGstVQl0DaeqZ3R9pSr2larY03MBF7qeHgy40PXVqzpkTNKBdH31qthXr0rB3Khd6frqVSmYSbUnXQUTrHal6ytmZF8xI7Mvun5ixpfL3/77/tcP73/6+PNvl595+cf/fPr75w+/fPrjr5//9+/Xf7ks/j8=","brillig_names":["register_initial_keys"],"assert_messages":{"832":"attempt to add with overflow","320":"attempt to add with overflow","756":"Array index out of bounds","622":"attempt to add with overflow","686":"attempt to add with overflow","875":"Array index out of bounds","1055":"attempt to add with overflow","348":"Array index out of bounds","601":"Array index out of bounds","278":"attempt to add with overflow","915":"Array index out of bounds","214":"attempt to add with overflow","1034":"Array index out of bounds","193":"Array index out of bounds","449":"Computed address does not match supplied address","769":"attempt to add with overflow","961":"Array index out of bounds","824":"Array index out of bounds","943":"Array index out of bounds","748":"Array index out of bounds","361":"attempt to add with overflow","675":"Array index out of bounds","928":"attempt to add with overflow","340":"Array index out of bounds","593":"Array index out of bounds","657":"Array index out of bounds","907":"Array index out of bounds","267":"Array index out of bounds","1026":"Array index out of bounds","249":"Array index out of bounds","886":"attempt to add with overflow","1014":"attempt to add with overflow","185":"Array index out of bounds","868":"Array index out of bounds","740":"Array index out of bounds","609":"Array index out of bounds","728":"attempt to add with overflow","1042":"Array index out of bounds","466":"Storage slot 0 not allowed. Storage slots must start from 1.","972":"attempt to add with overflow","332":"Array index out of bounds","201":"Array index out of bounds","899":"Array index out of bounds"}},{"name":"compute_note_hash_and_optionally_a_nullifier","is_unconstrained":true,"custom_attributes":[],"abi":{"error_types":{},"parameters":[{"name":"contract_address","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::aztec_address::AztecAddress"},"visibility":"private"},{"name":"nonce","type":{"kind":"field"},"visibility":"private"},{"name":"storage_slot","type":{"kind":"field"},"visibility":"private"},{"name":"note_type_id","type":{"kind":"field"},"visibility":"private"},{"name":"compute_nullifier","type":{"kind":"boolean"},"visibility":"private"},{"name":"serialized_note","type":{"kind":"array","length":0,"type":{"kind":"field"}},"visibility":"private"}],"return_type":{"abi_type":{"kind":"array","length":4,"type":{"kind":"field"}},"visibility":"public"}},"bytecode":"H4sIAAAAAAAA/9VW207DMAx1Wbum6yom+IHyhuCBVtqkPQ5x/QB+YBqV2MuG1sL3M3c2O8sKLzQSjRQ5ceLjE8e5eLQrZls9aQci+3RcdM5MZPa3kreIlbnk6XWE50lHePY6wtNvkafXwJOlL20+d3zmQtqdx6NBNOaN7sE4/QLkWU653ED7UuTL27JMF+tVtZkvqvR1XZTpal2lH2WRvm+Wn/Oq4H5RfgPdioyEEJKetRO1PLIW3hr2dLyIhLsD3hPGHbjBznhj78w+9gS+OCmeZEylJzWRcQL7hPaJcw86TbgH0OmL8Ai6kA59MR/jZr+mDvcrY9zYDXaewP4Q+MCCB1l5DMhZDtUvWmz5V196lut8kc00oPPNIc86X6x85G4K4wbWpOPX1tqQS8/iwriBi1hIXvVdYGfZGGPoN8QwaIhhvyGG59v6bOEw79A44V2/VgY4+uBLeZ7AHAM8Auhf0V4faRIInsZFcU957ZpH5mc737IbwZw+2IWWXQi867nbeiHtWOKJ90uLv77cfg/a/FHiWfYFW33pegKYo1+mMzouGAOiTtyvky7fr0OL0wh0mItDC2toYf0Hu4QOY6s6vctjkF9e6Ei/eg4AAA==","debug_symbols":"lZDLCsMgEEX/ZdYu0sZG8FdKCZpoGBANagpF/PdOHots3QxzZu7Z3AKz0dsyorchgXwXcGFSGYMnKpWBjugcLuP9DN0+eH/k06r8jimrmEH2g2Bg/EybeJJv0RmQvHvUDwPO25VXuzK0K6JRqYRfFVFpZ66m7OanW3H5t54fCv8B","brillig_names":["compute_note_hash_and_optionally_a_nullifier"]},{"name":"rotate_npk_m","is_unconstrained":true,"custom_attributes":["aztec(public)"],"abi":{"error_types":{},"parameters":[{"name":"inputs","type":{"fields":[{"name":"calldata_length","type":{"kind":"field"}},{"name":"is_static_call","type":{"kind":"boolean"}}],"kind":"struct","path":"aztec::context::inputs::public_context_inputs::PublicContextInputs"},"visibility":"private"},{"name":"account","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::aztec_address::AztecAddress"},"visibility":"private"},{"name":"new_npk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::NpkM"},"visibility":"private"},{"name":"nonce","type":{"kind":"field"},"visibility":"private"}],"return_type":null},"bytecode":"H4sIAAAAAAAC/6Vae6wtV1lfs2Zm7z2zX+ec/ZiZM/sx+/2ac8+9tMy1JQ1qW/pAFKIxN0rB+IqQFNGUGFDB1oaqaaimiaTEoEYJlkYhRglGNCbqH6JB0aIh+IfVENTyBxiqaIzx9/vWzOzt5ZzbPzzJmrPWmm997+9ba32zryrb0teUXXtQqavKrvp4qPpG4a+O5itVu3uoKrV7ave8AePaPaYpjWbxxf21++XF/aaZF9exStnXCergea9y8XyNquB5n6peJ2QNzweUdwXgJ68hggdJE9SteiZ0wYbKtO1/3ZRz89RVZal6pusy3yjmG5ivqEamG35C1L6vKq7f7Cur6Q9UxfffoIyA0oRtILKaVEALD7tNdEdAYh2j55ycKfVK5afqGhB5DR/D25V/n6VU6rxFKHgTPjtA3ulybQ+sdMhKj4J0ONXHVI9TfQrSK6acYqrucCrAVJ9TAaYafU6FmAo4FWKqFXAqwlTIqYhqU6d46AHGp4MYbyK+idVVC4DoRjrO9GlMmJjD+DTTUTiAmKfg9zRCL7Iz1YJ8b24o27cjgp6eqeobVZSq78usjp9ZPTuzgjizwsBXdtwKz5T9vApT9VZ4EBQxwMpBPPThGfUB9PPDakD9kNkBWBqSpQGHxyMMyasaCYfsDvQIb47G6I5H40yNEmBLxhMYbDIBj5OJGGySNzEYaDymJtAR9G8nOknVuzI9GJLgIQUQBEL0MBwLQXZHekyCsnScZGo8AcFJMgXB6RQEp1MhOM1bQfAX1RQEwYI90ZNUvS/TowEJHlDAe8piAamiPCqh0QDQgq5+FVTCOCHpCZwrnd4ONzV/x6r4m50p/YyCPB/OrDEV0UrGoP2cGqcW7DBMMgs6sgZCJi5EjVXhKrFxlcKZQuNMHM4LR5pz6CwwnHO4EL2wO9eYXCwzPV1itNToNQ56mZ5TXvdWKxsXrix6M+KAOx6FcPggVX8HxcxT9TmIOZ8sIPlMLVL193C1OVxpXseU+ge1oCsBcpSqfwTkqD0/U9Z/KSz8QmbFVIQbFooIS68a6ZBizsXBFq+1lShDLag7eT2i/TjS+5FGBOlmIGuoybg1gr4DQMWAihlK8QARM6YijmLx+hG4sdSITF5XKqnZCAl1XHOQ4Ko/jVzniieMtVAlfsSRHg9zcxYONMxdNHfgcenAEkCjMoBusrlzaHNILkxrTIYBzEhBAo1e46AHERgn7rRYOT1YickpjNOg34T6kt4MLR7DjFBafZBat8M4cWplUEc8QWqwHkdqsO6A1kKYMawHmLpLBbkZAflqQrYJ+d2E/Ga4upgxLhRh0tdQ7BSLmOgOdSBmBKcKJhnuzTjkSO9HegjumgNZI8oXM8LYw7GmKcY0QKYGUWr/LV6EZCckl29WQWq9G+yEaMy1zkSEmuLdD6gpJRBFIi3Y03iSWRPE45CAtgFE+FoPq1kJOMNzJoBYUkmmgpNhHScEfYcBhd+Exm/cQ78RKjmKBH6DNkUaeDctdRS2CqYfK1QbUrV0zIAEAjL9MyXTSc40NBdAusEUppmKaZ7K11sjzNnTNud+g4p4mrJxGm1GGRfAO1ss8f4DapkzHhjGnUPGTUqQsJ8tMh0uSFk4noYU+0NGbCQD2Cocpdafwy9A8CPAH7TJ92fUNLV+09AfT+kbTF+zPH3BN2aim7lkMipIL8U3QFktM2tmVId8PZ1B3qkuRgHflaPZJfyb1cJ/S/gHLDidic+D25sM8JeHBsioMMoxpaSfVbPU+iplQJsJt3wnOvy80aHhnrQCJKfFHEKXyg4WKwD+k1qVgCs8VwKIJZX5UnDOCTon6IsGFHJNL3Aok4gNijnkQVvCob5KVz2atgqmv5abR01pE2z6xD+aIxtb/4MErRFuMdiMF6S94rvVGsnbUeuczYVe47kerTJrBWsMCGgbwA0AG2pTAuLAaW8EEEsqy7XgXBN0TdCuAYU880vlMSjWmV6gLWPwx8RwNG/lTOtJsYXMuYUwQJbccZZQGJRR6HZkFDMHw0voN1ghQFZ1GEpfMYaCIjBnr9qcu08tU/0KyLbkNNqaMm6Bd73d4f0dapczvrzAwYRlvcNzt96C8S0pH63B8WpN7PfkFPUGe9I6TPVbESAg+ADwL9vk++1qlepvMfTjFQNkgwCh2oGcAcLuSm+oTmJf650ECA/4u8xai6x6lenVGvKudDFa8l05Wl/Cv1kt/LeEf8CSU9nbwS3j/2gBceb0dP22XBy14G5PhVEOcZpH1DrVT1MGtLVwy3eiw3cZHRruSWu5zaztBkKXyl5uUwA+ptISMMUzFUAsqWx2gnND0A1Bf86AQq7VBQ4lVHIUG8iDtoNDPU0/O1q1Cqbfbzw9UyvaBPxgFxjP5XhHf/ug8TfZAOhN9LZQvO3XjLfxhE3fDZaiyFBcbu+XJPGcIXHJicLoX4IM/qp58oL+cWBkohfFJwuckvQn1Nz40WIMz11MEsx9EqdL+xxZBlRHi+K0OjenVQ7XGBIRvInDQ7/CcJuJE9lqK+ePHYb0L6iOXsfuVmNylyJniiI1eo2DXqa38+L8sd2fP8xKnj92gDKGuKQ3Q9tiMzxCvNc3qf4igmOW6n/h7sSt2n4Tdg/9pczazBDDszqm9JfNRghIxM2/NRjGSHX2K5Gf9UuZlayLPWa132NW4lCyx8xE4dNyj5mahIXX4GEt6UvvR3oF7pobWSMmaSHI4EzWKtFyXcl0ssIxcrGSewi5SWB0+7g0+vICoy/2mZX4N2gLnuSOaaHFPvIN3Eb8iY67WWZqw4hbLde44qzXuOKs13LFWectv+LYGwUBGnluSG1csBYDegkiaQEyejPidQbuw6PgUQI/C5MJ1t2mJka7Ce85kHVGcjPa4g7Ywr4BDWMjTqZFgK8Y4ParywCfmgBfMW5xWppPiwBfMcDt+8oAn5roXBUBPtkJzh1BdwT9tjLAZxcEuLm9GRTwIvraBOFwQ/LvrFUw/cbCW2b0FmqSvMyE6e8tmc4z4Iy8wCE2O3jbrr4FzFvU1uwYa8zZuzbnHlPb1H4Ysm05jZZSxivAm145x/tH1HnO+PaCjIubkH2mqffz9AoYv0LKRyk43qXE/p6coj7Dpp6uU/tDcHUQfBz4t23y/Rxi0n7C0E92dPcz+A1VAeT0m1Ti64zqvCLhei7uDsoK6SItww+hDd3rYrTlu3KUXsK/WS38t4R/wJJTCWNwy8ONHEFmU4rzbC6OmjKwqTDKIQb+qEpT+9OUAS0VbvlOdPi7RoeGe9LaXsmsK2cQulT29spVAP6BuloCXsXzqgBiSeXsXHCeEfSMoH9qQCHX7gKHEio5ijPIg3YOh/o0s9nRrlUw/dfGK5EXaZNMNeTqof0O6kM95AoHRRkp9zhFBciRbGsXNSJbFYUl2xSWOPSLopLPkteZX1wIO/sLIbud4kLoX3Ih7JC06xcr/YOVmPRf5kK4L2M4ZRkDSHHL0B3IdWQjS/dSx5UqiFPlZsg7RuXzuGM4rC2Vt0SnVd4So9Q5AmTEW2Llt3FLdDqZ5bA25R7WNcBnKEUuuVj1haGuuC0EVF0cNUwNLGLRiyO9H+kQ3DV7soY6dlpRZkU9QDmAcjTeOuFtRrj/uPMuaJQ+FBUWiYS6LARCFXVfqSpXv/9bf/SFa7+y+cTr7/34o4/eeGh92z/f/87fe/sv3P3CS09/mXj6me53saSru+xhyfyJn3j9e596749Mv/HFb3/o5z/zZ4/Yf/XITz30N+948s4vfWxz42vPK6nHUTzN6mYAl4FgZKAjDBhs8KOAdUZNq3U7UFGAKdfYEL1eR/gMBNjLLI+4PC1L6GNe7mNA6Mmb+O5ersRIiVtIsZRXb4aNVFOAZa9c7/+OWFCNYFY76sOsN1TfpEOPzkuK2vZuNRIWBF2rn1l9O7fCc//+4PMKrFdsLwLaH1JRXoWlYZxCDOdADEw6wHhc4nZtmbdFV6+jw7Zyx6VMHeB2Gi4Yd+seKLxTeUUd0wN6l1Aeh63jgtrxATWWi5ui82NY6diGA9udLvbcbhd7brcre243b/me6zwJN9WNnMHUeTzTniv1WOcpojtmUfYYzFR+SXmpg6Oy6xWZwS0zQ7NTZAbjFQYdzdsQB+l0M9XpAVWv2wc//T746feFn37eCn4+TCdtMCx6GmH7y7BHzs9HiM6WInEH/DymOqnzW+TH+BLlbiPkuq6Mhe4JwqlHNtyuTDJC+13WIHrgoHcBB2RMtNWTd7285WV6u9IXPJJ6+oxXRka1v3eY/mlmnTJSa2bylIXxPkrXMUrdlehUsJ7mraB4KvqI5F2Ut4Kidyp4pFJ9ykoTC1K+meRNc3gqxSVM1s2k1KVOUaQdD4F16AlWL28FRU+q70N5N8ybvIN1ah4BLlgH76w0Ro6yvBHO85Vqw0N/7I2wpneLNW6jxzU9rulIf9zjypHXw8pohJWjkawc5a1YGTQiwkWMuVD6XkT6vVGElcNbrIwbQ64c9tAfSL835MpoNITrHKlh6lINtaiIrV4ZW9awiK1hWQ8d7uuhhwV9Vbl9LFW64soyEe83HwUwOUGVZ1zWghoHPZzA+RHGHRcrxwcrx/wmsK/1X9Tbb3rNctNjSQkgiYdND+Wi+ijlEQvnZfccQTO2cftyfxK3L/cVLOIjyYzrnMKpudz03G+QTa+O6e9Q9dR9FfKiVGt7xZedXvllZ6gpgdOWrFuXTY+RUkdQiF9qFkIZIkO9HzFT6+ZI1oijtph6m4DaF1CxmzX9tHICX6+TnTq+QLg38AXC/THAAr83LkqjEe9b7pvKKuPYVBmjvDTaGxel0YilUfcHy9Lo2NQ1o31pdFyURiOWRt23laXR+q1LoxGOkGOWRj3wR7mO6q2C6R9XY6PaOlXLPHkrT6mU/lEte1HZc8tep+x1y15Q9sKy1y97cdkblL1TXlwaLBWOWXVzP1jqJjGCsWYIf7JGCVwlqROmKJziwwHuFQmvsO4f4grrPgtdsxQ9PaweSqnW/VhZqk1evlQ7MaVa3uymvNm5v5/f7PQcx9QEUfsC/BQu/Ef8RsdSrftFXPDcPzb0vf9vqTbZF2eTryvVJi9fqp2wVAtOZxKD4JauJuKMRZwvlBdVRiUVRjlE/y9CjxWfMqCVpdpEdPiVm0u1SV6q7ZXKTliqdf/z5lJtclOplhWehLWginXLUq2xi0FRfDnzwJ8UeHhPEqYrrbJUS5vgXsG4ZZY8KVLqiRxX2hiecNgWk7B7ovmdu4n0ZTfbzUy1Gev1pofE7l22mYDiQkG1jTpW1XU9rSCrnHArr51I/qqw0hbZbQC+VrXTSsrtHyJ2jIitQxFzJvBs201cTppEBSzdtHIdWLrHPGS8CoeMyp3nPBDggFFxOsJ0i+9bTbz/JtXMFX6iRZRuK7NanTtVfmol+u5RGwrrtonvAdUxCmuTDLgTfPztQDP/7QDUI4g0Jht1ZIVcVmSFsndS9tyy1yl73bIXlL2w7PXLXlz2BmXvtM6sYNIuD30PmxOoMCTnrAj5t94g0x6BPGwVlUdUPXel9gV6NtIIBSb/hidJssEk2aCh3qPaJsSbPbmYVlCocnlAbnZ51uv2APOE6uVseFqOhj4PeuZ8KUA45lfeZ475YMM2bDQP2TAnSjkAYrHu8EDoH3XAht+xsfoZlHmEjR52xA6Pm2DjmD/Y8Gh4D5Wk/JTuyYGXZDtdLPx11c3JHl8gvTkJy2GUt22vI2Q9kvWOsfqj6tiQ5SnX46k7s2x+EYz4bafycVxSK5/F1RPXHUcumSQcdXy8+6T5FYjcpBmYfoQ7Kk7aVl++CBpAGvFPSiMGuREJiCWVri84qcOoS9C/MKCXfBEUKjkK6DBA8x3wJxblBynD9OfKD1K8RgvTxcd/cz0wt/8O9QyVGKzodctexFqC7fOu7sfA+K8qLiWQL8UhMiX0afUCbE5BnTBfMTBQH38kErQxV/VVnFZeokYwjSU2D8/2kN8nh/hwXvnv8sP5Rd/h8l+H8JgSI9F0hmK7gLYLEMzVah7MeoArS2Cn1TP5jlhtyHdEmKh6m/LTatvQl58PuYPis/eg/Ozta57enaF8AR/J5jTgcRZ3hlIhPm4Qga+LUcB35Si+hH+z2hyzhH/AgtNYqiLgVqqoFCcUca4VuSlgnYQKoxzUf/U69Fj9TsqAJl/EqcOAOqzeZXRouCetgLcU1G37pbKDIU5D1XvNaUgA5bO4AGJJZTASnCOCjgj6OgMKufwL3NDYxaDAgTFGGzjgT74j+q2C6e/KHUL5tAnvYX6El6cRX36PeSm/S8rkNlZ89pcbm443Tn4RO2LhAZe6fXkhh5AfaPAnHDjkBrj2hbHMD8B1bLi2DNcfEK6HeFZgVR3BssM9NlhlgHrVMKTWNCXjD0GMrw3pa8MB+H3U/KQpU0P+Uuq6VbNr2BnwULoGS1afqFXT6s+ChF1z0+oz1/nLNtdi+qlBkGvS8ZpY4NWcGgpxVs2v+fwdHf7J7+h804qNtvr+mm8xkWJBHeTqtRqHrgx1rVarc+iBupdWn7xmUVgSPpdFZAqLqrUqh1WQrJEFbXDWQNQ75BAZJccgNIhUaHgHi2wuMuO64aRe841cDcrVAJkm5WrWmpQL/0SupmmlXL9TawrnWNACiy2DzZchUNdaHDZApZFWnzWvqrXK+XUVfir81P8C47Zo77YoAAA=","debug_symbols":"7Z3djuTGkYXfZa59wfxh/vhVFgtDtmVDgCAZlrzAwtC7b3VXV5I9LGaY2qiJzIjjC7tlZdfE+aqGcU6SlfHvL3/9/s//+vuffvjpbz//8uWP//XvLz/+/Jfvfv3h559u//Tv3/7w5c///OHHH3/4+5/2//eX5e2/XHlf/8s/vvvp7R9/+fW7f/765Y/LH758/9Nfb/97+92//fDj91/+GBf323//4Yurl5b75dpyd225v7Y8XFsery1fry1P15bna8uvvav+2rsarr2r4dq7Gq69q+Hauxquvavh2rsanr6rfgnl4zf8sqZPv/SHw+oYUvhYHUN2bbVz6cnqvGT/sTovJX9a/VZQfl6Qz62gkKmCfH3Uk2JbG/z6/geUq3/A7Zfi08+bdzk9fsmV9PUvrcvv+SX3e34pPNeU1/ZLoRDQXHLFfSx36cajrc/h1W/6Gjnqv0Ha6g+JqP/20XjUH0ug6vfLY3X2YTnUv7LXH3O//rI+Xrvk7TPu/f3zkFjqWXefh7z263E1Pl7c1XVXUQrvFeXhKirDVVRHqygtw1XkhqvID1dRGK6iOFxF63AVDXfNTsNds9Nw1+w03DU7D3fNzsNds/O3v2bHtLgWSlz52kHmMFxFcbiK1uEqSsNVlIerqAxXUR2torIMV5EbrqLhrtlluGt2Ge6aXYa7ZpfhrtlluGt2Ge6aXYa7ZleBa3Zum9QxJ3eoyA1XkR+uonW4igQ+2WVte/clha8rcssyXkluvJL8eCUJOJIa2lWyRv+ppONqv+VyX9PuPlB89toh5sdtyHD7cz6tfpebdMldw+MmU1jTE7nZltxiS241JdcttuQ6XXJTeDxScvvRHeV6W3KV9V1KbrQld7UlV5mrouQqc1WUXGWuipKrzFURcr0yV0XJteWqvC1X5W25Km+r73pbfdfb6rveVt8Ntvpu0NZ3a25yaznK1dZ3Cbna+i4hN9qSq203g5CrzVURcrW5KkKuNldFyNXmqvpyozZXRci15aqiLVcVbbmqaKvvRlt9N9rqu9FW311t9d1VWd/N7WSD24/rUa6yvkvJVdZ3KbnRllxluxnFPc5Juf14fIxsVeaqKLnKXBUlV5mrIuQmZX23hLXJjcdLVdL1YY7BtwOU3o7WOsjV9WGOIfkmt/qD3Kzrw0zK1WUiSbm6TCQpN+qSe/vP47VXT612i2t3v28/5+20N5/qHY8u08mOR5dJZcejzAdw41HmG7jx6NqK5MZTdG1dsuNR5lK58Shztdx4lLlgbjwReHp44Jq7eIy75nbA+e3nUj/heSa0HYRx21fbthZDvLM0brFZWRr346wsjZt3TpbVuNNnZWk8FrCyNJ4hWFkaDxysLCNYsrE0HmVYWSL38LFE7uFjidzDxxK5h4ulX5B7+Fgi9/CxRO7hY4ncw8cygiUbS+QePpbIPXwskXv4WCL38LFE7mFjqezAcFmWyD18LJF7+Fgi9/CxtO2J/O5xK7+r5eNxK6/spOTLeOqGJyyR+qh117/jtN1RLuLM7dVvf+X9139zlR3zLMvSdkfhZWl7x+Iiy7I+Dp1xJac9y+Pi4h8vXXw8YLcdIl+I/c0lbK+dvgav7FDnkcC7pb22i/UAHmZCCDychxB42BQh8BHgZcDbvpUoCB4uXgi88Q05OfC272gKgkdylQGv7OD8icAjuQqBR3IVAo/kKgQ+AjwH+HeWCKN8LJEvL7Cs9XEHwi/LkSUiIx9LpEA+lgh2bCyVDVuRZYn4xcfSTqJ6l6stxywPk3YT7o5yoy252gw+IVebByfkarPJhFxtTpaQq81s9uUmbX6QkKvNshFytbkqQq4tV5WiLbm2bIa2AV5rbHKTD2S6JA6w9toGfnHjUWZjmPFkZbaHG48ym8SNR5mt4sajzIZx44nA08OjbPOMG48yF8yNB665iweuuYvHuGvmPBFE22w8UZbG/TgrS+PmnZWlcafPyjKCJRtL4xmClaXxwMHK0ng6YWVpPMqwskTuYWOpbVKgKEvkHj6WyD18LJF7+FhGsGRjidzDxxK5h48lcg8fS+QePpbIPVwsg7ZJgaIskXv4WCL38LFE7uFjGcGSjSVyDx9L5B42ltqmiF1kSUzFCdoGMF3FwzsVJzjbHYVz+khwtjsKL0vbHYWXpe0dC6GpOEHbkKxxsPen4gRtE7UGAt898DP4CPAy4OE8hMDDpgiBt313UBC87VuJguDh4mXAaxuyOA9423c0BcEjuQqBR3IVAh8BXgY8kqsQeCRXIfBIrizg31kijPKxRL68wLI7mSBom24oyhIpkI8lgh0fS2Q1PpYRLNlYwl++yNh3n/bQNrxtHOy1rO2llwN3bQO1puEOKyHDHbbjVfs2/afKtM0jmwc8toiFwGOLWAg8LLwQeJh4IfDYfJYBr22W3zzgkVtfBj5ur72GA3gEVyHwSK5C4CPAy4BHchUCj+QqBB7JVQg8kuu38PFPwCO5ygQo4+NYBcEjuQqBR3IVAo/kKgQ+ArwMeCRXIfBIrkLgkVyFwCO5CoFHcpUBb3zKsSB4BCgh8AhQQuAjwMuAR4ASAm/cTqZGcvE7lI/zvo1PbaXwGB/ESuIxvvVP4THuLyk8xl0ghScCTw+PcUe1DY25oUqUo+qfQWR8TulFlt616Qo+HKYrGJ9TysvSuHlnZWnc6TOyjMbnlF5lGds4tPcVX7E07gKvsYyl6Yzl+LmMYMnGEv6SjyX85QWWaWm9JwV3YAl/yccS/pKPJfwlG0vrM19ZWRrfo2ZlaXxDm5Ulcg8fywiWbCyRe/hYIvfwsUTuucJyW55yOLBE7uFjidzDxtIj9/CxRO7hY4ncw8cSnugCy9DO9ne39L1neVzcO48+Wh8X+zrs/QeQo/VxsXLg0QBfBb77NFm0Pi5WDjy2FIXAR4CXAY/NSiHwcPFC4LENKgQee6ZC4JFcZcBbn1orBx7JVQg8kqsQeCRXIfAR4GXAI7kKgUdyFQKP5CoEHsn1AvjoSwMfD0+hRYRRNpYr8iUfS0RGPpZIgXwsEez4WEawZGOJ+HWFZffb3dbngrOyREjiYwmvfsbyDY/1Uc8UHjjqLh6Y5C4e+IsXbXZ1n3K3Puj1ddhrWdtLL0fuaLUi3K0PvRTjDnPwIu7Elzqsz7yUA4+NPCHwEeBlwMPCC4GHiRcCj81HIfB4QkMIPHLry8DHbeTXGr4Gb33mpRx4JFch8EiuQuCRXIXAR4CXAY/kKgQeyfVb+Pgn4JFcZQKU9fG6cuCRXGXAWx8JLAceyVUIPJKrEHgkVyHwEeBlwCO5CoFHchUCj+QqBB7JVQT8iuHJUuARoITAI0AJgUeAEgKvzE7e/vN47dVnGnzd7hKF3bcHTsCX9fG2upJTH3zv60+rttnQ42Dvfh1k1TavdxruyhzNNNyVGZpxuBN9VdvQ4HnAR4CXAa9sR3ge8LDwQuBh4oXAK9sRnge8smeZpgGvbd7ySOB7Dwqv2oYzzwMeyVUIPJKrEPgI8DLgkVyFwCO5CoFHcv0WPv4JeCRXoQCF5CoDPiC5CoFHchUCj+QqBB7JVQh8BHgZ8EiuQuCRXIXAI7kKgUdyFQKP5CoDPiJACYFHgBICjwAlBD4CvAx443YyNZKLz5+/d/aOx7jpo/AYt2YEHm1jw7nxGPeXFB7jLpDCY9yrUXiibTzXvlDulmbAXKxfmyRtI7hfy9K7x6s7H/yBpfGNY1aWxs07K0vjTp+VpfFYcJFlTI1lOvQebdOrX8sylqYzlsPnMhm3jKwsI1iysYS/vMAyLa33pOAOLOEv+VjCX/KxhL/kYwl/ycYyG9+jZmVpfEOblSVyDx9L5B4+lhEs2Vgi9/CxRO65wnJbnt60fcUSuYePJXIPH0vkHjaW2sa6i7JE7uFjCU90geWVQQDd8+i1TYcdBzvxALK26bDTgNc2HXYg8P2nybRNh50HPLYUhcBj/1EIfAR4GfBw8ULgsQ0qBB57pkLgkVyFwCO5ioBP2sbyzgMeyVUIPJKrEHgkVyHwEeBlwCO5CoFHchUCj+R6AXz0pYGP7sASYZSPJfIlG0vrY89ZWSIF8rFEsONjiazGxzKC5QWWvW93J+tzwVlZIiTxsYRXP2P5jgf2u4fH+kBmCg9MchdPBJ7XbHb1nnJP1ge9vg57LWt76eXIHa1Whjt6uAh36zMvpb7UkazPvJQDj408IfDY9RMCHwFeBjxMvBB4bD4KgccTGkLgkVtfBj5uI7/WcACP4CoDPiK5CoFHchUCj+QqBB7JVQh8BHgZ8Eiu38LHPwGP5CoToKyP15UDj+QqBB7JVQa89WHDcuCRXIXAI7kKgUdyFQIfAV4GPJKrEHgkVyHwSK5C4BGgZMAnBCgh8AhQQuARoITA67KToYTH6lDi+mn1u1xdJo6Uq8s6heoer337sRzl6tpqJ+Xq8meUXGXzgUm5urwIKVeXAyDl6tq4JOVGW3KVuSpKrjJXRcm15aqUzU0l5SpzVSUtTe5ylKts+igpV5mrouQqc1WUXGWuipIbbcnVtldFyNW2V0XIVeaqKLnKXBUl15arUjbSlpRry1UpG996u53km9zkjnK17VURcqMtudr2qgi52vaqCLna9qry47DwuITla7lZ2UA+Uq62e0SEXGVPiSwlPV7bpUqsdosL21daXd7wfBxlm7WNiOPGo6uvs+NR9mA5Nx5lj39z41H2kDY3HmVfAubGo+xJc2Y82maGceNR9tQ2Nx645i4euOYunmgbT04bnlI/4XkmdHuQP71p+1h9f9g+a5u/JcrSuB9nZWncvLOyNO70WVkajwWcLLVNSRNlaTxwsLI0nk5YWRqPMqwsI1iysUTu4WOJ3MPHErmHjyVyDx9L5B42ltoGQIqyRO7hY4ncw8cSuYePZQRLNpbIPXwskXv4WCL38LFE7uFjidzDxlLb+EBRlsg9fCxteyK/e9zK72p5PG6lbVrQVTx1wxOWSH3UuuvfcdruKBdx5nZq7e2vvP/6b662sT6iLG13FF6WESz/c5ZlzY/lJX86Dvq4uPjHSxcfD9hth8gXYu8f2Z1XWIRXgXdLe20X6wE8zIQMeG3zMOYBD5siBN723UFB8LZvJQqCjwAvA974hpwceNt3NAXBI7kKgUdyFQKP5CoDXtnMoonAI7kKgUdyZQH/zhJhlI9lBMv/nGVtE0b9shxZIjLysUQK5GOJYMfHElmNjyXiFxtLZfPKeizf5WrLMbE+Xnsp4ShXW3og5Goz+ITcaEuuNptMyNXmZAm52swmIVebHyTkarNsfbnK5pWRcm25KmXzyki5ylyVbwOrbz/6o9xoS64yV0XJVeaqKLnKXBUlV5mrouQqc1V9uUXZNDpSrjJXRclV5qoouab6btE274uSa6rvFm3zuCi5tvqutnlZlFxtfXddm9ycj3K19V1CrrLdjOAfX+a//bge5SqzGZRcZTaDkqvMZlByldkMQq7xuShCJ3EU4yNUXoi9lrW99HLkjsdgZbjjkVkZ7ni89kXc+yf+FOOzNQTB48FdGfDGp3YIgoeFFwIPEy8EHl+yFAIfAV4GPHLry8DH7bXXcACP4CoEHslVCDySqxB4JFcZ8MbnrgiCR3IVAo/k+i18/BPwSK4yASpGgJcBj+QqBB7JVQg8kqsQeCRXIfBIrjLgMd9NCjySqxB4JFch8EiuQuAjwMuAR4ASAo8AJQQeAUoIPAKUDHjrQ/tSI7n4HcqPWezF+mg9Ck8Enh4e41v/FB7j/pLCY9wFUniMezUKj3FHtW6ux6dEOarufKhifSLaNZbePb5w73zwB5bGN45ZWRo376wsjTt9VpYRLC+wjKmxTMfeY9wFXmMZS9MZy/FzadwysrKEv2RjaWg+FAPLtLTek4I7sIS/5GMJf8nHEv6Sj2UESzaWxveoWVka39BmZYncw8cSuYePJXIPG0t1E9wkWSL3XGG5LU9v2r5iidzDxxK5h49lBEs2lsg9fCyRe7hYVm3z117LMtS2PLpP++rHxb3z6OuCNvUi7P0HkOuCniYEHg3wVeC7T5NVbVP65gGPLUUh8Nh/FAKPzUoZ8NqmOc4DHtugQuCxZyoEHslVCHwEeBnwSK5C4JFchcAjuQqBR3IVAo/kKgPeI7kKgUdyFQKP5HoBfPSlgY/uwBJhlI9lBEs2loiMfCyRAvlYItjxsURW42OJ+HWFZe/b3dX6XHBWlghJfCzh1c9YvuOJwNPDA0fdxQOT3MUDf/Giza7uU+7WB72+Dnsta3vp5cgdrVaGO3q4DHeYgxdxJ77UYX3mpRx4bOQJgceunxB4WHgZ8NZnXsqBx+ajEHg8oSEEHrn1ZeDjNvJrDQfwEeBlwCO5CoFHchUCj+QqBB7JVQg8kqsM+ITk+i18/BPwSK4yAcr6eF058EiuQuAjwMuAR3IVAo/kKgQeyVUIPJKrEHgkVxnwmAAtBR7JVQg8kqsQ+AjwMuARoITAI0AJgUeAkgEvMljXlQ38+gn8e0lhvJLieCWt45XEcvV0cRsu50vsl+RqaK/uatz9NX6+fHFhuy3o8vLpb9q7hqxAQ1Ggoc6vgWeopLAGp0CDV6AhKNAQFWhYFWhQ0Kergj5dZ+jTOW0aSqWSSX+iYJ2hqTMKdssygwXgVTyDYeBVPIO94FU8gxnhVRzNKZ7B6PAqnsEW8SqewUTxKjZmuW6KzXkuZ85zOXOey5nzXM6c5+KZajaVYnOey5nzXM6c53LmPJcz57m8Oc/lzXkub85zeXOei2fSz1SKzXkub85zeXOeK0zQnfzu9qjfLf+4PXoTMcHFyNdNRNgdP3zytnXX30VPcD26KDpvxeTkj5/VCa5HzIonuB7xKo4T5IOLisuaH8tL/vRc9XFxbxTCDc4ENvOFcPpPqN/w6GsDl/B0Z8be8OhrGKx49HUXVjz6WhErngn2LiXxTLDRKYhnte16SDwzhFRBPBPst0riMe6aKTwReHp44Jq7eOCau3jgmrt4LLnmu2JLRvhdcdLnbWs7VsEvyxPF+uwqpVifA6UU6zOVlOJoTrE+60cp5jnWaKsphRQICdmVx2EhLnuX+st98g+cPqdN7/PDeEqJj2NLSqnu0+q74GxNcLEmuBoTzHTu50SCnTXB3prgYE1wtCZ4tSbYmtPK1pxWtua0sjWnVaw5rWLNaRVrTqtYc1pMB7ZOJNia0yrWnFax5rSKNadVrDmtas1pVWtOq1pzWtWa0+I51HcmwdacVrXmtKo1p1WtOa1qzGm5xZjTcosxp+WWqZ3WXcLU3ukuIc4vYWp/c5cwtWO5S5jag9wljO8qSvGPWkp9JmF8n0BJcON3flLC+L2clDB+d66+PmqpaSXsSG/1XfD4vZxZ8Pidn1nw+D6BWfD4roJZ8PgehFmwtGOJayWWh8W1iZ23nysh2fnaJtHe1nv/RLS0x5EQ7aVdkYhoaR9Fi+6KeLJ+m8rs6rr/mkz4kCztuwQkSzsvAclRQHLM24l36+L2y+9FrSMWlUYsKo9Y1PO2uA3M9j5HoqjqHl+h/jQyPj39kK+t/LqJ9Wt59rprfCyua6XOir2tfrzysuyOWb0fOHr7C2hFqLMi1FsRGqwIjVaErlaEJitCsxWhxYpQK84oWnFGkcEZ3W59+/Zn7Ao6kbrk7QSpJRCvndIjLqYSdq9cPsr3c5cf5i4/zl3+c8eRXNsqTjGQ5ad1K3/59IccV9/+uj5Wp2W3w/1882PN7Ryu24/lt8Ou3skB1xMJyLMLKLMLqJMLODloeSIBbnYBfnYBYXYBcXYBs3fidfZOvM7eidPsfSDN3gfS7H0gzd4H0ux9IA1/FSqxCShPHiNKw+cBQkAe/SpU2vnjtx/TEwECV6GyNAHBEQJ8aAJuP26rS/yoP0xef5y8/nXy+tPk9efJ6y+T11/nrr8sk9fvJq9/8v5bJu+/ZfL+Wya//pfJr/9l8ut/nfz6Xye//tfhrz9teocPu28CtfqH9/9E/aNff2I7zcLHlI71j379ifWxh+XXkPf1HxeH0Da8QshbIbedlzexfhn9YsUqdvQrG6vY0W3wNbHt+xghlHIUO7pnZhU7eoNjFTt6N7wkNi6PWVkh7naam9jRt85YxY6es1jFDm+KOMWqclB7sT4exDpVpoISq8pUUGJV9dmYUxNb6lGsrj5LiNXVZwmxuvosIVZXn62PnZawLvkoVlef7Yv1qnYqKLG6TAUhVpWpWL1vYsN6FKtqp4ISGy2JVeWgKLGqHNRe7K7sJlaVqaDEqjIVhNigqs+uteXZtBy3ZYKuPkuI1dVnCbG6+iwhVlWfTe2gxZD8sc8GVX2WEqtqp4ISq8pUUGJVmYrUjj8JaT3uG0dVOxWUWFUOihKrykFRYlU5qL3Y5I9idZkKQqwuU0GIfd5nc9gNkCHF+nbXwfnq+wXd9kba86n704fevux4fGUXtuOEdlJ9evbSrobtMOLsiZfO7fAhl/endN2fc/Qnx34YAFOWdiJZcfkIxtv9xKwbmHIEE8x+Yto2kiu73dAGJuITcwOTjmBWTWBK64+LL//Pi6+qrnQFDHXxrXY/Md2L78nxMhY+Mf2Lb1LlY37vJ+bJxTfp8jFxA3N87icpsiZ+aSNH/FIi+SHoNpqUrIIhGs3JST8mPjH9RqPImlz8xBCNRpE1+f2fmCeNJquyJrtGU453MrIit+Hd0r4Ju59y9LsaTVaUga+BIRpNVpSBr35iuo0ma7Im1z4x/UaTNVmT3/2JedZodO3lxw3MMdGUb95owrqdq5EIrbfA1fxDyse7LuWbZ8/gW/XROeKdWnZv1eJ2355/G2FyFxBmFxBnF7DOLiDNLiDPLqDMLqBOLqAuswtwswuYvRPX2TtxHb0Tby+9uEKNc3NpfTye7VLe6g4fHr2O3rZ51Y7e43nVjm4IeNWO7h541Y5uNTjVhmV0X8KrdnQTw6t2dMfDq3Z0e8SrNppSa8lLhcWSlwqLJS8VFkteKiymvJQz5aWcKS/lTHkpZ8pLOVNeypnyUs6Ul3KmvJQz5aWcKS/lTXkpb8pLeVNeypvyUn7wDuR3Nyl99J/UvgsIg194fN0E3HYBqberu/4uePBrz0XBuQ1lun2w/eHzGQa/9jCrHfzaw6x2cK9/UW1pc41cyWmv9ri4tELK7gD/BmZw6/hCMG9X/O210wFN1HW5v4TGLdtj2rEe0ehqDKxodHURVjS6Wg4rmgg0Z2gG35SURGPX1ZBoRg+bgmgG3xuVRGPYDRNoVrjhUzRww6do4IZP0cANn6KJRtDc1VoxuHe1ujxrbYMY/LI8UavLhlJqdTlLSq0us0ioTbr8H6VWl6Wj1Frpt1fvjiS7e0+1bGfXL0/I2N1EoMjY3UMgyGTDWwjEvcZseAuBQmN4C4FCY3gLgUITgeYMjeEbahQawzfUKDSGb6hRaAzfUFvi9trr8ZnfbPnxsj6aYtkNE2gsu2ECjWU3TKCx7IYJNBFoztDADZ+igRs+s3yjH/sqicayGybQ4MsWZ2hGPwRXEg32hk/RYG/4FA32hk/RRKA5QwM3fIoGbvgUDdzwKRpYvhM0cfTzhSXRwPKdooHlO0UzevNOTevid2If543E0U+3pQWM3ghJAaNv3pACRu+3lIDRT4qlBYzeu0gBo3cYUsDo0Z8UEGcXMHsnHv1sVFrA7J149BNMaQGzd+LRzxmlBczeiUc/DZQWMHsn9rN3Yj97J/azd+Lhj30lBczeif3snXj4g3dJAbN34uHPxiUFzN6Jw+ydOMzeiYc/Q5gUMHsnDrN34uFPW6YEDH8mMilg9E68zVC4ifks4Mn6/kFacfjDiK+p9a4d8n77g45qR+/xvGqjKbWjuwdetaNbjYtq41ZJenKVGr0rXlMbi3ssj+X43g5/kCqvWl39llKrq9+mpV2lUnBHtbr6LaVWV7+l1Orqt5RaXf2WUjv6PgCv2tE3DXjV6vJShNrhDyXlVavLS1FqTXmppMxLdUeBxuEPnOVVq8xLEWqVeSlCrTIvRahV5qX6aoc/efSa2tAOAX97xn2v9ri4eyx2HP4EydeBccR3sIY/QVIQja5L5SU0xH264U+QFESjK9Byohn+BElBNLqiMisau66GRKMrhLOiiUBzhsawG6bQGHbDFBq44VM0cMOnaOCGz9AMf4KkIBq44VM0cMOnaOCGT9FEXU+1+dLQxOO9yeEPheRVq8uzUmp12VBKrS5nSalV9lx1V+06/HGSvGotPVe9Dn/oI69aXcaLUjuxu7gLmNgw3AVM7AHuAiZu6+8Chj8zUehJk3X4sxhfB6Y/THsd/ohBOTJ2bzpQZAzfc+g/nLQOf9yiIBrD9xwINMMfESmIxvA9BwqN4XsOFBrD9xwoNBFoztBYfh69O952Hf74UEE0lt0wgcayGybQWHbDfTTDH9MqiMayGybQwA2fooEbPrN8wx+HK4gG3848RYNvZ56iwd7wKRrsDZ+iwd7wGZrhj0oWRIO94VM0cMOnaOCGT9FEoDlDA8t3igaW7xQNLN8pGli+MzRnRwQvpaEJNJpYG5q8ttUulSerUygPNinU3WqXnr129g179nmP/V7/Onn9afL68+T1l8nrr3PXf3Yc7jT1u8nr95PXHyavf/L+mybvv2ny/psmv/7nya//efLrf578+p8nv/7n4a//21chy5KJ2JvC48scPmW/j713saOHhRI2sas/vFll9ItV2WZJlt1rt/pHv1hV1+qv8Qn/0S9WVP2jX6yo+ke/WFH1j25WqfpHN6tU/aNf/6n6R98sIuqvAtf/GFr9iao/udU/Vrvdw4Vvq+8C1tEF1McbkPzOLW0C0ugCiu8LyIML8EttAlx5IqDMLqDOLSAty+wCRr+MkgL87ALC7ALi6H0glU1AJVbX2CqpsS5P5A7ft8/l3gUM37cpAaP3bVLA6H2bEuBG33zpb34lN/rmS8nt+MFS07H+0TdfqPrj5PWPvvlC1T/65gtV//Cb70T9o2++UPWPfqeWqN8Pf/ODqH/4/kvUP3n/9ZP3Xz95//WT918/ef/1k/dfP3n/9ZP33zB5/w2T998wef8Nk/ffMHn/DZP33zB5/w2T998wef8Nk/ffOHn/jZP33zh5/42T9984ef+Nk/ffOHn/jZP33zh8/+0+/J3i8P23X/8698P3aR2+/xL1D99/ifqH779E/cP3X6L+4fsvUf/w/Zeof/j+S9Q/ef8d/qQGov7hT2qg6p+8/w5/UgNV/+T99+SkgOQeFflbxKfqX9I27Wz/oOzT+te61b8ER9TvQ2zHWe0fV2z158Hrv/2Rj0riUo/1l8nrr3PXf3JSwzz1u8nr95PXHyavP45+/W+rfajlWP86ef3D91+i/tH7L1X/6P2Xqn/0/kvUX0bvv1T9o/dfqv7R+y9V/+j9l6p/8v5bJu+/ZfL+Wybvv2Xy/lsm779V4Ppf11a/S0T9ay6P/Z/bj593u+4CwuACSnhswK0l5icC4ugCvO8LWEcX0I4tuAkoxOoa2pTEGnJ4IjcNL3dpcpf0RECeXUCZXUCdW0BeltkFuNkFjN63SQHD921KwPB9mxIwft8mBEzeifMyeSfOy+SdOC+zd2I3eyd2s3fikxNsltwODXehUAKSa485vH0nObb1bwnkuPyWTJrgGndnoj5fvvi6ND5h2V79ZBRXWXfPjGySn47iKm0mWPFxv/QOZzUNp5btc7k8oVNAp0Ongs45nZODa6zQISYA5pNzcYDnA48Hnh6eADw9PBF4enhsmx4STwKeHp4MPD08tj2zW+L22rthEg2PbdNM4QnWXTOBx7prJvBYd80EHuuumcATgaeHB665iweuuWcLA1xzF49110zgse6a+3gi9pq7eLDX3MWDveYuHuw1d/FE4OnhgWvu4oFr7uKBa+7igS3s4VlhC7t4YAu7eGALu3hmaOzb2VKL3wl+w3MXMUP7JUXM0CRJETNsAJEiZujHlIg0Q9ckRczQ20gRM3QgUsQM2wekiKhBhIaOnTR07KShYycNHTtp6NhZQ8fOGjp21tCx8wwde93CqU+JCr6ufUfOuVgPWTbP0N6vKfauFeODPyqewQvwKp7BOPAqnsFl8CqewZJcVBxTU5yOV64yQ9e8pjiWx4HAtx+P73GZocXyKtbXjynF+vpxWrZidofiNcX6+jGlWF8/phTr68eUYn39mFI8w34Cq+I6w+YDr2J9notSrM9zUYr1eS5KcTSnWKHn2panfPyOTlXouQjFCj0XoVih5yIUK/RcXcVlUei5CMX6ulOobXl0n/ZAjou7h9iVRd9F7goc4knFsui7IrLi0Xf5vISnf2+wOH3XWlY8+sIwKx59yZkVj76YzYonAk8Pj74Az4pHX9pnxWPcNVN4jLtmCg9ccw/PFKc/C+KBa+7igWvu4oFr7uKJwNPDA9fcxaPPNUdfGp7ojor1GWFKsT5vSynWZ1cJxVOcpMyrWOGz4IRihc+CE4qtPQtepjiVmFexPoNGKZ7cgdxFTG4q7iIm9wnvIqY4DpYUYTvk9594meLQzdfB6Y/eK1OcmihHx/aNDYqO8fsaxMNSUxwpKYjH+H0NCo/x+xoUHuP3NSg8EXh6eIzf16DwGH8aiMJj/Rn67vCrMsXxrIJ4rLvmPp4pjpQVxGPdNRN4rLtmAo9110zgifA9PTxwzT1bOMVxw4J48M3TLh5887SLB3vNPTxTHOssiAd7zV082Gvu4sFecxdPBJ4eHrjmLh645i4e2MIuHtjCHp4CW9jFA1vYxcPS2P3qNjx57euNxT2eaY/Fb1tQzqWPmtYBa0oD1pQHrKkI1LSEVlNYP9V0XF29rx+rq8/LEwV1dgU8RzCLKnDTK/DTKwjTK4hDKbjXtA5YUxqwJonelmKrKbsnNZUBa6rD1VQXif6zbp+nFIgrx9t0wcdr552b9yl+KHDTK/CDKwjOP147uF1EcjF8KAjTK4jTK1inV5CmV5CnV1CmV1BnV+BG78m0gtF7Mq1g+p7spu/JPEfoiiqYvie76XuyG6sn32saq8veaxqrb77X5MfqhP/92+0f/+e7f/7w3Z9//P6X2y+9/dt//fSXX3/4+aePf/z1f/9x/ze3xf8H","brillig_names":["rotate_npk_m"],"assert_messages":{"1798":"attempt to add with overflow","1920":"attempt to add with overflow","1536":"Array index out of bounds","1402":"attempt to add with overflow","579":"attempt to add with overflow","256":"Array index out of bounds","110":"Args length exceeds maximum","372":"Array index out of bounds","695":"attempt to add with overflow","482":"Array index out of bounds","409":"Array index out of bounds","531":"Array index out of bounds","1677":"Array index out of bounds","1549":"attempt to add with overflow","391":"Array index out of bounds","1860":"Array index out of bounds","964":"Array index out of bounds","830":"Array index out of bounds","1787":"Array index out of bounds","385":"attempt to add with overflow","641":"Array index out of bounds","818":"attempt to add with overflow","568":"Array index out of bounds","1769":"Array index out of bounds","550":"Array index out of bounds","544":"attempt to add with overflow","1373":"Array index out of bounds","1111":"Nested call failed!","977":"attempt to add with overflow","1739":"Array index out of bounds","51":"invalid nonce","1520":"Array index out of bounds","490":"Array index out of bounds","356":"Array index out of bounds","1508":"attempt to add with overflow","1752":"attempt to add with overflow","1868":"Array index out of bounds","649":"Array index out of bounds","838":"Array index out of bounds","515":"Array index out of bounds","1600":"Array index out of bounds","1466":"attempt to add with overflow","503":"attempt to add with overflow","948":"Array index out of bounds","1710":"attempt to add with overflow","936":"attempt to add with overflow","1381":"Array index out of bounds","674":"Array index out of bounds","1887":"attempt to add with overflow","1881":"attempt to add with overflow","662":"attempt to add with overflow","784":"Array index out of bounds","894":"attempt to add with overflow","1662":"attempt to add with overflow","1144":"Storage slot 0 not allowed. Storage slots must start from 1.","1528":"Array index out of bounds","1723":"Array index out of bounds","1455":"Array index out of bounds","364":"Array index out of bounds","1644":"Array index out of bounds","1699":"Array index out of bounds","1437":"Array index out of bounds","669":"Index out of bounds","474":"Array index out of bounds","846":"Array index out of bounds","462":"attempt to add with overflow","523":"Array index out of bounds","1608":"attempt to add with overflow","956":"Array index out of bounds","633":"Array index out of bounds","1852":"Array index out of bounds","883":"Array index out of bounds","1651":"Array index out of bounds","1389":"Array index out of bounds","621":"attempt to add with overflow","1127":"Message not authorized by account","682":"Array index out of bounds","865":"Array index out of bounds","420":"attempt to add with overflow","859":"attempt to add with overflow","1688":"attempt to add with overflow","1840":"attempt to add with overflow","1670":"Array index out of bounds","1731":"Array index out of bounds"}},{"name":"get_current_keys","is_unconstrained":true,"custom_attributes":[],"abi":{"error_types":{},"parameters":[{"name":"account","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::aztec_address::AztecAddress"},"visibility":"private"}],"return_type":{"abi_type":{"fields":[{"name":"npk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::NpkM"}},{"name":"ivpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::IvpkM"}},{"name":"ovpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::OvpkM"}},{"name":"tpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::TpkM"}}],"kind":"struct","path":"aztec::keys::public_keys::PublicKeys"},"visibility":"public"}},"bytecode":"H4sIAAAAAAAA/71ZSY/cVBB+PV7adtu9zJCdg++gqDshECQOk4QlIRAQSNw9Y08yYqaN3B4C/4cDnOAMEocoUq5R8ocy7lRNf11T3YomfnlSdz2Xa/mq3uLyc8e8bvHxr0N9jyhfY2PeNtHx27VJi7bGsYJzg6hD1BUx+kS7RAOiIdGIaA/yNDfuCkfYYri3Qc5dcuqTs4CcRGQ8XmHzA+h/RvTHuqyyh0U6OyjrdJxOj/+zg4PycZFfTfHeLD08mtXprM6qOt2rysN0chVt/wn9S0RvVVX2e7o/zYvf0vKoTsu9dKc8muYzVPz7rIr/Qv99olldF4e/1Gldplmep4/360dp+WtR7R1HdJKKl0RDsxhTHoZtuh6/XZuEAK5V2zdvjEOzPLxt4/bs2B43U/UOLQq5dhKzWFcs05D34P7nxHeA94Ww1/C+DE7b/op4PvDuEq8LvHvgm3lf00UIvPvEi4D3DfF6wPuWeDHwHgSLPtPviNcn3hbEy7ox3H9Y1LcPyt2fHxwd7hQVLgttx8VNBltjcXNh8U45ratst76V51UxW1psvmLVrLAYgcVH2f70Xo5a3bNZ+qmoZvvlFLWCN7QUgqWW5/T1xCzmhVmBBzMfAQ3tYJp0wA/7Z1+83zW4ewJTI4PPve2W8AyNeOZRzD2BsScwop4DGC2N5bhjFmtyVd6a674d/9dGFBtj6Ivx6QEGnHMt+R8bGB9P+GPqQOydlnPfh7x3AIsDmFjmQ6K8e2FzhI4B/F77ecstzokiMctrkn1gw/0F50xsB9MEx4r9sy9eJ801z5/Z6zLyhyI7eRCgiQR4TGWIiRKqD33cShzoe4reujYwZ9+qYoFFLpc2hyARmNiHETi54fZpqbzLsYR7E0yMI7KYp45ZXvIu+MIt3bfjf7djluepC9dYnvYFDx9FHumxjA/4sYRkPQ+u7xIdgj6WHXIZ98E2+7oNNuTjODGLMY1A5z74slTmzHMbiBy54Ney/4kH/v+A2L+n/gDu9wADF8CG8AQi59qc6Yoc4z7lt2Q7BNuRsG0xj9c0TBpuuY59BTfHwrKOOX0sw88XB3TRv6PkhHUs5uG6FqOWB1fIeEoefLhv7OL+SMOk4XaEjKvgxnGzjPuGhknDHQsZR8HNsWDJKo8JtXmH/h1zOifvYN59rMWo5UG+GsVKHvC5YOzi/kTDpOGWz7hEwc2x9O3jvqlh0nAPhExfwZ1Av2mO0etqOe/Qv6Pk5B3Mu0+1GLU8DIXMQMkDxzOEe5ZwZxomDfdIyAwV3BzLyD7uHQ2ThntTyIwU3BwLy+LcGoItnnfyUwjrsGwgdBLwi8ep7A+PXbeoj8e4fGyMx73nqI9193mziJN5FwAf8y5SH49xL0Gf6WXq4xq8Qv0B8Ph7xRB47G8EPMa1CTzGvwU8jhOPyzkf54DHeT4PPB6TC8Dj/F4EHo8Dxs35uAw8zscV4HE+OO7GllYfW3wXy7G+ku8L+E7GMn8R1Y6YtFpNHoFoda08j8Ca1befg12sedblgGX+WZOD+ZwVn0vmn6YCK9jzxuz/4PtkLMGfrOdYZt2YyDptaPR3BvlupdVqnAdfyOB7Ccv8R1TLLb5r434l7eG79rzu509kkJNusIyZZTbAPss8AbtPwa8n7Db3Xyj3ua0793Hhc1poZ67Mj5Mj+Azogi8X4meZCHB4cP0c4ukFy/FwLtjufD/jT4DBaj1P6A1BJgC9UOiFYtyaMXhG/cgsr4M2zzlwrJs5+Qrssv0w5yEAAA==","debug_symbols":"7Z3dbhoxEIXfZa+58M94bOdVqioiCYmQEIkSUqmKePcCxcZlXVsVK3U83pskhME538B6jkex92t4Wj18vtyvt8+vH8Pdt69h8/q43K1ft4dHX/vF8PC+3mzWL/fprwdx/KLEKf7jbbk9PvzYLd93w51YDKvt0+H74bXP681quAMh94tRnHX+HOmEjbFS+EysUeYca8xlXIl6/30xKHmLDAch0qGqyAAdJAO6kQx1kwxnz5H++HxRBoqQDVQ4kqFvkeFjor12NRkujGrF+E2BnAwJVp5fI8FDTYyMOcHkE4KYiZUmiJH+IlwZlxvXxPfcG+8v0ejz0WFkIS6fEOVPmKYPTOwD0/aB6frA9F1gatEHpuwDU/WBqfvAhD4w+3BBug8XpPtwQXoCFyQFqPgXEjl/ARU2kkqhK2MjYljlOZ2M7E7ifcPiQbQsXrYsXrUsXrcsHmrijXA18UbqGJ22ZzA3VSqpQrdKybRrlm3myEPbKc7C6KutHxdaP5B0q4zONc0wDAxO/RF7TIvpNS3ahQ9iShjSgnNacmmxc1pyaXFzWnJp8XNaMmkxYk5LLi1yTksuLYpVWqyOaVE3pUXPacmlBea05NLyH1yuhJgWNBVQpUVY5xx+vMwXDk7qsWn1tmn1rmn1vmX1KJpWL5tWr5pWr5tWD02rb7rWYtO1Fpuutdh0rcWma61tutbapmutbbrWWvLzPcRonUSf1ZOf70vqHfWrFiAoUYB4rZ76VQs+/BOFMtqm6jP9B6VDx08rk1wk5oRK/RKfEJW6954QFVihGoyoSWvujEp9lp8QlXpJmBCV+nrh31AdRFRvr1GpLy4mRKW+EpkO1ZM3QNOh8nJLF1QtzDUqL7dUROXlloqowAlVGxtRrbhGZeWWyqis3FIZlZVbKqOyckvamojq3DUqK7dURJWClV2qsLLySxVWVoYJRBCiQeKIlZVjqrBCR6ysPFOFlZVpSlkVjFhZuaYKKyvbVGFl5ZvAxjYpuOs2qZSsfFOFlZVvqrDy8k1lVl6+ycdOkxF2xAodsfLyTWVWXr6pzMrKNxmlIqs2I1ZWvqnCyso3lVkVK99UYWXlm1JW0CNWVr6pwsrKN1VYgRWrj+tXFKMejGLlmyqsrHxThZWXbyqzsvJNKGVkVeP6yso3lVk1K99UYWXlmyqsrHwTxqMANZpRf1iz8k0VVuiIlZVvqrCy8k0pa3KrhcDKyjdVWHn5piIr/d3kpR1ukvx2chCXLW7Cj+STn0HK8slPCmX55K/zsnzyS56ifPJ7yivyyS9MyvLJ7yp3l13lybnjQT75I1zK8slX3bJ88pv6y/LJ7+ovyyd/jEtZPvlzXMryyR/kUpRP/kyIinzyR7mU5bdddckf3lCR33bVJX/IQkV+21WX/GEIBfn7w6Mfy/f18mGzOt829vlz+5jcRXb38+33M4fgXw==","brillig_names":["get_current_keys"]}],"outputs":{"globals":{"storage":[{"fields":[{"name":"current_keys","value":{"fields":[{"name":"slot","value":{"kind":"integer","sign":false,"value":"0000000000000000000000000000000000000000000000000000000000000001"}}],"kind":"struct"}}],"kind":"struct"}]},"structs":{"functions":[{"fields":[{"name":"parameters","type":{"fields":[{"name":"account","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::aztec_address::AztecAddress"}},{"name":"partial_address","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::partial_address::PartialAddress"}},{"name":"keys","type":{"fields":[{"name":"npk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::NpkM"}},{"name":"ivpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::IvpkM"}},{"name":"ovpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::OvpkM"}},{"name":"tpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::TpkM"}}],"kind":"struct","path":"aztec::keys::public_keys::PublicKeys"}}],"kind":"struct","path":"KeyRegistry::register_initial_keys_parameters"}}],"kind":"struct","path":"KeyRegistry::register_initial_keys_abi"},{"fields":[{"name":"parameters","type":{"fields":[{"name":"account","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::aztec_address::AztecAddress"}},{"name":"new_npk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::NpkM"}},{"name":"nonce","type":{"kind":"field"}}],"kind":"struct","path":"KeyRegistry::rotate_npk_m_parameters"}}],"kind":"struct","path":"KeyRegistry::rotate_npk_m_abi"}]}},"file_map":{"109":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/context/unconstrained_context.nr","source":"use dep::protocol_types::{address::AztecAddress, traits::Deserialize};\nuse crate::oracle::{execution::{get_chain_id, get_version, get_contract_address, get_block_number}, storage::storage_read};\n\nstruct UnconstrainedContext {\n block_number: u32,\n contract_address: AztecAddress,\n version: Field,\n chain_id: Field,\n}\n\nimpl UnconstrainedContext {\n 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 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 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 fn block_number(self) -> u32 {\n self.block_number\n }\n\n fn this_address(self) -> AztecAddress {\n self.contract_address\n }\n\n fn version(self) -> Field {\n self.version\n }\n\n fn chain_id(self) -> Field {\n self.chain_id\n }\n\n unconstrained fn raw_storage_read<let N: u32>(self: Self, storage_slot: Field) -> [Field; N] {\n storage_read(self.this_address(), storage_slot, self.block_number())\n }\n\n unconstrained fn storage_read<T, let N: u32>(\n self,\n storage_slot: Field\n ) -> T where T: Deserialize<N> {\n T::deserialize(self.raw_storage_read(storage_slot))\n }\n}\n"},"116":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/context/public_context.nr","source":"use crate::hash::{compute_secret_hash, compute_message_hash, compute_message_nullifier};\nuse dep::protocol_types::address::{AztecAddress, EthAddress};\nuse dep::protocol_types::constants::MAX_FIELD_VALUE;\nuse dep::protocol_types::traits::{Serialize, Deserialize, Empty};\nuse dep::protocol_types::abis::function_selector::FunctionSelector;\nuse crate::context::inputs::public_context_inputs::PublicContextInputs;\nuse crate::context::gas::GasOpts;\nuse crate::hash::ArgsHasher;\n\nstruct PublicContext {\n inputs: PublicContextInputs,\n args_hash: Option<Field>\n}\n\nimpl PublicContext {\n pub fn new(inputs: PublicContextInputs) -> Self {\n PublicContext { inputs, args_hash: Option::none() }\n }\n\n pub fn emit_unencrypted_log<T, let N: u32>(_self: &mut Self, log: T) where T: Serialize<N> {\n emit_unencrypted_log(Serialize::serialize(log).as_slice());\n }\n\n pub fn note_hash_exists(_self: Self, note_hash: Field, leaf_index: Field) -> bool {\n 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 l1_to_l2_msg_exists(msg_hash, msg_leaf_index) == 1\n }\n\n fn nullifier_exists(_self: Self, unsiloed_nullifier: Field, address: AztecAddress) -> bool {\n nullifier_exists(unsiloed_nullifier, address.to_field()) == 1\n }\n\n 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_message_hash(\n sender,\n self.chain_id(),\n /*recipient=*/ self.this_address(),\n self.version(),\n content,\n secret_hash\n );\n let nullifier = compute_message_nullifier(message_hash, secret, leaf_index);\n\n assert(\n !self.nullifier_exists(nullifier, self.this_address()), \"L1-to-L2 message is already nullified\"\n );\n assert(\n self.l1_to_l2_msg_exists(message_hash, leaf_index), \"Tried to consume nonexistent L1-to-L2 message\"\n );\n\n self.push_nullifier(nullifier);\n }\n\n fn message_portal(_self: &mut Self, recipient: EthAddress, content: Field) {\n send_l2_to_l1_msg(recipient, content);\n }\n\n fn call_public_function<let RETURNS_COUNT: u32>(\n _self: &mut Self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field],\n gas_opts: GasOpts\n ) -> FunctionReturns<RETURNS_COUNT> {\n let results = call(\n gas_for_call(gas_opts),\n contract_address,\n args,\n function_selector.to_field()\n );\n let data_to_return: [Field; RETURNS_COUNT] = results.0;\n let success: u8 = results.1;\n assert(success == 1, \"Nested call failed!\");\n\n FunctionReturns::new(data_to_return)\n }\n\n fn static_call_public_function<let RETURNS_COUNT: u32>(\n _self: &mut Self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field],\n gas_opts: GasOpts\n ) -> FunctionReturns<RETURNS_COUNT> {\n let (data_to_return, success): ([Field; RETURNS_COUNT], u8) = call_static(\n gas_for_call(gas_opts),\n contract_address,\n args,\n function_selector.to_field()\n );\n\n assert(success == 1, \"Nested static call failed!\");\n FunctionReturns::new(data_to_return)\n }\n\n fn delegate_call_public_function<let RETURNS_COUNT: u32>(\n _self: &mut Self,\n _contract_address: AztecAddress,\n _function_selector: FunctionSelector,\n _args: [Field]\n ) -> FunctionReturns<RETURNS_COUNT> {\n assert(false, \"'delegate_call_public_function' not implemented!\");\n FunctionReturns::new([0; RETURNS_COUNT])\n }\n\n fn push_note_hash(_self: &mut Self, note_hash: Field) {\n emit_note_hash(note_hash);\n }\n fn push_nullifier(_self: &mut Self, nullifier: Field) {\n emit_nullifier(nullifier);\n }\n\n fn this_address(_self: Self) -> AztecAddress {\n address()\n }\n pub fn storage_address(_self: Self) -> AztecAddress {\n storage_address()\n }\n fn msg_sender(_self: Self) -> AztecAddress {\n sender()\n }\n fn selector(_self: Self) -> FunctionSelector {\n FunctionSelector::from_u32(function_selector())\n }\n fn get_args_hash(mut self) -> Field {\n if !self.args_hash.is_some() {\n let mut hasher = ArgsHasher::new();\n\n // TODO: this should be replaced with the compile-time calldata size.\n for i in 0..self.inputs.calldata_length as u32 {\n let argn: [Field; 1] = calldata_copy((2 + i) as u32, 1);\n hasher.add(argn[0]);\n }\n\n self.args_hash = Option::some(hasher.hash());\n }\n\n self.args_hash.unwrap()\n }\n fn transaction_fee(_self: Self) -> Field {\n transaction_fee()\n }\n\n fn chain_id(_self: Self) -> Field {\n chain_id()\n }\n fn version(_self: Self) -> Field {\n version()\n }\n fn block_number(_self: Self) -> Field {\n block_number()\n }\n fn timestamp(_self: Self) -> u64 {\n timestamp()\n }\n pub fn fee_per_l2_gas(_self: Self) -> Field {\n fee_per_l2_gas()\n }\n pub fn fee_per_da_gas(_self: Self) -> Field {\n fee_per_da_gas()\n }\n\n fn l2_gas_left(_self: Self) -> Field {\n l2_gas_left()\n }\n fn da_gas_left(_self: Self) -> Field {\n da_gas_left()\n }\n\n 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 out[i] = storage_read(storage_slot + i as Field);\n }\n out\n }\n\n fn storage_read<T, let N: u32>(self, storage_slot: Field) -> T where T: Deserialize<N> {\n T::deserialize(self.raw_storage_read(storage_slot))\n }\n\n fn raw_storage_write<let N: u32>(_self: Self, storage_slot: Field, values: [Field; N]) {\n for i in 0..N {\n storage_write(storage_slot + i as Field, values[i]);\n }\n }\n\n fn storage_write<T, let N: u32>(self, storage_slot: Field, value: T) where T: Serialize<N> {\n self.raw_storage_write(storage_slot, value.serialize());\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 [\n user_gas.l2_gas.unwrap_or(MAX_FIELD_VALUE),\n user_gas.da_gas.unwrap_or(MAX_FIELD_VALUE)\n ]\n}\n\n// Unconstrained opcode wrappers (do not use directly).\n// TODO(https://github.com/AztecProtocol/aztec-packages/issues/6420): reconsider.\nunconstrained fn address() -> AztecAddress {\n address_opcode()\n}\nunconstrained fn storage_address() -> AztecAddress {\n storage_address_opcode()\n}\nunconstrained fn sender() -> AztecAddress {\n sender_opcode()\n}\nunconstrained fn portal() -> EthAddress {\n portal_opcode()\n}\nunconstrained fn function_selector() -> u32 {\n function_selector_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 note_hash_exists(note_hash: Field, leaf_index: Field) -> u8 {\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) -> u8 {\n nullifier_exists_opcode(nullifier, address)\n}\nunconstrained fn emit_nullifier(nullifier: Field) {\n emit_nullifier_opcode(nullifier)\n}\nunconstrained fn emit_unencrypted_log(message: [Field]) {\n emit_unencrypted_log_opcode(message)\n}\nunconstrained fn l1_to_l2_msg_exists(msg_hash: Field, msg_leaf_index: Field) -> u8 {\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<let RET_SIZE: u32>(\n gas: [Field; 2],\n address: AztecAddress,\n args: [Field],\n function_selector: Field\n) -> ([Field; RET_SIZE], u8) {\n call_opcode(gas, address, args, function_selector)\n}\nunconstrained fn call_static<let RET_SIZE: u32>(\n gas: [Field; 2],\n address: AztecAddress,\n args: [Field],\n function_selector: Field\n) -> ([Field; RET_SIZE], u8) {\n call_static_opcode(gas, address, args, function_selector)\n}\n\nunconstrained fn calldata_copy<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {\n calldata_copy_opcode(cdoffset, copy_size)\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(PublicContextInputs::empty())\n }\n}\n\n// AVM oracles (opcodes) follow, do not use directly.\n#[oracle(avmOpcodeAddress)]\nunconstrained fn address_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodeStorageAddress)]\nunconstrained fn storage_address_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodeSender)]\nunconstrained fn sender_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodePortal)]\nunconstrained fn portal_opcode() -> EthAddress {}\n\n#[oracle(avmOpcodeFunctionSelector)]\nunconstrained fn function_selector_opcode() -> u32 {}\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(avmOpcodeNoteHashExists)]\nunconstrained fn note_hash_exists_opcode(note_hash: Field, leaf_index: Field) -> u8 {}\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) -> u8 {}\n\n#[oracle(avmOpcodeEmitNullifier)]\nunconstrained fn emit_nullifier_opcode(nullifier: Field) {}\n\n#[oracle(avmOpcodeEmitUnencryptedLog)]\nunconstrained fn emit_unencrypted_log_opcode(message: [Field]) {}\n\n#[oracle(avmOpcodeL1ToL2MsgExists)]\nunconstrained fn l1_to_l2_msg_exists_opcode(msg_hash: Field, msg_leaf_index: Field) -> u8 {}\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(avmOpcodeCall)]\nunconstrained fn call_opcode<let RET_SIZE: u32>(\n gas: [Field; 2], // gas allocation: [l2_gas, da_gas]\n address: AztecAddress,\n args: [Field],\n // TODO(5110): consider passing in calldata directly\n function_selector: Field\n) -> ([Field; RET_SIZE], u8) {}\n// ^ return data ^ success\n\n#[oracle(avmOpcodeStaticCall)]\nunconstrained fn call_static_opcode<let RET_SIZE: u32>(\n gas: [Field; 2], // gas allocation: [l2_gas, da_gas]\n address: AztecAddress,\n args: [Field],\n // TODO(5110): consider passing in calldata directly\n function_selector: Field\n) -> ([Field; RET_SIZE], u8) {}\n// ^ return data ^ success\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\nstruct FunctionReturns<let N: u32> {\n values: [Field; N]\n}\n\nimpl<let N: u32> FunctionReturns<N> {\n pub fn new(values: [Field; N]) -> FunctionReturns<N> {\n FunctionReturns { values }\n }\n\n pub fn raw(self) -> [Field; N] {\n self.values\n }\n\n pub fn deserialize_into<T>(self) -> T where T: Deserialize<N> {\n Deserialize::deserialize(self.raw())\n }\n}\n\nimpl FunctionReturns<0> {\n pub fn assert_empty(self) {\n assert(self.values.len() == 0);\n }\n}\n"},"143":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/hash.nr","source":"use dep::protocol_types::{\n address::{AztecAddress, EthAddress},\n constants::{\n GENERATOR_INDEX__SECRET_HASH, GENERATOR_INDEX__MESSAGE_NULLIFIER, ARGS_HASH_CHUNK_COUNT,\n GENERATOR_INDEX__FUNCTION_ARGS, ARGS_HASH_CHUNK_LENGTH, MAX_ARGS_LENGTH\n},\n point::Point, traits::Hash, hash::{sha256_to_field, poseidon2_hash_with_separator}\n};\nuse crate::oracle::logs_traits::ToBytesForUnencryptedLog;\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_unencrypted_log_hash<T, let N: u32, let M: u32>(\n contract_address: AztecAddress,\n log: T\n) -> Field where T: ToBytesForUnencryptedLog<N, M> {\n let message_bytes: [u8; N] = log.to_be_bytes_arr();\n // can't use N - not in scope error\n let n = message_bytes.len();\n let mut hash_bytes = [0; M];\n // Address is converted to 32 bytes in ts\n let address_bytes = contract_address.to_be_bytes_arr();\n for i in 0..32 {\n hash_bytes[i] = address_bytes[i];\n }\n let len_bytes: [u8; 4] = (n as Field).to_be_bytes();\n for i in 0..4 {\n hash_bytes[32 + i] = len_bytes[i];\n }\n for i in 0..n {\n hash_bytes[36 + i] = message_bytes[i];\n }\n\n sha256_to_field(hash_bytes)\n}\n\npub fn compute_message_hash(\n sender: EthAddress,\n chain_id: Field,\n recipient: AztecAddress,\n version: Field,\n content: Field,\n secret_hash: Field\n) -> Field {\n let mut hash_bytes = [0 as u8; 192];\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\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 }\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 and index of the message hash\n// in the L1 to L2 message tree\npub fn compute_message_nullifier(message_hash: Field, secret: Field, leaf_index: Field) -> Field {\n poseidon2_hash_with_separator(\n [message_hash, secret, leaf_index],\n GENERATOR_INDEX__MESSAGE_NULLIFIER\n )\n}\n\nstruct ArgsHasher {\n 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\npub fn hash_args_array<let N: u32>(args: [Field; N]) -> Field {\n hash_args(args.as_slice())\n}\n\npub fn hash_args(args: [Field]) -> Field {\n if args.len() == 0 {\n 0\n } else {\n assert(args.len() <= MAX_ARGS_LENGTH, \"Args length exceeds maximum\");\n let mut chunks_hashes = [0; ARGS_HASH_CHUNK_COUNT];\n let mut current_chunk_values = [0; ARGS_HASH_CHUNK_LENGTH];\n\n let mut current_chunk_index = 0;\n let mut index_inside_current_chunk = 0;\n for i in 0..args.len() {\n current_chunk_values[index_inside_current_chunk] = args[i];\n index_inside_current_chunk+=1;\n if index_inside_current_chunk == ARGS_HASH_CHUNK_LENGTH {\n chunks_hashes[current_chunk_index] = poseidon2_hash_with_separator(current_chunk_values, GENERATOR_INDEX__FUNCTION_ARGS);\n current_chunk_values = [0; ARGS_HASH_CHUNK_LENGTH];\n current_chunk_index+=1;\n index_inside_current_chunk = 0;\n }\n }\n if index_inside_current_chunk > 0 {\n chunks_hashes[current_chunk_index] = poseidon2_hash_with_separator(current_chunk_values, GENERATOR_INDEX__FUNCTION_ARGS);\n }\n poseidon2_hash_with_separator(chunks_hashes, GENERATOR_INDEX__FUNCTION_ARGS)\n }\n}\n\n#[test]\nfn compute_var_args_hash() {\n let mut input = ArgsHasher::new();\n for i in 0..MAX_ARGS_LENGTH {\n input.add(i as Field);\n }\n let hash = input.hash();\n assert(hash == 0x1cce4dbf69f14c44865919991ee1057922e34d7310ba237d71759aa422621ca9);\n}\n\n#[test]\nfn compute_unenc_log_hash_array() {\n let contract_address = AztecAddress::from_field(0x233a3e0df23b2b15b324194cb4a151f26c0b7333250781d34cc269d85dc334c6);\n let log = [\n 0x20660de09f35f876e3e69d227b2a35166ad05f09d82d06366ec9b6f65a51fec2,\n 0x1b52bfe3b8689761916f76dc3d38aa8810860db325cd39ca611eed980091f01c,\n 0x2e559c4045c378a56ad13b9edb1e8de4e7ad3b3aa35cc7ba9ec77f7a68fa43a4,\n 0x25d0f689c4a4178a29d59306f2675824d19be6d25e44fa03b03f49c263053dd2,\n 0x2d513a722d6f352dc0961f156afdc5e31495b9f0e35cb069261a8e55e2df67fd\n ];\n let hash = compute_unencrypted_log_hash(contract_address, log);\n assert(hash == 0x0095b2d17ab72f4b27a341f7ac63e49ec73935ae8c9181a0ac02023eb12f3284);\n}\n\n#[test]\nfn compute_unenc_log_hash_addr() {\n let contract_address = AztecAddress::from_field(0x233a3e0df23b2b15b324194cb4a151f26c0b7333250781d34cc269d85dc334c6);\n let log = AztecAddress::from_field(0x26aa302d4715fd8a687453cb26d616b0768027bd54bcae56b09d908ecd9f8303);\n let hash = compute_unencrypted_log_hash(contract_address, log);\n assert(hash == 0x0083ab647dfb26e7ddee90a0f4209d049d4660cab42000c544b986aaa84c55a3);\n}\n\n#[test]\nfn compute_unenc_log_hash_str() {\n let contract_address = AztecAddress::from_field(0x1b401e1146c5c507962287065c81f0ef7590adae3802c533d7549d6bf0a41bd8);\n let log = \"dummy\";\n let hash = compute_unencrypted_log_hash(contract_address, log);\n assert(hash == 0x00629e88ebd6374f44aa6cfe07e251ecf07213ebc7267e8f6b578ae57ffd6c20);\n}\n\n#[test]\nfn compute_unenc_log_hash_longer_str() {\n let contract_address = AztecAddress::from_field(0x1b401e1146c5c507962287065c81f0ef7590adae3802c533d7549d6bf0a41bd8);\n let log = \"Hello this is a string\";\n let hash = compute_unencrypted_log_hash(contract_address, log);\n assert(hash == 0x0098637962f7d34fa202b7ffad8a07a238c5d1fd897b82a108f7f467fa73b841);\n}\n"},"153":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/oracle/storage.nr","source":"use dep::protocol_types::{address::AztecAddress, traits::Deserialize};\n\n#[oracle(storageRead)]\nunconstrained fn storage_read_oracle<let N: u32>(address: Field, storage_slot: Field, block_number: Field, length: Field) -> [Field; N] {}\n\nunconstrained pub fn raw_storage_read<let N: u32>(\n address: AztecAddress,\n storage_slot: Field,\n block_number: u32\n) -> [Field; N] {\n storage_read_oracle(\n address.to_field(),\n storage_slot,\n block_number as Field,\n N as Field\n )\n}\n\nunconstrained pub fn storage_read<T, let N: u32>(\n address: AztecAddress,\n storage_slot: Field,\n block_number: u32\n) -> T where T: Deserialize<N> {\n T::deserialize(raw_storage_read(address, storage_slot, block_number))\n}\n\nmod tests {\n use crate::oracle::storage::{raw_storage_read, storage_read};\n use dep::protocol_types::address::AztecAddress;\n\n use std::test::OracleMock;\n use crate::test::mocks::mock_struct::MockStruct;\n\n global address = AztecAddress::from_field(29);\n global slot = 7;\n global block_number = 17;\n\n #[test]\n fn test_raw_storage_read() {\n let written = MockStruct { a: 13, b: 42 };\n\n let _ = OracleMock::mock(\"storageRead\").returns(written.serialize());\n\n let read: [Field; 2] = raw_storage_read(address, slot, block_number);\n assert_eq(read[0], 13);\n assert_eq(read[1], 42);\n }\n\n #[test]\n fn test_storage_read() {\n let written = MockStruct { a: 13, b: 42 };\n\n let _ = OracleMock::mock(\"storageRead\").returns(written.serialize());\n\n let read: MockStruct = storage_read(address, slot, block_number);\n assert_eq(read.a, 13);\n assert_eq(read.b, 42);\n }\n}\n"},"163":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/oracle/execution.nr","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\nunconstrained pub fn get_contract_address() -> AztecAddress {\n get_contract_address_oracle()\n}\n\nunconstrained pub fn get_block_number() -> u32 {\n get_block_number_oracle()\n}\n\nunconstrained pub fn get_chain_id() -> Field {\n get_chain_id_oracle()\n}\n\nunconstrained pub fn get_version() -> Field {\n get_version_oracle()\n}\n"},"166":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/state_vars/map.nr","source":"use dep::protocol_types::{storage::map::derive_storage_slot_in_map, traits::ToField};\nuse crate::state_vars::storage::Storage;\n\n// docs:start:map\nstruct Map<K, V, Context> {\n context: Context,\n storage_slot: Field,\n state_var_constructor: fn(Context, Field) -> V,\n}\n// docs:end:map\n\nimpl<K, T, Context> Storage<T> for Map<K, T, Context> {}\n\nimpl<K, V, Context> Map<K, V, Context> {\n // docs:start:new\n pub fn new(\n context: Context,\n storage_slot: Field,\n state_var_constructor: fn(Context, Field) -> V\n ) -> Self {\n assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n Map { context, storage_slot, state_var_constructor }\n }\n // docs:end:new\n\n // docs:start:at\n pub fn at(self, key: K) -> V where K: ToField {\n // TODO(#1204): use a generator index for the storage slot\n let derived_storage_slot = derive_storage_slot_in_map(self.storage_slot, key);\n\n let state_var_constructor = self.state_var_constructor;\n state_var_constructor(self.context, derived_storage_slot)\n }\n // docs:end:at\n}\n\n"},"168":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/state_vars/public_mutable.nr","source":"use crate::context::{PublicContext, UnconstrainedContext};\nuse dep::protocol_types::traits::{Deserialize, Serialize};\nuse crate::state_vars::storage::Storage;\n\n// docs:start:public_mutable_struct\nstruct PublicMutable<T, Context> {\n context: Context,\n storage_slot: Field,\n}\n// docs:end:public_mutable_struct\n\nimpl<T, Context> Storage<T> for PublicMutable<T, Context> {}\n\nimpl<T, Context> PublicMutable<T, Context> {\n // docs:start:public_mutable_struct_new\n pub fn new(\n // Note: Passing the contexts to new(...) just to have an interface compatible with a Map.\n context: Context,\n storage_slot: Field\n ) -> Self {\n assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n PublicMutable { context, storage_slot }\n }\n // docs:end:public_mutable_struct_new\n}\n\nimpl<T, T_SERIALIZED_LEN> PublicMutable<T, &mut PublicContext> where T: Serialize<T_SERIALIZED_LEN> + Deserialize<T_SERIALIZED_LEN> {\n // docs:start:public_mutable_struct_read\n pub fn read(self) -> T {\n self.context.storage_read(self.storage_slot)\n }\n // docs:end:public_mutable_struct_read\n\n // docs:start:public_mutable_struct_write\n pub fn write(self, value: T) {\n self.context.storage_write(self.storage_slot, value);\n }\n // docs:end:public_mutable_struct_write\n}\n\nimpl<T, T_SERIALIZED_LEN> PublicMutable<T, UnconstrainedContext> where T: Deserialize<T_SERIALIZED_LEN> {\n unconstrained pub fn read(self) -> T {\n self.context.storage_read(self.storage_slot)\n }\n}\n"},"221":{"path":"/usr/src/noir-projects/noir-protocol-circuits/crates/types/src/abis/function_selector.nr","source":"use crate::utils::field::field_from_bytes;\nuse crate::traits::{Serialize, Deserialize, FromField, ToField, Empty};\n\nglobal SELECTOR_SIZE = 4;\n\nstruct FunctionSelector {\n // 1st 4-bytes of abi-encoding of function.\n inner: u32,\n}\n\nimpl Eq for FunctionSelector {\n fn eq(self, function_selector: FunctionSelector) -> bool {\n function_selector.inner == self.inner\n }\n}\n\nimpl Serialize<1> for FunctionSelector {\n fn serialize(self: Self) -> [Field; 1] {\n [self.inner as Field]\n }\n}\n\nimpl Deserialize<1> for FunctionSelector {\n fn deserialize(fields: [Field; 1]) -> Self {\n Self { inner: fields[0] as u32 }\n }\n}\n\nimpl FromField for FunctionSelector {\n fn from_field(field: Field) -> Self {\n Self { inner: field as u32 }\n }\n}\n\nimpl ToField for FunctionSelector {\n fn to_field(self) -> Field {\n self.inner as Field\n }\n}\n\nimpl Empty for FunctionSelector {\n fn empty() -> Self {\n Self { inner: 0 as u32 }\n }\n}\n\nimpl FunctionSelector {\n pub fn from_u32(value: u32) -> Self {\n Self { inner: value }\n }\n\n pub fn from_signature<let N: u32>(signature: str<N>) -> Self {\n let bytes = signature.as_bytes();\n let hash = std::hash::keccak256(bytes, bytes.len() as u32);\n\n let mut selector_be_bytes = [0; SELECTOR_SIZE];\n for i in 0..SELECTOR_SIZE {\n selector_be_bytes[i] = hash[i];\n }\n\n FunctionSelector::from_field(field_from_bytes(selector_be_bytes, true))\n }\n\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n}\n"},"24":{"path":"std/embedded_curve_ops.nr","source":"use crate::ops::arith::{Add, Sub, Neg};\nuse crate::cmp::Eq;\n\n/// A point on the embedded elliptic curve\n/// By definition, the base field of the embedded curve is the scalar field of the proof system curve, i.e the Noir Field.\n/// x and y denotes the Weierstrass coordinates of the point, if is_infinite is false.\nstruct EmbeddedCurvePoint {\n x: Field,\n y: Field,\n is_infinite: bool\n}\n\nimpl EmbeddedCurvePoint {\n /// Elliptic curve point doubling operation\n /// returns the doubled point of a point P, i.e P+P\n fn double(self) -> EmbeddedCurvePoint {\n embedded_curve_add(self, self)\n }\n\n /// Returns the null element of the curve; 'the point at infinity'\n fn point_at_infinity() -> EmbeddedCurvePoint {\n EmbeddedCurvePoint { x: 0, y: 0, is_infinite: true }\n }\n}\n\nimpl Add for EmbeddedCurvePoint {\n /// Adds two points P+Q, using the curve addition formula, and also handles point at infinity\n fn add(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n embedded_curve_add(self, other)\n }\n}\n\nimpl Sub for EmbeddedCurvePoint {\n /// Points subtraction operation, using addition and negation\n fn sub(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n self + other.neg()\n }\n}\n\nimpl Neg for EmbeddedCurvePoint {\n /// Negates a point P, i.e returns -P, by negating the y coordinate.\n /// If the point is at infinity, then the result is also at infinity.\n fn neg(self) -> EmbeddedCurvePoint {\n EmbeddedCurvePoint { x: self.x, y: -self.y, is_infinite: self.is_infinite }\n }\n}\n\nimpl Eq for EmbeddedCurvePoint {\n /// Checks whether two points are equal\n fn eq(self: Self, b: EmbeddedCurvePoint) -> bool {\n (self.is_infinite & b.is_infinite)\n | ((self.is_infinite == b.is_infinite) & (self.x == b.x) & (self.y == b.y))\n }\n}\n\n/// Scalar for the embedded curve represented as low and high limbs\n/// By definition, the scalar field of the embedded curve is base field of the proving system curve.\n/// It may not fit into a Field element, so it is represented with two Field elements; its low and high limbs.\nstruct EmbeddedCurveScalar {\n lo: Field,\n hi: Field,\n}\n\nimpl EmbeddedCurveScalar {\n pub fn new(lo: Field, hi: Field) -> Self {\n EmbeddedCurveScalar { lo, hi }\n }\n\n #[field(bn254)]\n fn from_field(scalar: Field) -> EmbeddedCurveScalar {\n let (a,b) = crate::field::bn254::decompose(scalar);\n EmbeddedCurveScalar { lo: a, hi: b }\n }\n}\n\nimpl Eq for EmbeddedCurveScalar {\n fn eq(self, other: Self) -> bool {\n (other.hi == self.hi) & (other.lo == self.lo)\n }\n}\n\n// Computes a multi scalar multiplication over the embedded curve.\n// For bn254, We have Grumpkin and Baby JubJub.\n// For bls12-381, we have JubJub and Bandersnatch.\n//\n// The embedded curve being used is decided by the \n// underlying proof system.\n// docs:start:multi_scalar_mul\npub fn multi_scalar_mul<let N: u32>(\n points: [EmbeddedCurvePoint; N],\n scalars: [EmbeddedCurveScalar; N]\n) -> EmbeddedCurvePoint\n// docs:end:multi_scalar_mul\n{\n let point_array = multi_scalar_mul_array_return(points, scalars);\n EmbeddedCurvePoint { x: point_array[0], y: point_array[1], is_infinite: point_array[2] as bool }\n}\n\n#[foreign(multi_scalar_mul)]\nfn multi_scalar_mul_array_return<let N: u32>(points: [EmbeddedCurvePoint; N], scalars: [EmbeddedCurveScalar; N]) -> [Field; 3] {}\n\n#[foreign(multi_scalar_mul)]\npub(crate) fn multi_scalar_mul_slice(points: [EmbeddedCurvePoint], scalars: [EmbeddedCurveScalar]) -> [Field; 3] {}\n\n// docs:start:fixed_base_scalar_mul\npub fn fixed_base_scalar_mul(scalar: EmbeddedCurveScalar) -> EmbeddedCurvePoint\n// docs:end:fixed_base_scalar_mul\n{\n let g1 = EmbeddedCurvePoint { x: 1, y: 17631683881184975370165255887551781615748388533673675138860, is_infinite: false };\n multi_scalar_mul([g1], [scalar])\n}\n\n// This is a hack as returning an `EmbeddedCurvePoint` from a foreign function in brillig returns a [BrilligVariable::SingleAddr; 2] rather than BrilligVariable::BrilligArray\n// as is defined in the brillig bytecode format. This is a workaround which allows us to fix this without modifying the serialization format.\n// docs:start:embedded_curve_add\nfn embedded_curve_add(\n point1: EmbeddedCurvePoint,\n point2: EmbeddedCurvePoint\n) -> EmbeddedCurvePoint\n// docs:end:embedded_curve_add\n{\n let point_array = embedded_curve_add_array_return(point1, point2);\n let x = point_array[0];\n let y = point_array[1];\n EmbeddedCurvePoint { x, y, is_infinite: point_array[2] == 1 }\n}\n\n#[foreign(embedded_curve_add)]\nfn embedded_curve_add_array_return(_point1: EmbeddedCurvePoint, _point2: EmbeddedCurvePoint) -> [Field; 3] {}\n"},"258":{"path":"/usr/src/noir-projects/noir-protocol-circuits/crates/types/src/storage/map.nr","source":"use crate::{hash::pedersen_hash, traits::ToField};\n\npub fn derive_storage_slot_in_map<K>(storage_slot: Field, key: K) -> Field where K: ToField {\n pedersen_hash([storage_slot, key.to_field()], 0)\n}\n\nmod test {\n use crate::{address::AztecAddress, storage::map::derive_storage_slot_in_map};\n\n #[test]\n fn test_derive_storage_slot_in_map_matches_typescript() {\n let map_slot = 0x132258fb6962c4387ba659d9556521102d227549a386d39f0b22d1890d59c2b5;\n let key = AztecAddress::from_field(0x302dbc2f9b50a73283d5fb2f35bc01eae8935615817a0b4219a057b2ba8a5a3f);\n\n let slot = derive_storage_slot_in_map(map_slot, key);\n\n // The following value was generated by `map_slot.test.ts`\n let slot_from_typescript = 0x2499880e2b1b831785c17286f99a0d5122fee784ce7b1c04e380c4a991da819a;\n\n assert_eq(slot, slot_from_typescript);\n }\n}\n"},"263":{"path":"/usr/src/noir-projects/noir-protocol-circuits/crates/types/src/type_serialization.nr","source":"use crate::traits::{Serialize, Deserialize};\n\nglobal BOOL_SERIALIZED_LEN: Field = 1;\nglobal U8_SERIALIZED_LEN: Field = 1;\nglobal U32_SERIALIZED_LEN: Field = 1;\nglobal U64_SERIALIZED_LEN: Field = 1;\nglobal U128_SERIALIZED_LEN: Field = 1;\nglobal FIELD_SERIALIZED_LEN: Field = 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; U32_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<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; 1] {\n [self.to_integer()]\n }\n}\n\nimpl Deserialize<U128_SERIALIZED_LEN> for U128 {\n fn deserialize(fields: [Field; U128_SERIALIZED_LEN]) -> Self {\n U128::from_integer(fields[0])\n }\n}\n\nimpl Serialize<FIELD_SERIALIZED_LEN> for Field {\n fn serialize(self) -> [Field; U32_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"},"264":{"path":"/usr/src/noir-projects/noir-protocol-circuits/crates/types/src/traits.nr","source":"use crate::utils::field::field_from_bytes;\n\n// Trait: is_empty\n//\n// The general is_empty trait checks if a data type is is empty,\n// and it defines empty for the basic data types as 0.\n//\n// If a Field is equal to zero, then it is regarded as zero.\n// We will go with this definition for now, however it can be problematic \n// if a value can actually be zero. In a future refactor, we can \n// use the optional type for safety. Doing it now would lead to a worse devex\n// and would make it harder to sync up with the cpp code.\n// Preferred over Default trait to convey intent, as default doesn't necessarily mean empty.\ntrait Empty {\n fn empty() -> Self;\n}\n\nimpl Empty for Field {\n fn empty() -> Self {\n 0\n }\n}\n\nimpl Empty for u1 {\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u8 {\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u32 {\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u64 {\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for U128 {\n fn empty() -> Self {\n U128::from_integer(0)\n }\n}\n\npub fn is_empty<T>(item: T) -> bool where T: Empty + Eq {\n item.eq(T::empty())\n}\n\npub fn is_empty_array<T, let N: u32>(array: [T; N]) -> bool where T: Empty + Eq {\n array.all(|elem| is_empty(elem))\n}\n\ntrait Hash {\n fn hash(self) -> Field;\n}\n\ntrait ToField {\n fn to_field(self) -> Field;\n}\n\nimpl ToField for Field {\n fn to_field(self) -> Field {\n self\n }\n}\n\nimpl ToField for bool {\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u1 {\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u8 {\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u32 {\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u64 {\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for U128 {\n fn to_field(self) -> Field {\n self.to_integer()\n }\n}\nimpl<let N: u32> ToField for str<N> {\n fn to_field(self) -> Field {\n assert(N < 32, \"String doesn't fit in a field, consider using Serialize instead\");\n field_from_bytes(self.as_bytes(), true)\n }\n}\n\ntrait FromField {\n fn from_field(value: Field) -> Self;\n}\n\nimpl FromField for Field {\n fn from_field(value: Field) -> Self {\n value\n }\n}\n\nimpl FromField for bool {\n fn from_field(value: Field) -> Self {\n value as bool\n }\n}\nimpl FromField for u1 {\n fn from_field(value: Field) -> Self {\n value as u1\n }\n}\nimpl FromField for u8 {\n fn from_field(value: Field) -> Self {\n value as u8\n }\n}\nimpl FromField for u32 {\n fn from_field(value: Field) -> Self {\n value as u32\n }\n}\nimpl FromField for u64 {\n fn from_field(value: Field) -> Self {\n value as u64\n }\n}\nimpl FromField for U128 {\n fn from_field(value: Field) -> Self {\n U128::from_integer(value)\n }\n}\n\n// docs:start:serialize\ntrait Serialize<let N: u32> {\n fn serialize(self) -> [Field; N];\n}\n// docs:end:serialize\n\nimpl<let N: u32> Serialize<N> for [Field; N] {\n fn serialize(self) -> [Field; N] {\n self\n }\n}\nimpl<let N: u32> Serialize<N> for str<N> {\n fn serialize(self) -> [Field; N] {\n let mut result = [0; N];\n let bytes: [u8; N] = self.as_bytes();\n for i in 0..N {\n result[i] = field_from_bytes([bytes[i];1], true);\n }\n result\n }\n}\n\n// docs:start:deserialize\ntrait Deserialize<let N: u32> {\n fn deserialize(fields: [Field; N]) -> Self;\n}\n// docs:end:deserialize\n\nimpl<let N: u32> Deserialize<N> for [Field; N] {\n fn deserialize(fields: [Field; N]) -> Self {\n fields\n }\n}\n"},"269":{"path":"/usr/src/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr","source":"use crate::{\n abis::{\n contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n function_selector::FunctionSelector, log_hash::{LogHash, ScopedLogHash, ScopedEncryptedLogHash},\n note_hash::ScopedNoteHash, nullifier::ScopedNullifier\n},\n address::{AztecAddress, EthAddress},\n constants::{\n FUNCTION_TREE_HEIGHT, GENERATOR_INDEX__SILOED_NOTE_HASH, GENERATOR_INDEX__OUTER_NULLIFIER,\n GENERATOR_INDEX__VK, GENERATOR_INDEX__NOTE_HASH_NONCE, GENERATOR_INDEX__UNIQUE_NOTE_HASH,\n MAX_ENCRYPTED_LOGS_PER_TX, MAX_NOTE_ENCRYPTED_LOGS_PER_TX\n},\n merkle_tree::root::root_from_sibling_path,\n messaging::l2_to_l1_message::{L2ToL1Message, ScopedL2ToL1Message},\n recursion::verification_key::VerificationKey, traits::{is_empty, ToField},\n utils::field::field_from_bytes_32_trunc\n};\n\npub fn sha256_to_field<let N: u32>(bytes_to_hash: [u8; N]) -> Field {\n let sha256_hashed = std::hash::sha256(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(function_leaf, function_leaf_index, function_leaf_sibling_path)\n}\n\nfn compute_note_hash_nonce(tx_hash: Field, note_index_in_tx: u32) -> Field {\n // Hashing tx hash with note index in tx is guaranteed to be unique\n poseidon2_hash_with_separator(\n [\n tx_hash,\n note_index_in_tx as Field\n ],\n GENERATOR_INDEX__NOTE_HASH_NONCE\n )\n}\n\npub fn compute_unique_note_hash(nonce: Field, note_hash: Field) -> Field {\n let inputs = [nonce, note_hash];\n poseidon2_hash_with_separator(inputs, GENERATOR_INDEX__UNIQUE_NOTE_HASH)\n}\n\npub fn compute_siloed_note_hash(app: AztecAddress, unique_note_hash: Field) -> Field {\n poseidon2_hash_with_separator(\n [\n app.to_field(),\n unique_note_hash\n ],\n GENERATOR_INDEX__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, tx_hash: Field, note_index_in_tx: u32) -> Field {\n if note_hash.contract_address.is_zero() {\n 0\n } else {\n let nonce = compute_note_hash_nonce(tx_hash, note_index_in_tx);\n let unique_note_hash = compute_unique_note_hash(nonce, note_hash.value());\n compute_siloed_note_hash(note_hash.contract_address, unique_note_hash)\n }\n}\n\npub fn compute_siloed_nullifier(app: AztecAddress, nullifier: Field) -> Field {\n poseidon2_hash_with_separator(\n [\n app.to_field(),\n nullifier\n ],\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 silo_encrypted_log_hash(log_hash: ScopedLogHash) -> Field {\n // We assume contract address has already been masked\n if log_hash.contract_address.is_zero() {\n 0\n } else {\n accumulate_sha256([log_hash.contract_address.to_field(), log_hash.log_hash.value])\n }\n}\n\npub fn mask_encrypted_log_hash(scoped_log: ScopedEncryptedLogHash) -> AztecAddress {\n if scoped_log.contract_address.is_zero() {\n AztecAddress::from_field(0)\n } else if (scoped_log.log_hash.randomness == 0) {\n scoped_log.contract_address\n } else {\n AztecAddress::from_field(\n poseidon2_hash_with_separator(\n [scoped_log.contract_address.to_field(), scoped_log.log_hash.randomness],\n 0\n )\n )\n }\n}\n\nfn compute_siloed_unencrypted_log_hash(address: AztecAddress, log_hash: Field) -> Field {\n accumulate_sha256([address.to_field(), log_hash])\n}\n\npub fn silo_unencrypted_log_hash(log_hash: ScopedLogHash) -> Field {\n if log_hash.contract_address.is_zero() {\n 0\n } else {\n compute_siloed_unencrypted_log_hash(log_hash.contract_address, log_hash.value())\n }\n}\n\npub fn merkle_hash(left: Field, right: Field) -> Field {\n poseidon2_hash([left, right])\n}\n\npub fn stdlib_recursion_verification_key_compress_native_vk(_vk: VerificationKey) -> Field {\n // Original cpp code\n // stdlib::recursion::verification_key<CT::bn254>::compress_native(private_call.vk, GeneratorIndex::VK);\n // The above cpp method is only ever called on verification key, so it has been special cased here\n let _hash_index = GENERATOR_INDEX__VK;\n 0\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: BoundedVec<u8, 160> = BoundedVec::new();\n\n let inputs = [contract_address.to_field(), rollup_version_id, recipient.to_field(), chain_id, content];\n for i in 0..inputs.len() {\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.push(item_bytes[j]);\n }\n }\n\n sha256_to_field(bytes.storage)\n}\n\npub fn silo_l2_to_l1_message(msg: ScopedL2ToL1Message, rollup_version_id: Field, chain_id: Field) -> 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\n // Concatentate two fields into 32x2 = 64 bytes\n // accumulate_sha256 assumes that the inputs are pre-truncated 31 byte numbers\n let mut hash_input_flattened = [0; 64];\n for offset in 0..input.len() {\n let input_as_bytes: [u8; 32] = input[offset].to_be_bytes();\n for byte_index in 0..32 {\n hash_input_flattened[offset * 32 + byte_index] = input_as_bytes[byte_index];\n }\n }\n\n sha256_to_field(hash_input_flattened)\n}\n\n// Computes the final logs hash for a tx.\n// NB: this assumes MAX_ENCRYPTED_LOGS_PER_TX == MAX_UNENCRYPTED_LOGS_PER_TX\n// to avoid doubling code, since we can't define the byte len to be 32*N directly.\npub fn compute_tx_logs_hash(logs: [LogHash; MAX_ENCRYPTED_LOGS_PER_TX]) -> Field {\n // Convert each field element into a byte array and append the bytes to `hash_input_flattened`\n let mut hash_input_flattened = [0; MAX_ENCRYPTED_LOGS_PER_TX * 32];\n for offset in 0..MAX_ENCRYPTED_LOGS_PER_TX {\n let input_as_bytes: [u8; 32] = logs[offset].value.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 // Ideally we would push to a slice then hash, but there is no sha_slice\n // Hardcode to 256 bytes for now\n let mut hash = sha256_to_field(hash_input_flattened);\n // Not having a 0 value hash for empty logs causes issues with empty txs\n // used for padding. Returning early is currently unsupported.\n // We always provide sorted logs here, so 0 being empty means all are empty.\n if is_empty(logs[0]) {\n hash = 0;\n }\n hash\n}\n\npub fn compute_tx_note_logs_hash(logs: [LogHash; MAX_NOTE_ENCRYPTED_LOGS_PER_TX]) -> Field {\n // Convert each field element into a byte array and append the bytes to `hash_input_flattened`\n let mut hash_input_flattened = [0; MAX_NOTE_ENCRYPTED_LOGS_PER_TX * 32];\n for offset in 0..MAX_NOTE_ENCRYPTED_LOGS_PER_TX {\n let input_as_bytes: [u8; 32] = logs[offset].value.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 // Ideally we would push to a slice then hash, but there is no sha_slice\n // Hardcode to 256 bytes for now\n let mut hash = sha256_to_field(hash_input_flattened);\n // Not having a 0 value hash for empty logs causes issues with empty txs\n // used for padding. Returning early is currently unsupported.\n // We always provide sorted logs here, so 0 being empty means all are empty.\n if is_empty(logs[0]) {\n hash = 0;\n }\n hash\n}\n\npub fn 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>(\n inputs: [Field; N],\n separator: T\n) -> Field where T: ToField {\n // We manually hash the inputs here, since we cannot express with the type system a constant size inputs array of N + 1\n let in_len = N + 1;\n let two_pow_64 = 18446744073709551616;\n let iv : Field = (in_len as Field) * two_pow_64;\n let mut sponge = std::hash::poseidon2::Poseidon2::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#[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,\n 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39,\n 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59,\n 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79,\n 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99,\n 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119,\n 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139,\n 140, 141, 142, 143, 144, 145, 146, 147, 148, 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 = std::hash::sha256(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 = 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(AztecAddress::from_field(1), EthAddress::from_field(3), 5, 2, 4);\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"},"29":{"path":"std/hash/mod.nr","source":"mod poseidon;\nmod mimc;\nmod poseidon2;\nmod keccak;\nmod sha256;\nmod sha512;\n\nuse crate::default::Default;\nuse crate::uint128::U128;\nuse crate::collections::vec::Vec;\nuse crate::embedded_curve_ops::{EmbeddedCurvePoint, EmbeddedCurveScalar, multi_scalar_mul, multi_scalar_mul_slice};\nuse crate::meta::derive_via;\n\n// Kept for backwards compatibility\npub use sha256::{digest, sha256, sha256_compression, sha256_var};\n\n#[foreign(blake2s)]\n// docs:start:blake2s\npub fn blake2s<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake2s\n{}\n\n#[foreign(blake3)]\n// docs:start:blake3\npub fn blake3<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake3\n{}\n\n// docs:start:pedersen_commitment\npub fn pedersen_commitment<let N: u32>(input: [Field; N]) -> EmbeddedCurvePoint {\n // docs:end:pedersen_commitment\n pedersen_commitment_with_separator(input, 0)\n}\n\npub fn pedersen_hash_with_separator<let N: u32>(input: [Field; N], separator: u32) -> Field {\n __pedersen_hash_with_separator(input, separator)\n}\n\nfn pedersen_commitment_with_separator<let N: u32>(input: [Field; N], separator: u32) -> EmbeddedCurvePoint {\n let value = __pedersen_commitment_with_separator(input, separator);\n if (value[0] == 0) & (value[1] == 0) {\n EmbeddedCurvePoint { x: 0, y: 0, is_infinite: true }\n } else {\n EmbeddedCurvePoint { x: value[0], y: value[1], is_infinite: false }\n }\n}\n\n#[no_predicates]\nfn pedersen_commitment_with_separator_noir<let N: u32>(input: [Field; N], separator: u32) -> EmbeddedCurvePoint {\n let mut points = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N];\n for i in 0..N {\n // we use the unsafe version because the multi_scalar_mul will constrain the scalars.\n points[i] = from_field_unsafe(input[i]);\n }\n let generators = derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n multi_scalar_mul(generators, points)\n}\n\n#[no_predicates]\nfn pedersen_hash_with_separator_noir<let N: u32>(input: [Field; N], separator: u32) -> Field {\n let mut scalars: Vec<EmbeddedCurveScalar> = Vec::from_slice([EmbeddedCurveScalar { lo: 0, hi: 0 }; N].as_slice()); //Vec::new();\n\n for i in 0..N {\n scalars.set(i, from_field_unsafe(input[i]));\n }\n scalars.push(EmbeddedCurveScalar { lo: N as Field, hi: 0 as Field });\n let domain_generators :[EmbeddedCurvePoint; N]= derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n let mut vec_generators = Vec::new();\n for i in 0..N {\n vec_generators.push(domain_generators[i]);\n }\n let length_generator : [EmbeddedCurvePoint; 1] = derive_generators(\"pedersen_hash_length\".as_bytes(), 0);\n vec_generators.push(length_generator[0]);\n multi_scalar_mul_slice(vec_generators.slice, scalars.slice)[0]\n}\n\n// docs:start:pedersen_hash\npub fn pedersen_hash<let N: u32>(input: [Field; N]) -> Field\n// docs:end:pedersen_hash\n{\n __pedersen_hash_with_separator(input, 0)\n}\n\n#[foreign(pedersen_hash)]\nfn __pedersen_hash_with_separator<let N: u32>(input: [Field; N], separator: u32) -> Field {}\n\n#[foreign(pedersen_commitment)]\nfn __pedersen_commitment_with_separator<let N: u32>(input: [Field; N], separator: u32) -> [Field; 2] {}\n\n#[field(bn254)]\nfn derive_generators<let N: u32, let M: u32>(domain_separator_bytes: [u8; M], starting_index: u32) -> [EmbeddedCurvePoint; N] {\n crate::assert_constant(domain_separator_bytes);\n // TODO(https://github.com/noir-lang/noir/issues/5672): Add back assert_constant on starting_index\n __derive_generators(domain_separator_bytes, starting_index)\n}\n\n#[builtin(derive_pedersen_generators)]\n#[field(bn254)]\nfn __derive_generators<let N: u32, let M: u32>(\n domain_separator_bytes: [u8; M],\n starting_index: u32\n) -> [EmbeddedCurvePoint; N] {}\n\n#[field(bn254)]\n // Same as from_field but:\n // does not assert the limbs are 128 bits\n // does not assert the decomposition does not overflow the EmbeddedCurveScalar\n fn from_field_unsafe(scalar: Field) -> EmbeddedCurveScalar {\n let (xlo, xhi) = unsafe {\n crate::field::bn254::decompose_hint(scalar)\n };\n // Check that the decomposition is correct\n assert_eq(scalar, xlo + crate::field::bn254::TWO_POW_128 * xhi);\n EmbeddedCurveScalar { lo: xlo, hi: xhi }\n}\n\npub fn hash_to_field(inputs: [Field]) -> Field {\n let mut sum = 0;\n\n for input in inputs {\n let input_bytes: [u8; 32] = input.to_le_bytes();\n sum += crate::field::bytes32_to_field(blake2s(input_bytes));\n }\n\n sum\n}\n\n// docs:start:keccak256\npub fn keccak256<let N: u32>(input: [u8; N], message_size: u32) -> [u8; 32]\n// docs:end:keccak256\n{\n crate::hash::keccak::keccak256(input, message_size)\n}\n\n#[foreign(poseidon2_permutation)]\npub fn poseidon2_permutation<let N: u32>(_input: [Field; N], _state_length: u32) -> [Field; N] {}\n\n// Generic hashing support. \n// Partially ported and impacted by rust.\n\n// Hash trait shall be implemented per type.\n#[derive_via(derive_hash)]\ntrait Hash {\n fn hash<H>(self, state: &mut H) where H: Hasher;\n}\n\n// docs:start:derive_hash\ncomptime fn derive_hash(s: StructDefinition) -> Quoted {\n let name = quote { Hash };\n let signature = quote { fn hash<H>(_self: Self, _state: &mut H) where H: std::hash::Hasher };\n let for_each_field = |name| quote { _self.$name.hash(_state); };\n crate::meta::make_trait_impl(s, name, signature, for_each_field, quote {}, |fields| fields)\n}\n// docs:end:derive_hash\n\n// Hasher trait shall be implemented by algorithms to provide hash-agnostic means.\n// TODO: consider making the types generic here ([u8], [Field], etc.)\ntrait Hasher{\n fn finish(self) -> Field;\n \n fn write(&mut self, input: Field);\n}\n\n// BuildHasher is a factory trait, responsible for production of specific Hasher.\ntrait BuildHasher<H> where H: Hasher{\n fn build_hasher(self) -> H;\n}\n\nstruct BuildHasherDefault<H>;\n\nimpl<H> BuildHasher<H> for BuildHasherDefault<H>\nwhere \n H: Hasher + Default {\n fn build_hasher(_self: Self) -> H {\n H::default()\n }\n}\n\nimpl<H> Default for BuildHasherDefault<H>\nwhere \n H: Hasher + Default {\n fn default() -> Self {\n BuildHasherDefault {}\n }\n}\n\nimpl Hash for Field {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self);\n }\n}\n\nimpl Hash for u1 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u8 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u16 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u32 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u64 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for i8 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for i16 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for i32 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for i64 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for bool {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for () {\n fn hash<H>(_self: Self, _state: &mut H) where H: Hasher {}\n}\n\nimpl Hash for U128 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self.lo as Field);\n H::write(state, self.hi as Field);\n }\n}\n\nimpl<T, let N: u32> Hash for [T; N] where T: Hash {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n for elem in self {\n elem.hash(state);\n }\n }\n}\n\nimpl<T> Hash for [T] where T: Hash {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n self.len().hash(state);\n for elem in self {\n elem.hash(state);\n }\n }\n}\n\nimpl<A, B> Hash for (A, B) where A: Hash, B: Hash {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n self.0.hash(state);\n self.1.hash(state);\n }\n}\n\nimpl<A, B, C> Hash for (A, B, C) where A: Hash, B: Hash, C: Hash {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n }\n}\n\nimpl<A, B, C, D> Hash for (A, B, C, D) where A: Hash, B: Hash, C: Hash, D: Hash {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n }\n}\n\nimpl<A, B, C, D, E> Hash for (A, B, C, D, E) where A: Hash, B: Hash, C: Hash, D: Hash, E: Hash {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n self.4.hash(state);\n }\n}\n\n// Some test vectors for Pedersen hash and Pedersen Commitment.\n// They have been generated using the same functions so the tests are for now useless\n// but they will be useful when we switch to Noir implementation.\n#[test]\nfn assert_pedersen() {\n assert_eq(\n pedersen_hash_with_separator([1], 1), 0x1b3f4b1a83092a13d8d1a59f7acb62aba15e7002f4440f2275edb99ebbc2305f\n );\n assert_eq(\n pedersen_commitment_with_separator([1], 1), EmbeddedCurvePoint {\n x: 0x054aa86a73cb8a34525e5bbed6e43ba1198e860f5f3950268f71df4591bde402,\n y: 0x209dcfbf2cfb57f9f6046f44d71ac6faf87254afc7407c04eb621a6287cac126,\n is_infinite: false\n }\n );\n\n assert_eq(\n pedersen_hash_with_separator([1, 2], 2), 0x26691c129448e9ace0c66d11f0a16d9014a9e8498ee78f4d69f0083168188255\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2], 2), EmbeddedCurvePoint {\n x: 0x2e2b3b191e49541fe468ec6877721d445dcaffe41728df0a0eafeb15e87b0753,\n y: 0x2ff4482400ad3a6228be17a2af33e2bcdf41be04795f9782bd96efe7e24f8778,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3], 3), 0x0bc694b7a1f8d10d2d8987d07433f26bd616a2d351bc79a3c540d85b6206dbe4\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3], 3), EmbeddedCurvePoint {\n x: 0x1fee4e8cf8d2f527caa2684236b07c4b1bad7342c01b0f75e9a877a71827dc85,\n y: 0x2f9fedb9a090697ab69bf04c8bc15f7385b3e4b68c849c1536e5ae15ff138fd1,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4], 4), 0xdae10fb32a8408521803905981a2b300d6a35e40e798743e9322b223a5eddc\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4], 4), EmbeddedCurvePoint {\n x: 0x07ae3e202811e1fca39c2d81eabe6f79183978e6f12be0d3b8eda095b79bdbc9,\n y: 0x0afc6f892593db6fbba60f2da558517e279e0ae04f95758587760ba193145014,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5], 5), 0xfc375b062c4f4f0150f7100dfb8d9b72a6d28582dd9512390b0497cdad9c22\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5], 5), EmbeddedCurvePoint {\n x: 0x1754b12bd475a6984a1094b5109eeca9838f4f81ac89c5f0a41dbce53189bb29,\n y: 0x2da030e3cfcdc7ddad80eaf2599df6692cae0717d4e9f7bfbee8d073d5d278f7,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6], 6), 0x1696ed13dc2730062a98ac9d8f9de0661bb98829c7582f699d0273b18c86a572\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6], 6), EmbeddedCurvePoint {\n x: 0x190f6c0e97ad83e1e28da22a98aae156da083c5a4100e929b77e750d3106a697,\n y: 0x1f4b60f34ef91221a0b49756fa0705da93311a61af73d37a0c458877706616fb,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7], 7), 0x128c0ff144fc66b6cb60eeac8a38e23da52992fc427b92397a7dffd71c45ede3\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7], 7), EmbeddedCurvePoint {\n x: 0x015441e9d29491b06563fac16fc76abf7a9534c715421d0de85d20dbe2965939,\n y: 0x1d2575b0276f4e9087e6e07c2cb75aa1baafad127af4be5918ef8a2ef2fea8fc,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8], 8), 0x2f960e117482044dfc99d12fece2ef6862fba9242be4846c7c9a3e854325a55c\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8], 8), EmbeddedCurvePoint {\n x: 0x1657737676968887fceb6dd516382ea13b3a2c557f509811cd86d5d1199bc443,\n y: 0x1f39f0cb569040105fa1e2f156521e8b8e08261e635a2b210bdc94e8d6d65f77,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9], 9), 0x0c96db0790602dcb166cc4699e2d306c479a76926b81c2cb2aaa92d249ec7be7\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9], 9), EmbeddedCurvePoint {\n x: 0x0a3ceae42d14914a432aa60ec7fded4af7dad7dd4acdbf2908452675ec67e06d,\n y: 0xfc19761eaaf621ad4aec9a8b2e84a4eceffdba78f60f8b9391b0bd9345a2f2,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 10), 0x2cd37505871bc460a62ea1e63c7fe51149df5d0801302cf1cbc48beb8dff7e94\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 10), EmbeddedCurvePoint {\n x: 0x2fb3f8b3d41ddde007c8c3c62550f9a9380ee546fcc639ffbb3fd30c8d8de30c,\n y: 0x300783be23c446b11a4c0fabf6c91af148937cea15fcf5fb054abf7f752ee245,\n is_infinite: false\n }\n );\n}\n\n"},"325":{"path":"/usr/src/noir-projects/noir-protocol-circuits/crates/types/src/address/aztec_address.nr","source":"use crate::{\n crate::address::{partial_address::PartialAddress, public_keys_hash::PublicKeysHash},\n constants::{AZTEC_ADDRESS_LENGTH, GENERATOR_INDEX__CONTRACT_ADDRESS_V1},\n hash::poseidon2_hash_with_separator, traits::{Empty, FromField, ToField, Serialize, Deserialize},\n utils\n};\n\n// Aztec address\nstruct AztecAddress {\n inner : Field\n}\n\nimpl Eq for AztecAddress {\n fn eq(self, other: Self) -> bool {\n self.to_field() == other.to_field()\n }\n}\n\nimpl Empty for AztecAddress {\n fn empty() -> Self {\n Self { inner: 0 }\n }\n}\n\nimpl ToField for AztecAddress {\n fn to_field(self) -> Field {\n self.inner\n }\n}\n\nimpl FromField for AztecAddress {\n fn from_field(value: Field) -> AztecAddress {\n AztecAddress { inner: value }\n }\n}\n\nimpl Serialize<AZTEC_ADDRESS_LENGTH> for AztecAddress {\n fn serialize(self: Self) -> [Field; AZTEC_ADDRESS_LENGTH] {\n [self.to_field()]\n }\n}\n\nimpl Deserialize<AZTEC_ADDRESS_LENGTH> for AztecAddress {\n fn deserialize(fields: [Field; AZTEC_ADDRESS_LENGTH]) -> Self {\n FromField::from_field(fields[0])\n }\n}\n\nimpl AztecAddress {\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n\n pub fn compute(pub_keys_hash: PublicKeysHash, partial_address: PartialAddress) -> AztecAddress {\n AztecAddress::from_field(\n poseidon2_hash_with_separator(\n [pub_keys_hash.to_field(), partial_address.to_field()],\n GENERATOR_INDEX__CONTRACT_ADDRESS_V1\n )\n )\n }\n\n pub fn is_zero(self) -> bool {\n self.inner == 0\n }\n\n pub fn assert_is_zero(self) {\n assert(self.to_field() == 0);\n }\n\n pub fn conditional_assign(predicate: bool, lhs: Self, rhs: Self) -> Self {\n let result = utils::conditional_assign(predicate, rhs.to_field(), lhs.to_field());\n Self { inner: result }\n }\n}\n\n#[test]\nfn compute_address_from_partial_and_pub_keys_hash() {\n let pub_keys_hash = PublicKeysHash::from_field(1);\n let partial_address = PartialAddress::from_field(2);\n\n let address = AztecAddress::compute(pub_keys_hash, partial_address);\n let expected_computed_address_from_partial_and_pubkey = 0x23ce9be3fa3c846b0f9245cc796902e731d04f086e8a42473bb29e405fc98075;\n assert(address.to_field() == expected_computed_address_from_partial_and_pubkey);\n}\n\n#[test]\nfn from_field_to_field() {\n let address = AztecAddress { inner: 37 };\n assert_eq(FromField::from_field(address.to_field()), address);\n}\n\n#[test]\nfn serde() {\n let address = AztecAddress { inner: 37 };\n assert_eq(Deserialize::deserialize(address.serialize()), address);\n}\n"},"34":{"path":"std/hash/poseidon2.nr","source":"use crate::hash::Hasher;\nuse crate::default::Default;\n\ncomptime global RATE: u32 = 3;\n\nstruct 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 if message_size == N {\n Poseidon2::hash_internal(input, N, false)\n } else {\n Poseidon2::hash_internal(input, message_size, true)\n }\n }\n\n fn new(iv: Field) -> Poseidon2 {\n let mut result = 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>(input: [Field; N], in_len: u32, is_variable_length: bool) -> 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\nstruct 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"},"401":{"path":"/usr/src/noir-projects/noir-contracts/contracts/key_registry_contract/src/main.nr","source":"contract KeyRegistry {\n use dep::authwit::auth::assert_current_call_valid_authwit_public;\n\n use dep::aztec::{\n keys::{PublicKeys, stored_keys::StoredKeys, public_keys::NpkM},\n state_vars::{PublicMutable, Map}, protocol_types::address::{AztecAddress, PartialAddress}\n };\n\n #[aztec(storage)]\n struct Storage {\n current_keys: Map<AztecAddress, PublicMutable<StoredKeys>>,\n }\n\n impl<Context> Storage<Context> {\n // The init function is typically automatically generated by the macros - here we implement it manually in order\n // to have control over which storage slot is assigned to the current_keys state variable.\n fn init(context: Context) -> Self {\n Storage {\n // Ideally we'd do KEY_REGISTRY_STORAGE_SLOT instead of hardcoding the 1 here, but that is currently\n // causing compilation errors.\n // TODO(#7829): fix this\n current_keys: Map::new(\n context,\n 1,\n |context, slot| { PublicMutable::new(context, slot) }\n )\n }\n }\n }\n\n unconstrained fn get_current_keys(account: AztecAddress) -> pub PublicKeys {\n // If #7524 were to be implemented, this function could be called by an oracle from an unconstrained function\n // in order to produce the preimage of the stored hash, and hence prove the correctness of the keys.\n storage.current_keys.at(account).read().public_keys\n }\n\n #[aztec(public)]\n fn register_initial_keys(account: AztecAddress, partial_address: PartialAddress, keys: PublicKeys) {\n let computed_address = AztecAddress::compute(keys.hash(), partial_address);\n assert(computed_address.eq(account), \"Computed address does not match supplied address\");\n\n storage.current_keys.at(account).write(StoredKeys::new(keys));\n }\n\n #[aztec(public)]\n fn rotate_npk_m(account: AztecAddress, new_npk_m: NpkM, nonce: Field) {\n if (!account.eq(context.msg_sender())) {\n assert_current_call_valid_authwit_public(&mut context, account);\n } else {\n assert(nonce == 0, \"invalid nonce\");\n }\n\n let account_key_storage = storage.current_keys.at(account);\n\n // We read all other current keys so that we can compute the new hash - we can't update just the npk. This means\n // updating all keys at once costs the same as updating just one (unless setting public storage to its current\n // value is cheaper than changing it, e.g. EIP-2200).\n let mut current_keys = account_key_storage.read().public_keys;\n current_keys.npk_m = new_npk_m;\n\n account_key_storage.write(StoredKeys::new(current_keys));\n }\n}\n"},"73":{"path":"/usr/src/noir-projects/aztec-nr/authwit/src/auth.nr","source":"use dep::aztec::protocol_types::{\n abis::function_selector::FunctionSelector, address::AztecAddress,\n constants::{\n GENERATOR_INDEX__AUTHWIT_INNER, GENERATOR_INDEX__AUTHWIT_OUTER, GENERATOR_INDEX__AUTHWIT_NULLIFIER,\n CANONICAL_AUTH_REGISTRY_ADDRESS\n},\n hash::poseidon2_hash_with_separator\n};\nuse dep::aztec::{prelude::Deserialize, context::{PrivateContext, PublicContext, gas::GasOpts}, hash::hash_args_array};\n\n/**\n * Authenticaion witness helper library\n *\n * Authentication Witness is a scheme for authenticating actions on Aztec, so users can allow third-parties\n * (e.g. protocols or other users) to execute an action on their behalf.\n *\n * This library provides helper functions to manage such witnesses.\n * The authentication witness, is some \"witness\" (data) that authenticates a `message_hash`.\n * The simplest example of an authentication witness, is a signature. The signature is the \"evidence\",\n * that the signer has seen the message, agrees with it, and has allowed it.\n * It does not need to be a signature. It could be any kind of \"proof\" that the message is allowed.\n * Another proof could be knowing some kind of secret, or having some kind of \"token\" that allows the message.\n *\n * The `message_hash` is a hash of the following structure:\n * hash(consumer, chain_id, version, inner_hash)\n * - consumer: the address of the contract that is \"consuming\" the message,\n * - chain_id: the chain id of the chain that the message is being consumed on,\n * - version: the version of the chain that the message is being consumed on,\n * - inner_hash: the hash of the \"inner\" message that is being consumed, this is the \"actual\" message or action.\n *\n * While the `inner_hash` could be anything, such as showing you signed a specific message, it will often be\n * a hash of the \"action\" to approve, along with who made the call. As part of this library, we provide a few\n * helper functions to deal with such messages.\n *\n * For example, we provide helper function that is used for checking that the message is an encoding of the current call.\n * This can be used to let some contract \"allow\" another contract to act on its behalf, as long as it can\n * show that it is acting on behalf of the contract.\n *\n * If we take a case of allowing a contract to transfer tokens on behalf of an account, the `inner_hash` can be\n * derived as:\n * inner_hash = hash(caller, \"transfer\", hash(to, amount))\n *\n * Where the `caller` would be the address of the contract that is trying to transfer the tokens, and `to` and `amount`\n * the arguments for the transfer.\n *\n * Note that we have both a `caller` and a `consumer`, the `consumer` will be the contract that is consuming the message,\n * in the case of the transfer, it would be the `Token` contract itself, while the caller, will be the actor that is\n * allowed to transfer the tokens.\n *\n *\n * The authentication mechanism works differently in public and private contexts. In private, we recall that everything\n * is executed on the user's device, so we can use `oracles` to \"ask\" the user (not contract) for information. In public\n * we cannot do this, since it is executed by the sequencer (someone else). Therefore we can instead use a \"registry\"\n * to store the messages that we have approved.\n *\n * A simple example would be a \"token\" that is being \"pulled\" from one account into another. We will first outline\n * how this would look in private, and then in public later.\n *\n * Say that a user `Alice` wants to deposit some tokens into a DeFi protocol (say a DEX).\n * `Alice` would make a `deposit` transaction, that she is executing using her account contract.\n * The account would call the `DeFi` contract to execute `deposit`, which would try to pull funds from the `Token`\n * contract. Since the `DeFi` contract is trying to pull funds from an account that is not its own, it needs to\n * convince the `Token` contract that it is allowed to do so.\n *\n * This is where the authentication witness comes in The `Token` contract computes a `message_hash` from the\n * `transfer` call, and then asks `Alice Account` contract to verify that the `DeFi` contract is allowed to\n * execute that call.\n *\n * `Alice Account` contract can then ask `Alice` if she wants to allow the `DeFi` contract to pull funds from her\n * account. If she does, she will sign the `message_hash` and return the signature to the `Alice Account` which\n * will validate it and return success to the `Token` contract which will then allow the `DeFi` contract to pull\n * funds from `Alice`.\n *\n * To ensure that the same \"approval\" cannot be used multiple times, we also compute a `nullifier` for the\n * authentication witness, and emit it from the `Token` contract (consumer).\n *\n * Note that we can do this flow as we are in private were we can do oracle calls out from contracts.\n *\n *\n * Person Contract Contract Contract\n * Alice Alice Account Token DeFi\n * | | | |\n * | Defi.deposit(Token, 1000) | |\n * |----------------->| | |\n * | | deposit(Token, 1000) |\n * | |---------------------------------------->|\n * | | | |\n * | | | transfer(Alice, Defi, 1000)\n * | | |<---------------------|\n * | | | |\n * | | Check if Defi may call transfer(Alice, Defi, 1000)\n * | |<-----------------| |\n * | | | |\n * | Please give me AuthWit for DeFi | |\n * | calling transfer(Alice, Defi, 1000) | |\n * |<-----------------| | |\n * | | | |\n * | | | |\n * | AuthWit for transfer(Alice, Defi, 1000) |\n * |----------------->| | |\n * | | AuthWit validity | |\n * | |----------------->| |\n * | | | |\n * | | throw if invalid AuthWit |\n * | | | |\n * | | emit AuthWit nullifier |\n * | | | |\n * | | transfer(Alice, Defi, 1000) |\n * | | | |\n * | | | |\n * | | | success |\n * | | |--------------------->|\n * | | | |\n * | | | |\n * | | | deposit(Token, 1000)\n * | | | |\n * | | | |\n *\n *\n * If we instead were in public, we cannot do the same flow. Instead we would use an authentication registry to store\n * the messages that we have approved.\n *\n * To approve a message, `Alice Account` can make a `set_authorized` call to the registry, to set a `message_hash`\n * as authorized. This is essentially a mapping from `message_hash` to `true` for `Alice Contract`. Every account\n * has its own map in the registry, so `Alice` cannot approve a message for `Bob`.\n *\n * The `Token` contract can then try to \"spend\" the approval by calling `consume` on the registry. If the message\n * was approved, the value is updated to `false`, and we return the success flag. For more information on the\n * registry, see `main.nr` in `auth_registry_contract`.\n *\n * Person Contract Contract Contract Contract\n * Alice Alice Account Registry Token DeFi\n * | | | | |\n * | Registry.set_authorized(..., true) | | |\n * |----------------->| | | |\n * | | set_authorized(..., true) | |\n * | |------------------->| | |\n * | | | | |\n * | | set authorized to true | |\n * | | | | |\n * | | | | |\n * | Defi.deposit(Token, 1000) | | |\n * |----------------->| | | |\n * | | deposit(Token, 1000) | |\n * | |-------------------------------------------------------------->|\n * | | | | |\n * | | | transfer(Alice, Defi, 1000) |\n * | | | |<---------------------|\n * | | | | |\n * | | | Check if Defi may call transfer(Alice, Defi, 1000)\n * | | |<------------------| |\n * | | | | |\n * | | throw if invalid AuthWit | |\n * | | | | |\n * | | | | |\n * | | set authorized to false | |\n * | | | | |\n * | | | | |\n * | | | AuthWit validity | |\n * | | |------------------>| |\n * | | | | |\n * | | | | transfer(Alice, Defi, 1000)\n * | | | |<-------------------->|\n * | | | | |\n * | | | | success |\n * | | | |--------------------->|\n * | | | | |\n * | | | | deposit(Token, 1000)\n * | | | | |\n *\n *\n * --- FAQ ---\n * Q: Why are we using a success flag of `keccak256(\"IS_VALID()\")` instead of just returning a boolean?\n * A: We want to make sure that we don't accidentally return `true` if there is a collision in the function selector.\n * By returning a hash of `IS_VALID()`, it becomes very unlikely that there is both a collision and we return\n * a success flag.\n *\n * Q: Why are we using static calls?\n * A: We are using static calls to ensure that the account contract cannot re-enter. If it was a normal call, it\n * could make a new call and do a re-entry attack. Using a static ensures that it cannot update any state.\n *\n * Q: Would it not be cheaper to use a nullifier instead of updating state in public?\n * A: At a quick glance, a public state update + nullifier is 96 bytes, but two state updates are 128, so it would be\n * cheaper to use a nullifier, if this is the way it would always be done. However, if both the approval and the\n * consumption is done in the same transaction, then we will be able to squash the updates (only final tx state diff is posted to DA), and now it is cheaper.\n *\n * Q: Why is the chain id and the version part of the message hash?\n * A: The chain id and the version is part of the message hash to ensure that the message is only valid on a specific\n * chain to avoid a case where the same message could be used across multiple chains.\n */\n\nglobal IS_VALID_SELECTOR = 0xabf64ad4; // 4 first bytes of keccak256(\"IS_VALID()\")\n\n/**\n * Assert that `on_behalf_of` have authorized the current call with a valid authentication witness\n *\n * Computing the `inner_hash` using the `msg_sender`, `selector` and `args_hash` and then making a call out to the\n * `on_behalf_of` contract to verify that the `inner_hash` is valid.\n *\n * @param on_behalf_of The address that have authorized the current call\n */\n// docs:start:assert_current_call_valid_authwit\npub fn assert_current_call_valid_authwit(context: &mut PrivateContext, on_behalf_of: AztecAddress) {\n let inner_hash = compute_inner_authwit_hash([context.msg_sender().to_field(), context.selector().to_field(), context.args_hash]);\n assert_inner_hash_valid_authwit(context, on_behalf_of, inner_hash);\n}\n// docs:end:assert_current_call_valid_authwit\n\n/**\n * Assert that a specific `inner_hash` is valid for the `on_behalf_of` address\n *\n * Used as an internal function for `assert_current_call_valid_authwit` and can be used as a standalone function when\n * the `inner_hash` is from a different source, e.g., say a block of text etc.\n *\n * @param on_behalf_of The address that have authorized the current call\n * @param inner_hash The hash of the message to authorize\n */\npub fn assert_inner_hash_valid_authwit(\n context: &mut PrivateContext,\n on_behalf_of: AztecAddress,\n inner_hash: Field\n) {\n // We perform a static call here and not a standard one to ensure that the account contract cannot re-enter.\n let result: Field = context.static_call_private_function(\n on_behalf_of,\n comptime {\n FunctionSelector::from_signature(\"verify_private_authwit(Field)\")\n },\n [inner_hash]\n ).unpack_into();\n assert(result == IS_VALID_SELECTOR, \"Message not authorized by account\");\n // Compute the nullifier, similar computation to the outer hash, but without the chain_id and version.\n // Those should already be handled in the verification, so we just need something to nullify, that allow same inner_hash for multiple actors.\n let nullifier = compute_authwit_nullifier(on_behalf_of, inner_hash);\n context.push_nullifier(nullifier);\n}\n\n/**\n * Assert that `on_behalf_of` have authorized the current call in the authentication registry\n *\n * Computing the `inner_hash` using the `msg_sender`, `selector` and `args_hash` and then making a call out to the\n * `on_behalf_of` contract to verify that the `inner_hash` is valid.\n *\n * Note that the authentication registry will take the `msg_sender` into account as the consumer, so this will only\n * work if the `msg_sender` is the same as the `consumer` when the `message_hash` was inserted into the registry.\n *\n * @param on_behalf_of The address that have authorized the current call\n */\n// docs:start:assert_current_call_valid_authwit_public\npub fn assert_current_call_valid_authwit_public(context: &mut PublicContext, on_behalf_of: AztecAddress) {\n let inner_hash = compute_inner_authwit_hash(\n [(*context).msg_sender().to_field(), (*context).selector().to_field(), (*context).get_args_hash()]\n );\n assert_inner_hash_valid_authwit_public(context, on_behalf_of, inner_hash);\n}\n// docs:end:assert_current_call_valid_authwit_public\n\n/**\n * Assert that `on_behalf_of` have authorized a speicifc `inner_hash` in the authentication registry\n *\n * Computing the `inner_hash` using the `msg_sender`, `selector` and `args_hash` and then making a call out to the\n * `on_behalf_of` contract to verify that the `inner_hash` is valid.\n *\n * Note that the authentication registry will take the `msg_sender` into account as the consumer, so this will only\n * work if the `msg_sender` is the same as the `consumer` when the `message_hash` was inserted into the registry.\n *\n * @param on_behalf_of The address that have authorized the `inner_hash`\n */\npub fn assert_inner_hash_valid_authwit_public(\n context: &mut PublicContext,\n on_behalf_of: AztecAddress,\n inner_hash: Field\n) {\n let result: Field = context.call_public_function(\n CANONICAL_AUTH_REGISTRY_ADDRESS,\n comptime {\n FunctionSelector::from_signature(\"consume((Field),Field)\")\n },\n [on_behalf_of.to_field(), inner_hash].as_slice(),\n GasOpts::default()\n ).deserialize_into();\n assert(result == IS_VALID_SELECTOR, \"Message not authorized by account\");\n}\n\n/**\n * Compute the `message_hash` from a function call to be used by an authentication witness\n *\n * Useful for when you need a non-account contract to approve during execution. For example if you need a contract\n * to make a call to nested contract, e.g., contract A wants to exit token T to L1 using bridge B, so it needs to allow\n * B to transfer T on its behalf.\n *\n * @param caller The address of the contract that is calling the function, in the example above, this would be B\n * @param consumer The address of the contract that is consuming the message, in the example above, this would be T\n * @param chain_id The chain id of the chain that the message is being consumed on\n * @param version The version of the chain that the message is being consumed on\n * @param selector The function selector of the function that is being called\n * @param args The arguments of the function that is being called\n */\n// docs:start:compute_authwit_message_hash_from_call\npub fn compute_authwit_message_hash_from_call<let N: u32>(\n caller: AztecAddress,\n consumer: AztecAddress,\n chain_id: Field,\n version: Field,\n selector: FunctionSelector,\n args: [Field; N]\n) -> Field {\n let args_hash = hash_args_array(args);\n let inner_hash = compute_inner_authwit_hash([caller.to_field(), selector.to_field(), args_hash]);\n compute_authwit_message_hash(consumer, chain_id, version, inner_hash)\n}\n// docs:end:compute_authwit_message_hash_from_call\n\n/**\n * Computes the `inner_hash` of the authentication witness\n *\n * This is used internally, but also useful in cases where you want to compute the `inner_hash` for a specific message\n * that is not necessarily a call, but just some \"bytes\" or text.\n *\n * @param args The arguments to hash\n */\npub fn compute_inner_authwit_hash<let N: u32>(args: [Field; N]) -> Field {\n poseidon2_hash_with_separator(args, GENERATOR_INDEX__AUTHWIT_INNER)\n}\n\n/**\n * Computs the `authwit_nullifier` for a specific `on_behalf_of` and `inner_hash`\n *\n * Using the `on_behalf_of` and the `inner_hash` to ensure that the nullifier is siloed for a specific `on_behalf_of`.\n *\n * @param on_behalf_of The address that have authorized the `inner_hash`\n * @param inner_hash The hash of the message to authorize\n */\npub fn compute_authwit_nullifier(on_behalf_of: AztecAddress, inner_hash: Field) -> Field {\n poseidon2_hash_with_separator(\n [on_behalf_of.to_field(), inner_hash],\n GENERATOR_INDEX__AUTHWIT_NULLIFIER\n )\n}\n\n/**\n * Computes the `message_hash` for the authentication witness\n *\n * @param consumer The address of the contract that is consuming the message\n * @param chain_id The chain id of the chain that the message is being consumed on\n * @param version The version of the chain that the message is being consumed on\n * @param inner_hash The hash of the \"inner\" message that is being consumed\n */\npub fn compute_authwit_message_hash(\n consumer: AztecAddress,\n chain_id: Field,\n version: Field,\n inner_hash: Field\n) -> Field {\n poseidon2_hash_with_separator(\n [\n consumer.to_field(),\n chain_id,\n version,\n inner_hash\n ],\n GENERATOR_INDEX__AUTHWIT_OUTER\n )\n}\n\n/**\n * Helper function to set the authorization status of a message hash\n *\n * Wraps a public call to the authentication registry to set the authorization status of a `message_hash`\n *\n * @param message_hash The hash of the message to authorize\n * @param authorize True if the message should be authorized, false if it should be revoked\n */\npub fn set_authorized(context: &mut PublicContext, message_hash: Field, authorize: bool) {\n context.call_public_function(\n CANONICAL_AUTH_REGISTRY_ADDRESS,\n comptime {\n FunctionSelector::from_signature(\"set_authorized(Field,bool)\")\n },\n [message_hash, authorize as Field].as_slice(),\n GasOpts::default()\n ).assert_empty();\n}\n\n/**\n * Helper function to reject all authwits\n *\n * Wraps a public call to the authentication registry to set the `reject_all` flag\n *\n * @param reject True if all authwits should be rejected, false otherwise\n */\npub fn set_reject_all(context: &mut PublicContext, reject: bool) {\n context.call_public_function(\n CANONICAL_AUTH_REGISTRY_ADDRESS,\n comptime {\n FunctionSelector::from_signature(\"set_reject_all(bool)\")\n },\n [context.this_address().to_field(), reject as Field].as_slice(),\n GasOpts::default()\n ).assert_empty();\n}\n"},"84":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/keys/stored_keys.nr","source":"use crate::keys::public_keys::{PublicKeys, PUBLIC_KEYS_LENGTH};\nuse dep::protocol_types::traits::{Serialize, Deserialize};\n\n// This struct represents how public keys are stored in the key registry. We store not just the keys themselves but also\n// their hash, so that when reading in private we can perform a historical read for the hash and then show that it\n// corresponds to a preimage obtained from an unconstrained hint. We do store the keys keys regardless as they might be\n// needed during public execution, and since we need to broadcast and produce hints in some standardized way.\n// While it might seem odd to create a struct for what is effectively some data and a pure function called on it, state\n// variables rely on serializable structs in order to persist data to storage, so we must use this abstraction.\nstruct StoredKeys {\n public_keys: PublicKeys,\n hash: Field,\n}\n\nimpl StoredKeys {\n // Instances of StoredKeys are expected to only be created by calling this function so that we guarantee that the\n // hash field does indeed correspond to the hash of the keys. Ideally we'd forbid direct access to the struct, but \n // Noir doesn't yet support private members.\n fn new(public_keys: PublicKeys) -> Self {\n Self { public_keys, hash: public_keys.hash().inner }\n }\n}\n\n// Our serialization is the concatenation of the public keys serialization plush the hash, so we need one extra field.\nglobal STORED_KEYS_LENGTH: u32 = PUBLIC_KEYS_LENGTH + 1;\n\nimpl Serialize<STORED_KEYS_LENGTH> for StoredKeys {\n fn serialize(self) -> [Field; STORED_KEYS_LENGTH] {\n // The code below is equivalent to:\n // [ ...self.public_keys.serialize(), self.hash ]\n\n let mut array = [0; STORED_KEYS_LENGTH];\n\n let serialized_keys = self.public_keys.serialize();\n for i in 0..serialized_keys.len() {\n array[i] = serialized_keys[i];\n }\n\n array[PUBLIC_KEYS_LENGTH] = self.hash;\n\n array\n }\n}\n\nimpl Deserialize<STORED_KEYS_LENGTH> for StoredKeys {\n fn deserialize(array: [Field; STORED_KEYS_LENGTH]) -> Self {\n // The code below is equivalent to:\n // Self { public_keys: PublicKeys::deserialize(array[0 : PUBLIC_KEYS_LENGTH]), hash: array[PUBLIC_KEYS_LENGTH] }\n\n let mut serialized_keys = [0; PUBLIC_KEYS_LENGTH];\n for i in 0..serialized_keys.len() {\n serialized_keys[i] = array[i];\n }\n\n let hash = array[PUBLIC_KEYS_LENGTH];\n\n Self { public_keys: PublicKeys::deserialize(serialized_keys), hash }\n }\n}\n"},"85":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/keys/public_keys.nr","source":"use dep::protocol_types::{\n address::PublicKeysHash, constants::GENERATOR_INDEX__PUBLIC_KEYS_HASH,\n hash::poseidon2_hash_with_separator, point::{Point, POINT_LENGTH},\n traits::{Deserialize, Serialize, Empty, is_empty, Hash}\n};\n\nglobal PUBLIC_KEYS_LENGTH: u32 = 12;\n\nstruct PublicKeys {\n npk_m: NpkM,\n ivpk_m: IvpkM,\n ovpk_m: OvpkM,\n tpk_m: TpkM,\n}\n\ntrait ToPoint {\n fn to_point(self) -> Point;\n}\n\nstruct NpkM {\n inner: Point\n}\n\nimpl ToPoint for NpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\nimpl Serialize<POINT_LENGTH> for NpkM {\n fn serialize(self) -> [Field; POINT_LENGTH] {\n self.inner.serialize()\n }\n}\n\n// Note: If we store npk_m_hash directly we can remove this trait implementation. See #8091\nimpl Hash for NpkM {\n fn hash(self) -> Field {\n self.inner.hash()\n }\n}\n\nstruct IvpkM {\n inner: Point\n}\n\nimpl ToPoint for IvpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\nimpl Serialize<POINT_LENGTH> for IvpkM {\n fn serialize(self) -> [Field; POINT_LENGTH] {\n self.inner.serialize()\n }\n}\n\nstruct OvpkM {\n inner: Point\n}\n\nimpl Hash for OvpkM {\n fn hash(self) -> Field {\n self.inner.hash()\n }\n}\n\nimpl ToPoint for OvpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\nimpl Serialize<POINT_LENGTH> for OvpkM {\n fn serialize(self) -> [Field; POINT_LENGTH] {\n self.inner.serialize()\n }\n}\n\nstruct TpkM {\n inner: Point\n}\n\nimpl ToPoint for TpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\nimpl Empty for PublicKeys {\n fn empty() -> Self {\n PublicKeys {\n npk_m: NpkM { inner: Point::empty() },\n ivpk_m: IvpkM { inner: Point::empty() },\n ovpk_m: OvpkM { inner: Point::empty() },\n tpk_m: TpkM { inner: Point::empty() }\n }\n }\n}\n\nimpl Eq for PublicKeys {\n fn eq(self, other: PublicKeys) -> bool {\n (self.npk_m.inner == other.npk_m.inner)\n & (self.ivpk_m.inner == other.ivpk_m.inner)\n & (self.ovpk_m.inner == other.ovpk_m.inner)\n & (self.tpk_m.inner == other.tpk_m.inner)\n }\n}\n\nimpl PublicKeys {\n pub fn hash(self) -> PublicKeysHash {\n PublicKeysHash::from_field(\n if is_empty(self) {\n 0\n } else {\n poseidon2_hash_with_separator(self.serialize(), GENERATOR_INDEX__PUBLIC_KEYS_HASH as Field)\n }\n )\n }\n}\n\nimpl Serialize<PUBLIC_KEYS_LENGTH> for PublicKeys {\n fn serialize(self) -> [Field; PUBLIC_KEYS_LENGTH] {\n [\n self.npk_m.inner.x,\n self.npk_m.inner.y,\n self.npk_m.inner.is_infinite as Field,\n self.ivpk_m.inner.x,\n self.ivpk_m.inner.y,\n self.ivpk_m.inner.is_infinite as Field,\n self.ovpk_m.inner.x,\n self.ovpk_m.inner.y,\n self.ovpk_m.inner.is_infinite as Field,\n self.tpk_m.inner.x,\n self.tpk_m.inner.y,\n self.tpk_m.inner.is_infinite as Field\n ]\n }\n}\n\nimpl Deserialize<PUBLIC_KEYS_LENGTH> for PublicKeys {\n fn deserialize(serialized: [Field; PUBLIC_KEYS_LENGTH]) -> PublicKeys {\n PublicKeys {\n npk_m: NpkM { inner: Point { x: serialized[0], y: serialized[1], is_infinite: serialized[2] as bool } },\n ivpk_m: IvpkM { inner: Point { x: serialized[3], y: serialized[4], is_infinite: serialized[5] as bool } },\n ovpk_m: OvpkM { inner: Point { x: serialized[6], y: serialized[7], is_infinite: serialized[8] as bool } },\n tpk_m: TpkM { inner: Point { x: serialized[9], y: serialized[10], is_infinite: serialized[11] as bool } }\n }\n }\n}\n\n#[test]\nfn compute_public_keys_hash() {\n let keys = PublicKeys {\n npk_m: NpkM { inner: Point { x: 1, y: 2, is_infinite: false } },\n ivpk_m: IvpkM { inner: Point { x: 3, y: 4, is_infinite: false } },\n ovpk_m: OvpkM { inner: Point { x: 5, y: 6, is_infinite: false } },\n tpk_m: TpkM { inner: Point { x: 7, y: 8, is_infinite: false } }\n };\n\n let actual = keys.hash();\n let expected_public_keys_hash = 0x0fecd9a32db731fec1fded1b9ff957a1625c069245a3613a2538bd527068b0ad;\n\n assert(actual.to_field() == expected_public_keys_hash);\n}\n\n#[test]\nfn compute_empty_hash() {\n let keys = PublicKeys::empty();\n\n let actual = keys.hash();\n let test_data_empty_hash = 0x0000000000000000000000000000000000000000000000000000000000000000;\n\n assert(actual.to_field() == test_data_empty_hash);\n}\n\n#[test]\nfn test_public_keys_serialization() {\n let keys = PublicKeys {\n npk_m: NpkM { inner: Point { x: 1, y: 2, is_infinite: false } },\n ivpk_m: IvpkM { inner: Point { x: 3, y: 4, is_infinite: false } },\n ovpk_m: OvpkM { inner: Point { x: 5, y: 6, is_infinite: false } },\n tpk_m: TpkM { inner: Point { x: 7, y: 8, is_infinite: false } }\n };\n\n let serialized = keys.serialize();\n let deserialized = PublicKeys::deserialize(serialized);\n\n assert_eq(keys.npk_m.inner.x, deserialized.npk_m.inner.x);\n assert_eq(keys.npk_m.inner.y, deserialized.npk_m.inner.y);\n assert_eq(keys.ivpk_m.inner.x, deserialized.ivpk_m.inner.x);\n assert_eq(keys.ivpk_m.inner.y, deserialized.ivpk_m.inner.y);\n assert_eq(keys.ovpk_m.inner.x, deserialized.ovpk_m.inner.x);\n assert_eq(keys.ovpk_m.inner.y, deserialized.ovpk_m.inner.y);\n assert_eq(keys.tpk_m.inner.x, deserialized.tpk_m.inner.x);\n assert_eq(keys.tpk_m.inner.y, deserialized.tpk_m.inner.y);\n}\n"}}}
1
+ {"transpiled":true,"noir_version":"0.34.0+e0185e75e65df08b5334856f8bf63fa3aed7049a","name":"KeyRegistry","functions":[{"name":"register_initial_keys","is_unconstrained":true,"custom_attributes":["aztec(public)"],"abi":{"error_types":{},"parameters":[{"name":"inputs","type":{"fields":[{"name":"calldata_length","type":{"kind":"field"}},{"name":"is_static_call","type":{"kind":"boolean"}}],"kind":"struct","path":"aztec::context::inputs::public_context_inputs::PublicContextInputs"},"visibility":"private"},{"name":"account","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::aztec_address::AztecAddress"},"visibility":"private"},{"name":"partial_address","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::partial_address::PartialAddress"},"visibility":"private"},{"name":"keys","type":{"fields":[{"name":"npk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::NpkM"}},{"name":"ivpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::IvpkM"}},{"name":"ovpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::OvpkM"}},{"name":"tpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::TpkM"}}],"kind":"struct","path":"aztec::keys::public_keys::PublicKeys"},"visibility":"private"}],"return_type":null},"bytecode":"H4sIAAAAAAAC/31YT4g0RxV/VdXd27s7O7s709Mz0zs9PT3dPT2725/5IrHXfyBo/ph/xnxREAKKIgEPnjx60oCgJERUEEEIiKiIFz14EEEURUwOwYNHL4KSg+TwIYKC4O+96q7dfNn9Fqr2Vdf7V69e/erV3Caj9INkwueIbpM5GqOj6JTwF6GNicKPpBSED4cPP4tx+LBtpNEUTzwePi4Tj9t2OfFU+JRMPGXb5cQz4TMy8YxtlxN3wjsyccc2O3EBB8hcsFUP/SPko3+UAvSP0Q76j1J4waZ30T9Be+ifpP0LtjlA/zQdoP8YDS/Y2CH6j9MR+mfp+IKtjN4FI/mjbPY5XnQr6zaw3WoTXR15V0a3SZF376eADMvEpHajBQVR9GwfxahfzB4FO2bikYomMehQ6HjCMoMJZCYTkZl0rZfZMzH4JvEU9L7ITCf8JYonkDyMIRnHIhl3rZc8MBFbiFhyKPQ06nRBcnQfyaPeN9DHprNmLSNF1ASdN30Ii7Z/B9T/RZxBM0RIzRGThxIMByfozOIWqc9T3NCnYHWXTQ9SdIdLdKMMkVx1ocaGOGrtqMJRJduueFjRbWVUCbLUVUvVptXJBqONBmWuUK0uV52kf5OkuVaypyLWkbd6ssa+Fw19paVZ2dCLA2g4qW4R/Zmqhr7WqmK5R2rppfj0DUofU5xTs6yhl8CZLZb4/BNaNvRKq/I1L5pdytilTFziIKx1xktcglzp9EmDqIKD0lat1jINH9YrHunLkV7Bu3khMhy/fLZu1boAVw6uXGM2RwyKcaNewMSS3Vmylz+jtKHX4c4SLWXDJc+VvKhfUMUrgLpUc9yqrGxVGUMpMxrLuAHjr2jjGCVmwgiRIK5EZ8ysMbP+zrJeEC1DA+ghP/RwCj0+kD6JlU5F3OoUrcrhHz5kk+Wwd/qNPrRLDi3iWMHIAYvRRuLY6WlpU7d6p8ao1qBCR8WO2nPUvqNSRx04auiopaOOHHXsqKzmnK85M+otfL1L2y42ld6i35Z1q+oNUqVCqlQe8/zH8mBj8M1UC3xTI9o29D/EusJniKy3HPMz6N2enWPeo/MukJUNpHc1kMBwc6rP0Z9vz1q9OWP3JhtEsN6w9sPOoj5F7mzWjXoP8rRqVDRg+zU4PkB1o6bWfl4jxmzfZ71QzjHeyopPeXtZ+1afS67y7XHeqq0LSL1tVVXrflTxnBttb/DfSov/M/EfvPB0K2cQ3vLRnVRYTlkhq9T7bFbhKPOp5IDxOjj+6kOIo/q0rEHlW/GW5ySGj9gYWu/ZVnXWqrNTLNoFuzprwPg0NY6xQd8II0SC03PRecqsp8z6ScuKddXXJLhY6VScYj1o5zn84/SY1MPe6c9120M170lLRs6tYHQHg6mjlo7KHMW44gmO5g5XAAwt5WvA8mHR6sJhiblCAUfiS1g3DtYZPgve/ys6GWwKq/PtSt5JrdCKFFu3BHxmjXoZybZq1CvQqHNEbpWvb5H5FmFnv92qLMDBCLwV4vBdWnUYigB8D5zjRQDOL1DQqO+3CviAKoX9CtivQPxC1WJiHXAEeNljnUte8qLyVo1jmQawxGMe6cuRHsPFeSYyHN50BqiLM3ClmpENs+kYF2Lmj+HaL2lsXSOGa8NWUTCxA6wh0+OWxsC+QLFyUccK/FQmU1n50x58mtlCizeUcmgfGx/L970MNv5IGdvgosLHPen7cln7XbssKjJczX5miwqfL24MUFTcR8YWFX6cS1HBdB6zZObHXFRkkMwykcy6dllUWL5cigqmc5/txxAFat1H8kjsZGLzuLPZeX6L9L9QHKg3uTjgumDAFcJhwMWB//bMvn+ZIBcYD8srOVq2VFYoDuytAMpcoZCZXH5wpeJLlVGIZAIy0QWuzBJctlS4gYrQEoDTBODkrRt9jHRNGj1GuiYnEZb2WYoa5JhaJ9jZxOPVJhR3iZ02egHOdJHg83sJghnf2l1eSb4gN/q8yiV1vIVkUSKJzYmT4NRM8W2qp62eZjzSlyOdwbv5WmTkTM64fJiD67KEQAzmy0b/GyCZsDsJe/lB7Il+HrzQv+LKzwt4LvAx92HyO0iMNTILngatCiIoZUZjGT0wPkGeY0TCG08YIRJEvujkOyeNmPWOZQV2Jtdgp1jpVEQ4VGj+Cv7x2Zokw97pz/ShTTi0ra1JD65sLdfsUb+1O24bQ0eljtpz1L6jYkcdOGroqMBRR446dpTPNeiAC6eEKyz9VVdhRbbCSrhwQtm2RuWtIo95vm55sDH4ZqIFf/sByk39MmKNeOcQybkAMu7S09+x9wcCGV1zudqyVoqRCpdwUcttWvBtWrD2VzuLeoPcKfJG/wF5ihT+4YDtl+B4ncpG/9jaX5VdAebfU4CVesPbW9vSR3IVHMTlgAsIzqWKSt2PIp5zo+oG/620+D8T/8ELTys5g/CWj+4kwnKSqICzf6LCJkTEp5IDxuuQ+L/BcXxL1oBCR7zlOYnhX+4t3KKucMtcsKP6FIx/pVPHKHWXMEIk2GxF54ZZN8z6d8uKdZXXJLhY6VTgwcHPki0S/C1Oj0k57J2+220PlbwnKA7k3BItHAwymA3nPJxfAbM5nwNBifkUp51r8njKr8/ophcrrtqQcMxMd2k2BkmRLBikEwbpXQbpAYP0oSCZOeSjfDKH3Ltp3phRqxbJ5WkeXl0suzfX4s4Jrsgl2nxhtTDEHVhQPIGqNZ00Jn8AZnAz4IJc8IPywKLUDPNbmnXxn2vcpmaWAq6Sxfv5EwToRABiMez13aYTG78F24KLc4RsyjqlvIolZBZNUV8wzOxYyAAVOipx1J6j9h2166gDRw0dNXDUkaOOHXXIgDWwqDiCv5+gUbe+qR6hHwH98B5nh0fMNMIdY56nqMus+TXBtqsRC+kIEDaSkMQckph36wWa2xM/xRbEvJGtWjKEjwOUYeaLtGrMS6i3gNyp1JZrnlvjdJkv2dMlBaZct2N+eaLSipnRWEZghvkylY5RTrAwQiTIC1uvMmvOrC9aViwmuOaYdJe6qMjty7eAyy9x4TYJhr3T3+xrx4BrRy4YxB/e4rVssbyTcfkR3sl6bLWCCriI0AWXpQU786rzO7dGV8DnAr5nKGRU7jHPjywPgoZvJmeMNL8BRpqfIg6IxRIiS8Z+w1hQbvDAMj+nultkfg3G2QpFnkElcGDN2FpMcqyukGL517S2O1bh4OTLxvwNZydvzG8HbJ835k0qGvN7az8tbvj9o9AWoQRRa8FocFDNt1AfkIIvmEL3o5zn3Ki8wX8rLf7PxH/wwtNSXgHwltNAlmNr/390y6Gc3wUcMF6HxP+fiKO3L2tQadnjaS4xvGtjaL1nWznweYM7JXbBzvm9a/7rwLy7OIQRIkFVlz3u54z7nnZ3Z3HjLxRWBd87aFUK/zg95AoVp73DLiGo4D25UKEJg32gaUA63MH8JNxpvCk0mtBvvPqCf4L0Fb+4QhQ4DwqxewCB3dAL96akwr1wj38mxT/5mXTPth6nvSrcg3jIAvswtx+GPPRlqMMw3OfhLqzvNl7yoDLQyIYfuKDZa7PX/g8izvhMCRYAAA==","debug_symbols":"7Z3fjtzG0cXfZa990V1d/c+v8uFDICdOIECQA1sJEBh698yMPeTsctgFrhjxVBVvEsnmjs+vZrbOYZFT/P3lbz//9K9//OXj57//8tvLj//3+8unX/764cvHXz5f/vb71x9efvr146dPH//xl8d//BKu/5PS7fjf/vnh8/Wvv3358OuXlx/DDy8/f/7b5f8vP/v3j59+fvmRQ/76/z+8JN52eN52eNl2eN12eNt2eN90OIdth8dth9O2w7e9q7ztXeVt7ypve1f56bsaa+h//kSssb36oR8WRxOV++sTVZ6ObuXJwTGm+8GXP9bpYCrPXjr2lO9H90rCS9dSJtW9zy/NV9IcDJG2wPeDW6xvSaOp9zTPpO0tKVl6T4km0pTfkiaj72kqb0kZnLTdhVCg9k0dCb33biEdd6Rm6j0ddaRu6T0ddaSC7qfvfU8XHanA+ynPpP3xpa/isS2SAudJfOOv39BOSzZEOmynpZh6TwfttGBb5Mb3dNhOsS3y/e/psp2iW+RDO235TTut2K5HMcT7S8f0Tem0Yp9xbCMdttPKpt7TQTut4Ba57T0dtdMKbpHvfk8X7bTCT/B4Jn2bTtserpfyJD4VQTyVaVBB5fWg4iqnf285Nd8/xFR7eCOnh+8tp9Xp4B7aWznxe8vp7W5QKVB6K2ePM5tEkxyOUfjgh1jT/bXD5dM8f/RruClKcIoYTlGGU1TgFFU4RQ1OUUdTFEP47pIo9llSoleSnhxf8kRQ6gyQ+A/9Ubl+Uq4/KdfPyvVn5fqLcv1Vuf6mXH/XrT8q99+o3H+jcv+Nyv03KvffqNx/o3L/jcr9Nyr336jcf0m5/5Jy/yXl/kvK/ZeU+y8p919S7r+k3H/TAf3zcST7cLPGfSSbvv+vZEqzpMRVKunw+BtCRkeoPN1cUQstPhVFuf6qWz8HdP0t1/vhrZZH/cuD2ySkES9QkyXUa0eeX7ssYOFb2ybYy9Wz+8GR+wIWvgnuCQvfMfeEhW+ve8I2T7DdEWw25bISbPQES55gbSUoAZY9wXpKUNlTgsqeElRWnKBu+hWHoqv+Ap9zer8fTiEs9cNHF0E/fBoR9MMHDEE/K9cPHwME/abOoIfTzGLq/Lm36TtsISxYq6mTLIHV1DmWwArfLnecyFdbp1gCrK1TLAHW1imWAGtrSC3A2hpSj2GbrSG1AGtrSC3A2hpSB55mQCEv7jNqxi7zj2HZE6yxBDWGNZagxrDGEtQY1liCGsPaTVBL2O4pQXVPCaobS1BjWE83Sh6wA+dAWE8zqO5pBtU9zaC6pxlUdzSDouAoQVFwlKAoOAoVFNgTrKNQQcFRqKADVv6kOE8TUuyvYK+SDtjiI0qKeJIIT1LCk8R4kjKepIInqeJJaniS8Lo34XVvwuvehNe9Ca97E173JrzuTXjdm/C6N+F1b8Lr3gmveye87p3wunfC694Jr3snvO6d8Lp3wuveCa97J7zuzXjdm/G6N+N1b8br3ozXvQ/YAUS9zJLCa0lPjh9+dZkOWOuzUf9lXnY//HEZ4F1/Va6/Kdffdes/YEXOVv08HU5l8ft7wG6Ujfq53R8qePnjsv6sXD98/xf0w/f/Mj8ltaS40A/f/wX98P1f0A/f/8f6C3z/F/RH5fpJuX54/xX0w/uvoB/efwX9yv234PvvaD08FXz/HevH99+h/orvv2P9+P471o/vv2P98P0zTaujIsdX51/Lg0erl6jC/6pvQRXuAW3wfWFPWPgmsgl2PHFu8B1nT1j404M9YdkTLPyJx56wplxWgoU/pdkTFv78Z09YWwlqDNttJSgB1lOC6p4SVPeUoA7YCnEgrKcE1T0lqO4pQXX4BMXUJlheTPA7fCga6k8BPucI+uGji6AfPo0I+vHvoBrrZ+X6dd9BlQK8swv64c1a0I/lX1dJEcuSbpKwXOYmCcs4bpJMnZKMriamaOqEZPjAjxRNzf3GrGRq7Cew2pr6DS8SJ7I19RNgbU39BFj2BGtr6ifA2pr6CbC2pn4CrK3rpgKssTvPRo8OSMnYnWdjWGMJagxrLEGNYY0lqDEse4I1lqDGsHYT1BNYTwkqeUpQydG9+4kd3buf2NMMij3NoNjTDOqA1UoHwnqaQeFveNoT1lOCwt8dtSMs/qKmPWE9hYrsKVTg7+vaE/Z5gyptelRMTRJsvPT0+9E5Pvwn6Dnt5SUnRRTTK9qbpo6naWUJ0bGaIqAmAtSUADUxoKYMqKl8f00U+6zpYR/le7ZfpJXtO4oAmnaArhygBu0AUTsAaQdI2gFYO0DWDqDdiat2J67anbhqd+Km3Ymbdidu2p24aXfipt2Jm3YnbtqduGl34qbdiZt2J+7anbhrd+Ku3Ym7difu2p24a3fifkQbfZyYt/z1zcScQwDUdMCvWkoP1z25Sm/08PgbA8MzVJ6eA1DL2y0MHLJ2gKIdoMMDtDy9equv7hZYHjxaXsCRTLGOb6PgiN/gNtEO96lxxG+Fe9Li9809afGb7J601RVtc0Vry20FWgquaKMrWmNZSqB1laXIVZYiV1mKXGUp0pylbgCa49ENAD/x9OmrCxTCAiDhhxgBAD+XCAD4UUMAwE8PAgBrB1j56m6e9kTWll4B3H6qvOun6rt+6nmjb/zQXINQ4h7vB/cyFyxe/7x85Tz5Zp/fOsr92evmlqYXZun6VM/TvDmEh4P7H5zdB+fKNgt7nNEJJznhTE442QlndsJZnHBWJ5xO8hA7yUPZSR7KO+ShGJim/0TvEmmo8wgsJOG1S7mvdSgPZyGx/KmeVKtPqtWzavUrOaNNW0R6qJJ6qtPR1OdfrfZ0nQmVaZ0J1flen+frTGKaSdPDMKE81dHTdK7eKwkvXae6xPpQcvpj8rCyzMRBXVqY+mSLdVGX7vfzkue6tLd1WVnq4uHzQlPraikv6hLPz8ulLmVRF7JUl9anIS61b+q7xZQfbanLuO+uLK9x8XkZ9t3q9vMy7rum8st7Py9P+q6t/MJzXfrjS19Rq6FIQoHzhNpY/AiMLGZlgY2DuowtZmUvjovPy8hiqqFIsvHzMrSYaiiSvP/zsrSYaiqSPFjMw7cx7xZjKGVQDPcHT1NM33YW0wyd9W6ry9himqGz3q2fl5HFNEuRZNvnZWgxzVIkeffnZWkxzdbUnue6LM5i2ne3mDRdgqRUBFQq00iQyuuR4E18hxZf8/2Xj2oPb8X3AC2+TRfBqIe2EB+hxfdJRwqUFuK/u01ue8aAsGmbe1Kun5Xrz8r1F+X6q3L9Tbn+rlp/DgFb/56Lr3KInmDBnX1fWPAYsC8se4IFDxj7woKnkX1hwaPLvrDgOWdfWPBQtCts9JSgoqcEFT0lqOgpQUVPCSp6SlDRU4KKnhJU9JSgoqcERZ4SFHlKUOQpQZGnBEWeEhR5SlDkKUGRpwSV0K1n/DyOnMB7zs7P7sgJvO3s+ZSJnMDbzr6w4G1nV1gGj/cHPWskM3hePOy5JJltNfr9thVntmUJe1bGln/sWRlbZrNnZcBHigdWBnz+eFxlst80I1UG/PTywMqAj0EPrIzjDCxUhs/KrFTmzMBrlTkz8Fplzgy8VhkvGfgG6yXWXmGLraQ6fHxHLrbCpwBrK08KsLYiogDLnmBtBTkB1u+saXgVpPidNPU2Ld4IYVGY6ndoIBTG78xAKIwt89jxgmJ1PDIQKuN4ZCBUxvHIQKiM48tmQmUcXzYbV6Y5vmwmVMbxZTOhMo4vmwWehrYhL+7kbZ5vHRtXhs/KrFTGcwYeV8ZzBh5XxnMGHlfGcwYeV+bMwCuV6WcGXkl6/czAa5XxnIHHlTm/PrFWGT4rs1KZcw68VplzDrxWmXMOvFaZcw68VpkzAz+vTEHfN3xgZc4MvFaZM+mtVYbPyqxU5kx6a5U5k95aZdBdO85ztxT7q8pc9aNvohX1ozugpB99ViPpR/dZST+6G0r60T1L0o/uLJJ+9DN9ST/6+bikX7n/ou8xFfUr91/0baOifuX+i74TVNSv3H/RN3eK+pX7Lyn3X1Luv0m5/6LvZxX1K/ffpNx/4ffjSvqV+y/8CltJv3L/Tcr9Nyn3X/hFv5J+5f7Lyv0XfiGypF+5/6IvF6ZeZv3htf4nxw/3XhX0fcEbYSlOK9gfnxNxh0V/zMWusOgPCtsVFv1BYXvCou/e3QrLs5KyaFDoq1E3wnKL98O5Ld9ZcOvcF9aWzwqwtny2hKlBXeZ1C1hbPivA2vJZAdaWz45h0TeH7guL/lS0XWHRH8i5K6ytBCXAsidYWwlKgPWUoIqxBDV6IGdB3wm7L6yxBDWErcYS1BjWWIIawxpLUGNYW9aTpg3dkeOrScXy4NHS6oK+5/F/WBfhO1Toex4PrIytLrmpMuNLceh7Hg+sjK0z2D0rw2dlVipj69x4z8r4TTNSZWydde9ZGVun6HtWxnEGHlcGfc/jgZU5M/BaZc4MvFaZMwOvVYbPyqxU5szAa5U5M/BaZc4MvFYZWxmYqU2V4cUFSPTVjXvCVvRtjPvC2gqfAqytPCnAGrtVegzLnmAd3Spd0Tcz7gtrK24JsIpDxVU/+mZJUb9i67/pV+zmN/1+z8dH95FU9I2J/8O6DB9lXdFXAR5WGPQdg8cVxvGlheGNRxV9LeKBlXF8aUGoDJ+VWamM40sLQmUcX1oQKuP40oJQGce31wiV8XyL+egBsxV9zeeBlfGcgceV8ZyBx5XxnIHHleGzMiuV8ZyBx5U5M/BaZc4MvJL00NfWHliZ82uWK5VBX7V7YGXOOfBaZc458FplzjnwWmX4rMxKZc458Fplzgy8VpkzA69V5szAK5UxtvN4z8qcSW+tMmfSW6vMmfTWKrPSgXl+vPoVUKgM96kydT46XrebL44uqd1LU1J/ODrWZ699ub58f+3LBdXHqt/kd9Xy1zbuapEfdcsn3fKTbvmsW37WLb/oll91y9ftukW361bdfb/q7vtVd9+vuvt+1d33K3zfn78Q2EIVThJLun+1gUqlx5PEGyu8SWxhvUwn7qy1hwUrvKNsYW11Ovnvob1lbfAnfVtY+zRDSZdJw4IV3atamlkzvW03Db1btjIreXjtu3z0btnjpKTzsvroDVCQj97TxvI7epsS5KPPpgT56Ocognz0vi/IZ93yD+j7nCb5RZJf4hQGL39Mr46+6W+q9bdA6Pr7XUmhh4Q36U/o+hsN9TO4fgp90h/bUn9Wrr8o14/ePyX96P1T0t91649Buf6I3v9Lm/V34ejOk5LOD6OniRberddpb/rh3VrQj+7Wkn50t5b0o49ZhjO6FtHHLK1Oqy5bL2/lE/qYRZCPPmYR5KOPWQT58OP1sXzWLR/9UrAgH/7ixlg++sUNQT68647l63bdpNt1k27XTbpdN+l23aTbdZNu1026XTfpdt2k23WTbtdl3a7Lul2Xdbsu63Zd1u26rNt1Wbfrsm7XZd2uy7pdN+t23azbdbNu1826XTfrdt0M77qj+89bVn37fMvwrjuWD++6Y/nwrjuUD7/aQZAP77pj+fCuO5YP77pj+fCuO5av23XhVzsI8nW7LvxqB0G+btetul13ZbVDadMP1dQk+WmGzfFh4Rc93z2W0sN+MJ6/TLGye+ySimeAV+vElgePHoLZVvZAaGUdPqawrewtMArbPMF2U7DjdYFtZXeBVdroipZc0dqyWonWltlKtNkVbXFFaytJjR8s1ZqtKCXRWstSQ9puLUuNaa1lqTGttSw1prWWpca0bNdvn9C6ylLdVZbq1rLUmNZalhrTeppL9eBpLtWDp7lUD57mUj14mkv1wK5oPWWpHjxlqR48pYseXKWL6CpdRFfpIh7hQHGeL6T4+nFvN00ZUFMB1FQBNTVATR1PEwVATRFQEwFqSoCaAPs4AfZxAuzjBNjHCbCPE2AfTwf08Y2Py41hQojc3wbAFOEBKPL9cEq0ACDtAEk7AGsHyPgAPD99uyx/iRs8AM9P1eK2fAe6cgDG9wEBAN8HSph+iUuKCwB8HxAA8H1AAMD3AQEA3wcEgKIdoGoHwHdiAQDficcAGd+JBQDtTpwVOHGeLoqUmhYACpx4DKDAiccACpx4DKDAiccACpx4CFDw22jqEwDHV2dky4NHXybvBf/3fQurcM264DeHPWnxO8km2vE4uuC3nT1p8c8W9qTFP7XYkbbin4fsSWvLbSVa/DOcPWnxT4f2pGVXtMaylEDrKktVV1mquspS1VWWaq6yVHOVpZqrLNXwsxTTtJOdeTHcP2KV0r4A+IlHAMAPMQIAfi4RABTcbjUGUHC71RCga7/dquN7vACAb9sCAJiR3TSBedNNE5jd3DSBOchF0yX22TpJGV1wvMDaOkcZLjm+/iNXtLZmghKtsZng8GryBdfYUFDCNTYVlHCNjQUF3GhsLijhGhsMSrjGJoMSrrHLrBIuG8MdbU294Fq7aU3AtZaqBFxrqUrAtZaqBFxrqWqMS9ZSlYBrOFU9w/WVqshXqjpiD9CRuJ6+CnD5t75mVeRrVkW+ZlXka1alYFPUrri+ZlUKtlDtiusrVSlYELUrrq+YkXzFDAXLwvbC/Xr5278//Prxw0+ffv7t8jPXf/mvz3/98vGXz3/+9ct//vnHv7kc/F8=","brillig_names":["register_initial_keys"],"assert_messages":{"890":"Array index out of bounds","753":"attempt to add with overflow","1009":"Array index out of bounds","241":"Array index out of bounds","177":"Array index out of bounds","869":"attempt to add with overflow","997":"attempt to add with overflow","732":"Array index out of bounds","659":"Array index out of bounds","851":"Array index out of bounds","324":"Array index out of bounds","193":"Array index out of bounds","577":"Array index out of bounds","641":"Array index out of bounds","312":"attempt to add with overflow","437":"Computed address does not match supplied address","1025":"Array index out of bounds","955":"attempt to add with overflow","882":"Array index out of bounds","815":"attempt to add with overflow","858":"Array index out of bounds","340":"Array index out of bounds","593":"Array index out of bounds","1038":"attempt to add with overflow","270":"attempt to add with overflow","206":"attempt to add with overflow","712":"attempt to add with overflow","898":"Array index out of bounds","724":"Array index out of bounds","1017":"Array index out of bounds","185":"Array index out of bounds","944":"Array index out of bounds","807":"Array index out of bounds","740":"Array index out of bounds","353":"attempt to add with overflow","926":"Array index out of bounds","670":"attempt to add with overflow","606":"attempt to add with overflow","911":"attempt to add with overflow","332":"Array index out of bounds","585":"Array index out of bounds","454":"Storage slot 0 not allowed. Storage slots must start from 1.","259":"Array index out of bounds"}},{"name":"get_current_keys","is_unconstrained":true,"custom_attributes":[],"abi":{"error_types":{},"parameters":[{"name":"account","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::aztec_address::AztecAddress"},"visibility":"private"}],"return_type":{"abi_type":{"fields":[{"name":"npk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::NpkM"}},{"name":"ivpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::IvpkM"}},{"name":"ovpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::OvpkM"}},{"name":"tpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::TpkM"}}],"kind":"struct","path":"aztec::keys::public_keys::PublicKeys"},"visibility":"public"}},"bytecode":"H4sIAAAAAAAA/71ZzW/cVBB/G3+s7bV3vQn95uA7qNptKRSJQ0KB0gKtBBJ3J3baiGSNvA6Fv4cDnOAMEgeExBXRv6jxdib728lkVaV+fdLuPI/n4zfz3rPnPffMyxaf/HrU94jyNTbmbROdvF6bdmhrEis4N4g6RF0Ro0+0TzQgGhKNiA4gTwvjrnCELYZ7G+TcJac+OQvISUTG43NsvgP9j4h+01R1/qTM5odVk02y2cl/fnhYPSuLmxnem2dHx/Mmmzd53WT7dXWUTW+i7V+gf43oTl3nP2UHs6L8MauOm6zaz3ar41kxR8XfLqr4B/TfJpo3TXn0fZM1VZYXRfbsoHmaVT+U9f5JRKepeE40NMsx5WHYpuvJ67VpCOA6tX33ziQ0q8PbNW7Pju1JO1Xv0aKQaycxy3XFMi15C+5/QnwHeJ8Key3vs+Cs7fvE84H3OfH6wHsAvpn3kC5C4H1BvAh4XxJvALyviBcD71Gw7DN9TLwh8bYgXtaN4f6Tsvn4sNr77tHx0W5Z47LQnrj4kMHWWtxcWrxXzZo632t2iqIu5yuLzVesmnMsRmDxaX4we1CgVv9ilr4t6/lBNUOt4BUttfkNBY8fl6zf4Ty/LfFg5iOgoR3/0x74Yf/sawNyMhCYWhl87213hCc14p1HMQ8ExoHAiHoOYLQ0bpOeWa7J8/LWXg/t+L81ptgYw1CMzwAw4HzuyP/EwPh4wh9TB2LvdZz7IeS9B1gcwMQy7xLlpxc2R+gYwO91n7ciMavrhn1ZmifluucLzpnYjv8pjhX7Z1+8Ttprnj/zl2Xk12V++iJAEwnwmMoQEyVUH/r4KHGg7yl669rIXPxRFQssidBjW0bYMsIWlkLcLJZlxTpM7DMyq0u/6+nkCf+OyEkbv2/H/17PrM4lF66xhBwKHr4uPNJjGR/wY5nHeh5c3yeagj6WBnKpDcE2+9oBG/KVmZjlmEag8xB8WSpFFrkNRI5c8GvZ/9QD/z9D7I+pP4L7A8DARaohPIHIuTZn+iLH+CzxO7Idgu1I2LaYx1saJg23XMe+gptjYVnHnD064XeAA7ro31FywjoW83Bbi1HLgytkPCUPPtw3dnG/p2HScDtCxlVw47hZxn1Hw6ThjoWMo+DmWLCslEd52rxD/445m5M3MO/e12LU8iC3L7GSB3wvGLu4P9AwabjlOy5RcHMsQ/u472qYNNwjITNUcCfQb5tj9NpXzjv07yg5eQPz7kMtRi0PqZAZKXngeFK4Zwl3rmHScI+FTKrg5ljG9nHvapg03JtCZqzg5lhYFudWCrZ43snPFazDsoHQScAv7nnYHx6NblEfj1r5aBePZC9RH+vuy2YZJ/OuAD7mXaU+HrVegz7T69THNXiD+iPg8TeFFHjsbww8xrUJPMa/BTyOE4+0OR+XgMd5vgw8HpMrwOP8XgUejwPGzfm4DjzOxw3gcT447taWVh9b3IsVWF/J/QLuyVjmV6LaMZBWq8ljCq2ulWcGWLP69nOwhzXPuhywzO9rcrCYs+KTxuLzUWAFe9Ga/Qt8n44l+JP1HMusGxNZp6VG3zPIvZVWq3EefCGD+xKW+ZOollvca+PzStrDvfai7ufPWJCTfrCKmWU2wD7L/A12/wG/nrDb3v9fuc9t3bmPC5+8QjtzZXHkG8GnOhd8uRA/y0SAw4Pr/yCeQbAaD+eC7S6eZ/yZLjhfzxN6KcgEoBcKvVCMWzsG/1I/MqvroMtzDhzrdk6+ANHDsB6LIQAA","debug_symbols":"7Z3tTmIxEIbv5fzmRz+mX97KZrNBRUNC0ChusjHc+wLS0uU0nRhOstPp+aOgQ32fgdN5O7E9n8Pj6v7j+dd6+/TyPtz9+Bw2Lw/L3fple3j2uV8M92/rzWb9/Cv/8SCOX5Q4xb+/LrfHp++75dtuuBOLYbV9PHw/vPZpvVkNdyDMfjGKcz6cI71wKVZKUYg1ypxjjbmMKy3sfy4GJW+R4SFGeqsQGaCjZLB+JEPdJMO7c2QQEpFhRcyGVXYkQ98iI6REB+0xGT6O6sT4TYGSDAlOnl8jIQAmRqac2OwTcnw8HtlEMTJchCsTSuMar9PAcHnTlRPFaIgjC5EFhxOm6QPT9oHp+sD0fWCGLjC16ANT9oGp+sDUfWBCH5h9uCDdhwvSfbggPYELkgJU+gshYKDCJVIpNDK2tTau8rzORv4SHxoWD6Jl8bJl8apl8bpl8YCJN8Jj4o3UKTpvz9jSVKmkit0qJfOuWbGZIw9tpzQL24C2fnxs/UDWrTJQaprZODB49U/sMS2m17RoHz+IOWFMi53TUkqLm9NSSouf01JKS5jTUkiLEXNaSmmRc1pKaVGs0uJ0Sou6KS16TkspLTCnpZSW/+ByJaS0WIOAKi3iOufw8DJfeHNSb5tW75pW75tWH1pWb0XT6mXT6lXT6nXT6qFp9U3XWtt0rbVN11rbdK21Tdda13StdU3XWkd+vocUrbPos3ry831VPfWrFiAqUWDtlXpP/aqFEP8NQRntcvWFFbzSsWemlckuEntCpX6JT4hK3XtPiErdqH8P1diEmjW3zqjUZ/kJUamXhAlRqa8XvofqIaEGd41KfXExISr1lciEqOQN0GSogZdbuqBqYa5RebmlKiovt1RFZeWWtHEJ1YlrVOgHlZVbqqOyckt1VFZuSTuTUL2/RmXlluqorNxSFVUKVnYJYWXll0BEIRqkHbGyMkwIKyvHhLBCR6ysPFPOqmDEyso0IaysXBPCyso2gUtdUvBhxMrKN9VZJSvfhLDy8k11Vl6+KaRGkxFuxMrLN9VZoSNWXr6pzsrKNxmlEqs2I1ZWvglhZeWbEFZWvqnOqlj5ppwV9IiVlW9CWFn5JoSVlW8yIa1frRj1YPATRhmxsvJNCCsv31RnZeWbrJSJVY3rKyvfhLCy8k11Vs3KNyGsrHyTTUefa2tG/WHNyjchrKx8E8IKHbGy8k05a3avgsjKyjchrLx8U5WV/mby2gY3SX43OYjLDjcRRvLJzyB1+eQnhbp88td5XT75JU9dPvlVTFU++T3liHzym8r9ZVN5dnB3lE/+BJe6fPJVty6fetVF5JPf1F+XT/4Ul7p88se41OWTP8elLp/8QS5V+eTPhEDkt111yZ/dgMhvu+qSP2MBkd921SV/FkJF/v7w7Pfybb2836zO9119+tg+ZLdh3f15/frNIfgv","brillig_names":["get_current_keys"]},{"name":"rotate_npk_m","is_unconstrained":true,"custom_attributes":["aztec(public)"],"abi":{"error_types":{},"parameters":[{"name":"inputs","type":{"fields":[{"name":"calldata_length","type":{"kind":"field"}},{"name":"is_static_call","type":{"kind":"boolean"}}],"kind":"struct","path":"aztec::context::inputs::public_context_inputs::PublicContextInputs"},"visibility":"private"},{"name":"account","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::aztec_address::AztecAddress"},"visibility":"private"},{"name":"new_npk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::NpkM"},"visibility":"private"},{"name":"nonce","type":{"kind":"field"},"visibility":"private"}],"return_type":null},"bytecode":"H4sIAAAAAAAC/31ZW4gsRxmuruqZ7ememd2dme6e6bl0T8/uuWhvzjkx6RMDASE5OceIIQkRoyJRoj4oiBjyIAoajBIlKlGM6IOGgIqShxOj8QL6IOpDIAko3oKgAdHzoJA8hHh78Pv+6u6ZxV0Xureq66//XlXfX3NWGUefU8a7Ramzymz5eKngtMJfgMdXyrtxrtreTd5Nt6Pv3WQfpfE4HLjkXZKBS/axA+cxS5nzJHXxvqBaeN+s2nhfVFvnSenh/XrVuQrkg5vJ4BbKLEWkAZdSG3+z5270zipHBaUODn1qq26pu35GNr6v2i2/Fymn589U2/dvV9YYeURF2tkDI6ePlruNl7ODl9k9oCP8QhXg0en66J5R/kVHqcK5Isw7S74H4DsYQoFBo+8AvVGj7wg9t+4FLnph3euG6EV1rxehF9dmGDXBS0/Rn0wTjIw5kqizjnHYHOuk1JOENAm7yaTU43gGzSfQaDJGa2xK1YMFd3aV8c2YpJMD5f5ajQt1V+kM/NIZmdKJktKJI1+ZpBcfKOfNKi7U3WCZ7MR9vOMpTL9HTWk6OMfTa+Bi++eo+i92VXsaz9YGoDVtWvOmtWhaKd2dsZuJTSmaqc5KlS0RwyIvdQ7/mqVewk8brVKncTW9lXN6vjE9L1WegYp8M31Ma4YnnZZ6Z454LAr1ELw0K9Rn4aVZksLYP6i0UA+XziLxlZMEET59UUW031J+iZS7CT4/qZJCfaV0pnOoNKNKyTpKMzTnmhFy6ZSZjt5g4CpQqKh0ZnMZhg7zGXt63dMzaNdfyBw6cdqbl858AaopqKYao1O4ejEunLdgIBHFqeX3VVSo30AdRHQaiYM5li0x9mO1vCjxMpEWd8INTpYy9Ex3S5iD8Ocqbwjp4FwIMaWdLoVnStKUpM9Y0vMwyjPYPFTLc7GQ3f9gTbeUDZplkZY6wrOcQj/atZP0a6Wfr12b1K6VIPxRpY0aVGBtyZ+tJUxnxjTKDpmzWCJoyyAD4d9UJpydOb6Z5S6+OS2VFepFWJ3xM56c1u+Beb63jzmvqP3KpMya5G6atIKkld7Hez/fQxbtUfJOCluWdIijrUNKvYoxOi+cU8iYrHC2wD/bhfLOVWpZOL6VP10iayi/Rb5gzqzJxWsrOprcc70vWQMKtV866zWxzBkVXfcyjjW9/Bj97WzRvyf6gxaa5rIaoK2EhubMUjqrqByoUq4POox2LGnp1SovnNvFBmeai7Ycow+d66wPrfaUle2Vzt4KRjfOzvZOgPB16kRDeALvE0KIKe3VvvBckXRF0kuWFHYtj0g1kVKxWMEePPtT6Mclv7Ps10q/qQqPWjImperKCtL+AJv2CEvOxRYabmzQ642b/+rWqGkNqKMcPL7EjkfAQOM08mPsYQcRkp4rP9bwcXejVepBuN5F3WYXjSqeraN5Hmbyv62IjGHDjsHGNiqcB5B8ceF8Ek6Md7HU3DuxPzifwq4fY43E3NiczzQbG3zxOVCOd3EIuK/GIeB8vnTcMbd0qiTHVCQqxXL8yF4QiuyhpCgo1BBBtqfTmMcRe3rd0zG0649kDj3r9salMx6BygWVqzHqxpVAI653G4GYUSp3fK1qn33XrR984dyjp39w24Wn7r//rrefes2VSx/64QcevvGFl7/wohIl9LBRYsgpr3r2bKCffuvlx26744krdzx8/cXT2SNf/sijX7vvoX65d+XCO5TL3STki/4OB1F94EYbBy7iGdJqTV+MI2RKiE/imYiDo+hq1T4ZPfEeZd0iZLpTOh3Gs6OJCzqcL7lkhHNHRpIbw8qBTIZBhU+S6oilc0NwEZeJkzqHe4QvyEPHuCOE9LdqZLe94ycc7okK1Mn0EIuRCysuPv/MvQpqt92OAcu/KlMhn8qEzejY+YyOQdY7WEwDYaaRhi1jmdPq4RtpXK8ykkYNKaCLbHdaQQdi/qk6NhlVq1ljlNYXbDXYkMZV0huiOST2GhgkrhmOgPNGI2CU0Uhw3qh6BOcdKB0oLPJupVtB9TotQUia2K/XIUyiuchqDA9Kp2UOqdIIVcONpTnE1y5zejQE1BuG4BKOIqgSRVAlikSVqHpqVfax1gH/mGs6LHjuDypVTpHdgKoMhgfK/FsNC11QFVFbTN5llFrSF7nbSI6QarRG8lEScsTFF0KD8AgNqJg4KpSxsHpqQNyOhI9kfTQpnQkX5Jb9OCEgJWRMCCg9+5GoJ4mmOAoEfCbCNameWmIi/pjI2KR6aomdRPgQMs0Sop0pPvr2owClBPBnQYQV2I9ER4sE5306B9e5Ea6memqJJqHYuYzNq0fGEB3PkOCIecjJdnfhYjUtUrS3pJ0uDOaEKeakqcxJq6ee0+qGpAsXaA+lvQhTcklDzJz8n5lxd8KZE4P2WNpmwplhOsHMucTwiDiBetqdk25OPWfSTueUPAnnSJ1Pq3mhP4rZ3uTQmWaOx+VYv9ek6Gbc2wkWgBiY6RY7A64AdehUIB2wtu5utEqdbZxpveZMy2qwvsHOgvWKXfdIdnUro0DTgHX9TayStNDfwgJJB8Ao+hUAOv04kgNOcFLiPn25hi29SaG/A8rJboDPz6qg0N8rHUOwzuKqJT4JRaWJoHGeAO4uM1wHcqbR2wEWwBqsczmswTqKrompwPrEJmUPJZXpg2oBqoVelHoB//f9wjyEvA6oTgCAq3+JKkO/BFrwN1INEV1NCFT07xoMnloAPQHMIsYLSWgs4QqEf1KrhlDAqRBiSjvL07oAmGQkvWJJgaCCIxCUdbhlwfoIT45N8CXatRP0a6Vftqi8VAFdW2VK77hMaTdh3Gpak6bValrDpjVqWnHTGjetqGlNm9asaSWEjN2cmZHDYDNufJNZw9KcIBmpkiFVsoA0qaVBYPANEJ3frlOrwgCthiwRMGVOMG72wXe1DyhqXtVA0aMgNkH7noWiq33Aa0LTXDBozoiZayuJei/E6Lwwb5MSwVwvJQKCb94JaG1usPINKlpF+S3yBXP6eCUW7zG8+1KQnJBcBYU6UTqrxiGAwU6W67qXcazprY7RP1+j8Z7oD1poupI1CG2ZajsZzElZjJm7bTGGsp2rkg6jHeL/d9OPD4gNjpGChj7MxIfva5D/qoLtKG72gf7DxtnZ/kkQ3qtONoQn8T4phJjS3juxWpcdJP2wJYVd+REJLlIqFih7VnhOGOgnJULer5V+sAoP7hEQE5QIsm43t89dApJtdrclGtwudjUvjnp9xaF+qba5zIM+zwxz3DkDYV9V8GoX92sm0EFhHin1Lnd7b1e2LvMY1+5gG4Q/U9uF+TpPeVg3tNb1N62rlMB7e9BHRdMnK3AZFeYyuIw6xBLfBZYwT57huQ8c0XaHAmi2Ob7dx/iPVL/y9a4WU0bbpbM9vF4wtcWlZrQz7BPqDED/UzWwvhpSDLTbhnsESnVpZ1fcI4x0F57ETV27shUbQtPabVqtpjVsWqOmFTetcdOKmta0ac2aVhJwQ7A7rgd9/4JbR2tfX3t4exNsvUGXCnsk8nBKmL+roMqi7SP8bK0RCRMPsfNkf+xyf+wyUP9Q23Z19+H9LmMI6CZuHhHSjcIDgt+wUgMlBxGgTzxnYaQQsVTbsnUZ1BhYNXqbaljgKDgPk/WQuM+XyPiMjDuoIqNDoMohUSXU6PAG1DDwZvBaVdUZRjAtxQ5RO7hzWztAbOcI6y3gFczpo8gyQxHb6de4+ZQtEyyY7RBXY+XHLCpj2nQG5ad7K4pKQFNXykfi3PEAd6vutfZuVUopVkv+GPgb2N6RistYQtQI7g22RhBCqQWEEFPaQ194+iT1SXrBksKY+IgNQaB0xcJHKuEZutCPoFduPq3Sd9QFcswCmfe1ovi6ILHlH2o73KdqqfR8TV5Na8y7dEO1Yh+Xhu49KmksEOAc4z4IdxDOCJewThSQ5r2WBu7jxWzEy0b347hsdN9Pj+AzphheLZoZ+CYz4D33PjWvzI2O2NflIrHC0rhiHMwkdryG83kN536sslNPsdsnpnC/ge0D8fpEl/IZosdxG+4+aOXLLTzlt+SWdyqeSMRiIneX3BM9l3NpSuSNeqFxiI/qIfJ13Ys41vSSY/S3s0X/nugPWmoq9x3QlhX3TgRz4ogr4Nv13hTxBoQOox3i/8v043Nig+PK9Sx9GIkPn7I+tNpTVsTLWRQ2YePsaLYA4U/UoiEU2CeEmNKezoXnlKRTkv7CksIu/4g0tMjSssA1XIJnjjR8jumx4/drpX9VJYTyGRPuOv6Yu86Yg7+vB+1vBht30FKt6eQ0K26Uc2qHNRmw6fqOpqKgIT0WcLiRYckXJ/J9ur7bdUTr1lC0nuHdRlT1GJGdrbkhKlNUtrP48GW15NqMuTbDrwnuv+yvCaWa8deJ86jFPJwMeCntbR2g4va2ipaGCOO1itbgPH8Wajk8Oj0Yck4anR4mdDzX82Oo5ns+f4TCP/kRyrdPfdC2djwf0z1OCCAu8Dx2W9LVnucF7HYgvVO0WuccGkvBZ2QSlcKkLW+L3S2I9KiCtjw9CO1saogdpeIgMshUZHQ2JhlOsv3AahJ4vrWrS7u6ENOjXT2vR7vwT+zq2aex68DrieaY0IeKfcvNly5Ye312u5DSLVq5Hdry2mfOq/HT46f/C1W8mVDzGwAA","debug_symbols":"7Z3djty40YbvZY73gD/Fv72VD0HgTTaBAcMb7DofECx879F0jyi11WJBDsesYtVJMk447fd9Wma9RUnkny9///WXf//zrx8//+O3P15+/r8/Xz799rcPXz7+9nn5059ff3r55fePnz59/Odf9//zi3n9D5tv4//414fPr3/848uH37+8/Gx+evn189+X/15+9x8fP/368jOY8PUvP73Ycmm4M9eG22vD3bXh/tpwuDY8XBserw1P14Zf+1bdtW/VX/tW/bVv1T/9Vp3x+e03nAnx4Zd+OowGH/3baPDJ1tHWpiejk0nubXQyOT2MfhXknwtyqQryCRPkyqonQh3rXbz9BXD1L1h+CZ7/kk1x/SWb4+GXwvf8UvyeX8rPPaVQf8lnBJqNC4O34cvPztfxCd77S4fSRX+9aJefQ0L0L5fGqh+yx/Q7s45Ozptv9QfTXX/Mbf05rJ+d03aNO+duemwXPWl3PZTY1mMLrB9uS9gpWv4Fvipy5BR5coqAnKJATlEkpyiRU5TJKSrUFEVDThG5OTuSm7Pjj5+zIRpbw6TN31b+COQUBXKKIjlFiZyiTE5RoaYoGXKKLDlFjpwicnN2IjdnJ3JzdiI3Zydyc3YiN2enAXN2qgtnkKL9VlE25BRZcoqAnKIBV3YOdT0xR39QVKgpKoacIktO0YA0UnydIQu4r+11XVfs+tmu+K3ftPDss32AdRXYh1AeRr+6DZO5Let362OMyGhroPpcfi7bnOKSudGJSqdBJymdBp2sdBp0img6IdTbZiYk/y0da4xwPGnDs7v1WvFYxdPCM1uEuYYnWlPxxGCOeLziaeEBxdPCIzsxo3hkR2YUj+zMjOKRHZpRPLJTM4bHyk7NMcQNTywPeJ4ZrctgNu5aEA93lrIjdl+WwvN4V5bCw3tXlqAsu7EU3hZ0ZSm8h+jKUnjD0ZWl8O6kK0vhrUxPlk77nn4ste/px1L7nn4ste/pxxKUZTeW2vf0Y6l9Tz+W2vf0Y6l9Tz+W2vd0Y+m17+nHUvuefiy17+nHUvuefixBWXZjqX1PP5ba9/RjqX1PP5ba93RjCbIzUdo9upace2B5wyO7nKS0w5MBu9SM9/VaMx6Ob0CA7IpyEWeqr4jaFN3hX67sitKXpeyK0pVlkL1icZFl3t4ZyynuWR4HZ7d+dHZwwA6K/X2wW+N2VS0ewGtEeC/w1tTPtlAO4DVMDAKvyWMQeI0pg8DLvjs4DnyUfStxIHhN8YPAC1+QGwde9h3NgeBBwY8Br53rIPDauQ4Cr53rIPDauQ4Cr51rF/CvLJM2o/1Yan95gWWpn+6MObLUlrEfS+0C+7EEZdmNpfZq/Vhq+9WPpebLdwr2zac9skbRd8Je8rZBujly13gwhjso9yHcNXa817pN+6myrBllEHhdIh4EXpeIB4HXCD8GfNEQPwi8Lj4PAq8r1YPAa9/6buBh++xweL+2gIIfA14710HgtXMdBF4710HgtXMdBF471yHgnfBzUH9Ujn8CXjvXIQ2UE35260Dw2rkOAg8Kfgx47VwHgdfOdRB47VwHgdfOdRB47VzHgBd+FvFA8Nq5DgKvnesg8KDgx4DXBmoQeG2gBoHXBmoMeOFHvCZIG/gQH8Df8AgPfRge4dEMwyN86R/DA4qnhUd4CsTwCM9qGB7hiQrDI3zhGMMjfHkXwSP8gFAUj6bmJh7hqXl3xlKCRzxPxje3h3PCj/G8yHJZ0l2HL1fhgSUoy24shYf3riyFJ/2uLIW3BRdZQj2p0sVD7QHhKfAaS8ir8uXHw3UJwiNjV5aaL/ux1Hx5gWU0tfZEbw8sQVl2Y6n5sh9LzZf9WGq+7MdS+Bp1V5bCF7R7sgza9/RjqX1PP5ba9/RjqX1PP5agLC+wDHV4TIf9A6QfVt6VpfY9/Vhq39OPpfY9/Vhq39ONpfQDdq+x9PXTLdiHdfXj4NZRIU76YaPvhx15N0T6YaPjwGsBfC/w7afJpB82Ogy89JNJx4HX9cdB4HWxchB4TfGDwIOCHwNe10wHgdfOdRB47VwHgdfOdRB47VzHgJd+kPE48Nq5DgKvnesg8Nq5DgIPCn4MeO1cL4AHlyt4ODyFJv1A7q4stb/sx1Jbxn4stQvsxlL64dZdWWqv1o+ltl9XWDbf7pZ+qnRXlqAsu7HUrH7G8oZH43cTjybqJh4NyQ08XvpBoWOecvfSjwl9P+wlh/rR5shdS+0Y7lrDx3DXcPBO3NsvdXjpJyYOAy/9xMRx4HXVbxB4jfCDwGuIHwQeFPwY8PqExiDw2re+G3jYTmMM/gBeG9dB4LVzHQReO9cx4KUfzjoOvHaug8Br5zoIvHauPyLHPwEPCn5IAyX9eN1x4LVzHQReO9dB4LVzHQReO9cx4KUfkDwOvHaug8Br5zoIvHaug8CDgh8DXjvXQeC1gRoEXhuoQeC1gRoDXs8WHwV+RHG1eQMfHsDfJEV6khI9SZmepC6zp431fY7oTWhLssWXuA4vED0y3Ni0/WtY5Dz8S3v10Oewz8Ee7AQe3AQe/AQeYAIPYQIPcQIPib4HZ8vmwTssiTVPUPN9TvbjZJhBAuhqODKIC30NM8gWfQ0zCCJ9DTNILX0NgzTDDPJQX8MMwlNfw9KSVpSWtKK0pJWkJa0kLWklaUkrSUtafY7E42RYWtJK0pJWkpa0krSklaQlrSwtaWVpSStLS1pZWtLqc4QTJ8PSklaWlrQKh7K0vwOaw4PhmwcG85DfPYvmIWFfWnP8zTODqeii5wSwDk/RHS5UBlNRX8MMpqK+hhm0BBcN55DW4Tk9PCV6HNza2B0Mg2z5jmzaj9uCma8AXKLTPP8SzHyloied+epKTzrzFaGedBgsUw6kw2BNcyAd2WkHoWMZtKUD6TBYWh1IR3hWRuhoVm7RAaXToKNZuUVHs3KLjqSsfDMsKf7eDM+XaEt9JdwZczDs5gupiOH5cidieL4oiRieLx0ihkGa4S4Zzlu7Gc6AOEjO1FvWyfnUHu6iW28TuRS3z36+hUjOsErJudiH0Te/UZjfJMxvFua3yPLbZxNYRn6tML9OmF8vzC8I8yssX3lh+coLy1deWL7ywvIVCMtXICxfgbB8BcLyFYAwv8LyFQjLVyAsX4GwfAXC8lUQlq+CsHwVhOWrICxf9dmql5FfYfkqCMtXQVi+CsLyVRCWr6KwfBVZ56ubA9aJ6eaAdQa6OQD2DljnlJsD1snj5oB+lsi5HjCVyxMH9NMB5oB+vUccJPoVHHNAvyYXt452JQYkg7RG3/zSr+B9/dKv9339gjC/9LNEX7/0k0dfv6NzCmSDDPdm+/Tl54I4tq7kuI137uh5dLIZ4Xl0FhrgOY9OT7jnpocn4wvUt2lK2LS4eH+DJY9OWz/e8ei89eMdj0hcUKqmFHYW0psmIKgpENQUCWp6Xg1dWP8S5xIgmopd334ucYsvNj69vkN9F75sXl0ozz43ZF8/GLD9XJd/LesnG7MbXO4+iwyfJ9vWzufTCvHphPj0QnyCEJ9BiM8oxGcS4lNIHioy8lAwMvJQMB3ykDXg6l9RCubUpG1bK+ORz45x7YJj9rtPflPvWKv3rNUDa/XPc0asR4EsCyceVb/tUmOKefg7jqNDqR11NDYi6zkh1a3Blh/z129WKcPJPtJ89Cfm+jNz/YW3/pP9jPnot8z1O+b6PXP9wFw/8/prmddfy3z+d8znf8d8/nfM53/HfP535OefDFV/Dkf95PN/W7+nPv/kunn48mM86h8w/2RT9XuL6He+6l9+3EYvX8VNvuMt3/OWD7zlB97yI2/5ibf8zFt+YS0fDG/5vKsu8K66wHveB97zPvCe94H3vA+85/1AfuapJ3E7v3thZpVPPu+35VOfeaBu8eAgxoN86jMPlHWtx4Xdi1z5mRDv68KQ92kTkuPdK/VpqqdX6nNaR6+RevC95rW+uuB9zgev1FNyT6/UC1tPr9Sr4CWvYNaH8DzslmNXryDIK/W+qqdX8lGoo9epctPeq4OD16myRNtrmipLIF6nqq+QYvWay8HrXPW17XWu+tr2Old9bXudq76WdVnFB5MOXueqr22vU61LIF7nyhJNr3mqLBGcq159OHidal0C8TpVbkK8TpWbEK8wq9ed7NXrVFkC8TpVlkC8TlVfQz1d3kdzWIMpc9XXtte56mvb61z1te11qvoa6z5aPrpDfS1T1VfE61TrEojXqbIE4nWqLBHBVK/hsD5cplqXQLxOlZuaXqOZKjchXqfKTXuv0R28zpUl2l5BkNfn9TX53XkpqFdXby1YV1xbj3OxPnC636hm0fPkk63fdp7ZOXXxqY7it714k0M+OtV9amzabYHj4M6lSOWSTd23Ktv0LZeT/T9EXC9h45IPXKzY66WuGdm8W/dcuTi9XhYu8cDFz8Ql18poXP6f5l07VT26wgWZd5Pc66U572ax10t73p0qv3zv9XKcd91c+QU2Lt8+0hPdRJHEmXrMhjMZ0EugVWIcSOXSLjEuyL1eWiXGTRRJLl4vzRLjJook33+9PCkxU0WSXYnJ4VBiJkoZzpr6Muv+XJ/vKTF+oq73Gpd2ifETdb1Xr5dWifEzRZJr10uzxPiZIsl3Xy/HEuPnWrWHjcuhi/E/vMT4sO2IERGrLtYlQRfT4e4K/PBu07sqHqxFvidj0/r8kDUL/O2bSuau3zLX75jr98z1A3P9gbn+yFx/Yq4/09bv6iMNy88eO9HIxlDtxrTp9vdQAkWQ2UC8svc1SzwG9DVLPDP0NUs8YPQ1C5LMEo8ufc0Szzl9zRIPRX3NSkpQQVKCipISVJSUoKKkBBUlJagoKUFFSQkqSkpQUVKCipISVJSUoJKkBJUkJagkKUElSQkqSUpQSVKCSpISVJKUoDL10rO/C7l7SHO9C5mJzzneb/o9JOzLao6/+SU+7Vz0m+oZMTbtXuBeL07i005fs8Snna5mC/F4f9Fsrues2Jzi3uxxcK5C8m5r8ZUL8bz4jlxei9n22fFAZq6J/hIZa7ZnTqEcyMxVEnqSmat+9CQzV7HpSYb4kuJAMsTXH4eRSUZumsHIEG8vB5Ihvgw6kIzgDIyQASVzQkYz8BkZzcBnZDQDn5GRkoFvZqXE2lezdq6kWuoe8c6Yo9m5wididq48iZidKyIiZkGS2bmCHGJW7lpT6y5IsnJXmkrettY2BzBO7qIBAkbumgECZq7i0e+GYnKClwwQMoKXDBAygpcMEDKCb5shZATfNmuT8YJvmyFkBN82Q8gIvm1m6mk31gR/ICP50bE2GVAyJ2QkZ+A2GckZuE1GcgZuk5GcgdtkNAOfkKG+i+q4pEd9f9aBZCRn4DYZfX3ijAwomRMyug58RkbXgc/I6DrwGRldBz4joxn4hAz1/YYHktEMfEZGk94ZGVAyJ2Q06Z2R0aR3RoZ61bbbupu35YHMq37qO9Gi+qlXQEw/9bUaTD/1Oovpp14NMf3Uaxamn3plwfRT7/Qx/dT7cUw/8/pLfR9TVD/z+kt9t1FUP/P6S31PUFQ/8/pLfedOVD/z+puY19/EvP5m5vWX+v6sqH7m9Tczr7/k98fF9DOvv+S3sMX0M6+/mXn9zczrL/mNfjH9zOtvYV5/yW+IjOlnXn+pby7sStz0m0f9T8a3972ivl/wRbPO1i3Y9+dErGapH3PR1Sz1g8K6mqV+UFhHs5n63rtXzcKmJJaDWerHSV0zC9muwyEfv1nipbOv2bnqLGJ2rjobTZ2gorcHs3PVWcTsXHUWMTtXnW2bpb5zaF+z1E9F62qW+oGcXc3OlaAQsyDJ7FwJCjErKUHZyRJU60DOTH1P2L5mJ0tQTbNusgTVNjtZgmqbnSxBtc3OVXp83aHbgn1YqTgObm1ananv8/iOXNrvUGXq+zwOJDPXLHmJTPNWXKa+z+NAMnN1sD3JgJI5ITNXb9yTjNw0g5GZq+vuSWauFr0nGcEZuE2G+j6PA8loBj4joxn4jIxm4DMyoGROyGgGPiOjGfiMjGbgMzJzZWBwuZKBww1I6ls3djVLfTfGvmbnCp+I2bnyJGJ2skel22ZBkllJj0pT35mxr9m54hZilnGoeNVPfWdJVD/j0n/Tz7ia3/TL7cebz5FQ3zHxHbk0j7LO1LcCHAaG+h6D48AIvrXQfvCI+raIA8kIvrWAkAElc0JG8K0FhIzgWwsIGcG3FhAygh+vQchIfsS8dcBspr7N50AykjNwm4zkDNwmIzkDt8mAkjkhIzkDt8loBj4joxn4JOlR37Z2IBl9zfKEDPWtdgeS0XXgMzK6DnxGRteBz8iAkjkho+vAZ2Q0A5+R0Qx8RkYz8HMyZbI9j3uS0aR3RkaT3hkZTXpnZE5mYJMrGY+TgVLJpFBH29fdzQ+jo88rmujLbrRNzz47uYomubSnfpNfWMs/23GXi3zLW77jLd/zlg+85Qfe8iNv+Ym3fN5V1/Kuuo73vO94z/uO97zveM/7jve878jP+9sLgdkkpEmMfn21wcXk9k3iq1dPvTnIfvMa3Ldflac+TeWYqvzdZ6/yqU9TSwZaP7vAkT71aQqRT32aQuRTn6YQ+dTjKSKfejxtywfq8z4in/qiECJ/wLwPvsqPmPxog1tH293zdq+jb/ozdf1lxR/dLiFV/YW6/uxa+oMhrt+ZUvXbfNRvmet3zPV75vqpz5+Y/sBcf2SuP1Gf/2Pe9Bdk9BInViVLZTNHt+Sr9bnbm37y1bqtP1Kv1ph+6tUa0w+s17gi9VWWnOo2e7nEg3zqqyyIfOqrLIh86qssiHzqqyxt+Yn86npbPvVVFkQ+9VuwiHzy9zba8slX3bZ83lU38a66iXfVTbyrbuJddTPvqpt5V93Mu+pm3lU38666mXfVzbyrbuZddTPvqpt5V93Cu+oW3lW38K66hXfVLbyrbuFddQvvqlt4V93Cu+oW1lXXGsO67C76ydfd1hPci37yhRfRz/oJ+tfTGpjrJ197Ef3kiy+in3z1RfSTL7+IfvL1t62f/O4KmH7m9Zf8/gqYfub1l/wOC5h+5vWX/B4LmP7n83+0qyIXAdVv4nZ81/4B2Kf6Q9n0G28R/c5D3b9p/yjiqt8Z4vrBrA8XLj+Wo37LXL9jrt8z1w/M9Qfm+iNz/Yn6/F9HO1/yUX9mrp98/W3r99TrL6afev3F9FOvv5h+6vUX00+9/mL6qddfTD/1+ovpZ15/PfP665nXX2Bef4F5/QXm9RcGzP8lVP02IvpDyuv6z/Lj42rX3UAkbiD7dQEuZEhPDCTqBpxrG8jUDdTdCBYDGRldfD0FsPjkn9gt5O2aatfEo4FguBuw3A047gY8dwPA3QD1uo0aIF+3MQPk6zZmgH7dRgxwr8SReyWO3Ctx5F6JI/dKHLlX4pMdakyq+35bnzED0W4Oojdbn5uenvdU/HaYVIHdsVbPhy+r7LvzoXY93MnZUznsnhl5OE7qODjXQ7Cyg/3QO5wsGk7J23VpjnRONnhROnc6Tuk06HjRdNpH3i14QPG08ATF08ITFU8Lj+zIg+KRHXpQPEXxNPCcbJ+keN7wyM7Mr3f862fvjoaoeGSHZhSP9NSM4AHF08IjPTUjeKSnZgSP9NSM4NHU3MSjqbkVC4um5iYe6akZwSM9NSN4dK25iQcUTwuPrjU38ehacxOPrjU38WhqbuLR1NzAY42m5iYejYVNPBoLm3hA8bTwaCxs4uFQ2O22oud3Jz++4rmb4FB+MROWQ5FETXBYAEJNcKjHqAkOVRM1waG2oSY4VCDUBIflA9QEhyYfNTFDxbYzVGw3Q8V2M1RsN0PFdjNUbDdDxXYzVGzHoGK7bbjxpmCNr63vyC3JsBx6WcegvF907Oy6Lc0yPbijYwZZoLNjBsGhr2PPIGV0dswgklx1DHW4i8eZyzOomhcdQ143BF5+fPIdMyixnR3PV48xx/PV42hgE2OPjuerx5jj+eox4hjmq8eY4/nqMeaYwXpCZ8cMFh86OwZxjufLXJjj+TIX5lhc5oIJM1eoz2zE5I+OJ8xcbcdhwsyFOJ4wcyGOJ8xciOMJMxfieL7q5Et1DPZhDeQ4uLmJnY3zTXJX4GBPKsb5ZsSueOabPi/hQe4Nxvnm2q54QPG08MzXOXfFM1+b3RWP7NSD4pmvge+KZ75uvyeeJDw1Y3iEp2YMj6bmJh5NzU08oHhaeDQ1N/Foam7i0dTcxKOpuYlnvtQMLlc8cLwPymFD586O58u2mOP54irmeL4EijkGcY4nfBYccSzuWXAOuxJ3djxfQEMcc9gct+X4boJ5qLibYJ4T7iaYl/67CdlNfvuJFw6bbr4jnPbRe47DrokD6ci+sYHREX5fo/2wlOOwpeRIPKB4WniE39fA8Ai/r4HhEX5fA8Mj/L4Ghkf400AIHg6bqL4rnubhV47D9qwj8UhPzQge6akZwQOKp4VHempG8EhPzQgeTc1NPJqam7FQU3MLD4eNjEfi0TdPm3h0rbmJR9eam3hA8bTw6FpzE4+uNTfxaGpu4tHU3MSjqbmFZ8Jtqrvi0VjYxKOxsIkHFE8LT5fC7pKreBYzbb+Q7fpMO2S3wbE2vWnKBDUVepr6bCDdWZMdoMn4qsmHB03H0WVJI2+jy+3f18GBY+/As3cA7B0E9g4ieweJlIO7pkxQU6GnKYyobRGqpmSfaLIENTmCmkbUn7BdT9EjM4dNqb5/lvL20LuL4c0BsHcQiDvwJq9J0ttdz2PhrTMJkb2DxN5BZu+gcHcQDXsHlr0Dx94B9ZqMO6Bek3EH7GtyZF+TI/uaHNnX5Mi+JidaNfmuiVaVvWuiVTfvmmhVwr98Xf74/x9+//jhl0+//rH80uv/++/Pf/vy8bfPb3/88p9/3f+fZfB/AQ==","brillig_names":["rotate_npk_m"],"assert_messages":{"1213":"Array index out of bounds","890":"Array index out of bounds","1015":"attempt to add with overflow","1076":"Array index out of bounds","1140":"Array index out of bounds","311":"Array index out of bounds","46":"invalid nonce","299":"attempt to add with overflow","997":"Array index out of bounds","1122":"Array index out of bounds","820":"attempt to add with overflow","1052":"Array index out of bounds","98":"attempt to add with overflow","756":"attempt to add with overflow","217":"attempt to add with overflow","470":"Nested call failed!","735":"Array index out of bounds","903":"attempt to add with overflow","196":"Array index out of bounds","257":"attempt to add with overflow","1092":"Array index out of bounds","961":"attempt to add with overflow","504":"Storage slot 0 not allowed. Storage slots must start from 1.","1205":"Array index out of bounds","882":"Array index out of bounds","327":"Array index out of bounds","1004":"Array index out of bounds","809":"Array index out of bounds","486":"Message not authorized by account","227":"Array index out of bounds","1193":"attempt to add with overflow","727":"Array index out of bounds","340":"attempt to add with overflow","791":"Array index out of bounds","1041":"attempt to add with overflow","1105":"attempt to add with overflow","1221":"Array index out of bounds","1151":"attempt to add with overflow","319":"Array index out of bounds","1273":"attempt to add with overflow","188":"Array index out of bounds","246":"Array index out of bounds","953":"Array index out of bounds","1023":"Array index out of bounds","874":"Array index out of bounds","743":"Array index out of bounds","1063":"attempt to add with overflow","1084":"Array index out of bounds","222":"Index out of bounds","862":"attempt to add with overflow","1240":"attempt to add with overflow","1234":"attempt to add with overflow","204":"Array index out of bounds","1030":"Array index out of bounds"}},{"name":"compute_note_hash_and_optionally_a_nullifier","is_unconstrained":true,"custom_attributes":[],"abi":{"error_types":{},"parameters":[{"name":"contract_address","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::aztec_address::AztecAddress"},"visibility":"private"},{"name":"nonce","type":{"kind":"field"},"visibility":"private"},{"name":"storage_slot","type":{"kind":"field"},"visibility":"private"},{"name":"note_type_id","type":{"kind":"field"},"visibility":"private"},{"name":"compute_nullifier","type":{"kind":"boolean"},"visibility":"private"},{"name":"serialized_note","type":{"kind":"array","length":0,"type":{"kind":"field"}},"visibility":"private"}],"return_type":{"abi_type":{"kind":"array","length":4,"type":{"kind":"field"}},"visibility":"public"}},"bytecode":"H4sIAAAAAAAA/9VWzU7DMAx2Wdqm6yomeAB6BA7QSUPacRK/D8ALTKMSu2xoLTw/S2dr39KyC4m0RaqcOLH95bOTNKBt05sv4H7IMqJ2kzVTlsX/2sihr8InzuBEcJ6dCM7eieBUDnEGHTiNVNw3586cuZi257E1icYm0T2YpwOOAiuoaXfQv2b5/rmo8vlqWa9n8zr/WJVVvlzV+XdV5l/rxc+sLs24rFosJwwIQU/dsDZKrI078z0ZzxPG7gH3g/Hb9+O7MIl91DvuCWKZonjlOZEBfxnPE9hntCucJ9BJwT2DTl6EF9DFtB/L4NF+8jXxmK8iAw4JYmDDwyb13idveW5endSK37fiNzllwjXoFA9S0IVWzZjhFcxr2JPM31p7Qyw9C4vxG/rggnMf+fBdFGPkUHVwGHZwGHVweLn53iw/BnesveBuXhQNGBXEEpxnsEYDjhDGN7TTJ1IE7E94Eb/nZu9SR/pvO2XZDWFNBHaxZRcD7mbt5su5nzKfeAc4/DMb2Xe2y78+PMuKfUss2U8Ia+5ZXlC7IQdEfu/ABDC5fiMP3a8S8xju14GFaQg6rMWB5Wtg+ToGu4z2uRWd3OUpyF9gHhYxHg4AAA==","debug_symbols":"lZDBCsMgDIbfJWcPpbUt+CpjFG21BCQWtYMhvvvSbYdevYR8yf9d/gKbNee+ILmQQD0K+LDqjIGYShVgInqP+3I/Q3cN2X/z6dB0Yco6ZlDDNAuwtPE29+w79BaU7Mb6FCCHdkW2K2O7MjUqlfGlI2rj7b8pd9J6Ky6/j9+Hwx8=","brillig_names":["compute_note_hash_and_optionally_a_nullifier"]}],"outputs":{"globals":{"storage":[{"fields":[{"name":"current_keys","value":{"fields":[{"name":"slot","value":{"kind":"integer","sign":false,"value":"0000000000000000000000000000000000000000000000000000000000000001"}}],"kind":"struct"}}],"kind":"struct"}]},"structs":{"functions":[{"fields":[{"name":"parameters","type":{"fields":[{"name":"account","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::aztec_address::AztecAddress"}},{"name":"partial_address","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::partial_address::PartialAddress"}},{"name":"keys","type":{"fields":[{"name":"npk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::NpkM"}},{"name":"ivpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::IvpkM"}},{"name":"ovpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::OvpkM"}},{"name":"tpk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::TpkM"}}],"kind":"struct","path":"aztec::keys::public_keys::PublicKeys"}}],"kind":"struct","path":"KeyRegistry::register_initial_keys_parameters"}}],"kind":"struct","path":"KeyRegistry::register_initial_keys_abi"},{"fields":[{"name":"parameters","type":{"fields":[{"name":"account","type":{"fields":[{"name":"inner","type":{"kind":"field"}}],"kind":"struct","path":"authwit::aztec::protocol_types::address::aztec_address::AztecAddress"}},{"name":"new_npk_m","type":{"fields":[{"name":"inner","type":{"fields":[{"name":"x","type":{"kind":"field"}},{"name":"y","type":{"kind":"field"}},{"name":"is_infinite","type":{"kind":"boolean"}}],"kind":"struct","path":"std::embedded_curve_ops::EmbeddedCurvePoint"}}],"kind":"struct","path":"aztec::keys::public_keys::NpkM"}},{"name":"nonce","type":{"kind":"field"}}],"kind":"struct","path":"KeyRegistry::rotate_npk_m_parameters"}}],"kind":"struct","path":"KeyRegistry::rotate_npk_m_abi"}]}},"file_map":{"110":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/context/unconstrained_context.nr","source":"use dep::protocol_types::{address::AztecAddress, traits::Deserialize};\nuse crate::oracle::{execution::{get_chain_id, get_version, get_contract_address, get_block_number}, storage::storage_read};\n\nstruct UnconstrainedContext {\n block_number: u32,\n contract_address: AztecAddress,\n version: Field,\n chain_id: Field,\n}\n\nimpl UnconstrainedContext {\n 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 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 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 fn block_number(self) -> u32 {\n self.block_number\n }\n\n fn this_address(self) -> AztecAddress {\n self.contract_address\n }\n\n fn version(self) -> Field {\n self.version\n }\n\n fn chain_id(self) -> Field {\n self.chain_id\n }\n\n unconstrained fn raw_storage_read<let N: u32>(self: Self, storage_slot: Field) -> [Field; N] {\n storage_read(self.this_address(), storage_slot, self.block_number())\n }\n\n unconstrained fn storage_read<T, let N: u32>(\n self,\n storage_slot: Field\n ) -> T where T: Deserialize<N> {\n T::deserialize(self.raw_storage_read(storage_slot))\n }\n}\n"},"117":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/context/public_context.nr","source":"use crate::hash::{compute_secret_hash, compute_message_hash, compute_message_nullifier};\nuse dep::protocol_types::address::{AztecAddress, EthAddress};\nuse dep::protocol_types::constants::MAX_FIELD_VALUE;\nuse dep::protocol_types::traits::{Serialize, Deserialize, Empty};\nuse dep::protocol_types::abis::function_selector::FunctionSelector;\nuse crate::context::inputs::public_context_inputs::PublicContextInputs;\nuse crate::context::gas::GasOpts;\nuse crate::hash::ArgsHasher;\n\nstruct PublicContext {\n inputs: PublicContextInputs,\n args_hash: Option<Field>\n}\n\nimpl PublicContext {\n pub fn new(inputs: PublicContextInputs) -> Self {\n PublicContext { inputs, args_hash: Option::none() }\n }\n\n pub fn emit_unencrypted_log<T, let N: u32>(_self: &mut Self, log: T) where T: Serialize<N> {\n emit_unencrypted_log(Serialize::serialize(log).as_slice());\n }\n\n pub fn note_hash_exists(_self: Self, note_hash: Field, leaf_index: Field) -> bool {\n 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 l1_to_l2_msg_exists(msg_hash, msg_leaf_index) == 1\n }\n\n fn nullifier_exists(_self: Self, unsiloed_nullifier: Field, address: AztecAddress) -> bool {\n nullifier_exists(unsiloed_nullifier, address.to_field()) == 1\n }\n\n 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_message_hash(\n sender,\n self.chain_id(),\n /*recipient=*/ self.this_address(),\n self.version(),\n content,\n secret_hash\n );\n let nullifier = compute_message_nullifier(message_hash, secret, leaf_index);\n\n assert(\n !self.nullifier_exists(nullifier, self.this_address()), \"L1-to-L2 message is already nullified\"\n );\n assert(\n self.l1_to_l2_msg_exists(message_hash, leaf_index), \"Tried to consume nonexistent L1-to-L2 message\"\n );\n\n self.push_nullifier(nullifier);\n }\n\n fn message_portal(_self: &mut Self, recipient: EthAddress, content: Field) {\n send_l2_to_l1_msg(recipient, content);\n }\n\n fn call_public_function<let RETURNS_COUNT: u32>(\n _self: &mut Self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field],\n gas_opts: GasOpts\n ) -> FunctionReturns<RETURNS_COUNT> {\n let results = call(\n gas_for_call(gas_opts),\n contract_address,\n args,\n function_selector.to_field()\n );\n let data_to_return: [Field; RETURNS_COUNT] = results.0;\n let success: u8 = results.1;\n assert(success == 1, \"Nested call failed!\");\n\n FunctionReturns::new(data_to_return)\n }\n\n fn static_call_public_function<let RETURNS_COUNT: u32>(\n _self: &mut Self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field],\n gas_opts: GasOpts\n ) -> FunctionReturns<RETURNS_COUNT> {\n let (data_to_return, success): ([Field; RETURNS_COUNT], u8) = call_static(\n gas_for_call(gas_opts),\n contract_address,\n args,\n function_selector.to_field()\n );\n\n assert(success == 1, \"Nested static call failed!\");\n FunctionReturns::new(data_to_return)\n }\n\n fn delegate_call_public_function<let RETURNS_COUNT: u32>(\n _self: &mut Self,\n _contract_address: AztecAddress,\n _function_selector: FunctionSelector,\n _args: [Field]\n ) -> FunctionReturns<RETURNS_COUNT> {\n assert(false, \"'delegate_call_public_function' not implemented!\");\n FunctionReturns::new([0; RETURNS_COUNT])\n }\n\n fn push_note_hash(_self: &mut Self, note_hash: Field) {\n emit_note_hash(note_hash);\n }\n fn push_nullifier(_self: &mut Self, nullifier: Field) {\n emit_nullifier(nullifier);\n }\n\n fn this_address(_self: Self) -> AztecAddress {\n address()\n }\n pub fn storage_address(_self: Self) -> AztecAddress {\n storage_address()\n }\n fn msg_sender(_self: Self) -> AztecAddress {\n sender()\n }\n fn selector(_self: Self) -> FunctionSelector {\n FunctionSelector::from_u32(function_selector())\n }\n fn get_args_hash(mut self) -> Field {\n if !self.args_hash.is_some() {\n let mut hasher = ArgsHasher::new();\n\n // TODO: this should be replaced with the compile-time calldata size.\n for i in 0..self.inputs.calldata_length as u32 {\n let argn: [Field; 1] = calldata_copy((2 + i) as u32, 1);\n hasher.add(argn[0]);\n }\n\n self.args_hash = Option::some(hasher.hash());\n }\n\n self.args_hash.unwrap()\n }\n fn transaction_fee(_self: Self) -> Field {\n transaction_fee()\n }\n\n fn chain_id(_self: Self) -> Field {\n chain_id()\n }\n fn version(_self: Self) -> Field {\n version()\n }\n fn block_number(_self: Self) -> Field {\n block_number()\n }\n fn timestamp(_self: Self) -> u64 {\n timestamp()\n }\n pub fn fee_per_l2_gas(_self: Self) -> Field {\n fee_per_l2_gas()\n }\n pub fn fee_per_da_gas(_self: Self) -> Field {\n fee_per_da_gas()\n }\n\n fn l2_gas_left(_self: Self) -> Field {\n l2_gas_left()\n }\n fn da_gas_left(_self: Self) -> Field {\n da_gas_left()\n }\n\n 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 out[i] = storage_read(storage_slot + i as Field);\n }\n out\n }\n\n fn storage_read<T, let N: u32>(self, storage_slot: Field) -> T where T: Deserialize<N> {\n T::deserialize(self.raw_storage_read(storage_slot))\n }\n\n fn raw_storage_write<let N: u32>(_self: Self, storage_slot: Field, values: [Field; N]) {\n for i in 0..N {\n storage_write(storage_slot + i as Field, values[i]);\n }\n }\n\n fn storage_write<T, let N: u32>(self, storage_slot: Field, value: T) where T: Serialize<N> {\n self.raw_storage_write(storage_slot, value.serialize());\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 [\n user_gas.l2_gas.unwrap_or(MAX_FIELD_VALUE),\n user_gas.da_gas.unwrap_or(MAX_FIELD_VALUE)\n ]\n}\n\n// Unconstrained opcode wrappers (do not use directly).\n// TODO(https://github.com/AztecProtocol/aztec-packages/issues/6420): reconsider.\nunconstrained fn address() -> AztecAddress {\n address_opcode()\n}\nunconstrained fn storage_address() -> AztecAddress {\n storage_address_opcode()\n}\nunconstrained fn sender() -> AztecAddress {\n sender_opcode()\n}\nunconstrained fn portal() -> EthAddress {\n portal_opcode()\n}\nunconstrained fn function_selector() -> u32 {\n function_selector_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 note_hash_exists(note_hash: Field, leaf_index: Field) -> u8 {\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) -> u8 {\n nullifier_exists_opcode(nullifier, address)\n}\nunconstrained fn emit_nullifier(nullifier: Field) {\n emit_nullifier_opcode(nullifier)\n}\nunconstrained fn emit_unencrypted_log(message: [Field]) {\n emit_unencrypted_log_opcode(message)\n}\nunconstrained fn l1_to_l2_msg_exists(msg_hash: Field, msg_leaf_index: Field) -> u8 {\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<let RET_SIZE: u32>(\n gas: [Field; 2],\n address: AztecAddress,\n args: [Field],\n function_selector: Field\n) -> ([Field; RET_SIZE], u8) {\n call_opcode(gas, address, args, function_selector)\n}\nunconstrained fn call_static<let RET_SIZE: u32>(\n gas: [Field; 2],\n address: AztecAddress,\n args: [Field],\n function_selector: Field\n) -> ([Field; RET_SIZE], u8) {\n call_static_opcode(gas, address, args, function_selector)\n}\n\nunconstrained fn calldata_copy<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {\n calldata_copy_opcode(cdoffset, copy_size)\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(PublicContextInputs::empty())\n }\n}\n\n// AVM oracles (opcodes) follow, do not use directly.\n#[oracle(avmOpcodeAddress)]\nunconstrained fn address_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodeStorageAddress)]\nunconstrained fn storage_address_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodeSender)]\nunconstrained fn sender_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodePortal)]\nunconstrained fn portal_opcode() -> EthAddress {}\n\n#[oracle(avmOpcodeFunctionSelector)]\nunconstrained fn function_selector_opcode() -> u32 {}\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(avmOpcodeNoteHashExists)]\nunconstrained fn note_hash_exists_opcode(note_hash: Field, leaf_index: Field) -> u8 {}\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) -> u8 {}\n\n#[oracle(avmOpcodeEmitNullifier)]\nunconstrained fn emit_nullifier_opcode(nullifier: Field) {}\n\n#[oracle(avmOpcodeEmitUnencryptedLog)]\nunconstrained fn emit_unencrypted_log_opcode(message: [Field]) {}\n\n#[oracle(avmOpcodeL1ToL2MsgExists)]\nunconstrained fn l1_to_l2_msg_exists_opcode(msg_hash: Field, msg_leaf_index: Field) -> u8 {}\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(avmOpcodeCall)]\nunconstrained fn call_opcode<let RET_SIZE: u32>(\n gas: [Field; 2], // gas allocation: [l2_gas, da_gas]\n address: AztecAddress,\n args: [Field],\n // TODO(5110): consider passing in calldata directly\n function_selector: Field\n) -> ([Field; RET_SIZE], u8) {}\n// ^ return data ^ success\n\n#[oracle(avmOpcodeStaticCall)]\nunconstrained fn call_static_opcode<let RET_SIZE: u32>(\n gas: [Field; 2], // gas allocation: [l2_gas, da_gas]\n address: AztecAddress,\n args: [Field],\n // TODO(5110): consider passing in calldata directly\n function_selector: Field\n) -> ([Field; RET_SIZE], u8) {}\n// ^ return data ^ success\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\nstruct FunctionReturns<let N: u32> {\n values: [Field; N]\n}\n\nimpl<let N: u32> FunctionReturns<N> {\n pub fn new(values: [Field; N]) -> FunctionReturns<N> {\n FunctionReturns { values }\n }\n\n pub fn raw(self) -> [Field; N] {\n self.values\n }\n\n pub fn deserialize_into<T>(self) -> T where T: Deserialize<N> {\n Deserialize::deserialize(self.raw())\n }\n}\n\nimpl FunctionReturns<0> {\n pub fn assert_empty(self) {\n assert(self.values.len() == 0);\n }\n}\n"},"144":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/hash.nr","source":"use dep::protocol_types::{\n address::{AztecAddress, EthAddress},\n constants::{GENERATOR_INDEX__SECRET_HASH, GENERATOR_INDEX__MESSAGE_NULLIFIER, GENERATOR_INDEX__FUNCTION_ARGS},\n point::Point, traits::Hash,\n hash::{sha256_to_field, poseidon2_hash_with_separator, poseidon2_hash_with_separator_slice}\n};\nuse crate::oracle::logs_traits::ToBytesForUnencryptedLog;\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_unencrypted_log_hash<T, let N: u32, let M: u32>(\n contract_address: AztecAddress,\n log: T\n) -> Field where T: ToBytesForUnencryptedLog<N, M> {\n let message_bytes: [u8; N] = log.to_be_bytes_arr();\n // can't use N - not in scope error\n let n = message_bytes.len();\n let mut hash_bytes = [0; M];\n // Address is converted to 32 bytes in ts\n let address_bytes = contract_address.to_be_bytes_arr();\n for i in 0..32 {\n hash_bytes[i] = address_bytes[i];\n }\n let len_bytes: [u8; 4] = (n as Field).to_be_bytes();\n for i in 0..4 {\n hash_bytes[32 + i] = len_bytes[i];\n }\n for i in 0..n {\n hash_bytes[36 + i] = message_bytes[i];\n }\n\n sha256_to_field(hash_bytes)\n}\n\npub fn compute_message_hash(\n sender: EthAddress,\n chain_id: Field,\n recipient: AztecAddress,\n version: Field,\n content: Field,\n secret_hash: Field\n) -> Field {\n let mut hash_bytes = [0 as u8; 192];\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\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 }\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 and index of the message hash\n// in the L1 to L2 message tree\npub fn compute_message_nullifier(message_hash: Field, secret: Field, leaf_index: Field) -> Field {\n poseidon2_hash_with_separator(\n [message_hash, secret, leaf_index],\n GENERATOR_INDEX__MESSAGE_NULLIFIER\n )\n}\n\nstruct ArgsHasher {\n 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\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\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#[test]\nfn 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\n#[test]\nfn compute_unenc_log_hash_array() {\n let contract_address = AztecAddress::from_field(0x233a3e0df23b2b15b324194cb4a151f26c0b7333250781d34cc269d85dc334c6);\n let log = [\n 0x20660de09f35f876e3e69d227b2a35166ad05f09d82d06366ec9b6f65a51fec2,\n 0x1b52bfe3b8689761916f76dc3d38aa8810860db325cd39ca611eed980091f01c,\n 0x2e559c4045c378a56ad13b9edb1e8de4e7ad3b3aa35cc7ba9ec77f7a68fa43a4,\n 0x25d0f689c4a4178a29d59306f2675824d19be6d25e44fa03b03f49c263053dd2,\n 0x2d513a722d6f352dc0961f156afdc5e31495b9f0e35cb069261a8e55e2df67fd\n ];\n let hash = compute_unencrypted_log_hash(contract_address, log);\n assert(hash == 0x0095b2d17ab72f4b27a341f7ac63e49ec73935ae8c9181a0ac02023eb12f3284);\n}\n\n#[test]\nfn compute_unenc_log_hash_addr() {\n let contract_address = AztecAddress::from_field(0x233a3e0df23b2b15b324194cb4a151f26c0b7333250781d34cc269d85dc334c6);\n let log = AztecAddress::from_field(0x26aa302d4715fd8a687453cb26d616b0768027bd54bcae56b09d908ecd9f8303);\n let hash = compute_unencrypted_log_hash(contract_address, log);\n assert(hash == 0x0083ab647dfb26e7ddee90a0f4209d049d4660cab42000c544b986aaa84c55a3);\n}\n\n#[test]\nfn compute_unenc_log_hash_str() {\n let contract_address = AztecAddress::from_field(0x1b401e1146c5c507962287065c81f0ef7590adae3802c533d7549d6bf0a41bd8);\n let log = \"dummy\";\n let hash = compute_unencrypted_log_hash(contract_address, log);\n assert(hash == 0x00629e88ebd6374f44aa6cfe07e251ecf07213ebc7267e8f6b578ae57ffd6c20);\n}\n\n#[test]\nfn compute_unenc_log_hash_longer_str() {\n let contract_address = AztecAddress::from_field(0x1b401e1146c5c507962287065c81f0ef7590adae3802c533d7549d6bf0a41bd8);\n let log = \"Hello this is a string\";\n let hash = compute_unencrypted_log_hash(contract_address, log);\n assert(hash == 0x0098637962f7d34fa202b7ffad8a07a238c5d1fd897b82a108f7f467fa73b841);\n}\n"},"154":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/oracle/storage.nr","source":"use dep::protocol_types::{address::AztecAddress, traits::Deserialize};\n\n#[oracle(storageRead)]\nunconstrained fn storage_read_oracle<let N: u32>(address: Field, storage_slot: Field, block_number: Field, length: Field) -> [Field; N] {}\n\nunconstrained pub fn raw_storage_read<let N: u32>(\n address: AztecAddress,\n storage_slot: Field,\n block_number: u32\n) -> [Field; N] {\n storage_read_oracle(\n address.to_field(),\n storage_slot,\n block_number as Field,\n N as Field\n )\n}\n\nunconstrained pub fn storage_read<T, let N: u32>(\n address: AztecAddress,\n storage_slot: Field,\n block_number: u32\n) -> T where T: Deserialize<N> {\n T::deserialize(raw_storage_read(address, storage_slot, block_number))\n}\n\nmod tests {\n use crate::oracle::storage::{raw_storage_read, storage_read};\n use dep::protocol_types::address::AztecAddress;\n\n use std::test::OracleMock;\n use crate::test::mocks::mock_struct::MockStruct;\n\n global address = AztecAddress::from_field(29);\n global slot = 7;\n global block_number = 17;\n\n #[test]\n fn test_raw_storage_read() {\n let written = MockStruct { a: 13, b: 42 };\n\n let _ = OracleMock::mock(\"storageRead\").returns(written.serialize());\n\n let read: [Field; 2] = raw_storage_read(address, slot, block_number);\n assert_eq(read[0], 13);\n assert_eq(read[1], 42);\n }\n\n #[test]\n fn test_storage_read() {\n let written = MockStruct { a: 13, b: 42 };\n\n let _ = OracleMock::mock(\"storageRead\").returns(written.serialize());\n\n let read: MockStruct = storage_read(address, slot, block_number);\n assert_eq(read.a, 13);\n assert_eq(read.b, 42);\n }\n}\n"},"164":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/oracle/execution.nr","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\nunconstrained pub fn get_contract_address() -> AztecAddress {\n get_contract_address_oracle()\n}\n\nunconstrained pub fn get_block_number() -> u32 {\n get_block_number_oracle()\n}\n\nunconstrained pub fn get_chain_id() -> Field {\n get_chain_id_oracle()\n}\n\nunconstrained pub fn get_version() -> Field {\n get_version_oracle()\n}\n"},"167":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/state_vars/map.nr","source":"use dep::protocol_types::{storage::map::derive_storage_slot_in_map, traits::ToField};\nuse crate::state_vars::storage::Storage;\n\n// docs:start:map\nstruct Map<K, V, Context> {\n context: Context,\n storage_slot: Field,\n state_var_constructor: fn(Context, Field) -> V,\n}\n// docs:end:map\n\nimpl<K, T, Context> Storage<T> for Map<K, T, Context> {}\n\nimpl<K, V, Context> Map<K, V, Context> {\n // docs:start:new\n pub fn new(\n context: Context,\n storage_slot: Field,\n state_var_constructor: fn(Context, Field) -> V\n ) -> Self {\n assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n Map { context, storage_slot, state_var_constructor }\n }\n // docs:end:new\n\n // docs:start:at\n pub fn at(self, key: K) -> V where K: ToField {\n // TODO(#1204): use a generator index for the storage slot\n let derived_storage_slot = derive_storage_slot_in_map(self.storage_slot, key);\n\n let state_var_constructor = self.state_var_constructor;\n state_var_constructor(self.context, derived_storage_slot)\n }\n // docs:end:at\n}\n\n"},"169":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/state_vars/public_mutable.nr","source":"use crate::context::{PublicContext, UnconstrainedContext};\nuse dep::protocol_types::traits::{Deserialize, Serialize};\nuse crate::state_vars::storage::Storage;\n\n// docs:start:public_mutable_struct\nstruct PublicMutable<T, Context> {\n context: Context,\n storage_slot: Field,\n}\n// docs:end:public_mutable_struct\n\nimpl<T, Context> Storage<T> for PublicMutable<T, Context> {}\n\nimpl<T, Context> PublicMutable<T, Context> {\n // docs:start:public_mutable_struct_new\n pub fn new(\n // Note: Passing the contexts to new(...) just to have an interface compatible with a Map.\n context: Context,\n storage_slot: Field\n ) -> Self {\n assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n PublicMutable { context, storage_slot }\n }\n // docs:end:public_mutable_struct_new\n}\n\nimpl<T, T_SERIALIZED_LEN> PublicMutable<T, &mut PublicContext> where T: Serialize<T_SERIALIZED_LEN> + Deserialize<T_SERIALIZED_LEN> {\n // docs:start:public_mutable_struct_read\n pub fn read(self) -> T {\n self.context.storage_read(self.storage_slot)\n }\n // docs:end:public_mutable_struct_read\n\n // docs:start:public_mutable_struct_write\n pub fn write(self, value: T) {\n self.context.storage_write(self.storage_slot, value);\n }\n // docs:end:public_mutable_struct_write\n}\n\nimpl<T, T_SERIALIZED_LEN> PublicMutable<T, UnconstrainedContext> where T: Deserialize<T_SERIALIZED_LEN> {\n unconstrained pub fn read(self) -> T {\n self.context.storage_read(self.storage_slot)\n }\n}\n"},"222":{"path":"/usr/src/noir-projects/noir-protocol-circuits/crates/types/src/abis/function_selector.nr","source":"use crate::utils::field::field_from_bytes;\nuse crate::traits::{Serialize, Deserialize, FromField, ToField, Empty};\n\nglobal SELECTOR_SIZE = 4;\n\nstruct FunctionSelector {\n // 1st 4-bytes of abi-encoding of function.\n inner: u32,\n}\n\nimpl Eq for FunctionSelector {\n fn eq(self, function_selector: FunctionSelector) -> bool {\n function_selector.inner == self.inner\n }\n}\n\nimpl Serialize<1> for FunctionSelector {\n fn serialize(self: Self) -> [Field; 1] {\n [self.inner as Field]\n }\n}\n\nimpl Deserialize<1> for FunctionSelector {\n fn deserialize(fields: [Field; 1]) -> Self {\n Self { inner: fields[0] as u32 }\n }\n}\n\nimpl FromField for FunctionSelector {\n fn from_field(field: Field) -> Self {\n Self { inner: field as u32 }\n }\n}\n\nimpl ToField for FunctionSelector {\n fn to_field(self) -> Field {\n self.inner as Field\n }\n}\n\nimpl Empty for FunctionSelector {\n fn empty() -> Self {\n Self { inner: 0 as u32 }\n }\n}\n\nimpl FunctionSelector {\n pub fn from_u32(value: u32) -> Self {\n Self { inner: value }\n }\n\n pub fn from_signature<let N: u32>(signature: str<N>) -> Self {\n let bytes = signature.as_bytes();\n let hash = crate::hash::poseidon2_hash_bytes(bytes);\n\n // We choose the last SELECTOR_SIZE bytes of the hash to avoid getting the first byte that is not full\n let hash_bytes = hash.to_be_bytes::<SELECTOR_SIZE>();\n\n FunctionSelector::from_field(field_from_bytes(hash_bytes, true))\n }\n\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n}\n\n#[test]\nfn test_is_valid_selector() {\n let selector = FunctionSelector::from_signature(\"IS_VALID()\");\n assert_eq(selector.to_field(), 0x73cdda47);\n}\n\n#[test]\nfn test_long_selector() {\n let selector = FunctionSelector::from_signature(\"foo_and_bar_and_baz_and_foo_bar_baz_and_bar_foo\");\n assert_eq(selector.to_field(), 0x7590a997);\n}\n"},"24":{"path":"std/embedded_curve_ops.nr","source":"use crate::ops::arith::{Add, Sub, Neg};\nuse crate::cmp::Eq;\n\n/// A point on the embedded elliptic curve\n/// By definition, the base field of the embedded curve is the scalar field of the proof system curve, i.e the Noir Field.\n/// x and y denotes the Weierstrass coordinates of the point, if is_infinite is false.\nstruct EmbeddedCurvePoint {\n x: Field,\n y: Field,\n is_infinite: bool\n}\n\nimpl EmbeddedCurvePoint {\n /// Elliptic curve point doubling operation\n /// returns the doubled point of a point P, i.e P+P\n fn double(self) -> EmbeddedCurvePoint {\n embedded_curve_add(self, self)\n }\n\n /// Returns the null element of the curve; 'the point at infinity'\n fn point_at_infinity() -> EmbeddedCurvePoint {\n EmbeddedCurvePoint { x: 0, y: 0, is_infinite: true }\n }\n}\n\nimpl Add for EmbeddedCurvePoint {\n /// Adds two points P+Q, using the curve addition formula, and also handles point at infinity\n fn add(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n embedded_curve_add(self, other)\n }\n}\n\nimpl Sub for EmbeddedCurvePoint {\n /// Points subtraction operation, using addition and negation\n fn sub(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n self + other.neg()\n }\n}\n\nimpl Neg for EmbeddedCurvePoint {\n /// Negates a point P, i.e returns -P, by negating the y coordinate.\n /// If the point is at infinity, then the result is also at infinity.\n fn neg(self) -> EmbeddedCurvePoint {\n EmbeddedCurvePoint { x: self.x, y: -self.y, is_infinite: self.is_infinite }\n }\n}\n\nimpl Eq for EmbeddedCurvePoint {\n /// Checks whether two points are equal\n fn eq(self: Self, b: EmbeddedCurvePoint) -> bool {\n (self.is_infinite & b.is_infinite)\n | ((self.is_infinite == b.is_infinite) & (self.x == b.x) & (self.y == b.y))\n }\n}\n\n/// Scalar for the embedded curve represented as low and high limbs\n/// By definition, the scalar field of the embedded curve is base field of the proving system curve.\n/// It may not fit into a Field element, so it is represented with two Field elements; its low and high limbs.\nstruct EmbeddedCurveScalar {\n lo: Field,\n hi: Field,\n}\n\nimpl EmbeddedCurveScalar {\n pub fn new(lo: Field, hi: Field) -> Self {\n EmbeddedCurveScalar { lo, hi }\n }\n\n #[field(bn254)]\n fn from_field(scalar: Field) -> EmbeddedCurveScalar {\n let (a,b) = crate::field::bn254::decompose(scalar);\n EmbeddedCurveScalar { lo: a, hi: b }\n }\n}\n\nimpl Eq for EmbeddedCurveScalar {\n fn eq(self, other: Self) -> bool {\n (other.hi == self.hi) & (other.lo == self.lo)\n }\n}\n\n// Computes a multi scalar multiplication over the embedded curve.\n// For bn254, We have Grumpkin and Baby JubJub.\n// For bls12-381, we have JubJub and Bandersnatch.\n//\n// The embedded curve being used is decided by the \n// underlying proof system.\n// docs:start:multi_scalar_mul\npub fn multi_scalar_mul<let N: u32>(\n points: [EmbeddedCurvePoint; N],\n scalars: [EmbeddedCurveScalar; N]\n) -> EmbeddedCurvePoint\n// docs:end:multi_scalar_mul\n{\n let point_array = multi_scalar_mul_array_return(points, scalars);\n EmbeddedCurvePoint { x: point_array[0], y: point_array[1], is_infinite: point_array[2] as bool }\n}\n\n#[foreign(multi_scalar_mul)]\nfn multi_scalar_mul_array_return<let N: u32>(points: [EmbeddedCurvePoint; N], scalars: [EmbeddedCurveScalar; N]) -> [Field; 3] {}\n\n#[foreign(multi_scalar_mul)]\npub(crate) fn multi_scalar_mul_slice(points: [EmbeddedCurvePoint], scalars: [EmbeddedCurveScalar]) -> [Field; 3] {}\n\n// docs:start:fixed_base_scalar_mul\npub fn fixed_base_scalar_mul(scalar: EmbeddedCurveScalar) -> EmbeddedCurvePoint\n// docs:end:fixed_base_scalar_mul\n{\n let g1 = EmbeddedCurvePoint { x: 1, y: 17631683881184975370165255887551781615748388533673675138860, is_infinite: false };\n multi_scalar_mul([g1], [scalar])\n}\n\n// This is a hack as returning an `EmbeddedCurvePoint` from a foreign function in brillig returns a [BrilligVariable::SingleAddr; 2] rather than BrilligVariable::BrilligArray\n// as is defined in the brillig bytecode format. This is a workaround which allows us to fix this without modifying the serialization format.\n// docs:start:embedded_curve_add\nfn embedded_curve_add(\n point1: EmbeddedCurvePoint,\n point2: EmbeddedCurvePoint\n) -> EmbeddedCurvePoint\n// docs:end:embedded_curve_add\n{\n let point_array = embedded_curve_add_array_return(point1, point2);\n let x = point_array[0];\n let y = point_array[1];\n EmbeddedCurvePoint { x, y, is_infinite: point_array[2] == 1 }\n}\n\n#[foreign(embedded_curve_add)]\nfn embedded_curve_add_array_return(_point1: EmbeddedCurvePoint, _point2: EmbeddedCurvePoint) -> [Field; 3] {}\n"},"259":{"path":"/usr/src/noir-projects/noir-protocol-circuits/crates/types/src/storage/map.nr","source":"use crate::{hash::pedersen_hash, traits::ToField};\n\npub fn derive_storage_slot_in_map<K>(storage_slot: Field, key: K) -> Field where K: ToField {\n pedersen_hash([storage_slot, key.to_field()], 0)\n}\n\nmod test {\n use crate::{address::AztecAddress, storage::map::derive_storage_slot_in_map};\n\n #[test]\n fn test_derive_storage_slot_in_map_matches_typescript() {\n let map_slot = 0x132258fb6962c4387ba659d9556521102d227549a386d39f0b22d1890d59c2b5;\n let key = AztecAddress::from_field(0x302dbc2f9b50a73283d5fb2f35bc01eae8935615817a0b4219a057b2ba8a5a3f);\n\n let slot = derive_storage_slot_in_map(map_slot, key);\n\n // The following value was generated by `map_slot.test.ts`\n let slot_from_typescript = 0x2499880e2b1b831785c17286f99a0d5122fee784ce7b1c04e380c4a991da819a;\n\n assert_eq(slot, slot_from_typescript);\n }\n}\n"},"264":{"path":"/usr/src/noir-projects/noir-protocol-circuits/crates/types/src/type_serialization.nr","source":"use crate::traits::{Serialize, Deserialize};\n\nglobal BOOL_SERIALIZED_LEN: Field = 1;\nglobal U8_SERIALIZED_LEN: Field = 1;\nglobal U32_SERIALIZED_LEN: Field = 1;\nglobal U64_SERIALIZED_LEN: Field = 1;\nglobal U128_SERIALIZED_LEN: Field = 1;\nglobal FIELD_SERIALIZED_LEN: Field = 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; U32_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<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; 1] {\n [self.to_integer()]\n }\n}\n\nimpl Deserialize<U128_SERIALIZED_LEN> for U128 {\n fn deserialize(fields: [Field; U128_SERIALIZED_LEN]) -> Self {\n U128::from_integer(fields[0])\n }\n}\n\nimpl Serialize<FIELD_SERIALIZED_LEN> for Field {\n fn serialize(self) -> [Field; U32_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"},"265":{"path":"/usr/src/noir-projects/noir-protocol-circuits/crates/types/src/traits.nr","source":"use crate::utils::field::field_from_bytes;\n\n// Trait: is_empty\n//\n// The general is_empty trait checks if a data type is is empty,\n// and it defines empty for the basic data types as 0.\n//\n// If a Field is equal to zero, then it is regarded as zero.\n// We will go with this definition for now, however it can be problematic \n// if a value can actually be zero. In a future refactor, we can \n// use the optional type for safety. Doing it now would lead to a worse devex\n// and would make it harder to sync up with the cpp code.\n// Preferred over Default trait to convey intent, as default doesn't necessarily mean empty.\ntrait Empty {\n fn empty() -> Self;\n}\n\nimpl Empty for Field {\n fn empty() -> Self {\n 0\n }\n}\n\nimpl Empty for u1 {\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u8 {\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u32 {\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u64 {\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for U128 {\n fn empty() -> Self {\n U128::from_integer(0)\n }\n}\n\npub fn is_empty<T>(item: T) -> bool where T: Empty + Eq {\n item.eq(T::empty())\n}\n\npub fn is_empty_array<T, let N: u32>(array: [T; N]) -> bool where T: Empty + Eq {\n array.all(|elem| is_empty(elem))\n}\n\ntrait Hash {\n fn hash(self) -> Field;\n}\n\ntrait ToField {\n fn to_field(self) -> Field;\n}\n\nimpl ToField for Field {\n fn to_field(self) -> Field {\n self\n }\n}\n\nimpl ToField for bool {\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u1 {\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u8 {\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u32 {\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u64 {\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for U128 {\n fn to_field(self) -> Field {\n self.to_integer()\n }\n}\nimpl<let N: u32> ToField for str<N> {\n fn to_field(self) -> Field {\n assert(N < 32, \"String doesn't fit in a field, consider using Serialize instead\");\n field_from_bytes(self.as_bytes(), true)\n }\n}\n\ntrait FromField {\n fn from_field(value: Field) -> Self;\n}\n\nimpl FromField for Field {\n fn from_field(value: Field) -> Self {\n value\n }\n}\n\nimpl FromField for bool {\n fn from_field(value: Field) -> Self {\n value as bool\n }\n}\nimpl FromField for u1 {\n fn from_field(value: Field) -> Self {\n value as u1\n }\n}\nimpl FromField for u8 {\n fn from_field(value: Field) -> Self {\n value as u8\n }\n}\nimpl FromField for u32 {\n fn from_field(value: Field) -> Self {\n value as u32\n }\n}\nimpl FromField for u64 {\n fn from_field(value: Field) -> Self {\n value as u64\n }\n}\nimpl FromField for U128 {\n fn from_field(value: Field) -> Self {\n U128::from_integer(value)\n }\n}\n\n// docs:start:serialize\ntrait Serialize<let N: u32> {\n fn serialize(self) -> [Field; N];\n}\n// docs:end:serialize\n\nimpl<let N: u32> Serialize<N> for [Field; N] {\n fn serialize(self) -> [Field; N] {\n self\n }\n}\nimpl<let N: u32> Serialize<N> for str<N> {\n fn serialize(self) -> [Field; N] {\n let mut result = [0; N];\n let bytes: [u8; N] = self.as_bytes();\n for i in 0..N {\n result[i] = field_from_bytes([bytes[i];1], true);\n }\n result\n }\n}\n\n// docs:start:deserialize\ntrait Deserialize<let N: u32> {\n fn deserialize(fields: [Field; N]) -> Self;\n}\n// docs:end:deserialize\n\nimpl<let N: u32> Deserialize<N> for [Field; N] {\n fn deserialize(fields: [Field; N]) -> Self {\n fields\n }\n}\n"},"270":{"path":"/usr/src/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr","source":"use crate::{\n abis::{\n contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n function_selector::FunctionSelector, log_hash::{LogHash, ScopedLogHash, ScopedEncryptedLogHash},\n note_hash::ScopedNoteHash, nullifier::ScopedNullifier\n},\n address::{AztecAddress, EthAddress},\n constants::{\n FUNCTION_TREE_HEIGHT, GENERATOR_INDEX__SILOED_NOTE_HASH, GENERATOR_INDEX__OUTER_NULLIFIER,\n GENERATOR_INDEX__VK, GENERATOR_INDEX__NOTE_HASH_NONCE, GENERATOR_INDEX__UNIQUE_NOTE_HASH,\n MAX_ENCRYPTED_LOGS_PER_TX, MAX_NOTE_ENCRYPTED_LOGS_PER_TX\n},\n merkle_tree::root::root_from_sibling_path,\n messaging::l2_to_l1_message::{L2ToL1Message, ScopedL2ToL1Message},\n recursion::verification_key::VerificationKey, traits::{is_empty, ToField},\n utils::field::field_from_bytes_32_trunc\n};\nuse super::utils::field::field_from_bytes;\n\npub fn sha256_to_field<let N: u32>(bytes_to_hash: [u8; N]) -> Field {\n let sha256_hashed = std::hash::sha256(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(function_leaf, function_leaf_index, function_leaf_sibling_path)\n}\n\nfn compute_note_hash_nonce(tx_hash: Field, note_index_in_tx: u32) -> Field {\n // Hashing tx hash with note index in tx is guaranteed to be unique\n poseidon2_hash_with_separator(\n [\n tx_hash,\n note_index_in_tx as Field\n ],\n GENERATOR_INDEX__NOTE_HASH_NONCE\n )\n}\n\npub fn compute_unique_note_hash(nonce: Field, note_hash: Field) -> Field {\n let inputs = [nonce, note_hash];\n poseidon2_hash_with_separator(inputs, GENERATOR_INDEX__UNIQUE_NOTE_HASH)\n}\n\npub fn compute_siloed_note_hash(app: AztecAddress, unique_note_hash: Field) -> Field {\n poseidon2_hash_with_separator(\n [\n app.to_field(),\n unique_note_hash\n ],\n GENERATOR_INDEX__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, tx_hash: Field, note_index_in_tx: u32) -> Field {\n if note_hash.contract_address.is_zero() {\n 0\n } else {\n let nonce = compute_note_hash_nonce(tx_hash, note_index_in_tx);\n let unique_note_hash = compute_unique_note_hash(nonce, note_hash.value());\n compute_siloed_note_hash(note_hash.contract_address, unique_note_hash)\n }\n}\n\npub fn compute_siloed_nullifier(app: AztecAddress, nullifier: Field) -> Field {\n poseidon2_hash_with_separator(\n [\n app.to_field(),\n nullifier\n ],\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 silo_encrypted_log_hash(log_hash: ScopedLogHash) -> Field {\n // We assume contract address has already been masked\n if log_hash.contract_address.is_zero() {\n 0\n } else {\n accumulate_sha256([log_hash.contract_address.to_field(), log_hash.log_hash.value])\n }\n}\n\npub fn mask_encrypted_log_hash(scoped_log: ScopedEncryptedLogHash) -> AztecAddress {\n if scoped_log.contract_address.is_zero() {\n AztecAddress::from_field(0)\n } else if (scoped_log.log_hash.randomness == 0) {\n scoped_log.contract_address\n } else {\n AztecAddress::from_field(\n poseidon2_hash_with_separator(\n [scoped_log.contract_address.to_field(), scoped_log.log_hash.randomness],\n 0\n )\n )\n }\n}\n\nfn compute_siloed_unencrypted_log_hash(address: AztecAddress, log_hash: Field) -> Field {\n accumulate_sha256([address.to_field(), log_hash])\n}\n\npub fn silo_unencrypted_log_hash(log_hash: ScopedLogHash) -> Field {\n if log_hash.contract_address.is_zero() {\n 0\n } else {\n compute_siloed_unencrypted_log_hash(log_hash.contract_address, log_hash.value())\n }\n}\n\npub fn merkle_hash(left: Field, right: Field) -> Field {\n poseidon2_hash([left, right])\n}\n\npub fn stdlib_recursion_verification_key_compress_native_vk(_vk: VerificationKey) -> Field {\n // Original cpp code\n // stdlib::recursion::verification_key<CT::bn254>::compress_native(private_call.vk, GeneratorIndex::VK);\n // The above cpp method is only ever called on verification key, so it has been special cased here\n let _hash_index = GENERATOR_INDEX__VK;\n 0\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: BoundedVec<u8, 160> = BoundedVec::new();\n\n let inputs = [contract_address.to_field(), rollup_version_id, recipient.to_field(), chain_id, content];\n for i in 0..inputs.len() {\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.push(item_bytes[j]);\n }\n }\n\n sha256_to_field(bytes.storage)\n}\n\npub fn silo_l2_to_l1_message(msg: ScopedL2ToL1Message, rollup_version_id: Field, chain_id: Field) -> 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\n // Concatentate two fields into 32x2 = 64 bytes\n // accumulate_sha256 assumes that the inputs are pre-truncated 31 byte numbers\n let mut hash_input_flattened = [0; 64];\n for offset in 0..input.len() {\n let input_as_bytes: [u8; 32] = input[offset].to_be_bytes();\n for byte_index in 0..32 {\n hash_input_flattened[offset * 32 + byte_index] = input_as_bytes[byte_index];\n }\n }\n\n sha256_to_field(hash_input_flattened)\n}\n\n// Computes the final logs hash for a tx.\n// NB: this assumes MAX_ENCRYPTED_LOGS_PER_TX == MAX_UNENCRYPTED_LOGS_PER_TX\n// to avoid doubling code, since we can't define the byte len to be 32*N directly.\npub fn compute_tx_logs_hash(logs: [LogHash; MAX_ENCRYPTED_LOGS_PER_TX]) -> Field {\n // Convert each field element into a byte array and append the bytes to `hash_input_flattened`\n let mut hash_input_flattened = [0; MAX_ENCRYPTED_LOGS_PER_TX * 32];\n for offset in 0..MAX_ENCRYPTED_LOGS_PER_TX {\n let input_as_bytes: [u8; 32] = logs[offset].value.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 // Ideally we would push to a slice then hash, but there is no sha_slice\n // Hardcode to 256 bytes for now\n let mut hash = sha256_to_field(hash_input_flattened);\n // Not having a 0 value hash for empty logs causes issues with empty txs\n // used for padding. Returning early is currently unsupported.\n // We always provide sorted logs here, so 0 being empty means all are empty.\n if is_empty(logs[0]) {\n hash = 0;\n }\n hash\n}\n\npub fn compute_tx_note_logs_hash(logs: [LogHash; MAX_NOTE_ENCRYPTED_LOGS_PER_TX]) -> Field {\n // Convert each field element into a byte array and append the bytes to `hash_input_flattened`\n let mut hash_input_flattened = [0; MAX_NOTE_ENCRYPTED_LOGS_PER_TX * 32];\n for offset in 0..MAX_NOTE_ENCRYPTED_LOGS_PER_TX {\n let input_as_bytes: [u8; 32] = logs[offset].value.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 // Ideally we would push to a slice then hash, but there is no sha_slice\n // Hardcode to 256 bytes for now\n let mut hash = sha256_to_field(hash_input_flattened);\n // Not having a 0 value hash for empty logs causes issues with empty txs\n // used for padding. Returning early is currently unsupported.\n // We always provide sorted logs here, so 0 being empty means all are empty.\n if is_empty(logs[0]) {\n hash = 0;\n }\n hash\n}\n\npub fn 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>(\n inputs: [Field; N],\n separator: T\n) -> Field where T: ToField {\n // We manually hash the inputs here, since we cannot express with the type system a constant size inputs array of N + 1\n let in_len = N + 1;\n let two_pow_64 = 18446744073709551616;\n let iv : Field = (in_len as Field) * two_pow_64;\n let mut sponge = std::hash::poseidon2::Poseidon2::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\npub fn poseidon2_hash_with_separator_slice<T>(inputs: [Field], separator: T) -> Field where T: ToField {\n let in_len = inputs.len() + 1;\n let two_pow_64 = 18446744073709551616;\n let iv : Field = (in_len as Field) * two_pow_64;\n let mut sponge = std::hash::poseidon2::Poseidon2::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 // We manually hash the inputs here, since we cannot express with the type system a constant size inputs array of Math.ceil(N/31)\n let mut in_len = N / 31;\n let mut has_padding = false;\n if N % 31 != 0 {\n in_len += 1;\n has_padding = true;\n }\n\n let two_pow_64 = 18446744073709551616;\n let iv : Field = (in_len as Field) * two_pow_64;\n let mut sponge = std::hash::poseidon2::Poseidon2::new(iv);\n\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 sponge.absorb(field_from_bytes(current_field, false));\n current_field = [0; 31];\n }\n }\n if has_padding {\n sponge.absorb(field_from_bytes(current_field, false));\n }\n\n 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,\n 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39,\n 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59,\n 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79,\n 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99,\n 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119,\n 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139,\n 140, 141, 142, 143, 144, 145, 146, 147, 148, 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 = std::hash::sha256(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 = 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(AztecAddress::from_field(1), EthAddress::from_field(3), 5, 2, 4);\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"},"29":{"path":"std/hash/mod.nr","source":"mod poseidon;\nmod mimc;\nmod poseidon2;\nmod keccak;\nmod sha256;\nmod sha512;\n\nuse crate::default::Default;\nuse crate::uint128::U128;\nuse crate::collections::vec::Vec;\nuse crate::embedded_curve_ops::{EmbeddedCurvePoint, EmbeddedCurveScalar, multi_scalar_mul, multi_scalar_mul_slice};\nuse crate::meta::derive_via;\n\n// Kept for backwards compatibility\npub use sha256::{digest, sha256, sha256_compression, sha256_var};\n\n#[foreign(blake2s)]\n// docs:start:blake2s\npub fn blake2s<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake2s\n{}\n\n#[foreign(blake3)]\n// docs:start:blake3\npub fn blake3<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake3\n{}\n\n// docs:start:pedersen_commitment\npub fn pedersen_commitment<let N: u32>(input: [Field; N]) -> EmbeddedCurvePoint {\n // docs:end:pedersen_commitment\n pedersen_commitment_with_separator(input, 0)\n}\n\npub fn pedersen_hash_with_separator<let N: u32>(input: [Field; N], separator: u32) -> Field {\n __pedersen_hash_with_separator(input, separator)\n}\n\nfn pedersen_commitment_with_separator<let N: u32>(input: [Field; N], separator: u32) -> EmbeddedCurvePoint {\n let value = __pedersen_commitment_with_separator(input, separator);\n if (value[0] == 0) & (value[1] == 0) {\n EmbeddedCurvePoint { x: 0, y: 0, is_infinite: true }\n } else {\n EmbeddedCurvePoint { x: value[0], y: value[1], is_infinite: false }\n }\n}\n\n#[no_predicates]\nfn pedersen_commitment_with_separator_noir<let N: u32>(input: [Field; N], separator: u32) -> EmbeddedCurvePoint {\n let mut points = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N];\n for i in 0..N {\n // we use the unsafe version because the multi_scalar_mul will constrain the scalars.\n points[i] = from_field_unsafe(input[i]);\n }\n let generators = derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n multi_scalar_mul(generators, points)\n}\n\n#[no_predicates]\nfn pedersen_hash_with_separator_noir<let N: u32>(input: [Field; N], separator: u32) -> Field {\n let mut scalars: Vec<EmbeddedCurveScalar> = Vec::from_slice([EmbeddedCurveScalar { lo: 0, hi: 0 }; N].as_slice()); //Vec::new();\n\n for i in 0..N {\n scalars.set(i, from_field_unsafe(input[i]));\n }\n scalars.push(EmbeddedCurveScalar { lo: N as Field, hi: 0 as Field });\n let domain_generators :[EmbeddedCurvePoint; N]= derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n let mut vec_generators = Vec::new();\n for i in 0..N {\n vec_generators.push(domain_generators[i]);\n }\n let length_generator : [EmbeddedCurvePoint; 1] = derive_generators(\"pedersen_hash_length\".as_bytes(), 0);\n vec_generators.push(length_generator[0]);\n multi_scalar_mul_slice(vec_generators.slice, scalars.slice)[0]\n}\n\n// docs:start:pedersen_hash\npub fn pedersen_hash<let N: u32>(input: [Field; N]) -> Field\n// docs:end:pedersen_hash\n{\n __pedersen_hash_with_separator(input, 0)\n}\n\n#[foreign(pedersen_hash)]\nfn __pedersen_hash_with_separator<let N: u32>(input: [Field; N], separator: u32) -> Field {}\n\n#[foreign(pedersen_commitment)]\nfn __pedersen_commitment_with_separator<let N: u32>(input: [Field; N], separator: u32) -> [Field; 2] {}\n\n#[field(bn254)]\nfn derive_generators<let N: u32, let M: u32>(domain_separator_bytes: [u8; M], starting_index: u32) -> [EmbeddedCurvePoint; N] {\n crate::assert_constant(domain_separator_bytes);\n // TODO(https://github.com/noir-lang/noir/issues/5672): Add back assert_constant on starting_index\n __derive_generators(domain_separator_bytes, starting_index)\n}\n\n#[builtin(derive_pedersen_generators)]\n#[field(bn254)]\nfn __derive_generators<let N: u32, let M: u32>(\n domain_separator_bytes: [u8; M],\n starting_index: u32\n) -> [EmbeddedCurvePoint; N] {}\n\n#[field(bn254)]\n // Same as from_field but:\n // does not assert the limbs are 128 bits\n // does not assert the decomposition does not overflow the EmbeddedCurveScalar\n fn from_field_unsafe(scalar: Field) -> EmbeddedCurveScalar {\n let (xlo, xhi) = unsafe {\n crate::field::bn254::decompose_hint(scalar)\n };\n // Check that the decomposition is correct\n assert_eq(scalar, xlo + crate::field::bn254::TWO_POW_128 * xhi);\n EmbeddedCurveScalar { lo: xlo, hi: xhi }\n}\n\npub fn hash_to_field(inputs: [Field]) -> Field {\n let mut sum = 0;\n\n for input in inputs {\n let input_bytes: [u8; 32] = input.to_le_bytes();\n sum += crate::field::bytes32_to_field(blake2s(input_bytes));\n }\n\n sum\n}\n\n// docs:start:keccak256\npub fn keccak256<let N: u32>(input: [u8; N], message_size: u32) -> [u8; 32]\n// docs:end:keccak256\n{\n crate::hash::keccak::keccak256(input, message_size)\n}\n\n#[foreign(poseidon2_permutation)]\npub fn poseidon2_permutation<let N: u32>(_input: [Field; N], _state_length: u32) -> [Field; N] {}\n\n// Generic hashing support. \n// Partially ported and impacted by rust.\n\n// Hash trait shall be implemented per type.\n#[derive_via(derive_hash)]\ntrait Hash {\n fn hash<H>(self, state: &mut H) where H: Hasher;\n}\n\n// docs:start:derive_hash\ncomptime fn derive_hash(s: StructDefinition) -> Quoted {\n let name = quote { Hash };\n let signature = quote { fn hash<H>(_self: Self, _state: &mut H) where H: std::hash::Hasher };\n let for_each_field = |name| quote { _self.$name.hash(_state); };\n crate::meta::make_trait_impl(s, name, signature, for_each_field, quote {}, |fields| fields)\n}\n// docs:end:derive_hash\n\n// Hasher trait shall be implemented by algorithms to provide hash-agnostic means.\n// TODO: consider making the types generic here ([u8], [Field], etc.)\ntrait Hasher{\n fn finish(self) -> Field;\n \n fn write(&mut self, input: Field);\n}\n\n// BuildHasher is a factory trait, responsible for production of specific Hasher.\ntrait BuildHasher<H> where H: Hasher{\n fn build_hasher(self) -> H;\n}\n\nstruct BuildHasherDefault<H>;\n\nimpl<H> BuildHasher<H> for BuildHasherDefault<H>\nwhere \n H: Hasher + Default {\n fn build_hasher(_self: Self) -> H {\n H::default()\n }\n}\n\nimpl<H> Default for BuildHasherDefault<H>\nwhere \n H: Hasher + Default {\n fn default() -> Self {\n BuildHasherDefault {}\n }\n}\n\nimpl Hash for Field {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self);\n }\n}\n\nimpl Hash for u1 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u8 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u16 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u32 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u64 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for i8 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for i16 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for i32 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for i64 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for bool {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for () {\n fn hash<H>(_self: Self, _state: &mut H) where H: Hasher {}\n}\n\nimpl Hash for U128 {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n H::write(state, self.lo as Field);\n H::write(state, self.hi as Field);\n }\n}\n\nimpl<T, let N: u32> Hash for [T; N] where T: Hash {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n for elem in self {\n elem.hash(state);\n }\n }\n}\n\nimpl<T> Hash for [T] where T: Hash {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n self.len().hash(state);\n for elem in self {\n elem.hash(state);\n }\n }\n}\n\nimpl<A, B> Hash for (A, B) where A: Hash, B: Hash {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n self.0.hash(state);\n self.1.hash(state);\n }\n}\n\nimpl<A, B, C> Hash for (A, B, C) where A: Hash, B: Hash, C: Hash {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n }\n}\n\nimpl<A, B, C, D> Hash for (A, B, C, D) where A: Hash, B: Hash, C: Hash, D: Hash {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n }\n}\n\nimpl<A, B, C, D, E> Hash for (A, B, C, D, E) where A: Hash, B: Hash, C: Hash, D: Hash, E: Hash {\n fn hash<H>(self, state: &mut H) where H: Hasher {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n self.4.hash(state);\n }\n}\n\n// Some test vectors for Pedersen hash and Pedersen Commitment.\n// They have been generated using the same functions so the tests are for now useless\n// but they will be useful when we switch to Noir implementation.\n#[test]\nfn assert_pedersen() {\n assert_eq(\n pedersen_hash_with_separator([1], 1), 0x1b3f4b1a83092a13d8d1a59f7acb62aba15e7002f4440f2275edb99ebbc2305f\n );\n assert_eq(\n pedersen_commitment_with_separator([1], 1), EmbeddedCurvePoint {\n x: 0x054aa86a73cb8a34525e5bbed6e43ba1198e860f5f3950268f71df4591bde402,\n y: 0x209dcfbf2cfb57f9f6046f44d71ac6faf87254afc7407c04eb621a6287cac126,\n is_infinite: false\n }\n );\n\n assert_eq(\n pedersen_hash_with_separator([1, 2], 2), 0x26691c129448e9ace0c66d11f0a16d9014a9e8498ee78f4d69f0083168188255\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2], 2), EmbeddedCurvePoint {\n x: 0x2e2b3b191e49541fe468ec6877721d445dcaffe41728df0a0eafeb15e87b0753,\n y: 0x2ff4482400ad3a6228be17a2af33e2bcdf41be04795f9782bd96efe7e24f8778,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3], 3), 0x0bc694b7a1f8d10d2d8987d07433f26bd616a2d351bc79a3c540d85b6206dbe4\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3], 3), EmbeddedCurvePoint {\n x: 0x1fee4e8cf8d2f527caa2684236b07c4b1bad7342c01b0f75e9a877a71827dc85,\n y: 0x2f9fedb9a090697ab69bf04c8bc15f7385b3e4b68c849c1536e5ae15ff138fd1,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4], 4), 0xdae10fb32a8408521803905981a2b300d6a35e40e798743e9322b223a5eddc\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4], 4), EmbeddedCurvePoint {\n x: 0x07ae3e202811e1fca39c2d81eabe6f79183978e6f12be0d3b8eda095b79bdbc9,\n y: 0x0afc6f892593db6fbba60f2da558517e279e0ae04f95758587760ba193145014,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5], 5), 0xfc375b062c4f4f0150f7100dfb8d9b72a6d28582dd9512390b0497cdad9c22\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5], 5), EmbeddedCurvePoint {\n x: 0x1754b12bd475a6984a1094b5109eeca9838f4f81ac89c5f0a41dbce53189bb29,\n y: 0x2da030e3cfcdc7ddad80eaf2599df6692cae0717d4e9f7bfbee8d073d5d278f7,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6], 6), 0x1696ed13dc2730062a98ac9d8f9de0661bb98829c7582f699d0273b18c86a572\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6], 6), EmbeddedCurvePoint {\n x: 0x190f6c0e97ad83e1e28da22a98aae156da083c5a4100e929b77e750d3106a697,\n y: 0x1f4b60f34ef91221a0b49756fa0705da93311a61af73d37a0c458877706616fb,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7], 7), 0x128c0ff144fc66b6cb60eeac8a38e23da52992fc427b92397a7dffd71c45ede3\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7], 7), EmbeddedCurvePoint {\n x: 0x015441e9d29491b06563fac16fc76abf7a9534c715421d0de85d20dbe2965939,\n y: 0x1d2575b0276f4e9087e6e07c2cb75aa1baafad127af4be5918ef8a2ef2fea8fc,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8], 8), 0x2f960e117482044dfc99d12fece2ef6862fba9242be4846c7c9a3e854325a55c\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8], 8), EmbeddedCurvePoint {\n x: 0x1657737676968887fceb6dd516382ea13b3a2c557f509811cd86d5d1199bc443,\n y: 0x1f39f0cb569040105fa1e2f156521e8b8e08261e635a2b210bdc94e8d6d65f77,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9], 9), 0x0c96db0790602dcb166cc4699e2d306c479a76926b81c2cb2aaa92d249ec7be7\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9], 9), EmbeddedCurvePoint {\n x: 0x0a3ceae42d14914a432aa60ec7fded4af7dad7dd4acdbf2908452675ec67e06d,\n y: 0xfc19761eaaf621ad4aec9a8b2e84a4eceffdba78f60f8b9391b0bd9345a2f2,\n is_infinite: false\n }\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 10), 0x2cd37505871bc460a62ea1e63c7fe51149df5d0801302cf1cbc48beb8dff7e94\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 10), EmbeddedCurvePoint {\n x: 0x2fb3f8b3d41ddde007c8c3c62550f9a9380ee546fcc639ffbb3fd30c8d8de30c,\n y: 0x300783be23c446b11a4c0fabf6c91af148937cea15fcf5fb054abf7f752ee245,\n is_infinite: false\n }\n );\n}\n\n"},"326":{"path":"/usr/src/noir-projects/noir-protocol-circuits/crates/types/src/address/aztec_address.nr","source":"use crate::{\n crate::address::{partial_address::PartialAddress, public_keys_hash::PublicKeysHash},\n constants::{AZTEC_ADDRESS_LENGTH, GENERATOR_INDEX__CONTRACT_ADDRESS_V1},\n hash::poseidon2_hash_with_separator, traits::{Empty, FromField, ToField, Serialize, Deserialize},\n utils\n};\n\n// Aztec address\nstruct AztecAddress {\n inner : Field\n}\n\nimpl Eq for AztecAddress {\n fn eq(self, other: Self) -> bool {\n self.to_field() == other.to_field()\n }\n}\n\nimpl Empty for AztecAddress {\n fn empty() -> Self {\n Self { inner: 0 }\n }\n}\n\nimpl ToField for AztecAddress {\n fn to_field(self) -> Field {\n self.inner\n }\n}\n\nimpl FromField for AztecAddress {\n fn from_field(value: Field) -> AztecAddress {\n AztecAddress { inner: value }\n }\n}\n\nimpl Serialize<AZTEC_ADDRESS_LENGTH> for AztecAddress {\n fn serialize(self: Self) -> [Field; AZTEC_ADDRESS_LENGTH] {\n [self.to_field()]\n }\n}\n\nimpl Deserialize<AZTEC_ADDRESS_LENGTH> for AztecAddress {\n fn deserialize(fields: [Field; AZTEC_ADDRESS_LENGTH]) -> Self {\n FromField::from_field(fields[0])\n }\n}\n\nimpl AztecAddress {\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n\n pub fn compute(pub_keys_hash: PublicKeysHash, partial_address: PartialAddress) -> AztecAddress {\n AztecAddress::from_field(\n poseidon2_hash_with_separator(\n [pub_keys_hash.to_field(), partial_address.to_field()],\n GENERATOR_INDEX__CONTRACT_ADDRESS_V1\n )\n )\n }\n\n pub fn is_zero(self) -> bool {\n self.inner == 0\n }\n\n pub fn assert_is_zero(self) {\n assert(self.to_field() == 0);\n }\n\n pub fn conditional_assign(predicate: bool, lhs: Self, rhs: Self) -> Self {\n let result = utils::conditional_assign(predicate, rhs.to_field(), lhs.to_field());\n Self { inner: result }\n }\n}\n\n#[test]\nfn compute_address_from_partial_and_pub_keys_hash() {\n let pub_keys_hash = PublicKeysHash::from_field(1);\n let partial_address = PartialAddress::from_field(2);\n\n let address = AztecAddress::compute(pub_keys_hash, partial_address);\n let expected_computed_address_from_partial_and_pubkey = 0x23ce9be3fa3c846b0f9245cc796902e731d04f086e8a42473bb29e405fc98075;\n assert(address.to_field() == expected_computed_address_from_partial_and_pubkey);\n}\n\n#[test]\nfn from_field_to_field() {\n let address = AztecAddress { inner: 37 };\n assert_eq(FromField::from_field(address.to_field()), address);\n}\n\n#[test]\nfn serde() {\n let address = AztecAddress { inner: 37 };\n assert_eq(Deserialize::deserialize(address.serialize()), address);\n}\n"},"34":{"path":"std/hash/poseidon2.nr","source":"use crate::hash::Hasher;\nuse crate::default::Default;\n\ncomptime global RATE: u32 = 3;\n\nstruct 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 if message_size == N {\n Poseidon2::hash_internal(input, N, false)\n } else {\n Poseidon2::hash_internal(input, message_size, true)\n }\n }\n\n fn new(iv: Field) -> Poseidon2 {\n let mut result = 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>(input: [Field; N], in_len: u32, is_variable_length: bool) -> 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\nstruct 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"},"405":{"path":"/usr/src/noir-projects/noir-contracts/contracts/key_registry_contract/src/main.nr","source":"contract KeyRegistry {\n use dep::authwit::auth::assert_current_call_valid_authwit_public;\n\n use dep::aztec::{\n keys::{PublicKeys, stored_keys::StoredKeys, public_keys::NpkM},\n state_vars::{PublicMutable, Map}, protocol_types::address::{AztecAddress, PartialAddress}\n };\n\n #[aztec(storage)]\n struct Storage {\n current_keys: Map<AztecAddress, PublicMutable<StoredKeys>>,\n }\n\n impl<Context> Storage<Context> {\n // The init function is typically automatically generated by the macros - here we implement it manually in order\n // to have control over which storage slot is assigned to the current_keys state variable.\n fn init(context: Context) -> Self {\n Storage {\n // Ideally we'd do KEY_REGISTRY_STORAGE_SLOT instead of hardcoding the 1 here, but that is currently\n // causing compilation errors.\n // TODO(#7829): fix this\n current_keys: Map::new(\n context,\n 1,\n |context, slot| { PublicMutable::new(context, slot) }\n )\n }\n }\n }\n\n unconstrained fn get_current_keys(account: AztecAddress) -> pub PublicKeys {\n // If #7524 were to be implemented, this function could be called by an oracle from an unconstrained function\n // in order to produce the preimage of the stored hash, and hence prove the correctness of the keys.\n storage.current_keys.at(account).read().public_keys\n }\n\n #[aztec(public)]\n fn register_initial_keys(account: AztecAddress, partial_address: PartialAddress, keys: PublicKeys) {\n let computed_address = AztecAddress::compute(keys.hash(), partial_address);\n assert(computed_address.eq(account), \"Computed address does not match supplied address\");\n\n storage.current_keys.at(account).write(StoredKeys::new(keys));\n }\n\n #[aztec(public)]\n fn rotate_npk_m(account: AztecAddress, new_npk_m: NpkM, nonce: Field) {\n if (!account.eq(context.msg_sender())) {\n assert_current_call_valid_authwit_public(&mut context, account);\n } else {\n assert(nonce == 0, \"invalid nonce\");\n }\n\n let account_key_storage = storage.current_keys.at(account);\n\n // We read all other current keys so that we can compute the new hash - we can't update just the npk. This means\n // updating all keys at once costs the same as updating just one (unless setting public storage to its current\n // value is cheaper than changing it, e.g. EIP-2200).\n let mut current_keys = account_key_storage.read().public_keys;\n current_keys.npk_m = new_npk_m;\n\n account_key_storage.write(StoredKeys::new(current_keys));\n }\n}\n"},"74":{"path":"/usr/src/noir-projects/aztec-nr/authwit/src/auth.nr","source":"use dep::aztec::protocol_types::{\n abis::function_selector::FunctionSelector, address::AztecAddress,\n constants::{\n GENERATOR_INDEX__AUTHWIT_INNER, GENERATOR_INDEX__AUTHWIT_OUTER, GENERATOR_INDEX__AUTHWIT_NULLIFIER,\n CANONICAL_AUTH_REGISTRY_ADDRESS\n},\n hash::poseidon2_hash_with_separator\n};\nuse dep::aztec::{prelude::Deserialize, context::{PrivateContext, PublicContext, gas::GasOpts}, hash::hash_args_array};\n\n/**\n * Authenticaion witness helper library\n *\n * Authentication Witness is a scheme for authenticating actions on Aztec, so users can allow third-parties\n * (e.g. protocols or other users) to execute an action on their behalf.\n *\n * This library provides helper functions to manage such witnesses.\n * The authentication witness, is some \"witness\" (data) that authenticates a `message_hash`.\n * The simplest example of an authentication witness, is a signature. The signature is the \"evidence\",\n * that the signer has seen the message, agrees with it, and has allowed it.\n * It does not need to be a signature. It could be any kind of \"proof\" that the message is allowed.\n * Another proof could be knowing some kind of secret, or having some kind of \"token\" that allows the message.\n *\n * The `message_hash` is a hash of the following structure:\n * hash(consumer, chain_id, version, inner_hash)\n * - consumer: the address of the contract that is \"consuming\" the message,\n * - chain_id: the chain id of the chain that the message is being consumed on,\n * - version: the version of the chain that the message is being consumed on,\n * - inner_hash: the hash of the \"inner\" message that is being consumed, this is the \"actual\" message or action.\n *\n * While the `inner_hash` could be anything, such as showing you signed a specific message, it will often be\n * a hash of the \"action\" to approve, along with who made the call. As part of this library, we provide a few\n * helper functions to deal with such messages.\n *\n * For example, we provide helper function that is used for checking that the message is an encoding of the current call.\n * This can be used to let some contract \"allow\" another contract to act on its behalf, as long as it can\n * show that it is acting on behalf of the contract.\n *\n * If we take a case of allowing a contract to transfer tokens on behalf of an account, the `inner_hash` can be\n * derived as:\n * inner_hash = hash(caller, \"transfer\", hash(to, amount))\n *\n * Where the `caller` would be the address of the contract that is trying to transfer the tokens, and `to` and `amount`\n * the arguments for the transfer.\n *\n * Note that we have both a `caller` and a `consumer`, the `consumer` will be the contract that is consuming the message,\n * in the case of the transfer, it would be the `Token` contract itself, while the caller, will be the actor that is\n * allowed to transfer the tokens.\n *\n *\n * The authentication mechanism works differently in public and private contexts. In private, we recall that everything\n * is executed on the user's device, so we can use `oracles` to \"ask\" the user (not contract) for information. In public\n * we cannot do this, since it is executed by the sequencer (someone else). Therefore we can instead use a \"registry\"\n * to store the messages that we have approved.\n *\n * A simple example would be a \"token\" that is being \"pulled\" from one account into another. We will first outline\n * how this would look in private, and then in public later.\n *\n * Say that a user `Alice` wants to deposit some tokens into a DeFi protocol (say a DEX).\n * `Alice` would make a `deposit` transaction, that she is executing using her account contract.\n * The account would call the `DeFi` contract to execute `deposit`, which would try to pull funds from the `Token`\n * contract. Since the `DeFi` contract is trying to pull funds from an account that is not its own, it needs to\n * convince the `Token` contract that it is allowed to do so.\n *\n * This is where the authentication witness comes in The `Token` contract computes a `message_hash` from the\n * `transfer` call, and then asks `Alice Account` contract to verify that the `DeFi` contract is allowed to\n * execute that call.\n *\n * `Alice Account` contract can then ask `Alice` if she wants to allow the `DeFi` contract to pull funds from her\n * account. If she does, she will sign the `message_hash` and return the signature to the `Alice Account` which\n * will validate it and return success to the `Token` contract which will then allow the `DeFi` contract to pull\n * funds from `Alice`.\n *\n * To ensure that the same \"approval\" cannot be used multiple times, we also compute a `nullifier` for the\n * authentication witness, and emit it from the `Token` contract (consumer).\n *\n * Note that we can do this flow as we are in private were we can do oracle calls out from contracts.\n *\n *\n * Person Contract Contract Contract\n * Alice Alice Account Token DeFi\n * | | | |\n * | Defi.deposit(Token, 1000) | |\n * |----------------->| | |\n * | | deposit(Token, 1000) |\n * | |---------------------------------------->|\n * | | | |\n * | | | transfer(Alice, Defi, 1000)\n * | | |<---------------------|\n * | | | |\n * | | Check if Defi may call transfer(Alice, Defi, 1000)\n * | |<-----------------| |\n * | | | |\n * | Please give me AuthWit for DeFi | |\n * | calling transfer(Alice, Defi, 1000) | |\n * |<-----------------| | |\n * | | | |\n * | | | |\n * | AuthWit for transfer(Alice, Defi, 1000) |\n * |----------------->| | |\n * | | AuthWit validity | |\n * | |----------------->| |\n * | | | |\n * | | throw if invalid AuthWit |\n * | | | |\n * | | emit AuthWit nullifier |\n * | | | |\n * | | transfer(Alice, Defi, 1000) |\n * | | | |\n * | | | |\n * | | | success |\n * | | |--------------------->|\n * | | | |\n * | | | |\n * | | | deposit(Token, 1000)\n * | | | |\n * | | | |\n *\n *\n * If we instead were in public, we cannot do the same flow. Instead we would use an authentication registry to store\n * the messages that we have approved.\n *\n * To approve a message, `Alice Account` can make a `set_authorized` call to the registry, to set a `message_hash`\n * as authorized. This is essentially a mapping from `message_hash` to `true` for `Alice Contract`. Every account\n * has its own map in the registry, so `Alice` cannot approve a message for `Bob`.\n *\n * The `Token` contract can then try to \"spend\" the approval by calling `consume` on the registry. If the message\n * was approved, the value is updated to `false`, and we return the success flag. For more information on the\n * registry, see `main.nr` in `auth_registry_contract`.\n *\n * Person Contract Contract Contract Contract\n * Alice Alice Account Registry Token DeFi\n * | | | | |\n * | Registry.set_authorized(..., true) | | |\n * |----------------->| | | |\n * | | set_authorized(..., true) | |\n * | |------------------->| | |\n * | | | | |\n * | | set authorized to true | |\n * | | | | |\n * | | | | |\n * | Defi.deposit(Token, 1000) | | |\n * |----------------->| | | |\n * | | deposit(Token, 1000) | |\n * | |-------------------------------------------------------------->|\n * | | | | |\n * | | | transfer(Alice, Defi, 1000) |\n * | | | |<---------------------|\n * | | | | |\n * | | | Check if Defi may call transfer(Alice, Defi, 1000)\n * | | |<------------------| |\n * | | | | |\n * | | throw if invalid AuthWit | |\n * | | | | |\n * | | | | |\n * | | set authorized to false | |\n * | | | | |\n * | | | | |\n * | | | AuthWit validity | |\n * | | |------------------>| |\n * | | | | |\n * | | | | transfer(Alice, Defi, 1000)\n * | | | |<-------------------->|\n * | | | | |\n * | | | | success |\n * | | | |--------------------->|\n * | | | | |\n * | | | | deposit(Token, 1000)\n * | | | | |\n *\n *\n * --- FAQ ---\n * Q: Why are we using a success flag of `poseidon2_hash_bytes(\"IS_VALID()\")` instead of just returning a boolean?\n * A: We want to make sure that we don't accidentally return `true` if there is a collision in the function selector.\n * By returning a hash of `IS_VALID()`, it becomes very unlikely that there is both a collision and we return\n * a success flag.\n *\n * Q: Why are we using static calls?\n * A: We are using static calls to ensure that the account contract cannot re-enter. If it was a normal call, it\n * could make a new call and do a re-entry attack. Using a static ensures that it cannot update any state.\n *\n * Q: Would it not be cheaper to use a nullifier instead of updating state in public?\n * A: At a quick glance, a public state update + nullifier is 96 bytes, but two state updates are 128, so it would be\n * cheaper to use a nullifier, if this is the way it would always be done. However, if both the approval and the\n * consumption is done in the same transaction, then we will be able to squash the updates (only final tx state diff is posted to DA), and now it is cheaper.\n *\n * Q: Why is the chain id and the version part of the message hash?\n * A: The chain id and the version is part of the message hash to ensure that the message is only valid on a specific\n * chain to avoid a case where the same message could be used across multiple chains.\n */\n\nglobal IS_VALID_SELECTOR = 0x47dacd73; // 4 last bytes of poseidon2_hash_bytes(\"IS_VALID()\")\n\n/**\n * Assert that `on_behalf_of` have authorized the current call with a valid authentication witness\n *\n * Computing the `inner_hash` using the `msg_sender`, `selector` and `args_hash` and then making a call out to the\n * `on_behalf_of` contract to verify that the `inner_hash` is valid.\n *\n * @param on_behalf_of The address that have authorized the current call\n */\n// docs:start:assert_current_call_valid_authwit\npub fn assert_current_call_valid_authwit(context: &mut PrivateContext, on_behalf_of: AztecAddress) {\n let inner_hash = compute_inner_authwit_hash([context.msg_sender().to_field(), context.selector().to_field(), context.args_hash]);\n assert_inner_hash_valid_authwit(context, on_behalf_of, inner_hash);\n}\n// docs:end:assert_current_call_valid_authwit\n\n/**\n * Assert that a specific `inner_hash` is valid for the `on_behalf_of` address\n *\n * Used as an internal function for `assert_current_call_valid_authwit` and can be used as a standalone function when\n * the `inner_hash` is from a different source, e.g., say a block of text etc.\n *\n * @param on_behalf_of The address that have authorized the current call\n * @param inner_hash The hash of the message to authorize\n */\npub fn assert_inner_hash_valid_authwit(\n context: &mut PrivateContext,\n on_behalf_of: AztecAddress,\n inner_hash: Field\n) {\n // We perform a static call here and not a standard one to ensure that the account contract cannot re-enter.\n let result: Field = context.static_call_private_function(\n on_behalf_of,\n comptime {\n FunctionSelector::from_signature(\"verify_private_authwit(Field)\")\n },\n [inner_hash]\n ).unpack_into();\n assert(result == IS_VALID_SELECTOR, \"Message not authorized by account\");\n // Compute the nullifier, similar computation to the outer hash, but without the chain_id and version.\n // Those should already be handled in the verification, so we just need something to nullify, that allow same inner_hash for multiple actors.\n let nullifier = compute_authwit_nullifier(on_behalf_of, inner_hash);\n context.push_nullifier(nullifier);\n}\n\n/**\n * Assert that `on_behalf_of` have authorized the current call in the authentication registry\n *\n * Computing the `inner_hash` using the `msg_sender`, `selector` and `args_hash` and then making a call out to the\n * `on_behalf_of` contract to verify that the `inner_hash` is valid.\n *\n * Note that the authentication registry will take the `msg_sender` into account as the consumer, so this will only\n * work if the `msg_sender` is the same as the `consumer` when the `message_hash` was inserted into the registry.\n *\n * @param on_behalf_of The address that have authorized the current call\n */\n// docs:start:assert_current_call_valid_authwit_public\npub fn assert_current_call_valid_authwit_public(context: &mut PublicContext, on_behalf_of: AztecAddress) {\n let inner_hash = compute_inner_authwit_hash(\n [(*context).msg_sender().to_field(), (*context).selector().to_field(), (*context).get_args_hash()]\n );\n assert_inner_hash_valid_authwit_public(context, on_behalf_of, inner_hash);\n}\n// docs:end:assert_current_call_valid_authwit_public\n\n/**\n * Assert that `on_behalf_of` have authorized a speicifc `inner_hash` in the authentication registry\n *\n * Computing the `inner_hash` using the `msg_sender`, `selector` and `args_hash` and then making a call out to the\n * `on_behalf_of` contract to verify that the `inner_hash` is valid.\n *\n * Note that the authentication registry will take the `msg_sender` into account as the consumer, so this will only\n * work if the `msg_sender` is the same as the `consumer` when the `message_hash` was inserted into the registry.\n *\n * @param on_behalf_of The address that have authorized the `inner_hash`\n */\npub fn assert_inner_hash_valid_authwit_public(\n context: &mut PublicContext,\n on_behalf_of: AztecAddress,\n inner_hash: Field\n) {\n let result: Field = context.call_public_function(\n CANONICAL_AUTH_REGISTRY_ADDRESS,\n comptime {\n FunctionSelector::from_signature(\"consume((Field),Field)\")\n },\n [on_behalf_of.to_field(), inner_hash].as_slice(),\n GasOpts::default()\n ).deserialize_into();\n assert(result == IS_VALID_SELECTOR, \"Message not authorized by account\");\n}\n\n/**\n * Compute the `message_hash` from a function call to be used by an authentication witness\n *\n * Useful for when you need a non-account contract to approve during execution. For example if you need a contract\n * to make a call to nested contract, e.g., contract A wants to exit token T to L1 using bridge B, so it needs to allow\n * B to transfer T on its behalf.\n *\n * @param caller The address of the contract that is calling the function, in the example above, this would be B\n * @param consumer The address of the contract that is consuming the message, in the example above, this would be T\n * @param chain_id The chain id of the chain that the message is being consumed on\n * @param version The version of the chain that the message is being consumed on\n * @param selector The function selector of the function that is being called\n * @param args The arguments of the function that is being called\n */\n// docs:start:compute_authwit_message_hash_from_call\npub fn compute_authwit_message_hash_from_call<let N: u32>(\n caller: AztecAddress,\n consumer: AztecAddress,\n chain_id: Field,\n version: Field,\n selector: FunctionSelector,\n args: [Field; N]\n) -> Field {\n let args_hash = hash_args_array(args);\n let inner_hash = compute_inner_authwit_hash([caller.to_field(), selector.to_field(), args_hash]);\n compute_authwit_message_hash(consumer, chain_id, version, inner_hash)\n}\n// docs:end:compute_authwit_message_hash_from_call\n\n/**\n * Computes the `inner_hash` of the authentication witness\n *\n * This is used internally, but also useful in cases where you want to compute the `inner_hash` for a specific message\n * that is not necessarily a call, but just some \"bytes\" or text.\n *\n * @param args The arguments to hash\n */\npub fn compute_inner_authwit_hash<let N: u32>(args: [Field; N]) -> Field {\n poseidon2_hash_with_separator(args, GENERATOR_INDEX__AUTHWIT_INNER)\n}\n\n/**\n * Computs the `authwit_nullifier` for a specific `on_behalf_of` and `inner_hash`\n *\n * Using the `on_behalf_of` and the `inner_hash` to ensure that the nullifier is siloed for a specific `on_behalf_of`.\n *\n * @param on_behalf_of The address that have authorized the `inner_hash`\n * @param inner_hash The hash of the message to authorize\n */\npub fn compute_authwit_nullifier(on_behalf_of: AztecAddress, inner_hash: Field) -> Field {\n poseidon2_hash_with_separator(\n [on_behalf_of.to_field(), inner_hash],\n GENERATOR_INDEX__AUTHWIT_NULLIFIER\n )\n}\n\n/**\n * Computes the `message_hash` for the authentication witness\n *\n * @param consumer The address of the contract that is consuming the message\n * @param chain_id The chain id of the chain that the message is being consumed on\n * @param version The version of the chain that the message is being consumed on\n * @param inner_hash The hash of the \"inner\" message that is being consumed\n */\npub fn compute_authwit_message_hash(\n consumer: AztecAddress,\n chain_id: Field,\n version: Field,\n inner_hash: Field\n) -> Field {\n poseidon2_hash_with_separator(\n [\n consumer.to_field(),\n chain_id,\n version,\n inner_hash\n ],\n GENERATOR_INDEX__AUTHWIT_OUTER\n )\n}\n\n/**\n * Helper function to set the authorization status of a message hash\n *\n * Wraps a public call to the authentication registry to set the authorization status of a `message_hash`\n *\n * @param message_hash The hash of the message to authorize\n * @param authorize True if the message should be authorized, false if it should be revoked\n */\npub fn set_authorized(context: &mut PublicContext, message_hash: Field, authorize: bool) {\n context.call_public_function(\n CANONICAL_AUTH_REGISTRY_ADDRESS,\n comptime {\n FunctionSelector::from_signature(\"set_authorized(Field,bool)\")\n },\n [message_hash, authorize as Field].as_slice(),\n GasOpts::default()\n ).assert_empty();\n}\n\n/**\n * Helper function to reject all authwits\n *\n * Wraps a public call to the authentication registry to set the `reject_all` flag\n *\n * @param reject True if all authwits should be rejected, false otherwise\n */\npub fn set_reject_all(context: &mut PublicContext, reject: bool) {\n context.call_public_function(\n CANONICAL_AUTH_REGISTRY_ADDRESS,\n comptime {\n FunctionSelector::from_signature(\"set_reject_all(bool)\")\n },\n [context.this_address().to_field(), reject as Field].as_slice(),\n GasOpts::default()\n ).assert_empty();\n}\n"},"85":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/keys/stored_keys.nr","source":"use crate::keys::public_keys::{PublicKeys, PUBLIC_KEYS_LENGTH};\nuse dep::protocol_types::traits::{Serialize, Deserialize};\n\n// This struct represents how public keys are stored in the key registry. We store not just the keys themselves but also\n// their hash, so that when reading in private we can perform a historical read for the hash and then show that it\n// corresponds to a preimage obtained from an unconstrained hint. We do store the keys keys regardless as they might be\n// needed during public execution, and since we need to broadcast and produce hints in some standardized way.\n// While it might seem odd to create a struct for what is effectively some data and a pure function called on it, state\n// variables rely on serializable structs in order to persist data to storage, so we must use this abstraction.\nstruct StoredKeys {\n public_keys: PublicKeys,\n hash: Field,\n}\n\nimpl StoredKeys {\n // Instances of StoredKeys are expected to only be created by calling this function so that we guarantee that the\n // hash field does indeed correspond to the hash of the keys. Ideally we'd forbid direct access to the struct, but \n // Noir doesn't yet support private members.\n fn new(public_keys: PublicKeys) -> Self {\n Self { public_keys, hash: public_keys.hash().inner }\n }\n}\n\n// Our serialization is the concatenation of the public keys serialization plush the hash, so we need one extra field.\nglobal STORED_KEYS_LENGTH: u32 = PUBLIC_KEYS_LENGTH + 1;\n\nimpl Serialize<STORED_KEYS_LENGTH> for StoredKeys {\n fn serialize(self) -> [Field; STORED_KEYS_LENGTH] {\n // The code below is equivalent to:\n // [ ...self.public_keys.serialize(), self.hash ]\n\n let mut array = [0; STORED_KEYS_LENGTH];\n\n let serialized_keys = self.public_keys.serialize();\n for i in 0..serialized_keys.len() {\n array[i] = serialized_keys[i];\n }\n\n array[PUBLIC_KEYS_LENGTH] = self.hash;\n\n array\n }\n}\n\nimpl Deserialize<STORED_KEYS_LENGTH> for StoredKeys {\n fn deserialize(array: [Field; STORED_KEYS_LENGTH]) -> Self {\n // The code below is equivalent to:\n // Self { public_keys: PublicKeys::deserialize(array[0 : PUBLIC_KEYS_LENGTH]), hash: array[PUBLIC_KEYS_LENGTH] }\n\n let mut serialized_keys = [0; PUBLIC_KEYS_LENGTH];\n for i in 0..serialized_keys.len() {\n serialized_keys[i] = array[i];\n }\n\n let hash = array[PUBLIC_KEYS_LENGTH];\n\n Self { public_keys: PublicKeys::deserialize(serialized_keys), hash }\n }\n}\n"},"86":{"path":"/usr/src/noir-projects/aztec-nr/aztec/src/keys/public_keys.nr","source":"use dep::protocol_types::{\n address::PublicKeysHash, constants::GENERATOR_INDEX__PUBLIC_KEYS_HASH,\n hash::poseidon2_hash_with_separator, point::{Point, POINT_LENGTH},\n traits::{Deserialize, Serialize, Empty, is_empty, Hash}\n};\n\nglobal PUBLIC_KEYS_LENGTH: u32 = 12;\n\nstruct PublicKeys {\n npk_m: NpkM,\n ivpk_m: IvpkM,\n ovpk_m: OvpkM,\n tpk_m: TpkM,\n}\n\ntrait ToPoint {\n fn to_point(self) -> Point;\n}\n\nstruct NpkM {\n inner: Point\n}\n\nimpl ToPoint for NpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\nimpl Serialize<POINT_LENGTH> for NpkM {\n fn serialize(self) -> [Field; POINT_LENGTH] {\n self.inner.serialize()\n }\n}\n\n// Note: If we store npk_m_hash directly we can remove this trait implementation. See #8091\nimpl Hash for NpkM {\n fn hash(self) -> Field {\n self.inner.hash()\n }\n}\n\nstruct IvpkM {\n inner: Point\n}\n\nimpl ToPoint for IvpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\nimpl Serialize<POINT_LENGTH> for IvpkM {\n fn serialize(self) -> [Field; POINT_LENGTH] {\n self.inner.serialize()\n }\n}\n\nstruct OvpkM {\n inner: Point\n}\n\nimpl Hash for OvpkM {\n fn hash(self) -> Field {\n self.inner.hash()\n }\n}\n\nimpl ToPoint for OvpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\nimpl Serialize<POINT_LENGTH> for OvpkM {\n fn serialize(self) -> [Field; POINT_LENGTH] {\n self.inner.serialize()\n }\n}\n\nstruct TpkM {\n inner: Point\n}\n\nimpl ToPoint for TpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\nimpl Empty for PublicKeys {\n fn empty() -> Self {\n PublicKeys {\n npk_m: NpkM { inner: Point::empty() },\n ivpk_m: IvpkM { inner: Point::empty() },\n ovpk_m: OvpkM { inner: Point::empty() },\n tpk_m: TpkM { inner: Point::empty() }\n }\n }\n}\n\nimpl Eq for PublicKeys {\n fn eq(self, other: PublicKeys) -> bool {\n (self.npk_m.inner == other.npk_m.inner)\n & (self.ivpk_m.inner == other.ivpk_m.inner)\n & (self.ovpk_m.inner == other.ovpk_m.inner)\n & (self.tpk_m.inner == other.tpk_m.inner)\n }\n}\n\nimpl PublicKeys {\n pub fn hash(self) -> PublicKeysHash {\n PublicKeysHash::from_field(\n if is_empty(self) {\n 0\n } else {\n poseidon2_hash_with_separator(self.serialize(), GENERATOR_INDEX__PUBLIC_KEYS_HASH as Field)\n }\n )\n }\n}\n\nimpl Serialize<PUBLIC_KEYS_LENGTH> for PublicKeys {\n fn serialize(self) -> [Field; PUBLIC_KEYS_LENGTH] {\n [\n self.npk_m.inner.x,\n self.npk_m.inner.y,\n self.npk_m.inner.is_infinite as Field,\n self.ivpk_m.inner.x,\n self.ivpk_m.inner.y,\n self.ivpk_m.inner.is_infinite as Field,\n self.ovpk_m.inner.x,\n self.ovpk_m.inner.y,\n self.ovpk_m.inner.is_infinite as Field,\n self.tpk_m.inner.x,\n self.tpk_m.inner.y,\n self.tpk_m.inner.is_infinite as Field\n ]\n }\n}\n\nimpl Deserialize<PUBLIC_KEYS_LENGTH> for PublicKeys {\n fn deserialize(serialized: [Field; PUBLIC_KEYS_LENGTH]) -> PublicKeys {\n PublicKeys {\n npk_m: NpkM { inner: Point { x: serialized[0], y: serialized[1], is_infinite: serialized[2] as bool } },\n ivpk_m: IvpkM { inner: Point { x: serialized[3], y: serialized[4], is_infinite: serialized[5] as bool } },\n ovpk_m: OvpkM { inner: Point { x: serialized[6], y: serialized[7], is_infinite: serialized[8] as bool } },\n tpk_m: TpkM { inner: Point { x: serialized[9], y: serialized[10], is_infinite: serialized[11] as bool } }\n }\n }\n}\n\n#[test]\nfn compute_public_keys_hash() {\n let keys = PublicKeys {\n npk_m: NpkM { inner: Point { x: 1, y: 2, is_infinite: false } },\n ivpk_m: IvpkM { inner: Point { x: 3, y: 4, is_infinite: false } },\n ovpk_m: OvpkM { inner: Point { x: 5, y: 6, is_infinite: false } },\n tpk_m: TpkM { inner: Point { x: 7, y: 8, is_infinite: false } }\n };\n\n let actual = keys.hash();\n let expected_public_keys_hash = 0x0fecd9a32db731fec1fded1b9ff957a1625c069245a3613a2538bd527068b0ad;\n\n assert(actual.to_field() == expected_public_keys_hash);\n}\n\n#[test]\nfn compute_empty_hash() {\n let keys = PublicKeys::empty();\n\n let actual = keys.hash();\n let test_data_empty_hash = 0x0000000000000000000000000000000000000000000000000000000000000000;\n\n assert(actual.to_field() == test_data_empty_hash);\n}\n\n#[test]\nfn test_public_keys_serialization() {\n let keys = PublicKeys {\n npk_m: NpkM { inner: Point { x: 1, y: 2, is_infinite: false } },\n ivpk_m: IvpkM { inner: Point { x: 3, y: 4, is_infinite: false } },\n ovpk_m: OvpkM { inner: Point { x: 5, y: 6, is_infinite: false } },\n tpk_m: TpkM { inner: Point { x: 7, y: 8, is_infinite: false } }\n };\n\n let serialized = keys.serialize();\n let deserialized = PublicKeys::deserialize(serialized);\n\n assert_eq(keys.npk_m.inner.x, deserialized.npk_m.inner.x);\n assert_eq(keys.npk_m.inner.y, deserialized.npk_m.inner.y);\n assert_eq(keys.ivpk_m.inner.x, deserialized.ivpk_m.inner.x);\n assert_eq(keys.ivpk_m.inner.y, deserialized.ivpk_m.inner.y);\n assert_eq(keys.ovpk_m.inner.x, deserialized.ovpk_m.inner.x);\n assert_eq(keys.ovpk_m.inner.y, deserialized.ovpk_m.inner.y);\n assert_eq(keys.tpk_m.inner.x, deserialized.tpk_m.inner.x);\n assert_eq(keys.tpk_m.inner.y, deserialized.tpk_m.inner.y);\n}\n"}}}