npm - @aztec/protocol-contracts - Versions diffs - 5.0.0-nightly.20260407 → 5.0.0-nightly.20260409 - Mend

@aztec/protocol-contracts 5.0.0-nightly.20260407 → 5.0.0-nightly.20260409

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

package/artifacts/AuthRegistry.json +377 -365
package/artifacts/ContractClassRegistry.json +2 -2
package/artifacts/ContractInstanceRegistry.json +5 -5
package/artifacts/FeeJuice.json +3 -3
package/artifacts/MultiCallEntrypoint.json +305 -293
package/artifacts/PublicChecks.json +331 -319
package/package.json +4 -4

package/artifacts/AuthRegistry.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "transpiled": true,
-  "noir_version": "1.0.0-beta.19+f4ead98d92f514ef4d30a625d7c54709b02b08d1",
+  "noir_version": "1.0.0-beta.19+c09ce9a7dbec1708a8b167fad7411ece61d8b9ea",
   "name": "AuthRegistry",
   "functions": [
     {
@@ -56,7 +56,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBHJwAABEclAAAATicCBQQDJwIGBAAfCgAFAAYARBwARkYBLQhEAi0IRQMtCEYEJQAAAHQnAgIERycCAwQAOw4AAwACLAAAQwAwZE5y4TGgKbhQRbaBgVhdKDPoSHm5cJFD4fWT8AAAACYeAgAFAB4CAAUAHgIABgEKIgZDBxYKBwgcCggJAAQqCQYIJwIGAQAKKgcGCSQCAAkAAACxJwIKBAA8BgoBCioIBQckAgAHAAAAwyUAAAH4JwIFAAIpAgAHAO9SU00rAgAIAAAAAAAAAAADAAAAAAAAAAAtCAEJJwIKBAUACAEKAScDCQQBACIJAgotCgoLLQ4HCwAiCwILLQ4FCwAiCwILLQ4CCwAiCwILLQ4ICy0IAQInAgUEBQAIAQUBJwMCBAEAIgkCBQAiAgIKPw8ABQAKJwIFBAEAKgIFCS0LCQknAgIAAAoqCQIKCioKBgskAgALAAABbiUAAAIKLQgBCicCCwQFAAgBCwEnAwoEAQAiCgILLQoLDC0OBwwAIgwCDC0OCQwAIgwCDC0OAwwAIgwCDC0OCAwtCAEDJwIHBAUACAEHAScDAwQBACIKAgcAIgMCCD8PAAcACAAqAwUHLQsHBwoqBwIDCioDBgIkAgACAAAB7CUAAAIKHAoEAgAwCgACAAcmKgEAAQXBUDSsJUi8UTwEAgEmKgEAAQW6uyHXgjMYZDwEAgEm",
-      "debug_symbols": "tZdbbuMwDEX34u98iCL1YLYyKIo0dYsARhK4yQCDInsfqhb9KCAhE09/kmPKvqaoS9n+bF7bl+v78+H4dvpotr8+m5f+0HWH9+futN9dDqejRD8bk34AfLPFTQMWmm1I/3IMIIASgDSCPgOZPEQug0sRl8Bl8BrxMUNAhSDgBaLNwEZBLrdyC2uMAmdAjSAp6BBphDTiNOJiBm8VQoYACj5D1FtETSMmQcnZMirEAdCggkZAI6ARm9LwCTgDagTTOVGAUEEjTiMeFNLaJMFgFFyGqJGoEdYIk0IcgFLOA4QMYBXyLSit/wBJMCTgDCn5ATRCGiGNOI0kA2BM4BTkHDICgRQ0EkMGlnyIEqRIuN02jXr1+dK3bbLqzLxi6fOub4+XZnu8dt2m+b3rrl8nfZx3x6//y66XUdFuj6/yL4Jvh65NdNtMV5vypeI8l6+2aN0oABAWElCRMFJx1TBS4lEkLNOwFY0QVYFpSiLQ3fPw0atCiLE4DypLIJGWAmVdp1ksk3D/oRL+ByuBYKxOI82+VIlYlpDG0WKSbHqlSnBlFuDSZjrMA5z1pUpAbSbEOhFfLkU9C4IpC8ZiFhVrkjVTLXhUcA8VczaPb9OAijMZ1JhsJ2sTPGQJLDd5RUKWUHNwlidXuW+FDBUJSHvfIAEzb1uDS41KMeUpphPhqRIoDb9QqHiCpw2Pkeyk4ZYraivFYENqbjZsyhpQM7dK4Gy7st4vFWp7JgQezR3DYxoWx23TBiprUG1d/biu1kx7HsS705DFHKvBDMU0qvYyHKc0XNFeNlR3nNFfzoSixp2NIn1XahTL6xsFzdpGQVjfKGjXNwri2kZBWt8oVY07GwX96kappXFvo1TtdWejYEWDZC30oUZzDfAPNQoWG4UqFg1stBqBLRezoNrWQ2Z8RxB2xXc2wtrKTg/HWbfxP6VhaEqj/MJElfdPRAzqUvkYQ1sUqbgUfRgTCeCW711PcrjbH/rFN/YtifWH3UvX5sO363E/G738OeuIfqOf+9O+fb32bVKaf6jLZw+7DYenW7rbXw=="
+      "debug_symbols": "tZdbbuMwDEX34u98iCL1YLYyKIo0dYsARhK4yQCDInsfqhb9KCAhE09/kmPKvqaoS9n+bF7bl+v78+H4dvpotr8+m5f+0HWH9+futN9dDqejRD8bk34AfLPFTQMWmm1I/3IMIIASgDSCPgOZPEQug0sRl8Bl8BrxMUNAhSDgBaLNwEZBLrdyC2uMAmdAjSAp6BBphDTiNOJiBm8VQoYACj5D1FtETSMmQcnZMirEAdCggkZAI6ARm9LwCTgDagTTOVGAUEEjTiMeFNLaJMFgFFyGqJGoEdYIk0IcgFLOA4QMYBXyLSit/wBJMCTgDCn5ATRCGiGNOI0kA2BM4BTkHDICgRQ0EkMGlnyIEqRIuN02jXr1+dK3bbLqzLxi6fOub4+XZnu8dt2m+b3rrl8nfZx3x6//y66XUdFuj6/yL4Jvh65NdNtMV5vypeI8l6+2aN0oAOAWElCRMFJx1TBS4lHEx4WGrWiEqApMUxLB3j0PH70qhBiL86CyBBJpKVDWdZT4loT7D5XwP1gJBGN1GgChWIlYlpDG0WKSbHqlSnBlFuDSZjrMA5z1pUpAbSbEOhFfLkU9C4IpC8ZiFhVrkjVTLXhUeKyYs3l8mwZUnMmgxmQ7WZvgIUtguckrErKEmoOzPLnKLXcaCBUJSHvfIAEzb1uznAhUiilPMZ0IT5XA6JcKFU/wtOExkp00HC43q0ox2JCamw2bsgbUzK0SONuurBhkoVDbMyHwaO4YHtOwOG6bNlBZg2rr6sd1TWs5uivenYYs5lgNZiimUbWX4Til4Yr2sqG644z+ciYUNe5sFOm7UqNYXt8oaNY2CsL6RkG7vlEQ1zYK0vpGqWrc2SjoVzdKLY17G6VqrzsbBSsaJGuhDzWaawA91ChYbBSqWDSw0WoEtlzMgmpbD5nxHUHYFd/ZCGsrOz0cZ93G/5SGoSmN8gsTVd4/ETGoS+VjDG1RpOJS9GFMJIBbvnc9yeFuf+gX39i3JNYfdi9dmw/frsf9bPTy56wj+o1+7k/79vXat0lp/qEunz3sNhyebulufwE="
     },
     {
       "name": "consume",
@@ -112,7 +112,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBIJwAABEglAAAASScCBAQCJwIFBAAfCgAEAAUARS0IRQItCEYDJQAAAHgtAgJHJwIDBEcnAgQEATsOAAQAAykAAEMAR9rNcywAAEQAMGROcuExoCm4UEW2gYFYXSgz6Eh5uXCRQ+H1k/AAAAAmHgIABAAeAgAEACcCBAABKQIABQDvUlNNKwIABgAAAAAAAAAAAwAAAAAAAAAALQgBBycCCAQFAAgBCAEnAwcEAQAiBwIILQoICS0OBQkAIgkCCS0OBAkAIgkCCS0OAgkAIgkCCS0OBgktCAEEJwIIBAUACAEIAScDBAQBACIHAggAIgQCCT8PAAgACScCBwQBACoEBwgtCwgIJwIEAAAKKggECScCCgEACioJCgskAgALAAABMiUAAAQjHgIACQAvKgAIAAkACxwKCwkCHAoJCAAcCggJAhwKCQsBHAoLCAIcCggJAQoqCQoIJAIACAAAAW8lAAAENR4CAAgBCiIIRAkWCgkLHAoLDAAEKgwICwoqCQoIJAIACAAAAZ0nAgwEADwGDAEeAgAIAx4CAAkEKQIADADDt7IGKwIADQAAAAAAAAAABQAAAAAAAAAALQgBDicCDwQFAAgBDwEnAw4EAQAiDgIPLQoPEC0ODBAAIhACEC0OCxAAIhACEC0OCBAAIhACEC0ODRAtCAEIJwILBAUACAELAScDCAQBACIOAgsAIggCDD8PAAsADAAqCAcLLQsLCwAqCwkMLQIIAycABAQFJQAABEctCAUJACoJBwstDgwLJwILBAIAKggLDC0LDAwAKgwDCC0CCQMnAAQEBSUAAARHLQgFAwAqAwsMLQ4IDC0IAQgnAgkEBQAIAQkBJwMIBAEAIgMCCQAiCAILPw8ACQALACoIBwMtCwMDJwIIAAItCAEJJwILBAUACAELAScDCQQBACIJAgstCgsMLQ4FDAAiDAIMLQ4IDAAiDAIMLQ4CDAAiDAIMLQ4GDC0IAQInAggEBQAIAQgBJwMCBAEAIgkCCAAiAgILPw8ACAALACoCBwgtCwgICioIBAsKKgsKDCQCAAwAAAMpJQAABCMtCAELJwIMBAUACAEMAScDCwQBACILAgwtCgwNLQ4FDQAiDQINLQ4IDQAiDQINLQ4DDQAiDQINLQ4GDS0IAQMnAgUEBQAIAQUBJwMDBAEAIgsCBQAiAwIGPw8ABQAGACoDBwUtCwUFCioFBAYKKgYKByQCAAcAAAOnJQAABCMeAgAGAC8qAAUABgAHHAoHCAIcCggGABwKBgcCHAoHCAEcCggGAhwKBgcBJwIGAQEkAgAHAAAD5CUAAAShLQsJBgAiBgIGLQ4GCS0LAgYAIgYCBi0OBgItCwsCACICAgItDgILLQsDAgAiAgICLQ4CAzAKAAQABS0IQwImKgEAAQW6uyHXgjMYZDwEAgEmKgEAAQVMr1JlAlqXtDwEAgEmLQEDBgoABgIHJAAABwAABJwtAAEFAAABBAEAAAMECS0AAwotAAULIwAABIUtAQoILQQICwAACgIKAAALAgsMAAoJDCQAAAwAAARzJwEFBAEjAAAEoC0AAwUmKgEAAQXtK68NmiE35zwEAgEm",
-      "debug_symbols": "vVrbbts4EP0XP+eBHM6F7K8URZGmbhHAcAI3WWBR5N93xuJIcgCyqunsS3x8ZB0NyTMcksrv3ff9t9efXx+PP55+7T59/r37dno8HB5/fj08Pdy/PD4dlf29C/Yngn6kO/2k3SfRz6TfIxqgChArYGe4VCB+SZzJzmRnSnIgE4AADriCGB3URwAEBybIBnIFKTlwBp1BZ8gZsjC0XcDowBmx3xQDuYLsTHamVCaF6EBjBlJgMYMYUEGwSxbqBJxJziRn0BlUJgUFhBUwONCOStr2JMawAakgx3opcwXFmGyAJ4ABHZQKorYCowFtF+pdCMqQPgsTVEDOkFTAfomdEWfEGYtnAlRBCQ7QQZkAheQgVxBNEAxwBRAdOJOcSc6gM2hhqHmJwIH9RhtIHCtjpj0DCQ5mplRgpp2ABaaDSzbuE6gMm2mJDUhlzAAT4ArAGUumM7BsmoA9IhvIFZhpJ+AMOUPOsDNmWlLbsGXcBPQ3bPGYaScgFRRwUBkJ4MAZC34CVIFl3ATQQakgJQf1oYImmA1wBRQdOMPOsDPijPmHtRWSwYH+RtSiYn6eQGWy+XkCGo/o7dn8PIFcATgDziRnklRgtpkAV0DBATnwR9h0MQEVzOrVbOafgFSQncnOFGdKZYp5PkcDuQLzfE4GpAJwxtwyAY0na7cUVKbYXWaSYpfMJBNwhp1hZ8QZM0nRdChmkjOw7p2Azb1BpWMIYYG0QJsng5WGYP3tMM/Qwo4xnCHP0NLVoYlFOMMyw3M5qdDEory93e28Mn19Oe33VphWpUoL2PP9aX982X06vh4Od7t/7g+v5x/9er4/nj9f7k96VZ+6P37XTxX88XjYG3q7W+4O7VshBap3QwKaBabwFonYkQgYxDUCQpxF5DIM6GiY5yaFgksQgpvbwZldQXJutgPbElqjvCsS8tIV74KgG/QEf2BPJM6ukCQuEnQZQm4rULRaeVaguAoCQrqQKJ1WZPdkKstgJB2YC1N1mlEWY5aEsGgQXWp0nFkCJtcIJbQ1oOcKl0grWwHzpULq9IWuEn1IY5brNCDN9gbBtgb1hpXnYYWweDPmzWHoYM69oVNqM4yeuULJSxTUNFfsaGCaLY641oh8VZak1MoS6EiwLvqrBEMozSig49AEbOab4gBeBfJ+7uxZVPcaHoliak/A6RazOI5OXv225FyWtqyn4XdhdOZQ3VvMNqVeIP2RCauRwdwMJPcs4l3KaTWFlb+xaVxsSi2b9hQyzFUtY2gppE5XYASffDBSszCmXn2PFNM8Ceomp9WbqTf74OwMbg/qH8LAuIRRmumWOvMoQlh6Y0l7uq4/Vy153xDpVLY4F0dYnIlxuyuIZ1eINF3RK/G6wfVZByisJsB3fYmdOLDQvNKAq1Y7uSwVKTbnceyZgpiXhugGs9mQjjd14+0NWXXn3zREVqWVmnmKveWnnsTMDUlptUwguBTh8XUXyvi6C/PougvL+Lqrq7Fx3UVxeN3VDYPSvEvT2nZdU9YaXK7T4DTP4oxxXEOu00gFlmThtgbJhw7L1uVwL+3LvGTCEJtpz2F8u8ZxdL/GMD5vcBqfNxhH5w2m8Xmjq7Fx3uBxg/bC2GrQrr02btgkdFdus78oSFNja6JAc8UiMJ4okkYTRXA8UYTGE0V4NFFExhOlq7ExUaQMJ0ovjK2J0rXXxkTJ8LEnG+tEQW6e/+H4yUamG5xsZL7ByUaWG5xs5Dx6stFvy8aTjRLGTzb+MDLbTjYKfODJBgYus03zNScbGOcjBYzYVCh0g5NuHq0IRcYrQsnjFaGU4aPuEG5w1t0V2XrYHWC4KGz1F0PLX/o6b9xgMdD4y5Qb7OpjuMG2PoY8brJyC5PdYGcfY/zfTJbbJuu9lZESXEMKtMt1jN19UwhzqdUVdvOENvbeMSU9dpoPFnWooa3SK5UsuLzCpMsq90W/3j88ni7+qevNxE6P998O+/r1x+vxYXX15d9nv+L/FPZ8enrYf3897U1p+c8w/fMZ1MEA/EVf1kf7CqJfy5c3e/p/"
+      "debug_symbols": "vVrbbts4EP0XP+eBHM6F7K8URZGmbhHAcAI3WWBR5N93xuJIcgCyqunsS3x8ZB0NyTMcksrv3ff9t9efXx+PP55+7T59/r37dno8HB5/fj08Pdy/PD4dlf29C/Yngn6kO/2k3SfRz6TfIxqgChArYGe4VCB+SZzJzmRnSnIgE4AADriCGB3URwAEBybIBnIFKTlwBp1BZ8gZsjC0XcDowBmx3xQDuYLsTHamVCaF6EBjBlJgMYMYUEGwSxbqBJxJziRn0BlUJgUFhBUwONCOStr2JMawAakgx3opcwXFmGyAJ4ABHZQKorYCowFtF+pdCMqQPgsTVEDOkFTAfomdEWfEGYtnAlRBCQ7QQZkAheQgVxBNEAxwBRAdOJOcSc6gM2hhqHmJwIH9RhtIHCtjpj0DCQ5mplRgpp2ABaaDSzbuE6gMm2mJDUhlzAAT4ArAGUumM7BsmoA9IhvIFZhpJ+AMOUPOsDNmWlLbsGXcBPQ3bPGYaScgFRRwUBkJ4MAZC34CVIFl3ATQQakgJQf1oYImmA1wBRQdOMPOsDPijPmHtRWSwYH+RtSiYn6eQGWy+XkCGo/o7dn8PIFcATgDziRnklRgtpkAV0DBATnwR9h0MQEVzOrVbOafgFSQncnOFGdKZYp5PkcDuQLzfE4GpAJwxtwyAY0na7cUVKbYXWaSYpfMJBNwhp1hZ8QZM0nRdChmkjOw7p2Azb1BpWMIYYG0QJsng5WGYP3tMM/Qwo4xnCHP0NLVoYlFOMMyw3M5qdDEory93e28Mn19Oe33VphWpUoL2PP9aX982X06vh4Od7t/7g+v5x/9er4/nj9f7k96VZ+6P37XTxX88XjYG3q7W+4O7VshBap3QwKaBWKkC4nYkQgYxDUCQpxFOF9oQEfDPDcpFFyCENjcDs7sCpJzsx3YltAa5V2RkJeueBcE3aAn+AN7InF2hSRxkaBLT+S2AkWrlWcFiqsgIMQLidJpRXZPprIMhlbvS1N1mlEWY5aEsGhQutToOLMETK4RSmhrQM8VLpFWttJl1aVC6vSFrhJ9SGOW6zQgzfYGwbYG9YaV52G1oZy9lTeHoYM594ZOqc0weuYKJS9RUNNcsaOBabY44loj4lVZklIrS6AjwbrorxIMoTSjgI5DE7CZb4oDeBXI+7mzZ1Hda3gkiqk9AadbzOI4Onn125JzWdqymobfh9GZQ3VvMduUeoH0RyasRgZzM5Dcs4h3KafVFFb+xqZxsSm1bNpTyDBXtYyhpZA6XYERfPLBSM3CmHr1PVJM8ySom5xWb6be7IOzM7g9qH8IA+MSRmmmW+rMowhh6Y0l7em6/ly15H1DpFPZ4lwcYXEmxu2uIJ5dIdJ0Ra/E6wbXZx2gsJoA3/UlduLAQvNKA65a7eSyVKTYnMexZwpiXhqiG8xmQzre1I23N2TVnX/TEFmVVmrmKfaWn3oSMzckpdUygS7DQB5fd6GMr7swj667sIyvu7oaG9ddFIfXXd0wKM27NK1t1zWFUBaXl+s0OM2zOGO8UmPeZgHLdRqpwJIs3NYg+dBh2boc7qV9mZdMGGIz7TmMb9c4ju7XGMbnDU7j8wbj6LzBND5vdDU2zhs8btBeGFsN2rXXxg2bhO7KbfYXBWlqbE0UaK5YBMYTRdJoogiOJ4rQeKIIjyaKyHiidDU2JoqU4UTphbE1Ubr22pgoGT72ZGOdKMjN8z8cP9nIdIOTjcw3ONnIcoOTjZxHTzb6bdl4slHC+MnGH0Zm28lGgQ882cDAZbZpvuZkA+N8pIARmwqFbnDSzaMVoch4RSh5vCKUMnzUHcINzrq7IlsPuwMMF4Wt/mJo+Utf540bLAYaf5lyg119DDfY1seQx01WbmGyG+zsY4z/m8ly22S9tzJSgmtIgXa5jrG7bwphLrW6wm6e0MbeO6akx07zwaIONbRVeqWSBZdXmHRZ5b7o1/uHx9PFP3W9mdjp8f7bYV+//ng9Pqyuvvz77Ff8n8KeT08P+++vp70pLf8Zpn8+gzoYgL/oy/poX0H0a/nyZk//Dw=="
     },
     {
       "name": "is_consumable",
@@ -165,7 +165,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBGJwAABEYnAgQEAicCBQQAHwoABAAFAEMtCEMCLQhEAyUAAABELQICRScCAwRFJwIEBAE7DgAEAAMeAgAEAB4CAAQAHgIABAknAgUBASQCAAQAAABlJQAAAnYnAgQAASkCAAUA71JTTSsCAAYAAAAAAAAAAAMAAAAAAAAAAC0IAQcnAggEBQAIAQgBJwMHBAEAIgcCCC0KCAktDgUJACIJAgktDgQJACIJAgktDgIJACIJAgktDgYJLQgBBCcCCAQFAAgBCAEnAwQEAQAiBwIIACIEAgk/DwAIAAknAgcEAQAqBAcILQsICCcCBAAACioIBAknAgoBAAoqCQoLJAIACwAAARUlAAACiB4CAAkALyoACAAJAAscCgsJAhwKCQgAHAoICQIcCgkLARwKCwgCHAoICQEWCgkIJwIJAAItCAELJwIMBAUACAEMAScDCwQBACILAgwtCgwNLQ4FDQAiDQINLQ4JDQAiDQINLQ4CDQAiDQINLQ4GDS0IAQInAgkEBQAIAQkBJwMCBAEAIgsCCQAiAgIMPw8ACQAMACoCBwktCwkJCioJBAIKKgIKCyQCAAsAAAHHJQAAAogtCAECJwILBAUACAELAScDAgQBACICAgstCgsMLQ4FDAAiDAIMLQ4JDAAiDAIMLQ4DDAAiDAIMLQ4GDC0IAQMnAgUEBQAIAQUBJwMDBAEAIgICBQAiAwIGPw8ABQAGACoDBwItCwICCioCBAMKKgMKBCQCAAQAAAJFJQAAAogeAgADAC8qAAIAAwAEHAoEAwIcCgMCABwKAgMCHAoDBAEcCgQCAhwKAgMBBCoIAwImKgEAAQXwQ+Wh+qIsNDwEAgEmKgEAAQW6uyHXgjMYZDwEAgEm",
-      "debug_symbols": "tVjbbts6EPwXPfuBy72QzK8UReAkSmHAcALXPsBB4H8vN+LqUkCsWjov0XgkjZbkzIrRR/fSP11/PB5Or28/u4dvH93T+XA8Hn48Ht+e95fD2ymzH53TPxK7B9x1AbuHkA/5F7hdF/NPgHyMwzHJcAQHGUQFUgBwAWgMOQN2io1hY8QYIQOxAC1lAKGA6A3YI5KVkbKgdwrSALwjA8aAMWCMNwZzGR4UcAFkDOk1qCAVwMawMWJM8AZyzT5loDWj6qQsiHpKS1WAzhkwBowBY7yWQQryI8gpSAUgGogFkDFkDBvDoQABA1JAcAbYgD0i2kN1/clnkLyBMABy3oAxYAwY47UMVBALQL2GFYQCyBg1yQByPay36zx/Ap3nARgTjAnGqGUHEArQmgcgA2B17wDKI1hnfgAqSApiAVr8AIxBY9AYMkZNwrl4VpMMQK/JkWJBA8YEKSDmegQVZEb0rpRvFz2lflYgjgwYA8aAMWoSibfbrrOAP17Ofa/5niU+94H3/bk/XbqH0/V43HX/7Y/Xz4t+vu9Pn8fL/pzP5pXvTy/5mAVfD8de0W033e3Wb82J4nK3R8+jAEBYSEBFwmVLmYYjD6NIWJbhKxohmkKiqYhAm8chUUwhxLg6DlqXQCKbCiSZpuK3IvgOMyFfOBOIIYzDcLQ6E7Ei4VIC08ivEL82jrSuAS5SkQBwoX0ksjqSigTH0d4ccVoPXo4DKtbMncYGwjBbEu9wqYGVRY0WUUyTN3O3XipUzJmmnCakaUGQealRsWdy2tIHDZfcuobUQmISOEuZF1kqhMpcQEjmcIjh3zQ8jmn3gdY1Um1dZVxX7yZrQNxcRl7McTZyYtbLqNnLpTiVwav28hUNymtRNIjmGiD/FBR2a0HxFYsKjImXvJlbrcJXLIpedLKGKfWCuPouqXkUckTG9pV4/YUU7vFWi63NvD6WGNM0lvlraVkG1hopT6nlWiH1lXGzlaG4WoivWcSmVHDWw9Jf2FTCaNOU1myK1N7PkVv7OUp7P8fQ3s8xtvZzTO39vKqxsZ8TNPfzWhlb+3nVXhv7OVV3omn0F8/2Tr9rbAxKAlkLCkl7UCi0BoVie1AotQeFXWtQGNqDUtXYGBTG5qDUytgalKq9NgaF5Ys3PrOgIK8FhWP7xofTHTY+4u6w8ZF7/Dsvzf/P18eyceMj1L7x+cPKbNv4iHzpxsfRZNOwsOn3/Gv/fDgvvhbfVOt82D8d+/Lz9Xp6np29/P9uZ+xr8/v57bl/uZ57VZo+OUP+6vUN8i4VfPx+0+f9Ag=="
+      "debug_symbols": "tVhbbuM4ELyLvv1Bsh8kc5XBIHASZ2DAcAKPvcAi8N23O2JLcgByNUPnJyqXpFKTrGox+hhedk+XX4/74+vb7+Hhx8fwdNofDvtfj4e35+15/3YU9mNw+ofT8ACbIcLwEOUgv7zbDEl+ei/HNB4zj0fvvICkgAvwVAAYg86AnSJjyBg2htFAKkBLGUEsIAUD9ohsZWQRDE5BHkFwaMAYb4w3JhgDUkbwCqgANAb1GlCQCyBjyBg2JgYDUnPIArRmUJ0sgqCntFQF4JwBY7wx3pigZaACeQQ6BbkAAAOpADQGjSFjKBbA3gAXEJ0BMmCPSPZQXX8MAnIwEEeALhgwxhvjjQlaBihIBYBeQwpiAWiMmmQEUg/p7TrPn0DneQTGRGOiMWrZEcQCtOYR8AhI3TuC8gjSmR+BCqKCVIAWPwJjwBgwBo1Rk5AUT2qSEeg1EiliMGBM5AKS1MOgQBjWu7LcznpK/ayAHRowxhvjjVGTcLpeN4MF/PF82u0034vESx943552x/PwcLwcDpvhn+3h8nnR7/ft8fN43p7krKz87vgiRxF83R92iq6b+W5Xv1USReXuAIEmAWkTNxK+IeHEUqbhMPhJ5HOIs0ZoaMRkChnnImJYPQ5ObAoxpeo4sC4BiDYVgDxPxZci6A4zwd84EwAxTsNwWJ2J1JBwOXvTkFdIqI0j1zW8S1gkvHexfyRcHUlDgtJkb0owrwfdBsQ3rCmdxgZCfrEkwflbDWgsarKIQp69CYlvFRrmzHNOM+C8IPLmuNVo2DM7bemjhsuursGtkJgELFImL9ZbhdiYCx+zOdyn+HcaAaa0h4h1jdxaV57WVddycldaXYYs5jQbkph6GS17uZzmMqhqr9DQQFmLooG41PD4V0EhVwtKaFiU/ZR4ls1ctYrQsCgE1skapzQwQPVd0vKol4hM7StT/YUU7/FWS73NvD2WlPI8lsVr6UsZ0GqkNKeWWoW0V8YtVgZTtZDQsohNKcOih+U/sCnHyaY512wK2N/PgXr7OXB/P4fY388h9fZzyP39vKmxsp+j7+7nrTLW9vOmvVb2c2zuRPPkL1rsnb5qrAxK9lwLCnJ/UDD2BgVTf1Aw9weFXG9QyPcHpamxMigE3UFplbE2KE17rQwK8TdvfBZBAaoFhVL/xofyHTY+7O6w8eF7/DvP3f/Pt8eycuPD2L/x+Z+VWbfxYf7WjY/D2abxxqY/5df2eX+6+Vp8Va3Tfvt02JWfr5fj8+Ls+d93O2Nfm99Pb8+7l8tpp0rzJ2cvX71+eNml+pB+XvV5/wE="
     },
     {
       "name": "is_reject_all",
@@ -211,7 +211,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBFJwAABEUnAgMEAScCBAQAHwoAAwAEAEMtCEMCJQAAAEAtAgJEJwIDBEQnAgQEATsOAAQAAx4CAAMAHgIAAwAeAgADCScCBAEBJAIAAwAAAGElAAABQSkCAAMA71JTTScCBAABKwIABQAAAAAAAAAAAwAAAAAAAAAALQgBBicCBwQFAAgBBwEnAwYEAQAiBgIHLQoHCC0OAwgAIggCCC0OBAgAIggCCC0OAggAIggCCC0OBQgtCAECJwIDBAUACAEDAScDAgQBACIGAgMAIgICBD8PAAMABCcCAwQBACoCAwQtCwQEJwICAAAKKgQCAycCAgEACioDAgUkAgAFAAABESUAAAFTHgIAAgAvKgAEAAIAAxwKAwQCHAoEAgAcCgIDAhwKAwQBHAoEAgIcCgIDAS0KAwImKgEAAQWiP4wWRewq/zwEAgEmKgEAAQW6uyHXgjMYZDwEAgEm",
-      "debug_symbols": "tZZZauNAEIbvomc91NKrrxJCUBw5CIRsFHtgML77VNsqLYFuQpLxg/tXtfW51pau1Vv7enl/6YbD8aPaPV2r17Hr++79pT/um3N3HMR6rSB9OVPtuK5crHa+rrxcIcgql4h1FcxjjTStXtZQVwhuEoiTYFKhW0a3jFqsWqxaHKgwKuIkPKsIkwj6F0HdiAIkSMI+BAGoUAuqBdVCaiFxgyQsYlShFpN+w0nYSVi1WLU4tbgwieQzxSTEwokTBMhpK7n6EJOFAVWoBe+W262utFAv57FtU51WlZN6npqxHc7Vbrj0fV39afrL/Ucfp2a4r+dmlF0JsR3eZBXgoevbpG71cjfkbyUGO91NTHYGIPoNAgsIMOCVAYZwhvitG1Rg+KCEaBYnvPlyHC44JfgQsnGYPIKN0VSwcUsqPjlhfyET7j9mgtn7OQww2UyEAgJiRGUgIOXiiHkGQjATAhH8zyNx2UgKCGvTlN4RVj4zwm7jwEJrWjQaiMVVSQh4y+BCUYOOKMelN1n6dEMoNGdc5jSyWQrCEtSGUWjPCIaVARHyDFcaEkXwasrIuS3BF3KBXktCcsB/jyHntzLImzwjlurq5roSLKOK4ctuSDHnbMjE5N0otRfEsLhhs+1FBYaRWkwMY9YMdN8alFVGPw0KFVrU4TzxjiBmvaBCizK5lKxHSsnJMzL3LCn1KMqIzMdXtPkHkv+Np1r46WFejiWEuMSyfixt3eDSQWqXqbUlR8qVgVVlTMg6QqUW0ZQ6Xp1hURrkWS6bfTduXl1vCTV2zWvfTpeHy7Bf7Z7/nnRHX31P43Hfvl3GNpGW99/0yvXkuHb2+Zb+7R8="
+      "debug_symbols": "tZbbbuIwEIbfxde58Mz4yKtUFQoQqkhRQCmstEK8+44hkwOSrartcoH/jMnHHJ3c1KHZXT+2bX88farN203thrbr2o9td9rXl/bUs/WmdPpyRm2oUi6qja+U5yvQvPIlQKWCea4Rx9XzGioF2o0CYBSEImTLyJYRixWLFYvTIoyIOApPIsIogvxFEDciA1EnYZ8CtRYhFhALiAXFguwGclhIIEIsJv2GkrCjsGKxYnFicWEUyWeMSbCFEicwkNJWcvUpRgtpECEWeFju90pJobaXoWlSnRaV43qe66HpL2rTX7uuUn/q7vr40ee57h/rpR54l0Ns+gOvDDy2XZPUvZrv1vlbkbQd70ZCOwEA7AoBBYQ22gtDG4QJ4sKKgQWGD0KIZnbC45fjcMEJwYeQjcPkEWSMpIKMm1Px4oT9hUy4/5gJIu+nMLTJZiIUEDpGEAZowFwcMc8AHcyIAND+55G4bCQFhLVpSh8Iy58JYdcDAoXWtGAkEAuLkqCGNYMKRQ0yohTn3qTg1oRCc8Z5TiOZuSBkac0otGfUhoSho84zXGlIBEGLKUNn1gRfyAV4KQnyAf89Bp/fwkBv8oxYqqub6ppqOXVX+LIbXMwpGzwxeTdK7aVjmN2w2fbCAsNwLUaGMUsGmG8NyiKjL4OChRZ1ME28Qx2zXmChRQldStYzpej4GZl7lpR6FHhEpuMr2vwDyf/GUy389DAvxxJCnGNZPJZe3KDSQWrnqbUlR8qV0YvKmJB1BEstIil1tDjD2KX7O1/W+3ZYvbreE2po613XjJfHa79f7F7+nmVHXn3Pw2nfHK5Dk0jz+2965XpzVDn7fk//9g8="
     },
     {
       "name": "set_authorized",
@@ -245,7 +245,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBGJwAABEYlAAAASicCBAQCJwIFBAAfCgAEAAUARBwARUUBLQhEAi0IRQMlAAAAcCcCAgRGJwIDBAA7DgADAAIsAABDADBkTnLhMaApuFBFtoGBWF0oM+hIeblwkUPh9ZPwAAAAJh4CAAQAHgIABAAeAgAEAQoiBEMFFgoFBhwKBgcABCoHBAYnAgQBAAoqBQQHJAIABwAAAK0nAggEADwGCAEnAgUAAikCAAcA71JTTSsCAAgAAAAAAAAAAAMAAAAAAAAAAC0IAQknAgoEBQAIAQoBJwMJBAEAIgkCCi0KCgstDgcLACILAgstDgULACILAgstDgYLACILAgstDggLLQgBBScCBgQFAAgBBgEnAwUEAQAiCQIGACIFAgo/DwAGAAonAgYEAQAqBQYJLQsJCScCBQAACioJBQoKKgoECyQCAAsAAAFYJQAAAeItCAEKJwILBAUACAELAScDCgQBACIKAgstCgsMLQ4HDAAiDAIMLQ4JDAAiDAIMLQ4CDAAiDAIMLQ4IDC0IAQInAgcEBQAIAQcBJwMCBAEAIgoCBwAiAgIIPw8ABwAIACoCBgctCwcHCioHBQIKKgIEBSQCAAUAAAHWJQAAAeIcCgMCADAKAAIAByYqAQABBbq7IdeCMxhkPAQCASY=",
-      "debug_symbols": "tVfbbuIwEP2XPPPgufgy/MpqVdE2rZAQoBRWWlX8+47Bk0slW2zZfSGH4+TkeHzGST671/75/P603b8dPrr1j8/uedjudtv3p93hZXPaHvbKfnYu/wBgt6aVHmO3jnpE/Q+QgRKQRwgNhDLEYCAzXoEHA8YENiAFROrWiBmkAlK8AXSFwezmBmwIjUFjyJjs5wrYGfAGpADPBuwWgQxkQVYQwUAoIBmTjBFjpDDksg2fQSwAjIF8jhaTEAwYQ8aQFMDqkLIgpwI8GTAmGBOMiWggFJA934AvQJwBu4XIDbDLgiGDWMA1B1dgDBqDxpAxlG2oeWYykM8RBR4NGBN8AVH9MGWgDIfLZdVZIJ9OQ9/nPM4Sqrk9boZ+f+rW+/Nut+p+bXbn60kfx83+ejxtBh11q67fv+pRBd+2uz6jy2q62tUvRXK+XK258qOAtsNCAhoSTotoGo4RRpG4tIENjZhMQXgyEfnueYQUTCGmVJ0H1yU0iFYK0jWbZrE04f9BJcL/rASF0QMlHCX80kKqK2grWC0ZfLUQ0vCg+yGZCfAYaoUA11oPseUI9Uq0XTBMLoSqLhrJZHRTLWSq5reKOZvHl2lAI5gClkvBKdkM9ycib3klESHUEgGNVHpgk/AwyyU6WmrEho1klSSZpkHarAuFRi1l2qyEeIo2+eVyQCMU4tiSKU5cVQObyTQJmm01GMJSobVnQpQxmSl+TwNp3PIwcl2DWusaxnVFN+1XkO62oYs5VkMEqjaa8XKSJhu+Gi8Mze1izJd3sapxb6PMVvZLo2B6vFFQHm0Uco83CsHjjUL4aKMQPd4oTY07G4X8w43SsnFvozTjdWejUOuJpGthTySea0D4TqOwqzYKNySiOKtGFJSqC25tPezGB7xiX33fYmytrB8rOus2+Ssbjicb9bcdbr19kn7JmIj2DVZFGinVV7/RSAS/fGn6qX83L9th8RF8yWLDdvO868vft/P+ZTZ6+n20EfuIPg6Hl/71PPRZaf4lrZ8sGi1xPy/5bn8A"
+      "debug_symbols": "tVfbbuIwEP2XPPPgufgy/MpqVdE2rZAQoBRWWlX8+47Bk0slW2zZfSGH4+TkZHzGiT+71/75/P603b8dPrr1j8/uedjudtv3p93hZXPaHvbKfnYu/wBgt6aVHmO3jnpE/Q+QgRKQRwgNhDLEYCAzXoEHA8YENiAFROrWiBmkAlK8AXSFwezmBmwIjUFjyJjs5wrYGfAGpADPBuwWgQxkQVYQwUAoIBmTjBFjpDDksg2fQSwAjIF8jhaTEAwYQ8aQFMDqkLIgpwI8GTAmGBOMiWggFJA934AvQJwBu4XIDbDLgiGDWMA1B1dgDBqDxpAxlG2oeWYykM8RBR4NGBN8AVH9MGWgDIfLZdVZIJ9OQ9/nPM4Sqrk9boZ+f+rW+/Nut+p+bXbn60kfx83+ejxtBh11q67fv+pRBd+2uz6jy2q62tUvRXK+XK258qMAgF9IQEPCaRFNwzHCKBLSQgMbGjGZgvBkIuLdzxFSMIWYUvU5uC6hQbRSkM7ZKPHFhP8HlQj/sxIURg+UcJTwy0ykuoK2gtWSwVcLIQ0Puh6SmQCPoVYIcK35EJuOUK9E2wXD5EKo6qKRTEY31UKman6rmLPn+PIY0AimgOVScEo2w/2JyEteSUQItURAI5Ue2CQ8zHKJbukCYsNGskqSTI9BKSwVGrWUabES4ina+sJYajRCIY4tmeLEVTWwmUyToNlSgzq7C4XWmglRxmSm+D0NpHHJw8h1DWrNaxjnNc/l2GXpbhs6mWM1RKBqoxkvJ2my4avxwtBcLsZ8eRerGvc2ymxmvzQKpscbBeXRRiH3eKMQPN4ohI82CtHjjdLUuLNRyD/cKC0b9zZKM153Ngq13kg6F/ZG4rkG8HcahV21UbghEcVZNaKgVF1wa+lhN77gFfvq9xZja2b9WNFZt8lf2XA82ah/7XDr65N0J2Mi2jdYFWmkVD/9RiMR/PKj6af+3bxsh8Um+JLFhu3medeXv2/n/cts9PT7aCO2iT4Oh5f+9Tz0WWm+k9Yti0ZL3M9Lvtsf"
     },
     {
       "name": "set_authorized_private",
@@ -2068,7 +2068,7 @@
         }
       },
       "bytecode": "H4sIAAAAAAAA/+2dd2BURdfGc86EFkApKnYiSFGxgL0DSYCoFMHe4possBKSuNkgYI29mwRQEBGVKooVUewFQWUeQQGVoth7wd71uyFlN2WT2WSf1/Lx/vNed+/9nblzZ+bOnNn8MCXFN6/pkZHhGx/yZ2bkBDMCOSF/MMeXnZ+Rke8PZfgKQiNzg4Hx/qyMvGBgjC/kh9mw3iwpvL9vti9zVN/csf0KcjJTfNnZhbOG9hnUP62kcM6JgVCOPz9fkx1OMuJwUlsXUvveDidtYy92OKuD01k7upRqJ5eTdnY5qaPLSclOJd/F6axOTmd1djprV5fCd5PCu/sGA9nZgRGl309MKCqaUFS0ODmh7v9J4bw++fn+YOgUfzB3QlFxyeLkfbIGBd/teftujw5JW1hYeNLp3ff9ZMC4RXnFKe/+MGGjdwnMDXVjV+/5/qiGYG+Mik2sOKilIhYMyc33B7Jyc3oN8QdHF4R8oUBuTsnEyorxilt53KXyqGvE9zdOhCmCKYYpgZlQteQTSuqvwm4O53gRnOpgYr2ohtVB5HFxxHFJxPEErx4mwdwEczPM5Kr1UOJwj7s63eEUhzZZf3P3OMmxl7C9UwlvqQckx17sVMJbelftklJcOHtYIGdEtr+sR9RXWpe6StjEHJ2X7b1aprp1eJeiT602mrQgF/3W2Meq4glOxfDYbgWeVn/TaFj8aUUOfTp28lSPPMGpPU91Omua01m3OTylRrWchPpPiWg30zntxrvR6SVOrWa601m3E9qWV8bbi12j13NSwv/ymd1Be2Z3uNXHHTE+Dcfpy511x27dc/JDNW6qPmrpQ3ZpiAlOJZxBmlzcGXE8I7yEqTbFmgkzC2Y2zJzYp1jexMTprJlO9TCXVA9zI45nRRzPjjie49XEXTDzYO6Guadqv9NJsb5lXZ5oTEiNN9B7cvFH3hVvZJf6gbzl1PwY5weO2HujYrUS27jllPcgIo7nRxzf67Xy+2Duh3kA5sGqrdxbc8zqEwz6xhX/bY/bK1zcHniVe0ucFPd2FwbWU5qlY9M7EKqBMPF3vqVSYkl45vBQ+HBB/NY6DzVgIeld5dQHH45TGR9OrtrOmsS8Hlvgsh4r75cwCxtavbENHwvrGD4egXkUZhHMYw15PAucHs8jDRl56w++sO7Yc7v0uqEhA/rjdcdOX7dxeEOwT0TFmspKaMiDfryWtFvVN8YT3mN+EuYpmKdhnqnawpvG3MKf5LzD3drbw05V/WychoNnkxvyoJ+rO/rMK+dObQj2+bqxvptGnd8Q7OKo2CYVBw1qls9FHD9faxNd7DXLF2CWwCyFeTH2xUpXpxbzglMtvBTrCBW/hPUSpwK+TFpLvRRx/HLE8dKI4xe9B7UMxsIA5pWq40ezilnmxHr7fGkLjdt0zQ3UNV6gbvGfwC37O8fRZ50a3fI4jaPLq02rmhf/fZXVyK2C+qskMt++In7T5xUNTMtPdXsNvMpOXjqFiKi611hbFa96bLcCr6RsVXjxVxbFWttJJZW17ZLP3LRtMSUeLVo2lcVxIbnp5IiF5Krw4er49YRVbqetTo45DVzWYdwSpcvr7lYlGzedtcqp8612eASxN7SVpeGd4ruV8nVKd1zhgd2GqDcasL9XP7U0vts7c4VTKd9sQCnrj+0+kK9p5NBSf1luKx9aGjt/aNTQsjZ8uC5+Q8tat9PWJTfsEd7mtpHsNrSsdWKtowwtXqdZ63Yvbp3G7V7WN2Qu7IB1OustyuhX2ijc+tLbMY4rJU7xl3vDqtOJb3oji1tBN8S6lHYbfd1+XbGiIcHr3R12KGB3RmBxCLwbI7A6BN6dEdg4BN6D0cB6ODWvSbGGdpmC78moyESHwHsxAjdxCLw3I3BTh8D7MAI3cwjckxG4uUPgXozALRwC78sInOQQeD9G4JYOgfdnBG7lEPgARuDWDoEPZATewiHwQYzAWzoEPpgRuI1D4EMYgds6BD6UEbidQ+DDGIHbOwQ+nBF4K4fARzACb+0Q+EhG4G0cAvdmBO7gELgPI/C2DoH7MgJv5xA4hRF4e4fAqYzAOzgETmME3tEhcD9G4J0cAvdnBN7ZIfAARuCODoHTGYGTHQIfxQi8i0PgoxmBOzkEPoYRuLND4IGMRfcgBnQwIzMxxCkzcQvj6ezqULxjGfc8NA7bCzVDlzhtCHkp0fVOJ77lJWVdWsUwSubWS8Gvcd3g2uBS58fFbXsp5n5zPAN6AgN6IgN6EgN6MgN6CgN6KgN6GgN6OgN6BgOawYCeyYD6GNCzGNBMBjSLAfUzoMMZ0BEM6EgGNMCAns2AjmJAsxnQ0QxoDgOay4DmMaDnMKBBBjSfAQ0xoAUM6BgG9FwGdCwDOo4BHc+AnseAns+AXsCAXsiAXsSA2osp1EIK9RIK9VIK9TIK9XIK9QoK9UoK9SoK9WoK9RoK9VoK9ToK9XoK9QYK9UYKtYhCLaZQSyjUCRTqRAqV8mNFexOFejOFOplCnUKh3kKhTqVQb6VQp1Got1Go0ynU2ynUOyjUOynUGRTqTAp1FoU6m0KdQ6HOpVDvolDnUah3U6j3UKjzKdR7KdT7KNT7KdQHKNQHKdSHKNQFFOrDFOpCCpViuLKPUqiLKNTHKNTHKdQnKNQnKdSnKNSnKdRnKNRnKdTnKNTnKdTFFOoLFOoSCnUphfoihfoShfoyhbqMQrUUKijUVyjU5RTqCgr1VQr1NQp1JYW6ikJdTaG+TqG+QaG+SaFSfoJs11Ko6yjU9RTqWxTq2xTqBgr1HQr1XQr1PQr1fQr1Awr1Qwr1Iwr1Ywr1Ewr1Uwr1Mwr1cwr1Cwr1Swr1Kwr1awp1I4X6DYX6LYX6HYX6PYX6A4X6I4X6E4X6M4X6C4X6K4X6G4X6O4X6B4X6J4X6F4MKh38hrkFY4WCVgzUcbCIH24SDbcrBNosVGy/NIaQ5I3QXp9AtOJWZVHf5ul+58LOGYFvG+u8uOgk4pVWJy9+H39eQp1R/8NZOwRdwgm/hFHwKJ/iWTsEf4rTQNhxsWw62HQfbnoPdioPdmoPdhoPtwMFuy8Fux8Fuz8HuwMHuyMHuxMHuzMF25GCTOdhdONhOHGxnDnZXDrYLB9uVg+3GwXbnYHfjYHfnYPfgYHtwsHtysHtxsHtzsPtwsD052F4c7L4c7H4c7P4c7AEc7IEc7EEc7MEc7CEc7KEc7GEc7OEc7BEc7JEcbG8Otg8H25eDTeFgUznYNA62Hwfbn4Md0JCUanzS3hTDsVtoiuPYOIVukOW4fuwxTsnUZZzgA52CP8tpwYM42MEc7BAO9lgOdigHO4yDPY6DPZ6DPYGDPZGDPYmDPZmDPYWDPZWDPY2DPZ2DPYODzeBgz+RgfRzsWRxsJgebxcH6OdjhHOwIDnYkBxvgYM/mYEdxsNkc7GgONoeDzeVg8zjYczjYIAebz8GGONgCDnYMB3suBzuWgx3HwY7nYM/jYM/nYC/gYC/kYC/iYC/mYAs52Es42Es52Ms42Ms52Cs42Cs52Ks42Ks52Gs42Gs52Os42Os52Bs42Bs52CIOtpiDLeFgJ3CwEznYSRzsTRzszRzsZA52Cgd7Cwc7lYO9lYOdxsHexsFO52Bv52Dv4GDv5GBncLAzOdhZHOxsDnYOBzuXg72Lg53Hwd7Nwd7Dwc7nYO/lYO/jYO/nYB/gYB/kYEl/c7iAg32Yg13IwT7CwT7KwS7iYB/jYB/nYJ/gYJ/kYJ/iYJ/mYJ/hYEm/tXuOg32eg13Mwb7AwS7hYJdysC9ysC9xsC9zsMs4WMvBgoN9hYNdzsGu4GBf5WBf42BXcrCrONjVHOzrHOwbHOybHOwaDnYtB7uOg13Pwb7Fwb7NwW7gYN/hYN/lYN/jYN/nYD/gYD/kYD/iYD/mYD/hYD+N9c/t3LCfcUr7OQf7BQf7JQf7FQf7NQe7kYP9hoP9loP9joP9noP9gYP9kYP9iYP9mYP9hYP9lYP9jYP9nYP9g4P9k4PleImV4yVWjpdYOV5i5XiJleMlVo6XWDleYm3GwTbnYDk+YU3iYFtysK042NYc7BaxYp2cEOpm9+XsAWobzj21dbonzn68tuNgOQ5g5TiAleMAVo4DWDkOYOU4gJXjAFaOA1g5DmDlOICV4wBWjgNYOQ5g5TiAleMAVo4DWDkOYOU4gJXjAFaOA1g5DmDlOICV4wBWjgNYOQ5g5TiAleMAVo4DWDkOYOU4gJXjANZeHCzHAawcB7ByHMDKcQArxwGsHAewchzAynEAK8cBrBwHsHIcwMpxAOuRlF1Y5TiAleMAVo4DWDkOYOU4gJXjAFaOA1g5DmAdwMGmc7BHcbBHc7DHcLADOViOS1c5Ll3luHSV49LVoRwsx6WrHJeucly6ynHpKselqxyXrnJcuspx6SrHpascl65yXLrKcekqx6WrHJeucly6ynHpKselqxyXrnJcuspx6SrHpascl65yXLrKcekqx6WrHJeucly6ynHpKselqxyXrnJcuhrkYDkuXeW4dJXj0lWOS1c5Ll3luHSV49JVjktXOS5d5bh0lePSVY5LVzkuXeW4dJXj0lWOS1c5Ll3luHSV49JVjktXOS5d5bh0lePSVY5LVzkuXeW4dJXj0lWOS1c5Ll3luHSV49LVEg6W49JVjktXOS5d5bh0lePSVY5LVzkuXeW4dJXj0lWOS1c5Ll3luHSV49JVjktXOS5d5bh0lePSVY5LVzkuXeW4dJXj0lWOS1c5Ll3luHSV49JVjktXOS5d5bh0lePSVY5LVzkuXX2Qg+W4dJXj0lXS3+5xXLrKcekqx6WrHJeucly6ynHpKselq6S/o+W4dJXj0lWOS1c5Ll3luHSV49JVjktXOS5d5bh0lePSVY5LVzkuXeW4dJXj0lWOS1c5Ll3luHSV49JVjktXOS5dfY2D5bh0lePSVY5LVzkuXeW4dJXj0lWOS1c5Ll3luHSV49JVjktXOS5d5bh0lePSVY5LVzkuXeW4dJXj0lWOS1c5Ll3luHSV49LVTzlYjktXOS5d5bh0lePSVY5LVzkuXeW4dJXj0tVvOViOS1c5Ll3luHSV49JVjktXOS5d5bh0lePSVY5LVzkuXeW4dJXj0lWOS9dwXLqG49I1HJeu4bh0DcelazguXcNx6RqOS9dwXLqG49I1HJeu4bh0DcelazguXbMFB7slB9uGg23LwbbjYDn+W8Px3xqO/9Zw/LeG4781HP+t4fhvDcd/azj+W8Px3xqO/9Zw/LeG4781HP+t4fhvDcd/azj+W8Px3xqO/9Zw/LeG4781HP+t4fhvDcd/azj+W8Px3xqO/9Zw/LeG4781HP+t4fhvTS8OluO/NRz/reH4bw3Hf2s4/lvD8d8ajv/WcPy3huO/NRz/reH4bw3Hf2uO5GA5/lvD8d8ajv/WcPy3huO/NRz/reH4bw3Hf2s4/lvD8d8ajv/WcPy3huO/NRz/reH4bw3Hf2s4/lvD8d+aoRwsx39rOP5bw/HfGo7/1nD8t4bjvzUc/63h+G8Nx39rOP5bw/HfGo7/1nD8t4bjvzUc/63h+G8Nx39rOP5bw/HfGo7/1nD8t4bjvzUc/63h+G8Nx39rOP5bw/HfGo7/1nD8t4bjvzUc/60JcrAc/63h+G8Nx39rOP5bw/HfGo7/1nD8t4bjvzUc/63h+G8Nx39rOP5bw/HfGo7/1nD8t4bjvzUc/63h+G8Nx39rOP5bw/HfGo7/1nD8t4bjvzUc/63h+G+Nk/92oH90bnBcek4gNCFpvRnefbfd9+ix515779Oz17777X/AgQcdfMihhx1+xJG9+/RNSU3r139A+lFHHzNw0OAhxw4ddtzxJ5x40smnnHra6WdknOk7KzPLP3zEyMDZo7JH5+TmnRPMDxWMOXfsuPHnnX/BhRfZi22hvcReai+zl9sr7JX2Knu1vcZea6+z19sb7I22yBbbEjvBTrST7E32ZjvZTrG32Kn2VjvN3man29vtHfZOO8POtLPsbDvHzrV32Xn2bnuPnW/vtffZ++0D9kH7kF1gH7YL7SP2UbvIPmYft0/YJ+1T9mn7jH3WPmeft4vtC3aJXWpftC/Zl+0yay3sK3a5XWFfta/ZlXaVXW1ft2/YN+0au9aus+vtW/Ztu8G+Y9+179n37Qf2Q/uR/dh+Yj+1n9nP7Rf2S/uV/dputN/Yb+139nv7g/3R/mR/tr/YX+1v9nf7h/3T/gVJgAhEIQaSCGkCaQppBmkOaQFJgrSEtIK0hmwB2RLSBtIW0g7SHrIVZGvINpAOkG0h20G2h+wA2RGyE2RnSEdIMmQXSCdIZ8iukC6QrpBukO6Q3SC7Q/aA9IDsCdkLsjdkH0hPSC/IvpD9IPtDDoAcCDkIcjDkEMihkMMgh0OOgBwJ6Q3pA+kLSYGkQtIg/SD9IQMg6ZCjIEdDjoEMhAyCDIYMgRwLGQoZBjkOcjzkBMiJkJMgJ0NOgZwKOQ1yOuQMSAbkTIgPchYkE5IF8UOGQ0ZARkICkLMhoyDZkNGQHEguJA9yDiQIyYeEIAWQMZBzIWMh4yDjIedBzodcALkQchHkYkgh5BLIpZDLIJdDroBcCbkKcjXkGsi1kOsg10NugNwIKYIUQ0ogEyATIZMgN0FuhkyGTIHcApkKuRUyDXIbZDrkdsgdkDshMyAzIbMgsyFzIHMhd0HmQe6G3AOZD7kXch/kfsgDkAchD0EWQB6GLIQ8AnkUsgjyGORxyBOQJyFPQZ6GPAN5FvIc5HnIYsgLkCWQpZAXIS9BXoYsg1gIIK9AlkNWQF6FvAZZCVkFWQ15HfIG5E3IGshayDrIeshbkLchGyDvQN6FvAd5H/IB5EPIR5CPIZ9APoV8Bvkc8gXkS8hXkK8hGyHfQL6FfAf5HvID5EfIT5CfIb9AfoX8Bvkd8gfkT8hf0ASoQBVqoInQJtCm0GbQ5tAW0CRoS2graGvoFtAtoW2gbaHtoO2hW0G3hm4D7QDdFroddHvoDtAdoTtBd4Z2hCZDd4F2gnaG7grtAu0K7QbtDt0Nujt0D2gP6J7QvaB7Q/eB9oT2gu4L3Q+6P/QA6IHQg6AHQw+BHgo9DHo49AjokdDe0D7QvtAUaCo0DdoP2h86AJoOPQp6NPQY6EDoIOhg6BDosdCh0GHQ46DHQ0+Angg9CXoy9BToqdDToKdDz4BmQM+E+qBnQTOhWVA/dDh0BHQkNAA9GzoKmg0dDc2B5kLzoOdAg9B8aAhaAB0DPRc6FjoOOh56HvR86AXQC6EXQS+GFkIvgV4KvQx6OfQK6JXQq6BXQ6+BXgu9Dno99AbojdAiaDG0BDoBOhE6CXoT9GboZOgU6C3QqdBbodOgt0GnQ2+H3gG9EzoDOhM6CzobOgc6F3oXdB70bug90PnQe6H3Qe+HPgB9EPoQdAH0YehC6CPQR6GLoI9BH4c+AX0S+hT0aegz0Gehz0Gfhy6GvgBdAl0KfRH6EvRl6DKohQL6CnQ5dAX0Vehr0JXQVdDV0Nehb0DfhK6BroWug66HvgV9G7oB+g70Xeh70PehH0A/hH4E/Rj6CfRT6GfQz6FfQL+EfgX9GroR+g30W+h30O+hP0B/hP4E/Rn6C/RX6G/Q36F/QP+E/gWTAOO9kxXGwCTCNIFpCtMMpjlMC5gkmJYwrWBaw2wBsyVMG5i2MO1g2sNsBbM1zDYwHWC2hdkOZnuYHWB2hNkJZmeYjjDJMLvAdILpDLMrTBeYrjDdYLrD7AazO8weMD1g9oTZC2ZvmH1gesL0gtkXZj+Y/WEOgDkQ5iCYg2EOgTkU5jCYw2GOgDkSpjdMH5i+MCkwqTBpMP1g+nsb+94mvLdh7m1uexvR3qaxt8HrbcZ6G6feJqe3IeltHnobfd6mnLeB5m12eRtT3iaSt+Hjbc54Gynepoe3QeFtJniJfy9J7yXUveS3l6j2kspeAthL1nqJVS8J6iUsveSilwj0knZegs1LhnmJKy/J5CWEvOSNl2jxkiJeAsNLNniJAW8R7y24vcWxt5D1Fp3eAtFbzHkLL2+R5C1ovMWHt1DwJvXeBNybLHsTW28S6k0YvcmdNxHzJk3zhvpDBcGcVF/Itz6he4KoSWzStFnzFkktW7XeYss2bdu132rrbTpsu932O+y4084dk3fp1HnXLl27FRVNLimc2SczEOxQsnxFs8+/X7ZkRFFR+Ufb1fyoV82P9i9ZPnLtpxn27TFzKj46oGT51YMHpe559frEio8Oq3lhv5ofnVGyvFfgxIMXrX365vUJmYXz0sbmBf35+YHcnAlF9f+LAENivWBkrBf4Yr0gP9YL/LFekBzrBZn/vFrKifWCEf+8as2iFylEj5D5zytSFv3B5dJba8xFGh7rBQX0e+A3jcB/4MGdS7/pEH30jvmm8za/dv8Rr13+cD8q1gv2oldrOn1sTf7nddEAvT8k/weKFHN/GEsf+f5fzsh60J90Ab3x8d8PnWO94FT6WzSbfkHMU7iYJ1gZm2czjFranERwueD0WC9ImFqyprtv045pRmbu6DxfKHBWtj8jN+jL9P5vjD9YCso4N+jLy/MHpxfOSsnNyQ9NKJydGgj6M0NaOCc9J+Qf4Q/OOH7fXvVvtVa/XmK6/uLU6tcnxBY/tXBmii87u7hlJWfuUH+2d8tj/DHeSUJNgomVcE9pWbK87GlKbt64yltKjSxTBLys5K0bXfLUOJR85rBQbl5xSZSSVntGKbP6BfzZ9f+iepvZZfnkwrv75Qb9gRE5pTc8aU033/iQPzOjIJSdUdZMUypb6eBNjfSEsjZaVFRcOL9sj75PVlZpD6gsQHHh7GGB0XnZ/rKSlMcpWZMcyM/wj/VnFoRK23ggJyPo9xp8WQfIG+nL969PaPM3t/i0Rrb4tEY/balJSIxPS0+JLFME3Gvpkc0nfBAZtXDGwNwxVVpg5WkVPaXsjNq6VWPrJLXRdSI1+1CVOqjaB7qW9YG84JiMQH5aRYtNzxla2V6HlDbXGh0gzK7sApXFvPP4ntHP15rn117p4QiVvaqLf3QglOErCI3MDQbG+zb1LV9+Ru7w4ZkjfV4n8w8f7j2P9Qm9/+auld7IrpVe3tDa1mwMzWIjNalJaB73l0mzSHjVLpYWPnDqYqnVvzFhQLVvEiu+6Vf9myYV3/Sv/k3Tim8GlNdw+0a/9NL/5y+92OgVvad6VTQLt+3GNhFvTOkbyPGV/oItNDhvUiV4htf5Nz3tykgREean52SV3U/jWrhUCx4OURm+5j1r1VFwUXgQHOEPDfDljxzifTnaN8Ib9+4a4Pfl9QkGfeMiKq+5N+rNKvuw2gzARB/5EqudWtFVIiol/NTLT2n8KzZK7bSorXYi54TH5PqyIu64ReRhY0ul0UqVFGOpkiIPozBNHe0gpQbR1Nbzwhe6TDiHLk/uWL23tayjt7WKrfKSYu9traL3tpZxak+tatZyy3Bvq1YbrSOLNssb/IL+2r9tFi1c65rhWofD1YVsEn9k0/gjNf7I5vFHJsYf2SL+yKT4I2uORBrZ7qPE05rxtI54LR2ag9bZ7aq85J4Ir3ZLp9GDyyfNaZvmzKVL3FrfdNoi2puuRXixm+8PZXirhJHeG7TstVmR5ClP7qxP6PLfW+wmxvrOq0FoEvfFbmIkvLEz25RGl1iiztlreQ02bdwcwuE12DT6azAxTq/BpjX7Y2L112D5f5rIB1Plm8TIIlf5pknkoyhbwXSoY+WcGHU1VZGu7NToVpJGX//U+pybVX/OJlxHVaqsefiEKp+3CNf2zKMKRucVd6wY08s/bxomVAzN1S9tWnvZmlcvW/OIIbm2C1pUv6BFPRckzT3GW1ocN9KXU2sYb35bekvpwyuLnLRDZQq09oabWOe7KdpqKb/qaqn0p6+1vkUSJXr+qCTK+0VqT60+lemVwQseGOML+TOGF+RklqdYQ/5gji97fULXv/lVc1QjXzVH/YOTPim1rsuqJ31SwwdVkj5Vz+oXPqjjrP7hg4j0Yh0p2ugjXrR3UVrU/FG/qPmj/uXj51ZVB5UBUcf09DrXlTG+fgY0+s2sNcfcKnMHXrLI/NuTRU+Gh7/SoWhI2UjUr3wgipYw0mjTaJ0UPVUefdCMnmSK+k2TqN80nVQtMVVrgt79lCo9tbHzC4kprxMRpc7MTvXUW2K02UuNMyOnV1HyeCbazTa6MjSG13edlZFYxySxyuSrxnAavq7ijTwz22P/J5d4//j9zPp2KtvF0HkiUxGNvI3UuK0ca66VTNS1UmK9a6Xt/wXbs9HmLxKHDETMb97E6G/eeG1E1DJymXht0yRKtLeuuGxQlw/v9e9M/6+WqJ3+00vUncP7/Dm5ocDwcRmZQb83tcrKyCnIzg4MD/iDFXnFvGDu2HHT/vU/GfvvvXAa//M3/o/Iqv4AJjk8qJS1upSyRjeoos3V8uuvqGPFvyklPqCRzXdAoxtfk/+HKfFEYkq8yeaUeCNS4v3jlhIfsDklvjklXm9KPDH2lHhilLdNj/Jf2Y/xZQeyMvIKzsoOZG5KTmWUjozV3jybp02bp02131Ms06bO4RZf1vhOKG17QzY1vYqqacjM6f6yl5F3hrelU/oT5CnVm8vWjWyuW8XnUSeEy1MJrt6xHP88IaFwftkItOn0wXkTK8fn2WnnFPiy82vE1BqjmWleo1s6Rpdo0RNmpAbGhDt5ZRkqmknlbVdURMljkQ9vUxVnnFPgTar9OaHJ1YuX1NCfT5Rf3zLOjzEpDI5SHzqvPGBEtSSE6yfKVTJjYEF2xHOr9/RhBWfVQq/yoo5oB9UeRuWPf5L+DwZhOPlyqwEA",
-      "debug_symbols": "tVtRbhs5DL2Lv/MhUqRE5SrFokhbtwhgJIGbFFgUvfuKM5Jm7K5oxeP89NFO5oXikBRFsb933/Zf3n58fnz6/vxzd//p9+7L8fFwePzx+fD89eH18fkpf/t75/Qf8Lt77/7c7aB+wpQ/4fQp7e4py24GmAFn8DPQDLy7TxnC7h4gYywoBdOM3hWEgljQF8xsgBm5YCgYC0rBNCO5glAQC/qChY8KHxU+KnxU+KjwceHjwseFjwsfFz4ufFz4uPCx8knGNGNwBZUv2ycon5rXq3l1tWWxmL8j/U5tjTAbe0Is6AtSQS6YNUCaLT6hFMwaIM8WnxAKKl+cLT6h8sX813l64fp01ldfvOKkjRRtpGgjRRvJT4XpKf2pulD8n1VJ/Q34kz9V//v8etzv9Scrh8xu+vJw3D+97u6f3g6Hu92vh8Pb9Es/Xx6eJnx9OOafurvd/ulbxkz4/fGwV+nP3fK06z8aOJSHo4vtcUg0SsCSCkHAFYEMawAUUywUQIKhkTCecPg+RySuq4h8lRIMQlUJRuCeEtznIPS+UJB30BgITtUIfQofQ6Xw4rFLEbdTiLEQF6UuxKX1QvBKeyL17AmWbzquegQXFufy72AgbAzMHQZ7Hc2ceR0euuswvNMz1DcSVt6ZztZBhhoOscZplil23wmwxUIgjYUI+yyGjwaCupyQXb7PYTgp+pqykNda+HGbYvPyIF2buo/Jmb5aUdzi2BDDKIFIVV6SdAkQjeWHmvB8XFTI0XrKYBgQW8rEVWj9xTCmg/gug2GGhJUg+dA3Q9i6CPeBG0dI9VVGSis/lOEM44BbTEa3ohhfRGpvQtwqIgFOLenBcMkU2ruQa5RAhGoJxJVPqn+eKGFt46mtA0I3sXgjUaZY830SvmbjQh9qMYL6WNeWlldCkGaKVVEkZ+swEmTybomNVaL2eRM74TC28eSovpHkkutzJCPGaSkmFrfAcGoMMgzq3ZKp3Wr/fBcHuOqdHoj6HEa2yht5LUgYV9UZyLgagVvGC8Fft5Q1R4xXcqBrHKsS710caXktKRivJX6sSZMsaqS+GlbEElGL2PV2ehaxbCbhHOxLfbV6LyG9g4RoKa94VRqE4SzKyLGZVFJ/MdbOLj608kp0M+wtxiSJLQNlOcIVi6HY7EECSwLi092VjVSaq2+o58ssk++eyww/BaSles7Fs3QNYh2KWswR8GJSvnYpq7r3bCnBKplasZBQVvvbO7QgaqftQKuC41wLvMFJ128/pwa6AQdvP+xeMGrzDjVq10uDdSZC11opuZgi6ZLI9rohpO11Q3Rb64YI2+sGk2Owboh+8yZnqjFYNwxzGHWDzTFWN5gcg3VDlI816WDdYEdtkLbphxi6PSqbJMbWIAriU49EjHyaj7zt8JTlBNeRMLbyI3I/CYmRUTmFFjJZxu62L7z5/CNhex6TuD2PiWzNY5K2B7/NMRa4Jsdg4KbtZyhbjbHAveCkHhYnXdUwZ06arH3f81Kbdjs/F9QQ19SI/VhJ0eolglRFcn3rriMhbgVZlkPXIOP5I7Lrt+ytQ5BvrV3Ibts4IryHo/WBgID6HLg5B4HzVn8ytG4Srnz1PIHkg9/2Swy/PRlO1c7WbJibkFvTITjZng8vkIwlRJtkMCMCwOaUeEGRsZx4IWiWCzcjaOwMEFsjOcsJrypDBKAdMHMbt3uMAeuSCZETLO1k6CcjuEEXFeAGbVSAzX1UwBs0Um2SwRMR4PYywFZkNA3gDRqhF/w10uKvqTt+ANZFVL54hLpXZJm6DURAq6EqbatYX4ildylC2LpMiSj0FTHcNV8jISxXSuyu6f7J0jET9r3uH1i3Urlb1y6btXO3uo9x53fFuHUM4IIm3ArGLK9O4H9rQub1UitLyPtuWeL5BlnN36Ic8NvLAeuSajirmSSjWc26ihjNav4Wxc0widHquUAyWCH5W1RIxB9s19EK6UIIpyWZhFVK+iuESbYeHC9oEtotc94QIPU1sS6cokut5sslUv/sCAw3yPW2LjAdx4ouYOw71q0TtUlA5vUGOD6NmG8AG4N33fszYL7BBdoFFmp3eSjswpUsjCsWuV6XsLAkdyXL9jtBXoySX1B/vsJytRDb0E5IdErxT/748PXxeDrYDUEnxu52EDV+76ax3gnTjNNAdxnrpTLWy2XImMuQMeM8ZDxh0JXMQ8ZchozVcjpkzGXImMuQMZexbk7zkPGEVDDzBZjHuieMOkc0j3VPmGbUse6Y5rHuCVFHZOaxbh1A0rHuCblg5tOBHh3r1oDQse4JM19K81j3hDqG7KDMdbfBbh1FnCa79bZxHu32dbbb1+FuX6a7sY53a+Nnmu+eBJjOoWXCexJ8FagKykxZzRCqEKugzKQD4sqsJo+uCsqsRo/KrG4dfRWUWf0rchVCFWIVlFlbMjEVQVwVoAoTc/7r4ssfFaoCV0GZNU1IrIJUIRUhVZ0TVAGrUJmTMk9766+H4+PDl8NePVad+u3pa3Xg/PH135f6k/p/F16Oz1/3396Oe3X2yc99+edTfjveayxw+ybc+aDfxLPf0Zj5Dw==",
+      "debug_symbols": "tVvbbhs5DP0XP+dBvElUfqVYFGnqFgGCJHCTAoui/77SjKSRnRU98TgvOfRljimKoiiK+bP7vv/29vPrw9OP51+72y9/dt8OD4+PDz+/Pj7f370+PD+ld//sXP4DtLsl9/dmB/UVxvQKp1dxd8tJdjPADDgDzcAzyO42JvC7W4CEoaAWjDOSKwgFsSAVTGyACaWgLxgKasE4I7uCUBALUsHCx4WPCx8XPi58XPik8Enhk8InhU8KnxQ+KXxS+CTzacI4o3cFM1+yj8982byUzZtHWwaL6T3O72VbI8zGnhALUkEuKAWTBsizxSfUgkkDlNniE0LBzBdmi0+Y+UL6dZkmPD+d9M0Tn3HSRos2WrTRoo2mp/z0VP40u1D4n1Fp/Qb8Ta+q/319Pez3+ZPOIZObvtwd9k+vu9unt8fHm93vu8e36Uu/Xu6eJny9O6RP3c1u//Q9YSL88fC4z9Lfm+VpN37Uiy8PBxfa4xBxLYFoLAQeO4KgawmAQwyFAljRNxI5VoLGHIGljiLIRUoIKFclBEFGSsiYg5GoUDA5aAzsjtXwYwoKvlKQEg4pwnYKNQbigtaBuNgNBNyF9kQe2RMs33RS9fDOL85FH2BgbAwiAwZ7HM2caRwEw3EY3kkCdUZ8550RjhnYUMMh1nWaZA7DOQGxWBi0sTDjmMXwUc9Qh+OTy485DCdFqiELpdcC1tsUm5d7HdrUfU7MpGpFddxFG15LoFqV16hDAkRj+L4GPArcrfFwzGAYEFvIxG5pvWNYp4PSkMEwQ8RKEMmPzeC3DsJ94sbhY53KwLHzQ786wjiQtiaD6yjWDyK2mVDXrUiAY0sSGC4ZfZsLvUQJRKiWQOx8ksLJLm5t47GNA/wwsJARKGOo8T6qXLJxIfmajCADjm1peSV4babokiI9GYcRICO5ZW10gZrkeOsiYxuPjuuMRBfdmCMaa5yXZGJxC/THxmDDoOSWSO26/fNDHOCqdxIwjzmMaJU28pqQCHbZGeh6Nby0iOc9XTYU3/wreVq4kANd4+hSvA9xxGVaojemJXyuSaMuasSxGtaKZea2Yvvt9GTFihmEUZbMCOPiYj58gIT9EsrTIWJEYp2mUEIzqcbxYKydXSm0GKbcHahOB2OSBMRGErrFv34wHLidIxSWACTHcVCMUJqyb6jnyyQzDc9lhp9CcpGWxCcfkaFBrENRW3MMskyMXDqULu89GYq3UqaWLETUbn/7gBbM7bTtuUs4TrXAK5x0afs51fMVOGT7YfeMUZt3ZKMOvdRbZyJ0rZSSkinWIYluzxt83J43BLc1bwiwPW8wOVbmDYE2b3KmGivzBptjXd5gc6zLG0yOlXlD0M816cq8wV61XqGt2uCHNSqbJIS2t3ilOCJRI55C8O3wlOQIl5EIthwmyDgIqRFRJWqsPiIxuuFWqbL5/KN+exzTsD2OqW6NYxq3L36bY93CNTlWLty4/Qxlq7Fu4dpOuqRBSZZhth6tfZ9kyU2HlZ8zajRzeOfGayUGq5bIvl2gpFLmZSRpCKHVZJWHBlkfP4K4ccneOgRRK+1CcttFkfgRjlYHAgYec+DmGASOrPqkb9Uk7Hz1NICkg9/2SwzaHgynbGdrNExFyK3hEJxuj4dnSNYFRJtkZUQEgM0h8Ywi62LimUWzXLgZi8aOAGEpYIQQ8aI0RKHFoiT74TEGrEsmRImwlJNhHIzgClVUgCuUUQE211EBr1BItUlWnogAt6cBtiJrwwBeoRB6xl8DL/4ah+0HYF1EQSRsxZ10mzXcgQGtgqrqkgp0lzDuI4owt5viyJ1l3yliuKs6aRWeLPMl1T9dKmYqNKr+gXUrlap17bI5yaG7j3Gnd8W4tQ3gjCbSEsYkdyfw95qweb3U0hImGqYlJFeIanSNdIC2pwPWJdXqqGaSrI1q1lXE2qhG10hubJJ1pZ4zJCszJLpGhsTyyXZdmyGdWcJxCSa+C0nvljDr1oPjGU2WKU4bAsSxJtaFU0g8NZokeXx2BIErxPozupC2TkJgcmMW46TDrRNQpN8A13cjphvAxtApcXp/BiJXuEA7w8ItsUhzg3QhiyzXm5pOkBfrQh1LuJBl+52g8HLBKTTur7BczYfWtOO7q9qJ4p/08u7+4XDc2A0+d4zd7CDk9XsztfVOGGecGrpLWy+Xtl4pTcZSmowF5ybjCX0eydxkLKXJOFsuNxlLaTKW0mQspa1b4txkPCEXTHwe5rbuCUPuI5rbuieMM+a27hDntu4JMbfIzG3duQEpt3VPKAUTX27oyW3deUHktu4JE1+Mc1v3hDCFnNLX3Rq7cyvi1Nmdy2xzazfV3m6qzd1Uuruxtnfnws/U3z0JMJ1DS4f3JFAVuAqZOWer3lchVCEzc24Qz8zZ5MFVITNno4fMnGvzgaqQmbN/BamCr0KoQmbOJZkQi6CuClCFiTn9ulL5UeUqSBUyc76q1VAFrUIsQqw6R6gCVqEyx8w87a2/7w4Pd98e99ljs1O/Pd1XB04vX/99qZ/U/114OTzf77+/HfbZ2Sc/p/LnS5odorwWpL3jb8jnd8LJd/Ka+Q8=",
       "verification_key": "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAANsAAAAAAAAAAAAAAAAAAAANcxRZTxUIPDfgUGZWV1ofMQAAAAAAAAAAAAAAAAAAAAAAB/O8Bp8lv8Pn2g2XUGMPQAAAAAAAAAAAAAAAAAAABxanqlMkGPcss/Pu4YY9X6mAAAAAAAAAAAAAAAAAAAAAAAcLlApryWGo6DavcdN31YAAAAAAAAAAAAAAAAAAACMILHXFnHP6kq/VlbJyRIISAAAAAAAAAAAAAAAAAAAAAAAKPENgzACMJynso5Q2izsAAAAAAAAAAAAAAAAAAAAa64yrOIhQyw0FOMnPbrveXwAAAAAAAAAAAAAAAAAAAAAAAP2pMIXwOczO6EFhtcU5AAAAAAAAAAAAAAAAAAAAAH/9LPB/JbEfbqBoJr1bO2uAAAAAAAAAAAAAAAAAAAAAAALyoKQ5nEnF4+Wpr5O+WwAAAAAAAAAAAAAAAAAAACLr/9B7EZgQZebbqu8sFdE3AAAAAAAAAAAAAAAAAAAAAAABG3a+jK3QB/zNpZpgQJyAAAAAAAAAAAAAAAAAAAA5lbvqD/st9SlUffosLw3KVkAAAAAAAAAAAAAAAAAAAAAACnuwmhtw+ajIZCL90mVjAAAAAAAAAAAAAAAAAAAAODHlL5mT5G1ObZxjAOAnJN2AAAAAAAAAAAAAAAAAAAAAAAguHf9p5Y2klBUjRuhCVcAAAAAAAAAAAAAAAAAAAAFmEhrQz8r9fN1TJHcQE8epwAAAAAAAAAAAAAAAAAAAAAAByaPUw8/T8W7QW1DsHPQAAAAAAAAAAAAAAAAAAAAVfFvT9yz6u8v5Ct6wPPgBX8AAAAAAAAAAAAAAAAAAAAAABXyq9jATGEsKlU4jNOwMQAAAAAAAAAAAAAAAAAAALj18uKYbr+bMHMGcWM43nqsAAAAAAAAAAAAAAAAAAAAAAAn/UMAP/ASLDWjc8pZE0oAAAAAAAAAAAAAAAAAAACKofwHpYS1j3YNfk+Fd0jx8gAAAAAAAAAAAAAAAAAAAAAACqH0/bav875EO9SVW+IBAAAAAAAAAAAAAAAAAAAA0keFgXt5FOJa1FRGgAxYVSUAAAAAAAAAAAAAAAAAAAAAACKRtL5tI6UPJuhJdxShmQAAAAAAAAAAAAAAAAAAAJ/tqrZEtOwjVpiZTTg72iwPAAAAAAAAAAAAAAAAAAAAAAAZxnq60zGT9tq/8MzLh3gAAAAAAAAAAAAAAAAAAAAKqkPy4/OpejCszOmQz8W59QAAAAAAAAAAAAAAAAAAAAAAA9i+k7nZPFe1a95MIf/FAAAAAAAAAAAAAAAAAAAA1HlT90lD0eflyvrX/MoNLasAAAAAAAAAAAAAAAAAAAAAAC6eWtz86hE5NuBCecKeUgAAAAAAAAAAAAAAAAAAAGjYgotZbo6O3crH5wOVQRjuAAAAAAAAAAAAAAAAAAAAAAAiABgZIb9OVOy8aICWa6gAAAAAAAAAAAAAAAAAAACkyBfKcOm3I4n2OulpELouBAAAAAAAAAAAAAAAAAAAAAAACJEZfmKcd8AmeQEmosLHAAAAAAAAAAAAAAAAAAAADpsDepDgSnBBS07ZDxDKSvsAAAAAAAAAAAAAAAAAAAAAAAUWkxuq43kQdhRFySJ63AAAAAAAAAAAAAAAAAAAACxDmTyQCFa3sJFixNpLsMzxAAAAAAAAAAAAAAAAAAAAAAAUO4Hq7MW8wSCQTK0yhGkAAAAAAAAAAAAAAAAAAAByCQkrGf2yoO0k4h2gmOdpwQAAAAAAAAAAAAAAAAAAAAAACBlgQptvteSHUIgVaMSoAAAAAAAAAAAAAAAAAAAAVJGWQjP80PfqJe0ay9le5M8AAAAAAAAAAAAAAAAAAAAAACPf/XNYqq17eQ2WcqycAAAAAAAAAAAAAAAAAAAAANnst0fVuELwl6Sec9V/FRqRAAAAAAAAAAAAAAAAAAAAAAAwENlOSTvtCDYS60zQN0UAAAAAAAAAAAAAAAAAAABcpIGWlRGTJYiZNq6FWPOTxQAAAAAAAAAAAAAAAAAAAAAAKGJMehTm4+VZTdHZc0IcAAAAAAAAAAAAAAAAAAAAWzk4ReqvyEAAFTXcX6HcIuQAAAAAAAAAAAAAAAAAAAAAAA5K+Oq+BooXpGZ1ijOykAAAAAAAAAAAAAAAAAAAAM+bCunLFTo9I0l3nKQLaUrFAAAAAAAAAAAAAAAAAAAAAAAlhxchiTS1q+VJKgS9dU0AAAAAAAAAAAAAAAAAAACspt+pNj+fABfxMPAO8p1SfAAAAAAAAAAAAAAAAAAAAAAABP+jB/gdMa7NcIZWiUuHAAAAAAAAAAAAAAAAAAAAiurcMWw8q/KBIah9orLvP9gAAAAAAAAAAAAAAAAAAAAAAANGS+cS9Le3XQEzt09MWAAAAAAAAAAAAAAAAAAAAJfLkiEt5SVEIfRzzloBZSoyAAAAAAAAAAAAAAAAAAAAAAAc1xWYMpdJzcApuRyMgxsAAAAAAAAAAAAAAAAAAACFglzmUGknSaOd9epUeiBQUQAAAAAAAAAAAAAAAAAAAAAAG00Eb1uxvsLdAbmECIPYAAAAAAAAAAAAAAAAAAAAiY0NM+3Ixfpz6mlZQnQ6ENkAAAAAAAAAAAAAAAAAAAAAACVS2A5S8CZcCUbLjzaAjgAAAAAAAAAAAAAAAAAAALEXdD4IbVAamZz5PiRnAJDXAAAAAAAAAAAAAAAAAAAAAAAEr1NalLeRIu6QIfe4txsAAAAAAAAAAAAAAAAAAAACw0HalVUOCeXc38nYB1iwDQAAAAAAAAAAAAAAAAAAAAAAD1igBwcNNIe2fdCf8SBUAAAAAAAAAAAAAAAAAAAA94WFGNeU7E7dzn1rHYUlngQAAAAAAAAAAAAAAAAAAAAAAAZO+2PEp9+eYpwT4NDMSQAAAAAAAAAAAAAAAAAAAHkOgWZHL8eLL0RV3Ug1q6IXAAAAAAAAAAAAAAAAAAAAAAAf/wvjTO9RMY93lInRM+cAAAAAAAAAAAAAAAAAAABh+w+ll00dhNKlbt8b3Sh+wgAAAAAAAAAAAAAAAAAAAAAAHkAsrqJYZo21VwYMmtfmAAAAAAAAAAAAAAAAAAAAmNhNn+BZkfTtsqwIfH82exsAAAAAAAAAAAAAAAAAAAAAABDQtHr4OSB9zyg52GN9HQAAAAAAAAAAAAAAAAAAADPDtJLPWjkF2bwO4ME6SGJjAAAAAAAAAAAAAAAAAAAAAAAg4/Sv0LI4GXBlBDOB9GQAAAAAAAAAAAAAAAAAAAA/ud9Jhp+CV7WrCcXb55MiGwAAAAAAAAAAAAAAAAAAAAAACtoPhJKjxBNWaOy/F1f1AAAAAAAAAAAAAAAAAAAAvbbTOPvL7aR/If8Pklh7nyoAAAAAAAAAAAAAAAAAAAAAACaABrh2htG+fHG7sSQXFAAAAAAAAAAAAAAAAAAAAKDpBp6ws1pkNI4bkoMoZWKzAAAAAAAAAAAAAAAAAAAAAAArN4FNL1dKGreR0YDb3DcAAAAAAAAAAAAAAAAAAAAsXa1MYiJeAnuQ9zKNJLxlpwAAAAAAAAAAAAAAAAAAAAAAHSKyIRIBjQDl+3aC6mzSAAAAAAAAAAAAAAAAAAAA4CI7LjZ4c7oFDDzVNFzuhJIAAAAAAAAAAAAAAAAAAAAAABTqHowrePp72DAqKf689AAAAAAAAAAAAAAAAAAAAD+xMGQVpHqEjTUoDv8avxLCAAAAAAAAAAAAAAAAAAAAAAArGPNHM0plJIR9PJIANMcAAAAAAAAAAAAAAAAAAABAU1+KSPbyC1Zm/OGRyreLpQAAAAAAAAAAAAAAAAAAAAAAA/chLDMOjbhS322L0X9hAAAAAAAAAAAAAAAAAAAACZ69xS0ooHLQy2zth4pRxbQAAAAAAAAAAAAAAAAAAAAAABVV8KM5AoHxJxHsxU43VgAAAAAAAAAAAAAAAAAAAJW12Le0pjsF32UrDRDvFG0mAAAAAAAAAAAAAAAAAAAAAAAJnjvVoKAKt/4YBAEFubMAAAAAAAAAAAAAAAAAAAAhKa86Y39aYioyRA+GDR4qfwAAAAAAAAAAAAAAAAAAAAAAABW40lFdduLM7Jnc0ZRZAAAAAAAAAAAAAAAAAAAAIiuIgQjcJdGqRQ4LS8ISw34AAAAAAAAAAAAAAAAAAAAAABuRdReSC609i8AclZUJKgAAAAAAAAAAAAAAAAAAAEghQcfr5CAAodWMy3Q4H20ZAAAAAAAAAAAAAAAAAAAAAAAwXomSsUju2yLm6ZIHeoQAAAAAAAAAAAAAAAAAAAB8hoR2GGgdwp2Kk2OrfEDhwwAAAAAAAAAAAAAAAAAAAAAAFkZaXMu1UM0sY71YEW/kAAAAAAAAAAAAAAAAAAAAQ5lzrBLXynltb+mMpA5sprcAAAAAAAAAAAAAAAAAAAAAAC4k1CD7+VCO0x3mkttHewAAAAAAAAAAAAAAAAAAACjt0afkbIQNnJQ/30VSHGTOAAAAAAAAAAAAAAAAAAAAAAAEPQY7Ewrfs3NCr0XQFVoAAAAAAAAAAAAAAAAAAACTMJUq50xXPRaG2ctKAHM4VAAAAAAAAAAAAAAAAAAAAAAAJhUixAiTMGRq/5ZzYZSUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACyOYGGAwugTPYMxNz2+faUJgAAAAAAAAAAAAAAAAAAAAAAByGeLUrTmDnMx2CuHHUMAAAAAAAAAAAAAAAAAAAAWKOqiLjuXodGKFG23pjuWBQAAAAAAAAAAAAAAAAAAAAAACuMjYmDGJLTvydRJXxqLwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAF6UyFPM7GtAJ5GGyaZJyGb4AAAAAAAAAAAAAAAAAAAAAABQQfUvkU8gEqOKRhpGbPgAAAAAAAAAAAAAAAAAAAJKHn2GoKCaTAlYbtX87FVfPAAAAAAAAAAAAAAAAAAAAAAAoRQUJTjXTtVikNALK2uI="
     },
     {
@@ -2096,7 +2096,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBFJwAABEUlAAAARicCAwQBJwIEBAAfCgADAAQARBwAREQBLQhEAiUAAABsJwICBEUnAgMEADsOAAMAAiwAAEMAMGROcuExoCm4UEW2gYFYXSgz6Eh5uXCRQ+H1k/AAAAAmHgIAAwAeAgADAB4CAAMBCiIDQwQWCgQFHAoFBgAEKgYDBScCAwEACioEAwYkAgAGAAAAqScCBwQAPAYHASkCAAQA71JTTScCBgABKwIABwAAAAAAAAAAAwAAAAAAAAAALQgBCCcCCQQFAAgBCQEnAwgEAQAiCAIJLQoJCi0OBAoAIgoCCi0OBgoAIgoCCi0OBQoAIgoCCi0OBwotCAEEJwIFBAUACAEFAScDBAQBACIIAgUAIgQCBj8PAAUABicCBQQBACoEBQYtCwYGJwIEAAAKKgYEBQoqBQMEJAIABAAAAVQlAAABYBwKAgMAMAoAAwAGJioBAAEFursh14IzGGQ8BAIBJg==",
-      "debug_symbols": "tVbbTuswEPyXPPfBe/Fl+ysIoVICihSlVWiPdIT678cGb5wg2QJ0eGkm62Yynh07fuue+sfry8MwPZ9eu/3dW/c4D+M4vDyMp+PhMpymWH3rTPoBE7o97ToA6vY+XeM9QAQYC5BGMGRAmIfIZ8CpYhPwGVitOKPAKpBujxiBDxkE+gBoWEEeQtAh0ApqBbWS9HwAlwGDApuBNQr0FTbLQJcIOQGfgUcFWglaCVoRrUiSEedFhhRoBdJ/fAI+A9QKaoVsBhwVEiQQK8S3267TNj1c5r5PXVr1LXbzfJj76dLtp+s47ro/h/H6/qfX82F6v14Ocxw1u66fnuI1Ej4PY5/QbVeeNvVHkYzNT0eT7UIA4DcU0KAwbLxyGEZYSPxWBjY4fFAG4SLC85fn4YJTBh9CdR5cpyBmtYLYFSs+ibD/wQn3m054WDrqqUTCbiWEOgMDqpcMtmqENDSATdvIh4i4UbiaEWBa/RBth6s70VbBUFQIVVU0ksloihdS3PyRmat5fJoGNIIpS0MFS7IZvrE2lkx54FoioJFKC8yZwsIql2hoy+EbMoI6SVKmQXGxbhgaXkrZrIQYC4fdtgMaoRDDmkwxYqoc2EymUtBqq0HntgytPRO8LMkM/mcc8WOoHOi5zkGtvrqlr2jKfgXhyzJiMxc3RKAqoxkvI6HIsNV4YYODaUk585oD3I8WCkltoWAjol6MuuEFpaoCpRUvs+xbEdvqZ4RMq7N2cXS12uRbMgwXGfVNnBrbJxF5TSnFdYNVkkZKyflFSPy6bb8F9/H2cBzmzYn3lsjm4fA49vn2+TodV6OXv2cd0RPzeT4d+6fr3Cem1bE5HjTvHOwc3d/S2/4B"
+      "debug_symbols": "tVbbauMwFPwXP+dB56JbfqWU4qZuMRgnuMnCUvLvKzU6kl2QaMP2JR4fxePRnJGsj+5leL68PY3z6/G92z98dM/LOE3j29N0PPTn8TiH6ken4g8o1+1p1wFQt7fxGu4BAsBQgDiCLgHCNEQ2AY4VHYFNQEvFKAFagO/2iAFYl4CjG0DFAtIQggyBVFAqKJWo5wZMAgwCdAJaCZBX6CQDTSTkCGwCFgVIxUnFScVLxUcZYV6kSIBUIP7HRmATQKmgVEgnwEEhQQShQny97jpp09N5GYbYpVXfQjdP/TLM524/X6Zp1/3pp8vnn95P/fx5PfdLGFW7bphfwjUQvo7TENF1V55W9UeRlE5PB5N1JgDQGwpoUChWVjgUI2QS4zYc2OCwThg8FxEWvz0P44wwWOeq8+A6BTGLFcSmWPFFhP4PTpjfdMJC7qilEgm9zYSrMzCgeMmgq0b4hgbQcRu5iQgbhakZAarVDy/tMHUn2ioYigpPVRWNZDKq4oUvbt5l5moeX6YBjWD63FCPJdkMP1gbOVMWuJYIaKRSA3Oi0LDKJaqtCrANGU6cJF+mQc5sGRpe+rJZeWIsHJq2HI1QeMWSTK+8qnJgM5lCQautBg1vGVp7Jlifk+nsfRzhYygcaLnOQa2+mtzX2Mu8yty3ZYRmZje8h6qMZryUd0WGrsYLGxxMOeXMaw7guxYK+dpCwUZErVfihvXoqyrQt+Kl8r4VsK5+Rki1Oquzo6vV5n8kQ3GRUd/EqbF9EpGVlFJYN1glaaSUjM1Cwtdt+y14DLf9YVw2J95rJFvG/nka0u3rZT6sRs9/TzIiJ+bTcjwML5dliEyrY3M4aD4Y2Bl6vMa3/QM="
     },
     {
       "name": "utility_is_consumable",
@@ -2152,7 +2152,7 @@
         }
       },
       "bytecode": "H4sIAAAAAAAA/+1bTWwbRRS298e7ttP/NpuSNIkToEic0iLotU0aktK0VX+4mm2yBAvHDmu7ajhhTkhwsNNW3EkaitoihOBCJQ4IOEAjcUFQqRckbiD1ghBCHFg3tvftzL7ZnfW4P2p62vrNfO/Nm2/evHkzkZfrH955Pps13y5bs9mCnc0VypZdMPOlbLZSzuVz5aVsrpSdLRZKlQXzfN6S6tXrR+xcPp+bHzfz+cux5eramVxhPm9dqtWXvx2Osf/FY4FNYnyA8WDAegNxYdEx/lKtFoy4HIvX6pKjnMsxdyW1enXc+W/5UnVtImdbs2Wp+vG002veslfOHTwQrJjsH+fq/84Jsn+MT/+J6mpjSutb2zjXTlt5s5y7YCl8SBKNoPIhxKo3GrbMmWVzvLi41B7SK9AmAL4yU7yw7P4gue0JidySHG+O1mi2aP48A0GoUch8o5jp2JPx6uqZcnGx7hkBACNmfPzqZM7KzwXC9pIdJ/jMksn+R3mnl+g/GdJwquPLbcUfnRvjX2JTHS7Rab7+lN+P8fU31k5b5YpdqF6fLNpWbr7QoPCVO/s3olSlnM+apZJll8eLC4sOQ5ywdNI2Z/PWq5ZdyhULtVq9enPGWijaS4fn5myrVGoTpx0jNybCq+CWiz9vlc9thD9nIGXrYvluzCAxAT8xiYpKEqhEQyU6KkmikhQqSaOSHlSyBZVsRSXbUMl2VLIDlexEJbtQyW5UsgeV9KISnAd9qGQvKnmqQSwvJx+z/3mWdmCTF1/gwlw9N3bgEPvXYEtrNXqD6g8ZieN014EwXe+dPuOzLe4L6Cq3Psj9fNBNlijQIb7gqjqZba5g2ktOp5OLV9rAKw43N6awpQlouDldmNuIoITyQd6dxavcVdFWT49ZIr0xDE276mQOtuUvHcDUDdPqhl11LMh+8ZCSeMh9pMv6H1UC9T8QAoV3cL/b6dqRvDn75pHixeoXp4olKzdXLBw4ZdkLlbLTslhYBu4dUuA8KJi+QYa+qerq8aI551n04PPmBuL9+HFy8TIAWDv6VsU5sPmMe5I112ESyRjquKZSBwQOBahZO1ZZWJx+HbrlpeZZZD3+TOOLoIG7+TdjONlkB9jrkSa7wAaONOkFO3mzCbFUDMZSGeZMZPmXyjC+VAxBS8WH9QYaazPQNCrkZGAWjKjL0OoyjCiWgemzcMiEeEhNPKQuHjIpHjIlHjItHrJHPOQW8ZBbxUNuEw+5XTxkv3jIneIhd4iH3C0eco94yF3iIXvFQ/aJh9zrs/mHOfj9u/Pv3+g9FM8oRnhrztwZxQieUWQEZRQjTDcT3hiFplFTMArzDaLniDu6sF7A53oE2kpNyyifZ54mTX3avZ0gJM9CEwjZfpiR+Q4xRg4xBm1u5dfPeav9oE2Mkd892zE7R+m5xtzwDDSBe6gj7aFeCD9UA2rfXKJwiXrq4F976uCTdnHhVOV8PjfbWEHmvFWvfjJlmYuHbdtcguspXq9e3fiRqLLHL0copj6FSgaR4v7U5U6Ll4jrDIbr6FO7AT/J02cGCt2T+CGqITj7Z5CTrAFbs7AQpWNMpUxERPVYdeVEEQE0GmJqaRkhy7BSF9er+gRtqWhBdJRWN8rYPEfxjUoApCQech96d+5DIKPrBDJwAkmCCGSwA35o1kmRCqIGLIiOKBxGSiFDK1oQlaiCqOEWRLFzgl89U3I//eqZmdufgYImB70yXadXpvv0yjCZQiXuwDRWJj7AQcyRcMm9IR5SFg+5D33B86jFJ7l78UkKjE8DdCe58/g0gMYniaGPjk8S/ETjk0zFJykwPhl+8Ulmxyfj9g94fBJIL+NxoZeMxqcBaBq1TIFU4SDmAGPlA0hVPGRCPKQmHlIXD5kUD5kSD5kWD9kjHnKLeMit4iG3iYfcLh6yXzzkTvGQO8RD7hYPuUc85C7xkL3iIfvEQ+4lN0KFkRaoXS+DqnhaoAhKC1TaVwqaFiSgaZQfgZS6qVBF3lSo0FZqWhJ8nhkiTR1CS/Selxj4iU7mL98notxUKNCyTtkZzQ0K/1DVKDcVMtS+uUThEhVwU6FGuamQI9xUSA/6pkJiuC7guEqW+BUoZN0FwD/UQW4qJNiahYUoHWMqZSIiqscwD8orM5W855Q9CMGoKp/bsfU3K+T6aK8h+AgeXx1f3cr88u7BPseJZ22z8RdR1AbRUkROZwLaFZ4giZAEwXe4TrekPv4wlMDDkCooDCVoV6lopqBB06gNXAsxMxqtTmPkBFpgyWgTcBNwE3ATcBNwE/DhA2KHmKPV1cbFhXM8eg3NWa4dd3Lns2+YBSSznfa5/JDW41YbepaRt6ntvzWOklKH95MceLeV8HMuUMrI99CCv4b4rn3jdMzHd9p6PN8+tf7pPbXKMBsi/spb4U37Wjru0elUExK9HNGZTEQ6JelOOvQJReAkdDFejvBJjoFVLsHp83rA8yej9cFTBEh0/XY40f0iQIKnTheUfT+BgddnlV6LeELSOqaYhN4+u+H/Pd4Q5olEvkHsRhv8ffy4z1MwkeFn+OqV5G5UJKIKP9EXA/dnHxk5Fp2VDqOzikdnOTA6q8xnE6wCt8ZVFQSEZHoWwVQYc3WMQlTgJ/76zDtXnto9Nldy9+ZKiTJXCjOeqoyNj/XsTe76viR3/9mbzC5O88cErldLMny1pCocRkoho1qIAmf4LYoRSrUQS15v1GKRKDKB5njIdqGzMt7kevxzkPEi0KkoL9Z8cs4UtIp0TBJ+olEm5Y0yGuz0EHaE4Hw9yUhgppiJd4oDkrkjeDwbfor1wNNe+tMW5TYe6aEnjJQP9dLr8W9ajpVQFqURVqdYrHagvwtmdU8UVqfpTj3QKtL3afgZltVJ2AljtdY9VicDWe3jhiRz70yH4DUrkE5ECqQp5rk30S1e/xzMaz0Kr/X1+K/BvE5H4bVPWSHN4rUOPyNEax3ldfJhRmtWdWWCZrWHChyVCr3rGaHe/UqFqEqUEikj1GFGmFSiFCSnGK9PNHA+7/Bi+3f91FHpyw+GQl9sN39OuIvDd/q1NRCdyD6SGz5azdelmHfRRX+rhTwHSpIdZLeDR3PKbeD5Pe2a1nL/f4RXdBejtRzJzrq/dSnSuhTG1hYg2SEd0KHHG9RJNUlqTnrW4/9g9OK+zm96TIojsyzqocZP2h9//fj9fC2Qz/8DA4P8/31aAAA=",
-      "debug_symbols": "tZvdThw5EEbfZa65sKvKf7zKKopIQlZIiEQsrLSKePd1ueurnkFqbzOdvcFnYOaU2+2yXQ38On27//L65+eHp+8//jrd/vHr9OX54fHx4c/Pjz++3r08/Hjq3/11CvqF+HTLNyeS023uTTrdRn2ZrS3WVmvb0nKwNlpL1rK1Yq352HxsPjYfm0/MJ+pLvSVr2VqxNlmbrS3Wqq/3X9rSJvXV3kZryVq2VqztPtK2+6j1tvs49rZa233c+5WDtdFaspatFWuTtdnaYm211nzFfMV8xXzFfMV8xXzFfMV8xXzFfNV81XzVfNV81XzVfNV81XzVfNV8zXzNfM18zXzNfM18zXzNfM18zXwxBEAEEIABAkiADCgAFSeFZhADIAIIwAABJEAGFADMUc19DkUKgAggAAMEkAAZoOamUAHNQNNngQggAAO6WaJCAmRAAVRAM9BEEo2umbRAN0tVYIAAEiADCkATSruhGZV0WDSlFogAAjBAAAmQAQVQATBnmDPMGWbNr1QUBJAAGVAAFdAMNM2SXo7m2QLdnIMCAwSQAN2cx8cLoAKagSbcAhFAAAYIIAFgrjBXmDXzsg64pt4CEUAABgggAbq5aOc1Axfo5kIKbQHSHFwgArq5DmCAABIgAwqgApqB5uACEQBzhDnCHGGOMEeYI8wRZoKZYCaYCWaCmWAmmAlmgplgZpgZZoaZYWaYGWaGmWFmmBlmgVlgFpgFZoFZYBaYBWaBWWBOMGsOVlEgAAMEkAAZUAAV0Aw0BxdQc1IgAAMEkAAZUAAVoOaqJ4gAiAACMEAACdDNLSgUQAU0A83BBSKgm5tG1xxcoJtbUUiADCiACmgGmoNNu6Fp1ZqCHjSCxtC8MtLDRoh6GgpO0Ymc2EmcklN2Kk7VyWNEjxE9RvQY0WNEjxE9RvQY0WNEjxE9BnkM8hjkMchjkMcgj0EegzwGeQzyGOwx2GOwx2CPwR6DPQZ7DPYY7DHYY4jHEI8hHkM8hngM8RjiMcRjiMcQjzGOlIGUxvvGaXe8T5QaKAen6ERO7DT6kpSSU3YqTtWpgUpwGpaslJyyU3GqTg1Ug1N0Iid28hjVY1SPUT1GG58tSuN9VSk7jfc1peqkfYlB64Fg75MlowaREzuJU3LSGDEqFSeNEUmpgUZGLVVHxPtGRi3ETuKUnDzGyKhRg4yMWqiBRkYtFJ3IiZ1GDK1gRkYtNHxFqYFG9mjlIiN79IgmI3sWYidxSk7ZSftMOs7sMdhjjOxZKDqREztpDNIxGNmzkMYgHd2RPQtVpwYaBRrp2I8SbSFyYidxSk4jhigVxB2Zt1ADjcxbKDqR04gxaklxGjF07EfmLVScqtOIoWMwMm+h6ERO7CROI4bewZGXI+7Iy4WqUwONvFwoOo2CW+/gyMuFxCk5ZafiVJ1GjPb2dnPCk4HPL8/39/pg4OxRQX+A8PPu+f7p5XT79Pr4eHP6++7xdbzpr593T6N9uXvuP+3O+6dvve3C7w+P90pvN+unw/ZH++Ff7NP9RE8u6JP9QhG3FbVlMzSuq6C1CwFN+hA0F5c+hBI2FZPLaNWvIlDcvArZNgjhKnoKuaCPyPnn0/bnOeEu9EV+7UDZfQn9RjQz5F4UuSJd3suybUi9xDRD6rWKG3qZcaGo24p+uMNVtPUquF4OY5vcCA7JZ4Os84lTupxPs5sZhOEILWw7JpOSXaGd95HI+dIwmZW9PML96AVSuc5BjFnVayLZdsjsrma/q72EXKdW3d2Nfi99NFqLm92Yza2gB3P0Im3OrThx9F2veo6dO2K+KknOpvi7JImTGVpLjaaoNeTNXtB81cy+avLmckGTCdqfFPmS1beaTcXktlaf4zWXs1WzXBp40onWfI6HyOtYlHeO6cLJ6EY/Jq2Tq5/zLh2zxbPkNV2Zth35NzhmMzQUn6GhnV8L7XdUfQa2OOrZbvYRx95r4ckcTZk9Y3OaXMtkTLNE5Eru93nTwbM1kLGl9KcmZwb+wCzN6ywV2ZylPJmljXxEW39wsbmn/IeD3NGudOzcH7kc3x+5Ht0fp6tPw/rVUt1cfWQ2Q/3IleO2YdqH4oOZ03YfZltjbeRbY1x3g14xXzpm83M9d/UK8izjw+XhT2Q2msFvado2TNbQ7NtaCWXTMN/VwrqrneXquy1Jymx/xtqXz5at94M52+BpXXH6Y9utDV7a8WNwCkfPwSkeT/RExxM98dFET3L8IDx17DwIp3z4IDzrxt6D8HR67TwJpza7KZ7uvW4sm469iXK26LxLlByPJ0qmo4mS+XiiZDmeKDkdTZScjyfK1LEzUXI9nCizbuxNlOn02pkoJf6/JeN5ovTHMVvPVfh4yVjkcMlY0uGSseSjJWMpx0vGUo+XjKUdL5FqOF7e1Hi0vJmP6L7ypvLx8uY/HLvKm/obFvOajy/mtRxdzKeZsqu8qe1oeTPtw67ypsXj5U2j4+VN46PlTZOj5c18Bd5V3rT8f5Y3UapvRmd5mnb/wia1hNUitbO7wfsFtbjg7NT3AYFPy+66QpDDmhmByjWC9SlwSFf1IPltCPm6HtDag/RxQV/0Iej5zJtL1KxGDYl83zhbHz6iSJx895LrepGkuCK3w724UpH9REF9V79OId6LXOLhXlyn4EbrwTtvK+Jv+JVROH7+n07P6uMZ2nVza/x5jxVU8cpetLIq6OiFXKuI6ykxcr1O4TsHne/CH1PQqoiHL+Raxb4qeapYb2q/wVcqoitiOHoh1yr2/n6Y2nXZ/qm/uvv68HzxHyhv6np+uPvyeG8vv78+fT376cs/P/ET/AfLz+cfX++/vT7fq2n9N5b+5Q9p6SZF/qR/w99f9qdK/WX+9KbR/wU="
+      "debug_symbols": "tZvdbhw3DEbfZa99IYnUD/0qRRA4iVMYMJzAtQsUgd+9ooYfZ9fAqOOd5iY6G+8eakaiJM7av07f7r+8/vn54en7j79Ot3/8On15fnh8fPjz8+OPr3cvDz+e+v/+OgX9J9Hplm5OiU+3pTf5dBv1ZbG2WtuslaWlYG20NllL1rK15iPzkfnIfGQ+Nh+rL/c2WUvWsrXZ2mJttVZ9vf8sS5vV13obrU3WkrVsbfclbbsvSW+7j2Jvm7XdR71fJVgbrU3WkrVsbba2WFutbdaar5qvmq+ar5qvmq+ar5qvmq+ar5qvma+Zr5mvma+Zr5mvma+Zr5mvmU/MJ+YT84n5xHxiPjGfmE/MJ+aLIQAiIAEIwIAMKIAKUHFWEIMYABGQAARgQAYUQAXAHNXc51BMARABCUAABmRAAahZFBpADDR9FoiABCBAN3NUyIACqIAGEANNJNbomkkLdDM3BQIwIAMKoAI0obQbmlFZb4um1AIRkAAEYEAGFEAFNADMBeYCc4FZ8ytXBQZkQAFUQAOIgaZZ1svRPFugm0tQIAADMqCby/h4BTSAGGjCLRABCUAABmQAzA3mBrNmXtEbrqm3QAQkAAEYkAHdXLXzmoELdHNNCrJA0hxcIAK6uQ0gAAMyoAAqoAHEQHNwgQiAOcIcYY4wR5gjzBHmCHOCOcGcYE4wJ5gTzAnmBHOCOcFMMBPMBDPBTDATzAQzwUwwE8wMM8PMMDPMDDPDzDAzzAwzw5xh1hxsrJAABGBABhRABTSAGGgOLqDmrJAABGBABhRABTSAmpueIAIgAhKAAAzIgG6WoFABDSAGmoMLREA3i0bXHFygm6UqZEABVEADiIHmoGg3NK1EFPSgETSG5pWRHjZC1NNQcIpOyYmc2Ck7Fafq1Jw8RvQY0WNEjxE9RvQY0WNEjxE9RvQY0WMkj5E8RvIYyWMkj5E8RvIYyWMkj5E8BnkM8hjkMchjkMcgj0EegzwGeQzyGOwx2GOwx2CPwR6DPQZ7DPYY7DHYY4wjZUhK433jtDvex0oCKsEpOiUnchp9yUrZqThVp+YkoBqchqUoZafiVJ2ak4BacIpOyYmcPEbzGM1jNI8h47NVabyvKRWn8T5Rak5ixEtGNaXolJzIiZ2yk8aIQak6aYwYlQQ0MmqhiPeNjFqInNgpO3mMkVFL7dKcBDQyaqHolJzIacRgpew0fKMaEtDInlHpjOyJVSk5kRM7ZafiVJ08BnmMkT0LRafkRE4jht7xkT0LjRg6giN7FmpOAhoFWtL7N0q0hZITObFTdipOFXFH5i0koJF5C0Wn5DRi6OiPzFtoxEhKxak6NSeNkXTcRuYtFJ2SEzmxU3YqiDvycqHmJKCRlwtFpxFjVL7kxE7ZqThVp+Y0YvDb280JTwY+vzzf3+uDgbNHBf0Bws+75/unl9Pt0+vj483p77vH1/Gmv37ePY325e65/7SPyf3Tt9524feHx3ult5v102H7o/3wz/bpfqJPLuiT/UIRtxVNihmE2iqQeiFIkz4EnddLH0INm4rJZUjzqwgpbl4Fbxs44Sp6CrmgXt7IvP15yhiFvsivHai7L6EPhJih9KLIFfmyC3XbkHuJaYbcaxU39MLjQtG2Ff1wh6uQ9Sr6NnMhkMlAUMg+G3idT5Tpcj7NBjMwwREkbDsmk5JcQW29kH6WvjRMZmUvjzAevUCq1zkSYVb1moi3HTwb1eKjqiPpU6vt7kYfS78bInGzG7O5FfRgjl7kzbkVJ46+6zXPsXNH5KuS5GyKv0uSOJmhrbZoitZC2exFmq+axVdN2lwu0mSC9idFvmT1rWZTMRnW5nO8lXq2auZLA006IeJzPERa70V955gunIRu9GPSOrn62e/SMVs8a1nTldK2o/wPjtkMDdVnaDhLlH5m3e9o+gxscbSz3ewjjr3XQpM5mgt5xpY8uZbJPS0ckSulj/Omg2ZrIGFL6U9NzgzxA7O0rLOUeXOW0mSWSvI7Kv3Bxeae8h+O5A650rFzf6R6fH+kdnR/nK4+gvVLcttcfXg2Q/3IVeK2YdqH6jez5O0+zLbGJsm3xrjuBiSXd4Jn83M9d/UD51nGh8vDH/PsbgYf0rxtmKyhxbe1GuqmYb6rhXVXO8vVd1sS19n+jLWvnC1b72/mbINP64rTH9tubfAsx4/BORw9B+d4PNFzOp7omY4meubjB+GpY+dBOJfDB+FZN/YehKfTa+dJOMtsUDzde91YNx17E+Vs0XmXKCUeT5SSjiZKoeOJUvh4opR8NFFKOZ4oU8fORCntcKLMurE3UabTa2ei1Ph7S8bzRKmy+VyFjpeMlQ+XjDUfLhlrOVoy1nq8ZKzteMlY5XiJ1MLx8qbFo+XN/I7uK28aHS9v/sOxq7xp/8Ni3srxxbzVo4v5NFN2lTdNjpY30z7sKm8kHi9vJB0vb4SOljfCR8ub+Qq8q7yR8jvLm8jNN6OzPM27v7DJkrFaZDkbDdovaNUFZ6e+Dwh8WnbXFYIS1swIqV4jWJ8Ch3xVD7IPQyjX9SCtPcgfF/RFH4L+NRdtLlGzGjXk5PvG2frwEUWm7LsXX9eLzNUVRa5SFD8O9E/F6xTsF1LqVQqStB55y7Yizr5p2Xn0DsdP3tOJ0fxmBLluVMcv1lgpE6/shdRVka7rxXq4itSuU/iCm843r48p0qq47l7srAynivV29lt7pSK6Il53L/Z+oZmu/EbzU3919/Xh+eJPJt7U9fxw9+Xx3l5+f336evbTl39+4if4k4ufzz++3n97fb5X0/p3F/2fP1jyTY70SX/pvL/sj0H6y/LpTaP/Cw=="
     },
     {
       "name": "offchain_receive",
@@ -2290,7 +2290,7 @@
         }
       },
       "bytecode": "H4sIAAAAAAAA/+2dd3xUxRbHk9300El200xBwV6QYlcggIIgSoioqLgmS1gJSUg2SECEFbCiJgHsFUhAERt2sHc5Y++CitixY8X2JsjuTu69M7t38+P5ee8z/HWS2fmec+fMnJkzezlxNjddeWf1pEllkz2+qom13jKvb7qXxQ9qCqwaUuurrPRVFHsqKxfHNQdaBtfWeho2xA9a1NjU/FRhnPpffFzEj8RFB4pHgRwokBMFSkCBElGgJBQoGQVKQYFSUaA0FCgdBeqEAnVGgbqgQF1RoG4oUHcUqAcK1BMFykCBMlEgFwrkRoGyUKBsFCgHBcpFgfJQoF1QoHwUqAAFKkSBilCgXijQrijQbihQbxSoDwq0Owq0Bwq0Jwq0Fwq0Nwq0Dwq0Lwq0Hwq0Pwp0AArUFwU6EAXqhwL1R4EGoEADUaCDUKCDUaBDUKBDUaDDUKDDUaAjUKAjUaCjUKBBKNBgFGgIClSMAg1FgYahQMNRoKNRoGNQoBEo0EgU6FgUaBQKNBoFOg4FGoMCHY8CnYACjUWBSlCgcShQKQp0Igo0HgU6CQU6GQU6BQWagAKdigKdhgKdjgJNRIHOQIE8KNCZKFAZClSOAnlRoEkoUAUKNBkF8qFAZ6FAU1CgShRoKgpUhQJVo0A1KNA0FKgWBapDgfwoUD0KNB0FOhsFmoECNaBAM1GgWSjQOSjQbBToXBRoDgpEc2GkAIx0How0D0aaDyMtgJHOh5EugJEuhJEugpEuhpEugZEWwkiXwkiXwUiXw0iNMFITjNQMIy2CkRbDSEtgpCtgpCthpKtgpKthpGtgpGthpOtgpOthpBtgpBthpJtgpJthpKUw0jIYaTmM1AIjtcJIK2CklTDSLTDSrTDSKhjpNhhpNYx0O4x0B4x0J4x0F4x0N4y0Bka6B0a6F0a6D0a6H0Z6AEZ6EEZ6CEZaCyOtg5EehpEegZEehZEeg5Eeh5GegJGehJGegpGehpGegZGehZGeg5Geh5FegJHWw0gEIzEY6UUY6SUY6WUY6RUY6VUY6TUY6XUY6Q0Y6U0Y6S0Y6W0Y6R0Y6V0Y6T0YaQOMtBFGeh9G+gBG+hBG2gQjfQQjbYaRPoaRPoGRPoWRPoORPoeRvoCRvoSRtsBIX8FIX8NI38BI38JI38FI38NIP8BIW2GkH2Gkn2Ckn2GkX2CkX2Gk32CkbTDS7zDSHzDSnzDSXzDS3ygSw1VgYrgaTAxXhYnh6jAxXCUmhqvFxHDVmBiuHhPDVWRiuJpMDFeVieHqMjFcZSaGq83EcNWZGK4+E8NVaGK4Gk0MV6WJ4eo0MVylJoar1cRw1ZoYrl4Tw1VsYriaTQxXtYnh6jYxXOUmhqvdxHDVmxiufhPDVXBiuBpODFfFieHqODFcJSeGq+XEcNWcGK6eE8NVdGK4mk4MV9WJ4eo6MVxlJ4ar7cRw1Z0Yrr4Tw1V4YrgaTwxX5Ynh6jwxXKUnhqv1xHDVnhiu3hPDVXxiuJpPDFf1ieHqPjFc5SeGq/3EcNWfWDT1nwKtJb6qikpvtMgoKkE1LmqM/N9p4jfED46LdzgTEpOSU1LT0jt17tK1W/cePTMyXe6s7JzcvF3yCwqLeu26W+8+u++x515777Pvfvsf0PfAfv0HDDzo4EMOPezwI448atDgIcVDhw0/+pgRI48dNfq4McefMLZkXOmJ4086+ZQJp552+sQzPGeWlXsnVUz2nTWlcmpVdc202jp//fSzZzTMnHXO7HPn0FwK0Hk0j+bTAjqfLqAL6SK6mC6hhXQpXUaXUyM1UTMtosW0hK6gK+kqupquoWvpOrqebqAb6Sa6mZbSMlpOLdRKK2gl3UK30iq6jVbT7XQH3Ul30d20hu6he+k+up8eoAfpIVpL6+hheoQepcfocXqCnqSn6Gl6hp6l5+h5eoHWExGjF+klepleoVfpNXqd3qA36S16m96hd+k92kAb6X36gD6kTfQRbaaP6RP6lD6jz+kL+pK20Ff0NX1D39J39D39QFvpR/qJfqZf6Ff6jbbR7/QH/Ul/0d/8VpLfJvJbQH57x2/d+G0Zv+Xit1P8VonfBvFbHH77wm9N+G0Hv6Xgtwv8VoBn8zwL59kzz3p5tsqzTJ4d8qyOZ2M8i+LZD89aeLbBswR+uuencn6a5qdgfnrlp05+WuSnPH4646cqfhripxh++uCnBr7b812a7658V+S7Gd+F+O7Boz6P1jzK8ujIoxqPRjyK8NXPVy1fbXyV8NnNZ2NjI5+3ppL5G5znB1qKq6vq/IsCrUN9/Ld+R2DFiCq/t8Jbu6y0X+RtLt7YP95W/8ACY/84W/3jFwSWt5X6b2KOihBp5VhvpcfPHy/BHmuwmZBobzTiAre1WVPu8XuKq2saQg81VLRJgHPbhUcvCQuiVsOnSsNC8FNLS/saPjQ+LIRRA/sbPlURFhQKfWFBrnBKWFAonBUWFApnhwW5wjlhQaGQLhckhUpqEiS5UhIlldplgqRS2yJICrUrBEml9n5BUql9UJAUatcKkkrtekFSqWWCpFD7kiCp1H4gSCq1mwRJoXazIKnUbhUkldqfBEmh9hdBUqjl240oKhTzLUkU5ar5riWKSuW5oqhUvosoqpQXiKJS+f6iqFTeVxRVyvuJolJ5sSgqlQ8TRZXyo0VRqXy8KCqVnyyKKuUTRFGpfIooKpVPFUWV8mpRVCqfI4pK5QFRVCmfJ4pK5fNFsZ1y0wnB5nlpaIfPGGcElo2unt4snihCRy8TO8ke2xNYNcRX5alt4J3G1CwJgZcNLi/f/vghTYKG1SOqyrf/tmPHL36UbK88rCKk3vzMDuNopIiuMbSlimabxirdnrldjfQ0hR862WN3s++HTnI/pIH80MnshzSjH3b86BQd0q4lQTS5XUui6Irgqd4XaCnxV9d6rb2YBvCi5GFTzA+bImqRdEs1d0sNj9HyUdWecuFRkkW46kGTbZkZ0qeN1Eb+Xxipg7UO1jpYayO1kTpY62Ctg7VevdpIbaQO1jpY62CtQ4w2UgdrHax1sNbBWhupjdTBWgdrHaz16tVGaiN1sNbBWgdrHWK0kTpY62Ctg7UO1tpIbaQO1jpY62CtV682Uhupg7UO1jpYayO1kTpY62Ctg7VevdpIbaQO1jpY62CtV682UgdrHax1sNbBWhupjdTBWgdrHaz16tVGaiN1sNbBWgdrHWK0kTpY62Ctg7UO1tpIbeS/aKQh1DrCYoKxzRns1VbePBhG/B2tbR6/wExw2v37Kcv5aNY0WT+H0/i3Yopbhvu8leUcu7HsgOoLlnh/WznhhMYZCyezUbeWJH312oBtLZM3P79u3Q+tY73++toq6y0j2bhlOMPhtl30TQl/oN3vU8OBe/nI+qk1fDCnBefMjpakMCM4X4ydk6ytSzFaJ50nQaCxQ2qEDmkrR3nr6sZN9lRZqkkOtLY91IhJIZPTmGNqaESH84fxVVS1TaIlaz0z/d6yifX+yokVXn+p31fp8zdwl/m9M/wb4tyB1aO9U6trG7h9tVyjuExkLSnSllRpS5q0JV3a0kna0lna0kXa0lXa0k3a0l3a0kPa0lPakiFtyZS2uKQtcs9lSVuypS050pZcaUuetGWXtonVWuKbWlPp/Scc/K/91P4PTET6yMD+tpjLS/seeLD6t5EtbWw0R/bkUOyNFNINm0+iIgdIsbdddLefA6TIc4BEUA5gsbcnKnKq1I7lPerTwUpjiiFESaEtuG0FzKeZtChOM2nKrEfSKb39tmOlMDW89YS7McecDk+cOJUblpb2jcL5LR1MIbt1OC9L6nAObfEUne0RLOZzF3sEp5nQ1R4hwUzoZo+QaCZ0j/JoudXctYfd9NpE6GmP0NP8F4Hk6z7Jat03yxZphmSRJrRLJkyLNIM5rgrBl8jgDmWgbHeyfKd3+GhZ520L3f5aT5m/pKGqrNhTNtk7omq6p9LHN6pF8oNC4JZjvJ6awbW1ngYxv5AfyZIWGTbFln86N7X/dTfLjTx4QLYcnGuCWZezvAMjn2YNvz4Er5DCl42ur5RypTc3brPDHBHjvMvcyS0eVI3JtUsUozckQ4yCkm7ZsdifZe6ULT6K0f4sUYzJ/s6ybjmx2G/x0Dkq+7NFMSb7u8i65cZiv8VD56rszxHFmOyXXnjmxWK/xUPnqezPFcWY7O8GtT/Dpv0ZqsXtjm1xu4Xzs/GA6mr3MVNAzGGOdaGt6CHjbpgpnm6Dn3rcGvOoeaN2277eGlfrabveMicmboVpuYJpxhHNi2JE86xcGNWI5hmtyldkbwV2z462s7cCefaWD8reCsxjlS85lNzT7rqr2FNTV1/Jx1F+h2F5ACmIbzYdINr+eqX1YSN+seKAY2gJ3pLGcOuVvbijNxd2hlcwyDi9C0Rxx5/ptOqZt0Pt6n/Ubv9hTM1icQ3wI49lVzO3QHSa1d8etcTssMD4kTzZHJXbun2Qwj92FwmG9ZijWI82l0SG/fWYL1+POaD1mG91fJHfphTaTZ0kagvNagsVbigS24LBeqM5tBaJ+41EdZFZdVHEXbqXJF0oEu03b2u9mOM905rLj2JLyVeGSdWWkv9f12fwlXAGMWXHuWJb0I+fS42SDLqgoYfFoOcz53Eh+BZTwBBsz1IHU7dEv/AUPS30u5njWyFHlL2VkGP8ui3BbjwJ6jjL7ILQN2zRZ13uiIvAYpJkiaNimibRzDyXMv+Q5ppZtwd9M2xavaeyTkpwWXgoizm2hUZvtlSFxP0utfs5/M8o3O/eee7Piuj+HCtPxpBp5YijYnK/4AU7qa4rCvfnKN0fMWdxpkR2vyty9LFyv4s506Nwf9bOc78rFve7Ouh+t9L9mTJopvL2KsbV7xYVWy1Qp0twv3F/EG/P1PuD7A4xUz1DMpgzJ4oZ4tp5MyQjlv0hI5arpCxxVEwzpN38iX5/yIxihriVMyRTvT+4mbN35ACR2Roh9lg5P5M59wih59pYFhmRs+S6UJbc2Ggjjw21FFhn0Jk9Y81jrXPsntGlsuqLManjM5WOz2s3oFbe2U8RGjLNoUG2sizyRddOv79xyfPFDFC+6FLOTHkqYHE8cMe2P+y8hRC60LFeBvHYZRAf5TKQbDLCF43WX1Q5DwvN5HnSTSaxg5tM945sMpmxbDLq/SBJmatm27AkKYpY41LGmiT1MYQfFIdHcQo1W5bQ4e0vIeL2N1KwTP7tt8v88pHgSfk345mRvxkvjOWImq+8VXKrbkbypYbEdglQyJzj/t1LgMKI66/Iargi3oRZXZ8Jo2Jaf72iGOT82C4BiqK9BMi38FARc06MvP6KIiQo8h2vyHyXLAyz/GIsX7gYM27noS1ffGFRPkk6P/3AmE2/1vQxfy8W9HLwNYoOKvo45fhhjnsXFkRWJHlv2yl5d1w8Yhv7OExvTicz5yzj/+gJWRLtaSq0EKN7/dsZ7tBOc5rkbfb0sGk7/Ow82zAqKWGG4W329PBHrN81N1qXFuHl9HRjh/QIHTpZvs2eJrwMb/BJJ+ask00v26+EBkfsHImXnaD5/HLylh/XP1PRuNMXzvziJ/f96LM1M3e6ojUD9jm080l95kZU9B9brTyt/PcAAA==",
-      "debug_symbols": "tZndbhs5DEbfxde5ECnqh3mVoCjc1C0MGE7gJgssgrz7khl9sh1AWtdub6KTxHPM4VCUZuZt9X3z7fXn1+3+x9Ov1f3D2+rbYbvbbX9+3T09rl+2T3v769sq+I/MdXUf72zU1X22MYY2Uhu5jbGN0sbUxtzG0sbaxuaT5pPmk+ZL9rliY7a/q4/cRvMTOSSAfQN5iLkAKkAblAAgAAMiQAAJAHOBucBcYK4wV5grzBXmCnOFucJcYa4wV5gVZoVZYVaYFWZt5hL8qORAAAb4Z7JDBhSAfTsHB21AAUAABkSAfTv74ZQAGVAAbi4O2oADwM3qYObowXMECCABMqAAKkAbeG0uQACYI8wRZi/Q6GnxCl2gANxcHbSBV+kCdrj4uYt9WNjBPizioA1SAFgY4sLEgAgQQAJkQAG42XOYtEEOAAK42XOYI0AAZk4eqk+QBQqgArSBT5AFCGDmRA4RIIAEcLMn0yfIAhXgZk+CT5AFCMCACBBAArjZk+ATZIEK0AY+QZInwSdI8qvjE2SBCHCzZ8MnyAIZUAAVoAtUn0QLeFcKDgyIAAF4p2OHDCgAb3bRQRv4tMriQAAGRICbq4OZi3+FT6sFCqACtIFPqwUIYOZCDhFg5uJh+LRaIAPc7N/u02oBbeDTagECMCAC3JwcEiADCsDN2UEb+LRagAB+VHEogAqwo6qfl8+vBQhg8VQ/QZ9fCwggATKgACrAzX69fH4tQAAG+JnW9/e7FRbJry+HzcbXyJNV09bS5/Vhs39Z3e9fd7u71T/r3evHh349r/cf48v6YP+1qDf77zaa8Md2t3F6vzseHcaHUrBFtx1unLUrKNCZhMYS8eb8oRApXVD47HgeHx8TziBaVnoARX/jLLT2s7D2NTwLGUtS9Vb+4UhWFkdFkjNFGis4M5LJtvnoinxxDMpIRdKYhzFMFDml0hS235Ghoo4VtqY3g7Xyk+tRLz+NHkPS05r6FANNrmlkUlQFxzTI5dygva5iqCPDpDCF+uUQivr71zMH3wMsFyOkOE7ExKEEhfLxJOTius7kC8ESA0e5qqZYjoo0VlCZzFHNqCrScnSk81lOk7qkQr1X2S5hqNBZMhGE1tNWUy43qPROQ2mo4Em/5GM6mdPwmjLPOh4f23aicRhxclXtvqt3inwaxqfOPauMSmi8dq+iY8esa0rqTfN4USVcWRg6LowyuyY9GXZ54kjBddp50bFyUrkqCsponBbPMIo46XqS+mJcxnURZ8s51a7gkxVE6HxbEWf1mfoFOWl71kQvj4L7ciwx0DiKSXUSVzgoEo3jmDhiyXBE26uO48iz+gxVe4HS2dmcz5M4KY4ofUFMOj6Xy+PgMI5DZ71HwrH5SIhjyzSWKNRjiakMLTKpkpiPW0cZ5mRquCirMumjUns7F7szGJ/HxMER58GJr4qCSzfUfFV1XFrpMqlRe/TW1xSbweNc1D+Qz3pzPuvfzOeluUh8ey5mjstyMTXcnAsLvvTzKOGqjnFxLsrfdVyYz3JzPmerY+x3RxInczXTH1gdZ7uNgjCShPF+eprNvttgCdftmoT6fjqdbIY/KXK6ddeUZ91TA2Z7VOZhZeVZdYaC3bRtf+lKR07dUcaratZbK3yaz4vqYvoYo+8xcqLxnXOZtC171YKrau9Y4uD2fWqo3B+m2DPDqwz9ttfez1zzCCHFfoeVZHzv/T87Njo+HxNO1+77Ti0yrvFSb18Vi97excvNNT41jLv4F/t1/bg9nL0EfXfVYbv+ttu0X3+87h9P/vvy7zP+g5eoz4enx83318PGTcc3qfbjodqz8qr85W5lT5MfsjXIzMV+85cBD1X1zhrSl3eP5T8="
+      "debug_symbols": "tZndTmM7DEbfpddcxI7zY14FjUYdpowqVQV14EhHiHc/NjtfWpCSU9qZG7KA7lXH23HS3dfVz82Pl1/ft/uHx9+r27vX1Y/Ddrfb/vq+e7xfP28f9/bX11XwH5nr6jbe2Kir22xjDG2kNnIbYxuljamNuY2ljbWNzSfNJ80nzZfsdcXGbH9XH7mN5idySAB7B/IQcwFUgDYoAUAABkSAABIA5gJzgbnAXGGuMFeYK8wV5gpzhbnCXGGuMCvMCrPCrDArzNrMJfhVyYEADPDXZIcMKAB7dw4O2oACgAAMiAB7d/bLKQEyoADcXBy0AQeAm9XBzNGD5wgQQAJkQAFUgDbw2lyAADBHmCPMXqDR0+IVukABuLk6aAOv0gXscvG5i71Y2MFeLOKgDVIAWBjiwsSACBBAAmRAAbjZc5i0QQ4AArjZc5gjQABmTh6qL5AFCqACtIEvkAUIYOZEDhEggARwsyfTF8gCFeBmT4IvkAUIwIAIEEACuNmT4AtkgQrQBr5AkifBF0jyu+MLZIEIcLNnwxfIAhlQABWgC1RfRAt4VwoODIgAAXinY4cMKABvdtFBG/iyyuJAAAZEgJurg5mLv4UvqwUKoAK0gS+rBQhg5kIOEWDm4mH4slogA9zs7+7LagFt4MtqAQIwIALcnBwSIAMKwM3ZQRv4slqAAH5VcSiACrCrqs/L19cCBLB4qk/Q19cCAkiADCiACnCz3y9fXwsQgAE+0/r2drPCJvn9+bDZ+B55smvaXvq0Pmz2z6vb/ctud7P6Z717eX/R76f1/n18Xh/svxb1Zv/TRhM+bHcbp7eb49VhfCkF23Tb5cZZu0L1g4PGDvHe/G4QKf368jEGHl8fEyYQLSm4nkr5wiS09klY9xpNQsaOVL2RvyuSFcUxjMQfFGms4MxIJdvRoyvy2TEoIxNJYx7GMFHklEpT2GlHhoo6VtiO3gzWyE9uxxem0WNIelJRn2OgyS2NTIqi4JgGuZwbtJdVDHVkmNSlUL8dQlG/fj9z8BPAcjNCiuNETBxKUCgfJyF0dgzk28ASA0e5qKZYjoo0VlCZLFHNqCrScnSkT11mUpdUqHcqOyMMFTpLJoLQetpp0vkGld5oKA0VPGmXfEwncxreU+ZZw+Nj0040DiNO7qp96uqdIp+G8alxzyqjEvqufVLRsWPWNSX1pnm8qRLKZYWh48Ios3vSk2G3J44UXKedFx0rJ5WLoqCMxmnxDKOIk64nqe/FZVwXcbabU+0KPtlBJNSPjll9pn5DTtqeEJ0fBfftWGKgcRST6iSucFAkGscxccSS4Yh2Uh3HkWf1Gar2AqXT2XxaJ3FSHFH6hph0PJfz4+AwjkNnvUfCsflIiGPLNJYo1GOJqQwtMqmSmI8nRxnmZGo4K6sy6aNSezsX+1wwnsfEwRHz4MQXRcG1d9GaL6qOcytdJjVqD976nmIreJyL+gfyWa/OZ/2b+Tw3F4mvz8XMcV4upoarc2HBlz6PEi7qGGfnovxdx5n5LFfnc7Y7xv7pSOJkrWb6A7vj7LRREEaSMD5PT7PZTxss4bJTk1A/T6eTw/AnRU7XnpryrHtqwGqPyjysrDyrzlBwmpagdKEjp+4o410167UVPs3nWXUxfYzRzxg50fiTc5m0LfuiBXfVvmGJg4/vU0Pl/jDFnhheZCjHD0jlkkcISWJPhIw/e//PiY2Oj8eE06XnvlOLjGu81Ot3xaLXd/FydY1PDeMu/s1+Xd9vDx++An1z1WG7/rHbtF8fXvb3J/99/vcJ/8FXqE+Hx/vNz5fDxk3H71Htx121J+VV+dvNyp4l32VrkJmL/eZfBdxV1RtrSN/ePJb/AA=="
     },
     {
       "name": "public_dispatch",
@@ -2346,7 +2346,7 @@
         }
       },
       "bytecode": "JwACBAEoAAABBIBHJwAABEclAAAAQScCAwQBJwIEBAAfCgADAAQARi0IRgIlAAAAdScCAgRHJwIDBAA7DgADAAIpAABDAEfazXMsAABEADBkTnLhMaApuFBFtoGBWF0oM+hIeblwkUPh9ZPwAAAAJwBFBAMmKQIAAwC4Od6RCioCAwQnAgUEACcCBwQDACoFBwYtCAEDAAgBBgEnAwMEAQAiAwIGLQ4FBgAiBgIGLQ4FBicCBgQDACoDBgUnAgUEAScCBgQCJwIHBAAnAggAACcCCQEAJwIKAAIpAgALAO9SU00rAgAMAAAAAAAAAAADAAAAAAAAAAAkAgAEAAABBSMAAAKqLQgBBCcCDQQDAAgBDQEnAwQEAQAiBAINHzoABgAFAA0AKgQFDS0LDQ0AKgQGDi0LDg4KKg4IBBYKBA4eAgAEAB4CAAQAHgIABAEKIgREDxYKDxAcChARAAQqEQQQCioPCQQkAgAEAAABeCcCEQQAPAYRAS0IAQQnAg8EBQAIAQ8BJwMEBAEAIgQCDy0KDxEtDgsRACIRAhEtDgoRACIRAhEtDhARACIRAhEtDgwRLQgBDycCEAQFAAgBEAEnAw8EAQAiBAIQACIPAhE/DwAQABEAKg8FBC0LBAQKKgQIDwoqDwkQJAIAEAAAAfYlAAAPqC0IAQ8nAhAEBQAIARABJwMPBAEAIg8CEC0KEBEtDgsRACIRAhEtDgQRACIRAhEtDg0RACIRAhEtDgwRLQgBBCcCDQQFAAgBDQEnAwQEAQAiDwINACIEAhA/DwANABAAKgQFDS0LDQ0KKg0IBAoqBAkPJAIADwAAAnQlAAAPqBwKDgQAMAoABAANLQsDBAAiBAIELQ4EAwAiAwINLQsNDScCDgQDACoDDgQ7DgANAAQjAAACqikCAAQAiVX1/AoqAgQNJwIEAAEkAgANAAACyiMAAAPoLQgBDScCDgQCAAgBDgEnAw0EAQAiDQIOHzoABQAFAA4AKg0FDi0LDg4KKg4IDRYKDQ4eAgANAB4CAA0AHgIADQEKIg1EDxYKDxAcChARAAQqEQ0QCioPCQ0kAgANAAADNCcCEQQAPAYRAS0IAQ0nAg8EBQAIAQ8BJwMNBAEAIg0CDy0KDxEtDgsRACIRAhEtDgQRACIRAhEtDhARACIRAhEtDgwRLQgBDycCEAQFAAgBEAEnAw8EAQAiDQIQACIPAhE/DwAQABEAKg8FDS0LDQ0KKg0IDwoqDwkQJAIAEAAAA7IlAAAPqBwKDg8AMAoADwANLQsDDQAiDQINLQ4NAwAiAwIOLQsODicCDwQDACoDDw07DgAOAA0jAAAD6CkCAA0AJxaxZgoqAg0OJwINAQEkAgAOAAAECCMAAAf+LQgBDicCDwQDAAgBDwEnAw4EAQAiDgIPHzoABgAFAA8AKg4FDy0LDw8AKg4GEC0LEBAeAgAOAB4CAA4ALQgBDicCEQQFAAgBEQEnAw4EAQAiDgIRLQoREi0OCxIAIhICEi0OBBIAIhICEi0ODxIAIhICEi0ODBItCAERJwISBAUACAESAScDEQQBACIOAhIAIhECEz8PABIAEwAqEQUOLQsODgoqDggRCioRCRIkAgASAAAEwiUAAA+oHgIAEQAvKgAOABEAEhwKEhECHAoRDgAcCg4RAhwKERIBHAoSDgIcCg4RAQoqEQkOJAIADgAABP8lAAAPuh4CAA4BCiIORBEWChESHAoSEwAEKhMOEgoqEQkOJAIADgAABS0nAhMEADwGEwEeAgAOAx4CABEEKQIAEwDDt7IGKwIAFAAAAAAAAAAABQAAAAAAAAAALQgBFScCFgQFAAgBFgEnAxUEAQAiFQIWLQoWFy0OExcAIhcCFy0OEhcAIhcCFy0ODhcAIhcCFy0OFBctCAEOJwISBAUACAESAScDDgQBACIVAhIAIg4CEz8PABIAEwAqDgUSLQsSEgAqEhETLQIOAycABAQFJQAAD8wtCAURACoRBRItDhMSACoOBhItCxISACoSEA4tAhEDJwAEBAUlAAAPzC0IBRAAKhAGEi0ODhItCAEOJwIRBAUACAERAScDDgQBACIQAhEAIg4CEj8PABEAEgAqDgUQLQsQEC0IAQ4nAhEEBQAIAREBJwMOBAEAIg4CES0KERItDgsSACISAhItDgoSACISAhItDg8SACISAhItDgwSLQgBDycCEQQFAAgBEQEnAw8EAQAiDgIRACIPAhI/DwARABIAKg8FES0LEREKKhEIEgoqEgkTJAIAEwAABq8lAAAPqC0IARInAhMEBQAIARMBJwMSBAEAIhICEy0KExQtDgsUACIUAhQtDhEUACIUAhQtDhAUACIUAhQtDgwULQgBECcCEQQFAAgBEQEnAxAEAQAiEgIRACIQAhM/DwARABMAKhAFES0LEREKKhEIEwoqEwkUJAIAFAAABy0lAAAPqB4CABMALyoAEQATABQcChQVAhwKFRMAHAoTFAIcChQVARwKFRMCHAoTFAEkAgAUAAAHZSUAABAmLQsOEwAiEwITLQ4TDi0LDw4AIg4CDi0ODg8tCxIOACIOAg4tDg4SLQsQDgAiDgIOLQ4OEDAKAAgAEScCDwQBJwIRBAMAKg8REC0IAQ4ACAEQAScDDgQBACIOAhAtDg8QACIQAhAtDg8QJwIQBAMAKg4QDy0KDxAtDEMQACIOAhAtCxAQJwIRBAMAKg4RDzsOABAADyMAAAf+KQIADgBhlmt8CioCDg8kAgAPAAAIGSMAAAnZLQgBDicCDwQEAAgBDwEnAw4EAQAiDgIPHzgARQAFAA8AKg4FDy0LDw8AKg4GEC0LEBAAIg5FES0LEREKKhEIDhYKDhEeAgAOAB4CAA4AHgIAEgEKIhJEExYKExQcChQVAAQqFRIUCioTCRIkAgASAAAIlScCFQQAPAYVAQoqFA4SJAIAEgAACKclAAAQOC0IAQ4nAhIEBQAIARIBJwMOBAEAIg4CEi0KEhMtDgsTACITAhMtDgoTACITAhMtDg8TACITAhMtDgwTLQgBDycCEgQFAAgBEgEnAw8EAQAiDgISACIPAhM/DwASABMAKg8FDi0LDg4KKg4IDwoqDwkSJAIAEgAACSUlAAAPqC0IAQ8nAhIEBQAIARIBJwMPBAEAIg8CEi0KEhMtDgsTACITAhMtDg4TACITAhMtDhATACITAhMtDgwTLQgBDicCEAQFAAgBEAEnAw4EAQAiDwIQACIOAhI/DwAQABIAKg4FDy0LDw8KKg8IDgoqDgkQJAIAEAAACaMlAAAPqBwKEQ4AMAoADgAPLQsDDgAiDgIOLQ4OAwAiAwIPLQsPDycCEAQDACoDEA47DgAPAA4jAAAJ2SkCAAMARvtE2goqAgMHJAIABwAACfQjAAALQS0IAQMnAgcEAgAIAQcBJwMDBAEAIgMCBx86AAUABQAHACoDBQctCwcHHgIAAwAeAgADAB4CAAMJJAIAAwAACjklAAAQSi0IAQMnAg4EBQAIAQ4BJwMDBAEAIgMCDi0KDg8tDgsPACIPAg8tDgQPACIPAg8tDgcPACIPAg8tDgwPLQgBBycCDgQFAAgBDgEnAwcEAQAiAwIOACIHAg8/DwAOAA8AKgcFAy0LAwMKKgMIBwoqBwkOJAIADgAACrclAAAPqB4CAAcALyoAAwAHAA4cCg4HAhwKBwMAHAoDBwIcCgcOARwKDgMCHAoDBwAnAg4EAScCEAQDACoOEA8tCAEDAAgBDwEnAwMEAQAiAwIPLQ4ODwAiDwIPLQ4ODycCDwQDACoDDw4tCg4PLQ4HDwAiAwIOLQsODicCDwQDACoDDwc7DgAOAAcjAAALQSkCAAMA+NRemwoqAgMHJAIABwAAC1wjAAAN5y0IAQMnAgcEAwAIAQcBJwMDBAEAIgMCBx86AAYABQAHACoDBQctCwcHACoDBg4tCw4OHgIAAwAeAgADAB4CAAMJJAIAAwAAC6olAAAQXC0IAQMnAgYEBQAIAQYBJwMDBAEAIgMCBi0KBg8tDgsPACIPAg8tDgQPACIPAg8tDgcPACIPAg8tDgwPLQgBBicCDwQFAAgBDwEnAwYEAQAiAwIPACIGAhA/DwAPABAAKgYFAy0LAwMKKgMIBgoqBgkPJAIADwAADCglAAAPqB4CAAYALyoAAwAGAA8cCg8GAhwKBgMAHAoDBgIcCgYPARwKDwMCHAoDBgEWCgYDLQgBBicCDwQFAAgBDwEnAwYEAQAiBgIPLQoPEC0OCxAAIhACEC0OChAAIhACEC0OBxAAIhACEC0ODBAtCAEHJwIKBAUACAEKAScDBwQBACIGAgoAIgcCDz8PAAoADwAqBwUGLQsGBgoqBggHCioHCQokAgAKAAAM1SUAAA+oLQgBBycCCgQFAAgBCgEnAwcEAQAiBwIKLQoKDy0OCw8AIg8CDy0OBg8AIg8CDy0ODg8AIg8CDy0ODA8tCAEGJwIKBAUACAEKAScDBgQBACIHAgoAIgYCCz8PAAoACwAqBgUHLQsHBwoqBwgGCioGCQgkAgAIAAANUyUAAA+oHgIABgAvKgAHAAYACBwKCAcCHAoHBgAcCgYHAhwKBwgBHAoIBgIcCgYHAQQqAwcGHAoGAwAnAgcEAScCCgQDACoHCggtCAEGAAgBCAEnAwYEAQAiBgIILQ4HCAAiCAIILQ4HCCcCCAQDACoGCActCgcILQ4DCAAiBgIHLQsHBycCCAQDACoGCAM7DgAHAAMjAAAN5ycCAwJVJwIFAm4nAgYCaycCBwJvJwIIAncnAgoCICcCCwJzJwIMAmUnAg4CbCcCDwJjJwIQAnQnAhECcicCEgJ7JwITAn0tCAEUJwIVBBwACAEVAScDFAQBACIUAhUtChUWLQ4DFgAiFgIWLQ4FFgAiFgIWLQ4GFgAiFgIWLQ4FFgAiFgIWLQ4HFgAiFgIWLQ4IFgAiFgIWLQ4FFgAiFgIWLQ4KFgAiFgIWLQ4LFgAiFgIWLQ4MFgAiFgIWLQ4OFgAiFgIWLQ4MFgAiFgIWLQ4PFgAiFgIWLQ4QFgAiFgIWLQ4HFgAiFgIWLQ4RFgAiFgIWLQ4KFgAiFgIWLQ4SFgAiFgIWLQ4LFgAiFgIWLQ4MFgAiFgIWLQ4OFgAiFgIWLQ4MFgAiFgIWLQ4PFgAiFgIWLQ4QFgAiFgIWLQ4HFgAiFgIWLQ4RFgAiFgIWLQ4TFgoqCQ0DJAIAAwAAD6gnAgUEHi0IAQYnAgcEHgAIAQcBLQoGByoDAAcFhhoTW+HI7KkAIgcCBwAiFAIIJwIKBBstAggDLQIHBC0CCgUlAAAQbicCCAQbACoHCActDgQHACIHAgctDgIHACIHAgc8DgUGKgEAAQW6uyHXgjMYZDwEAgEmKgEAAQVMr1JlAlqXtDwEAgEmLQEDBgoABgIHJAAABwAAECEtAAEFAAABBAEAAAMECS0AAwotAAULIwAAEAotAQoILQQICwAACgIKAAALAgsMAAoJDCQAAAwAAA/4JwEFBAEjAAAQJS0AAwUmKgEAAQXtK68NmiE35zwEAgEmKgEAAQXBUDSsJUi8UTwEAgEmKgEAAQWiP4wWRewq/zwEAgEmKgEAAQXwQ+Wh+qIsNDwEAgEmAAADBQctAAMILQAECSMAABCSLQEIBi0EBgkAAAgCCAAACQIJDAAIBwokAAAKAAAQgCY=",
-      "debug_symbols": "vZ3bbh23Dobfxde5kKgTmVcpiiJt3SJAkBZpsoGNIu++RUoix94YWbXk3mS+9XtZR0rikDPO3w+/Pv787fefPn7+7Y+/Ht7/8PfDz18+fvr08fefPv3xy4evH//4XNW/Hxz/4315eO/fPXjI7Rr8w3vga27X2D/H/jm5fk3tmvvnPD5Tu5bYr9iuGOQKuZYX+Zratbh+7Z+xf8b+mervFb6iXIODh/fE19KuvpbnHUPuALUEHxlqER4rBG4jMHAj+UfRDYj9R5E6JFYyA3XIpUOBAbWuECpwaxukDjQU6kp0bkAcgB18GFA6AAzoVUSekAZcYGKgDtz4BkNJQ0lDyUPhgQ6ZIQ3g79TxiRgHDIVKg8TDHRND7sAD3mAoMBQYCg94gziAOsQwADukUUUqHcRGCkPqIFYiMBQcCg6FhkLcjNr47PyA+p1UbSN7N2AoEAbU9qRqEjmwUhiaKecY+rWZcuYGJ2IoHbjBDXKHMhQEWVeZvFyLj2LXxWO7cv1y7Z9D/xz6Z153tZySfL+mZuaFF16D2Oy98NJjey+89nJgqEquI1p4hhtg/xGvqwas1O6iCx14hhvkDrykSmSIA6hDGEoYShwKj5cAD1iD0oEHrEHuUEYVPMMNuMBqp8hbRwPsQEOhrpALA4bCA10KA3XgoS7EgB3CUHiXa1Dbg3VYiMcbuRxuc511yr5f20ZI3GCeYeIGN6AOPNoNuuIdbwJegDoEkAmukDtEP2AoaShpKDzZKCXybDcqbYusgB3E6OT7WJpNeEe8cWah3MnzAumkmlfNq8bz3ykq0SAexU44KIJSGSQmjEJpEFtxJ9WKakU1VA25Vdxvz0uqkywKOcZkoDuayhvtQGTkYQIQlUsA3mVrjwWzYjQ1mppMTaZmUUEwK/JSHMgz73kkAEVFQVJkq+5fYLtuGNiya18EUVFOu4a8/Q7kHkNg5C3Yg5TAB0f9GSOvzY7ZVNk4Ghb7QjEVTUVTpb0dy8DIJ8bArCjHdEetOMpR3VGqiIKoGIKhqdHUaGoyNUkjk7gt0VC+y0MSS1C1FEVZNh1NlZ27Yx6YxM5CEUyGUjHPZvJRVTG5hmJyHU0NYFgUxfqiE0yKyRmamk3NphZT2WWpY8+I3lC+K+2ViW1I0VDV7KKhqbKyOhZFAMOsKIuso1acozPkKvg09nLYdpSJ7WhqNjWbWkwV+03czSz221G+y0ski/12VLWI0TYUo81OMCmK0XY0NZgaLiopitF2REU+GgcWxWwVy17SUGYzi1Mty7QjKaKpaCqZSqqiGC07AB69M5TvJkFSBFPFUjtyewsPKvJuXzvLKOZZ5Ating2zqdnUYmoxFUXNgqgok4VShWw2giSbTUceKOQSSDrUMRlyh4g7L57AQFSUvlEUzIqyCjtyYXLiiHtQzxrBrJhNzaZyNwcmRTQVLyop8rwNxI71n2BoqgdDqZhvtRx4w6Qod0MdTY3t/q8emqlDaZ5ohdIBYcBQaCjUFc92xW4JeJ6FTrHdw3lxxRh4AuRHPPwCMvhOqAxqG6CQTC5TG/gsKD0VtQ18w6RfaAPfkNVWqgx8R1Rk+xrIHh8f6gBsXx29M5TCUJAUeZUMNDWYGkyVW4qORTGBYVaUvnW0iqVvHeUe1gmiotxwdzSVTCVVxccYKPfB3M3go6F8NzBCMDRVwgUNJWIQpDBeMB0lbtDR1GxqvqikyEY4EBXZEAcWRbKK+aBuKLffwD4GyA34QFL0pnpTwVQwVRYM341DlBBCR/luEiTFZGoGQ2kvm3yUcEKUcnuUBMQFaVA6UL+TBPE+hMT56JQGedWg3WqC3IYLxHYzCe1eW6Cv15SHkodShoJjAYub0In6kmxOAgpxn/nGHcRHqH2UOA8Ycl/4SIUsW1LHrBhMDaZGU8WQOpKijHBHVGTHYKBVLIPdUaqQ9spe0DEpkqmkanHO0FQvjcyCWRHkuyiYFIOpARVlL8gSA5MIQ5YSZAPI8gXZADqaWkwtprJvB3woVxwnUL3z8IaqovOGSdE7Q1PBVIiGpBiCoZ5LGE2Vfa5h0nMJk55W4iMM1HMJi6nY7Rqp27Xc7EuQ0MOAbsUEQ4GhhKHEYddyoHfqJxOlOAC7pZN4miiEw9JJNiYxb5Ix78jdKfJdMaKOqWOQOMBAU72psht1REXZdDsWRe7RwKwoy6YjV4FOkBRl2XQ0NZuaTS2mylpBL5gM5bsc8HTisHRU1XOgtqNsCdiitqwSl+BlgZB8QRZIR1OjqdHUZKocKBgFOYLpWjw4GKJiMbWYiqbyxtuRl83APFAiDAOToVYMPIUDpQoOK4NEdjsWxWBqMDWaGk1N0sggiIpZvpsEi2IxVWLUHbm9XgqTUG9DnreBqgYXDU2ViHXHoih965gVJXLdUSuW0PtAqSIKoqJ0s6Op2dRsajFVotmeuynhioHyXU4cSLhioKoSo+jIW3lgH6Yiq8AliCNQx1OQFIOpwdRoajRVgvKAgtS35yCBCdkPK5JiMbWYisEQFclUvUEIErEfWBS9N8yKYCokQ+pbbpD4/UBUbLt6Q1OlbxxjC6n1raGpxdRiKpqKppKppGpzLzqa6k31poKpYGo7phqiYjQ1mppMlSBww3ar0TArtmOqYTK0iq2bGa0KsipIqyhtChtqFc3T6KhVNE+jYzTUiov1uFiPS7QqolWcrIpkFWerIlvFNrHFJrYUqwKtYrQqyComraK7Ig21iu6KNIyGWjFCMNSKJUYxUCvGaFVEqzhZFckqNlNGM2XMVkWxiotVgVYxWhVkFbecIC8yalnBhqjYEoINi2JLCjY0tSUGBWXf6UiKydRkarYqshVWrLCW3BREU9FUsqZfOkSjinrH1Sr+/v3dw8g4//T1y+MjJ5wvKeiamP7zw5fHz18f3n/+9unTu4f/fPj0Tb70158fPsv164cv9ae10MfPv9ZrLfC3j58emb6/s992978aI4el5Lfrlhy1gJrwWC6iugSjiBp8ek0R1WdMvQi+UbstIsyKYAenFwHJiihxuRVEYyyqjwe3rUj3RWRkR1iKqJlNG4vo4UkReToWox+5WAGOVttQA0SjG5yZuG0D/lttIH/bhsls1P0kD7Ny7n42OOR02w/x61pHwtUofHlaBkzKcNEN+64M1pnydJX5mXWWYRZwXWTPbHPalYxjOGpheN+VyaxUr2sMR3WqbDieNyOfGI3ypqMRsrainm1aRnrWCJptW6D2Ve+Q7gYDZhtGjbYOM68M+W4wwM8mhcac5PvBeKEZnK0azaBw24yJhUZwNhq2caXXjeelJ887MrFP8sM8a9rhsmf8A7MIeghU9/POLGBimzUvOYpI/mKdNRnwtIzZ9oljLKtfoCVUp+dpCZPBJNu4qN5XWRnp6YSEiVmQi8M4yZG7L2NqnHoiXvacGoJ7WsJs+/SF1DaxvK4MCLr31SDgfRlxNq9Z57V6m7bQcLkZdTJ1NOhyqD1vxtS8HKE1I92aVyjTHUPtq97D3paxvFIuU/tspQTaXynR7a6U6PdXSoT9lRLD7kqJcX+lTMtYXCkxb6+UWTNWV8rUvBZXSpydSXUu9O7mWobPr1op0d2ulDQpopAbw1Hv7+m2GWm2+dTsnFfnzaVbxyuF2dQmHdLLcqN/1AwXrRn3Lk+a+aE1GjnMtI5ugNtCJmZaPUBtSA34vOaGr3o65rLQ/W1nmpz1NQ4MdtNYXufNFp0XToLdmVh2295s9ge82Qy73uwLzVjzZnPc9GaXx/Pem835Lb3ZrLtXtZB4axa4f0Zn2j2ji9s/o4vfP6ML7J7RJeyf0dMyFs/okrbP6FkzVs/oqXktntEF3/iMvq6UQHcrBd3+GY3+wBmNsHtGv9CMtTMa44EzGtP+GT2LCWQYkR7KeN1HnzWj7EdlcTskOjPSYEYaJts5uf3tnPzudk6wv51T2N/OKe5u55T2t/NpGYvbOZXt7XzWjNXtfGpei9u5d+5t9/MnSyWE2/Cum1hp9poQyuDuN3TvZockP6c3WgI53Dqj3s0M1ZPeQwZ+Nvq+lHQi9O7ydux93h1Esu5cEwnPGzK7cUq2fNO0KfP5cZf5iXjbFO9mpjLGNV/OuedH7gsG681g063BzopA0OQMRndfRNi+C/Q+HrgN9PNU08p94EsNWbsR9LNc01peY3lQ728F/Sw5sn0vGFBDFfxIxa11zDJNEIksR+4ue+LzAYXJvhpJ/VMPrwp3BLQ8O/n73R1mxpFytr7kcr/wZwmnlIeBpfK60A0/xqN9SferdpYTqKnpaMH4cPEhEjwrBfe9Mj/NOy26ZX6WeFrzy3zw+47ZvJBFz8yHsO2azRuSgj3eEsMre3MtJNMrC8lB9/Yc/YFCyisLCQS2cPKsEHrbyVl1nKe7AKlXFZ2/3wUi7N/b+VkWau3mzs9yN8v7SEwH9pFZImpxH4nlwD4yLWR1H4kHTHXWkGVTndrZ6k3ePA20n4J+smjg3qVJ8cCimaWjFhfNLBm1vGhSObBopvmotUWT6MCimRayumhmuaDVRTNryPKimdrZ6qKZJqVOREauiybePuHkZ4mp5chILiciI7MEwnpkZJqhWn8o0W1HRubdWY2MTNNUq5GRF+ZnMTJS4ltGRqLLpAaLr4qMRK8BiVi9jtsiyoHH+nzZfq5Pds/tgwIPPNnncfvRPo8Hnu2bF7J6UOD+033LVpbvHynGfMDKZtmqRSvDE7EAPBELoP1YAJ2IBdCJWACFf8/KZg+up/1Utad8IEnsZ4mr5SyxJ9xPE0+zTmok1be6TM0/eI8pxIt7dv8qlLyrdtuVA4+DBW8nN7/eoWU8e9UD3H4qANyJVAC47VTASw1ZfMPB7aYC1gd18o6De9NUwNU8wuSlptmNFWR7yoRu773BHwhYgd8OWIE/ELACfyBgBX47YAX+QMBqXsjiYQd+P2A1bcjyGxP+QMAK4I0DVtdFE+6jvAAHAlYA2wErgAMBK4ADASuA7YAVwIGA1byQ1UUT9gNW04YsLxo4ELCC8MYBqyeL5v7Zdhn8XYcX5m9NLT6cCWH6QPXK05kvNWTN84bZm1PLnjdEv+95T/2RUIp1J967q9PXpxyRzo53ftKdicF6p5FN71050J38OvcqwdiQUkq3ESuIJ15EjftvosYDEStIByJWkLYjVpAORKzmhayeFGk/YjVtyPJJEQ+8kQqz1NWRk+K6aMrt89EwS/aspjZg9u7PcmoDsj+Q2oB84q9PQN7+8xMvdGcxtSHn/W5q46X5WUttwCxBspbamMWLbFTj1bP5v3jRLHVV9Gk69PkSDXj64BdM364qYzDokl95XsR05aFu8QmDv1155UQ0oOxHA8qJaEA5EQ0o+9GAciIaUE5EA8qBaEA5EQ0oJ6IBs5zTkePqumjun/wEjAeOq+lLVsvH1Sx1tX5cTXNXy8fV9F2rteNq3p3V42qavVo9rl6Yn8XjiuAtM/EJ9W8mJaTblySBToSvaD98RSfCV3QifEX74Ss6Eb6iA+Gr4A6Er+hE+IoOhK/C9D2lEzHfy6Ihf/u8VXAHngoIbvupgOAOPBUQ3IGnAoLffiog+ANPBcwLWV00fv+pgOAPPIQ+t7PVRTPLYZ1xjS6L5v5tuOBx3zUKsxzWsmsUZn9fb9k1CtO3r1ZdozDLY625Ri90Z9E1CrMEw6pr9NL8rLlGAfLbukYaka8Ge5sOn706HYKuvVDSbTAgTFNQzra0y99trTfyP9ZPH375+OXJ/1D7nUv68vHDz58e+8ffvn3+5fLTr//9c/xk/A+3f37545fHX799eeSS7L+5rf/8gNUzQE8/vnsI/CnAO4xQP/Hf1f4Bq0UhwI/fuS3/Aw=="
+      "debug_symbols": "vZ3bbh23Dobfxde5kKgTmVcpiiJt3Y0AQVqkyQY2irz7FimKHLsYWfWMe5P51u9lHSmJQ844fz38+vjzt//89PHzb7//+fD+h78efv7y8dOnj//56dPvv3z4+vH3z1396yHwPzG2h/fx3UOEOq4pPrwHvtZxzfo56+cS9FrGternOj/TuLasVxxXTHKF2svLfC3j2oJe9TPqZ9TP1H+v8RXlmgI8vCe+tnGNvbwYGKoC9BJiZuhFROyQuI3AwI3kH+UwIeuPMikUVioDKdSm0GBCryulDtzaAUWBpkKq5BAm5AmoENOEpgAwQavIPCEDuMDCQArc+AFTKVMpU6lT4YFOlaFM4O/08cmYJ0yF2oDCw50LQ1XgAR8wFZgKTIUHfECeQAo5TUCFMqsoTUFspDEUBbESgangVHAqNBXiZvTG1xAn9O+Ubhs1hglTgTSht6d0k6iJlcYwTLnmpNdhypUbXIihKXCDB1SFNhUEWVeVolxbzGLXLeK4cv1y1c9JPyf9zOuul9NK1GsZZt544Q3Iw94bLz2298ZrryaGrtQ+oo1neADqj3hdDWCldxdDUuAZHlAVeEm1zJAnkEKaSppKngqPlwAP2ICmwAM2oCq0WQXP8AAusNsp8tYxABVoKqQKhTRhKjzQrTGQAg91IwZUSFPhXW5Abw/2YSEeb+RyuM191qlGvY6NkLjBPMPEDR5ACjzaA1SJgTeBKEAKCWSCO1SFHCdMpUylTIUnG6VEnu1BbWyRHVBBjE6+j23YRAzEG2cVqkqRF4iSadG0aBrPv1I2okk8iko4KYNRmyQmjEJlEluxkmnNtGYamobcKu535CWlJItCjjEZaEVXeaOdiIw8TACicgnAu2zvsWA1zK5mV4urxdUqKghWQ16KE3nmI48EoKgoSIZs1foFtuuBiS2790UQDeW0G8jb70TuMSRG3oIjSAl8cPSfMfLaVKyuysYxsPkXmqvoKroq7VVsEzOfGBOroRzTilZxlqNaUarIgmiYkqOr2dXsanG1SCOLuC3ZUb7LQ5JbMrU1Q1k2iq7Kzq1YJxaxs9QEi6NUzLNZYjZVTG6gmJyiqwkcm6FYXw6CxbAER1erq9XV5iq7LH3sGTE6ynelvTKxAyk7mlpDdnRVVpZiMwRwrIayyBSt4pqDI1fBp3GUw1ZRJlbR1epqdbW5KvZbuJtV7FdRvstLpIr9KpraxGgHitHWIFgMxWgVXU2upoNKhmK0imjIR+PEZli9YtlLBspsVnGqZZkqkiG6iq6Sq2QqitGyAxAxBkf5bhEkQ3BVLFWR29t4UJF3+95ZRjHPJl8Q8xxYXa2uNlebqyhqFURDmSyUKmSzESTZbBR5oJBLIOmQYnHkDhF3XjyBiWgofaMsWA1lFSpyYXLiiHvQzxrBalhdra5yNycWQ3QVDyoZ8rxNRMX+T3J0NYKjVMy3WgGiYzGUuyFFV/O4/+uHZlFowxPt0BQQJkyFpkKqRLYrdksg8iwo5XEPF8UVY+AJkB/x8AvI4AehNmlsgEIyuUxj4Kug9FTUMfADi31hDPxAVkepMvCKaMj2NZE9Pj7UAdi+FGNwlMJQkAx5lUx0NbmaXJVbCsVmWMCxGkrfFL1i6Zui3MMGQTSUG25FV8lVMlV8jIlyH8zdTDE7yncTIyRHVyVcMFAiBkkK4wWjKHEDRVerq/WgkiEb4UQ0ZEOc2AzJK+aDeqDcfgP7GCA34BPJMLoaXQVXwVVZMHw3DllCCIry3SJIhsXVCo7SXjb5LOGELOVqlATEBRnQFEjvJEG8DyFxPpTKpGgajFtNkNtwgTxuJmHcawvoei11KnUqbSo4F7C4CUqkS3I4CSjEfeYbdxAfofdR4jzgyH3hIxWqbEmK1TC5mlzNroohKZKhjLAiGrJjMNErlsFWlCqkvbIXKBZDcpVMbSE4uhqlkVWwGoJ8FwWLYXI1oaHsBVViYBJhqFKCbABVviAbgKKrzdXmKvt2wIdyx3kC9TuP6GgqhuhYDGNwdBVchexIhik52rmE2VXZ5wYWO5ew2GklPsJEO5ewuYpq10hq13KzL0HCCBPUigmmAlNJU8nTruVAV9KTiUqegGrpJJ4mCuG0dJKNScybZMwVuTtNvitGpFgUk8QBJroaXZXdSBENZdNVbIbco4nVUJaNIleBQZAMZdkoulpdra42V2WtYBQsjvJdDngGcVgUTY0cqFWULQFH1JZV4hKiLBCSL8gCUXQ1u5pdLa7KgYJZkCOYYcSDkyMaNlebq+gqb7yKvGwm1okSYZhYHK1i4CmcKFVwWBkksqvYDJOrydXsana1SCOTIBpW+W4RbIbNVYlRK3J7oxQmod6BPG8TTU0hO7oqEWvFZih9U6yGErlWtIol9D5RqsiCaCjdVHS1ulpdba5KNDtyNyVcMVG+y4kDCVdMNFViFIq8lSf2YTqyClyCOAJ9PAXJMLmaXM2uZlclKA8oSLo9JwlMyH7YkQybq81VTI5oSK7aDUKSiP3EZhijYzUEV6E4km65SeL3E9Fw7OoDXZW+cYwtldG3ga42V5ur6Cq6Sq6SqcO9UHQ1uhpdBVfB1XFMDUTD7Gp2tbgqQeCB41ZjYDUcx9TA4ugVezcrehXkVZBV0cYUDrQqhqehaFUMT0MxO1rFzXvcvMctexXZKy5eRfGKq1dRvWKf2OYT25pXgV4xehXkFZNVoa7IQKtCXZGB2dEqRkiOVrHEKCZaxZi9iuwVF6+ieMVuyuimjNWraF5x8yrQK0avgrzikRPkRUYjKzgQDUdCcGAzHEnBga6OxKCg7DuKZFhcLa5Wr6J6Yc0LG8lNQXQVXSVv+qFDNKvod1yj4u/f3z3MjPNPX788PnLC+ZCC7onpPz58efz89eH952+fPr17+O+HT9/kS3/+8eGzXL9++NJ/2gt9/Pxrv/YCf/v46ZHp+zv/7XD+qzlzWEp+u2/J2QroSZbtIrpLMIvowafXFNF9xqJF8I3aaRFpVQQ7OFoEFC+iwXYriOZYdB8PTltRzouoyI6wFNEzmz4WOT6dkboci9mP2ryA0Hbb0ANEsxucmThtA/5bbaB42obFbPT9pE6zCuF8NjjkdNoP8etGR9LRKGJ5WgYsygg5TPvuDN6Zik8LWVlnm2YBx0X2zDaXXak4h6MXhuddWcxK97rmcHSnyofjeTPqHaPR3nQ0UrVW9LPNyihPzSvSatsCs69+h3Q2GLDaMHq0dZp5Z6hngwFxNSk056SeD8YLzeBs1WwGpdNmLCw0Q/DR8I2rvG48Dz153pGFfVKc5tnTDoc94x+YRbJDoLufZ2YBC9vseclZRIkH6+weytMyVtsnzrHsfoGV0De0pyUsBpN846J+X+VllPT0QFyYBYU8jZMChfMylsZpJ+Jhz+nRuKclrLbP2MhsE9vryoBke18PAp6XkVfzWm1eeS5toeF2M/pk2mjQ4VB73oyleQVCb0Y5Na/UljuG2Ve/hz0tY3ulHKb22UpJdH2l5HB1peR4faVkuL5Scrq6UnK+vlKWZWyulFwvr5RVM3ZXytK8NldKXp1JfS7s7uZYRsyvWik5nK6UsiiiUZjD0e/v6bQZZbX59OxcNOctlFPHq6TV1BYb0sNyo3/UjJC9GecuT1n5oT0aOc20j26C00IWZto9QGtID/i85oavezrustD5bWdZnPU9Dgx+09he5802mxdOgp2ZWA2Xvdkab/BmK1z1Zl9oxp43W/NFb3Z7PM+92Vrf0puttnt1C8mnZoHXz+hKV8/oFq6f0S1eP6MbXD2jW7p+Ri/L2DyjW7l8Rq+asXtGL81r84xu+MZn9HGlJDpbKRiun9EYbzijEa6e0S80Y++MxnzDGY3l+hm9iglUmJEeqodVy67Yk2a061FZvBwSXRlpciNNi+2cwvXtnOLV7Zzg+nZO6fp2Tvnqdk7l+na+LGNzO6d2eTtfNWN3O1+a1+Z2HkN42/38yVJJ6TS8GxZWWqMlhCqE8w09htUhyc/pzZZATafOaAwrQ41k95CJn40+L6XcEXoP9XLsfd0dRPLuHBIJf2vI6sap+PIty6as5ycc5ifjaVNiWJnKHNd6OOeeH7kvGGx0gy2nBrsqAsGSM5jDeRHp8l1gjPmG28C4TjXt3Ae+1JC9G8G4yjXt5TW2B/X8VjCukiOX7wUTWqiCH6k4tY5VpgkykefIw2FPfD6gsNhXM5l/GuFV4Y6EnmeneL67w8o4Sq3el9rOF/4q4VTqNLDSXhe64cd4rC/lfNWucgI9NZ09GJ8OPkR51pBV0mnXK4vLvNOmWxZXiac9vyymeN0xWxey6ZnFlC67ZuuGlOSPt+T0yt6U3Nzg6ZWF1GR7e83xtYUc74VeWUgi8IVTV4XQ207OruO83AXIvKoc4vkukOH6vV1cZaH2bu7iKnezvY/kcsM+skpEbe4jud2wjywL2d1H8g2mumrItqku7Wz3Jm+dBrqegn6yaODcpSn5hkWzSkdtLppVMmp70ZR2w6JZ5qP2Fk2hGxbNspDdRbPKBe0umlVDthfN0s52F80yKXVHZOS4aPLpE05xlZjajozUdkdkZJVA2I+MLDNU+w8lhsuRkXV3diMjyzTVbmTkhfnZjIy0/JaRkRwqmcHiqyIjOVpAInev47SIdsNjfbFdfq5Pds/LBwXe8GRfxMuP9kW84dm+dSG7BwVef7pv28rq+SPFWG+wslW2atPK8I5YAN4RC6DrsQC6IxZAd8QCKP17VrZ6cL1cT1VHqjckieMqcbWdJY6E19PEy6yTGUn3rQ5T8w/eY0r54J6dvwol76qdduWGx8FS9JO7x7a9jGevekC4ngqAcEcqAMLlVMBLDdl8wyFcTQXsD+riHYfwpqmAo3mkxUtNqxsrqP6UCZ3ee0O8IWAF8XLACuINASuINwSsIF4OWEG8IWC1LmTzsIN4PWC1bMj2GxPxhoAVwBsHrI6LJp1HeQFuCFgBXA5YAdwQsAK4IWAFcDlgBXBDwGpdyO6iSdcDVsuGbC8auCFgBemNA1ZPFs35s+0y+FcdXli/NbX5cCak5QPVO09nvtSQPc8bVm9ObXvekON1z3vpj6TWvDv53F1dvj4ViGx2YoiL7iwMNgaLbMYY2g3dqa9zrwrMDamUchqxgnzHi6j5+puo+YaIFZQbIlZQLkesoNwQsVoXsntSlOsRq2VDtk+KfMMbqbBKXd1yUhwXTTt9PhpWyZ7d1Aas3v3ZTm1AjTekNqDe8dcnoF7+8xMvdGcztSHn/dXUxkvzs5fagFWCZC+1sYoX+ajmo2fzt3jRKnXV7Gk6jPUQDXj+BwtWe2ubg0GH/MrzIpYrD22LL5ji6cprd0QD2vVoQLsjGtDuiAa069GAdkc0oN0RDWg3RAPaHdGAdkc0YJVzuuW4Oi6a8yc/AfMNx9XyJavt42qVuto/rpa5q+3javmu1d5xte7O7nG1zF7tHlcvzM/mcUXwlpn4gvY3kwrS6UuSQHeEr+h6+IruCF/RHeEruh6+ojvCV3RD+CqFG8JXdEf4im4IX6Xle0p3xHwPi4bi6fNWKdzwVEAKl58KSOGGpwJSuOGpgBQvPxWQ4g1PBawL2V008fpTASne8BD62s52F80qh3WPa3RYNOdvw6WI112jtMphbbtGafX39bZdo7R8+2rXNUqrPNaea/RCdzZdo7RKMOy6Ri/Nz55rlKC+rWtkEflusKfp8NWr0ynZ2kutnAYD0jIFFXxLO/zd1j6gP/ZPH375+OXJ/1D7nUv68vHDz58e9eNv3z7/cvjp1//9MX8y/4fbP778/svjr9++PHJJ/t/c9n9+wO4ZYKQf3z0k/pTgHWbon/jvav+A3aIQ4Mfv3Jb/Aw=="
     },
     {
       "name": "sync_state",
@@ -2483,7 +2483,7 @@
         }
       },
       "bytecode": "H4sIAAAAAAAA/+09aYAdRZkz75h33+fMe3Mn4TJAAoSAqIRwS0JMghAUkyGZHBBmMkcgASUnISaTzExOLkWBQFwFXQXFGy90leei6y6KsCviep94LN47gff6VXfV91VXv+qZbqbzqzP96quvv7u++uor977Rw/8ysLFn+dKBwa7B7rrRLR88r3/N2rVrVs3tWrv2wNj/H1y0pmfV2u79I6P7vtxWh/+rr+P+pG5k/8gIH9Bo3cjI2IwEas9N27blyNzenoHB/VsePH9Nf/fyQdeWhy7pGexe1d1//xWnzeQD1Y6vFxq/+b3a8XVi8793ywPHiDoaVuAcXdi9tmtwzY3dbqNfokDwiEGo2/KhY7is6Brsmtu7bqPySU+9h0SKgH7/vN4b91X/4CIGvPpVq2icXKL0qZUudVseWDTYu25UhSgBTMO/uUcuXNO9dsUY2OeXn9p7+8HuPx9921tGNgytLl32L4safvkfZ/zlyOoX/+0zn3lJO/B8ZeBI/EenPD/j53/++DdOP+u/9y36/NL/nXtppu6qxz9y0Z0PvP+mb2oHXqAMfGpF54vfPfCmef+5J73g5pP+6/Nbv++fm/z4HX+4/MXXH11x8xbtwAuVgfEPX9Kz/PUfPuvUAwduPW7hVw9//fMvf3H9NaPr9n3p7nsfnf937cCLCArOOp1Dwfob3qcdf7Ey8R8GnnnwG3s+9uWjgw8dOZR4NnJn6HXBTbfd9pvCr4t3/fa2+7UDL1Emvu+K2VzOUby5VGh4g3b4mxW03/gJ99Wr//UvvaGLtn34pme/N399pNj1xdadR67+ymjrz5bu0A68TBn406G7N8U+vO99bSeV/thw0fAvl/7+Eu/sZ0vvbPzS1r/97Lf7tQPnKQO/ffXfnn80tv/mDXs+ecvs41NdH9r/zO9+/tVvPBL7/QsP9z1zhnbgfDEZ92vHXy42Pqgdv6BGK/oWofH1+7TjF4rNH9eOXyQi4WP/tOMXi42nvv8KsfEu7fi3Cmkojf+ViuBteeDo83P2lE598W/BXfO6tm84bfd/XPmrm/MPTf3f6x4ufiihHXiVMvCHg3NHB3M3zPqV/9/3zHh/ofl//vDQoz/508bu2b/8yU8/3v577cAlYhw7Vzv+6srE+ZnHnbXujqfTzx3f8f1zn/jQyQca/zDlnOcev/j9v/3Lv73MYNXbKgPrOVNqB75dAOPQ2y67TDv+GoVUFDvwid8BDKQAaAcuFaMxZT+XiXpOzfgusfGUVF/L+fDKP6924HJiYP22joHDgT318764dfqj4eAXfzbn3vPmlr6xfVdr7EP3ageuqAw88ZzAb4/suvW2uh889Iu9fzrxM+dOT7TMSZz8nbv/q9DT/7bG32oHdot9qkc7fiXhqmaIU3qVTkpRA1cLzUvZrTU656UGXidGL4rD14uNp3z7WrHxPu34G8TGR7Tje8TGR7Xje8XGx7Tj14mNT2nH9wmFVm3a4f1Cw6drhw8IDT9VO3xQaPgM7fD1QsNnaoffKDR8jnb4TULD52qHbxAafr52+EYxuaHG3yw0/QLt8FuEhi/SDn+nGPbU+HcJTb9YO/xWoeFv0w7fJDT8Gu3wpzYLje+ixm8RGn8tNX6r0Pjl1PhtQuNXUOO3C43vpsbfJjR+JTV+h9D4VdT424XGr6bG7xQav4Ya/26h8ddT43cJjV9Ljd8tNP4GavyQ0PgeavweofG91Pi9QuPXUeOHhcb3U+NHhMYPUONHhcYPUuP3CY1fT43fLzT+Rmr8AaHxN1HjDwqN30CNPyQ0fiM1/rDQ+Jup8XcIjb+FGn+n0Ph3UePv4iwWXJUHauTdOjNxt1Mj79GZijvw4MLuwfX9PVs+eGFvf/eaVT3H8tEHP91182D38qXrB9cuXdU9eMXgmrVrBjeOzTDYvWHwubrclofndd/Q279xzooV/d0DA2SqG3rjBd80gG984Bs/+CYAvgmCb0LgmzD4JgK+iYJvYuCbOPgmAb5Jgm9S4Js0+CYDvsmCb2A5yINvGsE3TccEa2zD7IZ1a7tfFV67/U8VZHN/Mut0IZgPXDFj5mz8r3xMR0a0e1Ge6n4etYHkFVs1vG5s+3NNT1f/xrFBl687qAC+f4zVr1KkMhNpFS7pWfHqflJte3L1msmrUyjT09/s0lKjgUTtyNh2WH+36q2yngEma6Ana6hOBgMcW6LIhnhYOsRR6RC3S4e4VTbEfukoDkmHOCwb4ibZAPtkA7zZBrIonS1jC3HZEPfY4Kt3S4e40wZKvcPyOji2rra+i9k8Gd2gHVh9yAY6KD2aGEtlWt/e7rEBZ+Rb8MOT0vTstIX0aFZp3upKUu+KU5kHXG96Ja03GZ/prU6vf5CHO8iHz0Tm8x6u5vPW9q4aGTmgzcKUh1265QMXd3etm9Pf37WR5MVJwO+XsX/vqztAZSrGUqdbjrz6w1HWy5PYWRTtkFfzGHXqz/ucKl25oHuMxT2rFnetWtW94rLeVQMjI/sA/C8Gs1GufWhWBZZIKovSIFoMJJxFaZhwqSaZ8aiKGXO71g2sX9u9D0kZs0Wufh9DSmYA8lB/AE4r6mV9+e8LYJE4UGsS0ABxF2x54LLerhXsHFXDsfJxDb+rhC1P+vCrk77yn8vXHSB+cP+89WuZQ2m4DSTDVF+IYNBQxkD7Ezckn4zKfJ0V1A/UnL1cXLPmJrY8cOn6G9aNPvUcaLGPXjYmUYtXd/WQmryMpMyDx0BcspI0pqXgygrk/9EaHh9iePymGx4/bHh8kgyPn9YNn6mGx2+24bnQOoYHIy5tePzko1anfcYNjw+D69dteEgwfMPj02148DMj/6io5q9lK/3JFci/0yq9H1H6gOlKH4CV3i9J6QO0XPrlKL2PrfQBs5X+fOsoPUZcWukD5COinD6e0vvUSu/H4AZAPUUwCPCV3s9Rep/Oo2n/XlbNUn0daFqNaL2/FHhWAe3Wqn0AUfug6WofhNU+IEntg7RkBuSovZ+t9kGz1f4C66g9Rlxa7YPkI6Kefp7a+9VqH8DgBkFNRTAI8tU+wFF7v86DpVsV3UyCxtWI2gdKgY0K6IxW7YOI2odMV/sQrPZBSWofoiUzKEftA2y1D5mt9nOto/YYcWm1D5GPiHoGeGofUKt9EIMbAjUVwSAEqH0Akk+G8ug8wf57rUa6q3pd0dqpEP3DaoPANk+0SQiXAtMU4MerleB7U1RaMG8Mfteq7nJ15sB5GxdvuLhrYDUjyWs4Sr2gRrnVk0INI2YuYrqZi8BmLizJzEVoTQybuqiJTKLoBiMubeYi5KPWgoSNL2rCGNyI7kUNCYaLwYMX9K3vWjvAHB1kZhbqz6pZw+q2PLC4v+tYrxCWKkkpJfcZKOR2yrXHr1y7AL4pgm+awTct4JtW8E0b+KbdKSWfgFJyVUhTiV3OkZwW9f1IAf0mJy9q+7yohTZDnLyoAqysYPNk6+49CugFzkam7Tcy3+xsZI7XRqbAoa0JVRaPecoCH9oi09F0HaHKZppndKbY0OgI0rE87lYBBxpACjwD/EJZwxAPS4c4Kh3idukQt8qG2C8dxSHpEIdlQ9wkG2Cf9G++QzrEO63/0XttoIHyxXubdIg7bfDVOyajOG62vm00wQ3utAEdd1lfHOXr4J5JGUONGFy/60bDAyz6azyi4+8EV+NAZk/8iE6nyBGdeifD42R4nAyP0VJ1DySfWNUq8u/fGr7/BFb5hrc/T+oogfmizpo4AgZpFBlVcb5TFeBfUevPx1X6c+yM33kbF3etMlLzciXw96vGoebFMYm2M4lXOSZxgpLezu6ubGUJTKL4wZzdXVFl0bu76xHe3YUxoArEVBpL+11Pqf6HNWsYViAWcNyg4wYdN2h0ZWDoECt+SdEfGIsKoZ7HFyqB+kuSD8TV/1kB/UfGFXd6lj515L1fDNrg/4Ka4vtTqwp6Y9faNSu6Brvn9Kx4JaF0QU/f+u713Svm9w52D4z98YIbu3sGB0ZGDgmr12XA3+eBkNyIiQBV8pAZJYxKQ2m2HMTuX7T+Wu1CUFFXYFD8kYrwvOrMSBFagItQvFT/9/Iti6XwIa3rSSCuJ2m660nCrichyfUkaeuYkON64mzXk5xErgcjLu16kuSj1qonCMLyXE9c7XoSGNwkyTDU9ZBgANcTh+QTIlACSP3ESJi0ziZKroiis3diaMR4tEocYxFpDAkoGluQQmxBWkwdrxC3BWnYFqQk2YI0La4pObYgybYF6cUitmCxgC0g5BB64zXRHtAimyy5zqxEKq6cyBleQTcTl+pmgua5GeIM75EaJToGTZtiSTTx3Ro2pFWWssysDno7MF1BfZWAKqW5u4EZwBqmVfpIiVam5GrTfklEnkDNkSpQEfMEKiJPoM41U6BOsYFATQezqyvBtiPUm1B1FQcd5l2lfROlNo7cTdDnFRB/RYdXBfIRjAeKVDqsUMWVJlWx5PqNwthztB9TRLSw1XSz3gprYVGSFrbSHCgiWtgmyay30dO2kd+tYUM7+a7CrItoLWznamE7PXE7Vws7AC1sJ7GnRauj5LpAgO6EGWqgZL9VRQFNuNwOCSX1S4LI7cASoBXitpYpBdA4NINvWgjtLrNxISgjANWVeXsZNG8rub6ugL4CAt2ppCgUUMT3A4OmsFIUxDAEqykl1xIiRaFfJjq5iRMcq04Vgiy8rlHwugemFoVXS830alF9JAuzLj5mLYCIdJKLBBp4S8m1QgF+r5CK8kxFCz2olcRLq9ct5CNkfozIRateuehgEKi15LqeoL5GidvkOcU5Up1im3lOsQ1xip2SQtNOFp9hpziF5RRvpJ3iFK5TnEJPPIUr6VMB3ZuCK/bUkmtQgO4dFTyWgFRDBb0DN4CdJdc7dRhA4FNbcTMzBnwT38xMMWJmOlkcI8VBY2Y6VTZI4/GnQKKMxQZTgPChE4xFdIcP7dQKwgXWkLfygoQlbPN2RAG9G14paoKEJeRXQisajtlFsCqUXMP8IAFfMhlyBikV2VjU2s/XkRRLdwm4hjDrUH0kC7PDfMwKgIikcO0dY8ddfO1tNMKOgl52NLLxei/sm5OVyVcjmYyi9l2GjN0177JkhKJ5lyMdpOZdnlToSiYAXBBOA/UY9SbTSq4PaiduRZCaQiKleTeVlLuKdfiyKMIduFSNIfwIX6qOM+ITptGDjlN9ksYnTCMfISePeGRQvI/Tq9NTGQQ6ruR6jK/Tx4ErcsTAjoF+XAF9X5n95d+7SaHRXLXsEY1pK3McoUWzDNIrwPlWLuePRznfToeEx+tg/RQkUwKyfhrK+nZSEZm68SWC9XwVpDEsVDGkwg3ik6kFDUFsOPU0RftOJcrcUKWTb+KAEPVpBOEignAzgnCLgvDPRBFu4Ya9/zEhYW8LHvbqX1231Jh1aVFZS1Zu41m+iZsCUL+Zk2h6XoeJK9Zo4uKwiWvjmrgp6OpavyOaQtKEMnFTdbCekQxu5rIeX282q6wlSzd+yjBxPxMQeF0mrpPeyICDomYkKGphBUUL6dgSzgilTN8mScEZobSkjFAK3byjvrkgaZukwGI/8d0wk1MKs/5C60aRmxEqottCwKBmwGIVVcJL6URzyfUyvbCQJlBzpApUzjyByskTqHNNFCi3z/oC5faC6+KV9NoXykNlwT3uPDimkYyNuKve1IMsH9KIx1epkjup+JDHwW3+1Uj3pyRdvkTYNaoIgKAVVQZAUIuqYCFEmyoSIGhZLRNg1Ye7m2sugMHOqiRBSand9Likmp6keaYnKadIELiEJTWJCoYx4tIVLSmVfYULe0UvYUlicFMkw9B0PwkGSPf7IfkEy774BcN+ZvWle7pi9D4N15RRRw/83IA+pe/ogZ9timfwU/ZsKx9TSQgL9PmKZTxdQNxi3A9OoyuYGCkpNF7pkns2uYLRyEOaFhlQaFNg5XYaLqJjMJhAHSqj0/vFfmYxnfuNfCb7aczSXE5k9Ilemo3VeSRWpNl+rGq2l/eu21i22yMjBw2UX6cMFGb7Ybt7UG6n9IqCnI8aJuNHCPxqwn6iStgV3Wu7B7sV0u6XWtk+tuFmuOXEJD/wRB35IFCj1i0qVwgqtpHzVQNKuGSkZclV0KFfowEN1MHJkSRzjs75J+jonIX6MZhzdE40EtZ7dM5f89E5PySfNRyd8zOPzrmXEUfnEEIcc2plgj91d/VF3EQ9jzpHZF+ZMCKi5xEjx+L8gKbfYKKmU9LRKMagAlgDVofsScSRPYkEW97qtPJWR+JcUZ7PqffHiN/U0UkhAjM4xGhBim5akaKbNqToph0puulAim462avoDTQX4/KyaRSv4ohtSZgeQyRg2xKXZFsStG2Jg9FokkSNikaTpGyw2uV5IsqCZwvW9yQuEMsSDagohOLkz8xr1mVgh2bCm3XB+fMATUfloCx4s0IQP10LAoRbIRuGeFg6xFHpELdLh7hVNsR+6SgOSYc4LBviJtkA+6QBVB590sm4RzrEfTYQnm3W5bV5H73H+h+91QbyvVs6xL3SIe6ygdeS71l32kB6hqyvhLtsQMYd0iGOWJ8xt9mAMcPWJ6N8c7vZ+mS0hbndbH1bNikDPTusguUz5oANNEY+Y263PmNGbWB4dlifjHdIhyhyTyN5eYBuNIjstMzrqQLnil1PFTRwPdW5YtdTlXPl3s9RufIsSQ6AdFmadFmEg3HyZ1AheX3NW2hvEM+VN8K58qykXHkjSiv4mFIjTUdlS/BWoTMMMGMKfAtlGOJh6RBHpUPcLh3iVtkQ+6WjOCQd4rBsiJtkA+yTDfAm6UTcIx3ibukQ90qHuMsGOi3f7uy0gfQMWV4HTRAe+WTcYX0y3mYDMu6zgRvc5rDaktFEnw384Gbrk9EWfnCz9Z1Mnw1M2R4bCM926zPmgA00Rj5jbrc+Y0ZtYHhsEDneIR3incbSaPrRMCnF23iOWIq3YCDFe45YipdZJb3f5BJ3KEHPu/8wxEb3UOVAQjQrkPsPVomP322reRknQQDTxVGRwoor4xN0RiSInBEJgV0YF7CT6bpOj0Qb9Z8eiZM4Y+1VtcwiWq/kIGaFaGaFEGblEMJgrU9CYmwMiO9ThMxvfcKgFdH6BG7lE6Lp2FgZt0rAmjcijHEAOgBfkTWmG5lf/UEeRKXcZ+TYSUPaFqxkeJ/GkucLikG7EjwXuqyyler5kk6sCRgE3jQCoZJPubvA86QAjfOkBYUiI7TrR17FFEabbc/XhXuL08xqhEYWWcwqYMwqljzfhJkFX9WlPgJdpvW3ILyg/jwhkuCsk4U+nwL8O5gji0hyZBHyZ8h8CUnzJVTuoEYPZSzKiSJRThMd5RytRoFw/2ADJ2iV7nPRq/XHQCEkBoqTXwRwK8psohSvSj0tk9FSwwmKTP4UvTiX3QADq9vIizHcLR4P5c2v28gbrNvIs5a3BGFlrZiVx4xIqJoRo84bxVmTMT9UzYiEqnkSNYqOSrfKWwXkII8wJs/PCBmGeFg6xFHpELdLh7hVNsR+6SgOSYc4LBviJtkA+2QD3CCdiDulQxyxvnTDezeGIe63gZUYtgGO2yyvg3BG3yjEAeko3ml9Kg7ZQKnt4PpHrM/q22zA6mHrk3GvDcLvYRvo4E4b0HGXY8AniQGXz5gDNtAY+Yy53fqMGbWB4dkxCePvwfGLv/G0nKE0q8wSncwbgN93sX+fd4mX6LxBpETHhaXdG/EOwgxaIx2EM+QjADGLQOzCTolmBVirQFxKQcyTj/o3OxWI3RTERvJRf9pdgXgdBbFAPkKblwjE6ymIRfIRgNiMQFxLQWwmHwGILQjE+RTEFvKRuqyoPGyZcqQYdFbQfeTEhUdx5k3W3icU4Lvo7pJlBGqvyzHQRBWpywmaV5cTBAykYIPmANvuhSZRI/aQUPFgiHzU2m6yzSmvEXtA3Yg9iMENkQxDG7GTYIBG7AFIPiECBfmN2AMMnQ2WvHfxryQK0vfCBKrUh1im716YALOixvte/m01Id6VREE26H9VjNT7BcSNfyVRWO8FPawa2nDJewS5kihMiwwotK8gr0SBd5NAIMxZ/CUwB4ZF9H4wi8eRkveDfB4HaMzCXEZE9ElemI3Vh8fjRqKQgXuHAuN9I9ExTYEviAjyjScgh6ZeSBQw5UKiABK9BE2PXoJw9BKQFL0wmuwEqtELXAcVpFegIRWn2dP50enMuZDozRNzIVG1g4+Gim7SVpZ/Vf8SFcwQNXBg/XwrTc5WJEeQI3+GzJeQNF9C53xBSfMFdc4XkTRfhPyZ8KKqDHcJe0n174o7uhfGdixKBaAuhQa1o5WjwKA2elA7Rus28lE/Iq1cF99pBPsOelAn+SFa7DvIRwPYd0nFvlUQ+1byUWN6OhF3NsV0dzYFdmedktzZFBaxpCzG29leZIrZi/HLrLMYx4hLL8ankI/aeJKUYF482a5ejHdicKeQDEMX4yQYYDHeDsknjOsUVex7DwlAS59OHf62ExVnzN+O/3wCpmaqmLYnxU3NVPNNzVSUVhpqTCNRo+g4jTQDwHTT6OmmIawhQKbkgwzIB5mWD7JNPsiMfJBZ+SDz8kE2ygdZkA+yKB9ks3yQLfJBJuWD7JAPslU+yLBQ2GxWpoGIP5hRYmtCbq4hoS9ga2Ut23hLrDY0u6ta9tEL17ZSQxFJZxPrwlZ2wq0VCRvaTV+htMNhQ6uksKEdTTFoqNFBokapQYcOV9eGTmdOwu0ythK0mZxw068E0aoSUNvlBJmqG+aUKLrIohKuMBxHpwBhKfeICdpycSn3wFLuliTlHproblDKvSRqlJR7K+NuhCbz0pN5Ee/h5VaHGQUIV0kbhrhZOsRh6RBHpUPcaQM67rK+OA5Jh7jHBsKzXRpEwtzLRnLE+tKz1QbSs9sGJnyXhSXcTiZ8j/XtY58NhEc+GXdYn4zbbCDf25yAwpKmTD4Zh23gEaQHKPAVARYyjjYQnp2T0Q1utoEpO+TY79f6gtBGq7ctNiCjDUyZHYLb22yg1ftswGrrB+D91hdG+eb7dhvYHRs4hBEbMMYOdmfXJLQ7Jhhb+dHEfhvgOGx9VsvXavmLt702gLh9/JTQRfRjL/94ZeVhNaNKx3Ws4XmthQcr6G388pSMooYGUdjCRQ0NWnQaSMzAggcSsVmnw4jNXHPlWZ989vNgh98GmqkNVaYCg3xolQRFRL8YEa9VNzgnjp351G88NBXLb7zk5OWyrtg9NGY+UcxEqEjMQimHQuNVxhhTuSqJEBVCHwCQSRok0RwlBA3TfaVDknmlgy8kfKUDgVP5i3vYoKP8w2aMtilxroAzurcUSawM9W8BvlFpZTSfef+EL018I6QYCUW0FdUQvDmoMscRrTkqVnUK+LBmFrF4FGZ0imkmaUJpTIsOEjMEXJGgBcih4CRyfUeRf30HfA8LwtlQydfBl15GY6Icl7aMbhCNJFZo+xFIxJLmiVgjV8QKrC/ikYGh+QWVymhFrKjDGDJomwBFLEETlqAn8SnVq36cLkROFyKnC9ExlCeyC5GbhMnqQuQ7VzFnd2JouHm0eqWPhbJSupsEAl02xTAFYTFtjIqbgjBsCkKSTEEY8d6mmIJwRMQURIycqwkCxuAGE43BxNyTFUBvA2XKW51W3lj3XYU/p/++qyCJmeZdmMRM807VDwM+WdGmfUe0jGpH7tfqQOKCTrZ5WUJzUbBzTh1ynW7AxHZBXnHbYtt2QT4Bx4tdcxcixU0WSF6CwSjAp+4yMUj12iVIDXCXH2E0sj163tqu5def17thy6MLege616zo7Zm5oLv/hvWDY7/s7dlHUt5DmjEwu1PDfdXmRRquSRZpBIFIw+xFx5XWWXSE0SSMVg7D5COyOAjyA2nVoiOEwQ2D6wQEgzCw6AhC8gnj+gqJqv/1kxAEdDFi+nWYEfN1MYLqIhyMRWgXFSX1BJguSk8XRbxelDST+g2vDmtS64n9MNvSBFxyDyu79Ck97nwgt4puLARVzpaVPx1CTuwz8hUCMe+EptYC4xK1wMujEK0GKoNpKMQ258T+lWwlCE7Mif0Asi0KKkEQVQJ+IuouQgnghp0BpWHnF+FNXap1MR97v77WxW4G7v6S731E62Knga0eddETg/ohpTA5Br3QOjEoRlw6Bg2Sj0gy18+LQf3qGDSAwQ2SDENj0AAdBSNtrgO6Et8BIPHtI2HSOhso+T6CJL4JNHz6um0r//WQUMzLLyyeZJtggC0ILRKxBYuMxKcBwBq8czwz34nxyHz7kcx3UDzznVAKlh7Sn/kOkJjB6cwWJOxrRbLibchCrB3JincgWfFOtn35t5rrx7DMt58y/qrFNxTl0Prp15fO9df8NcZksomWSaXAkupcRiCueddGSormXTspKXD/ryjdYJWQFM07og2uS1xzlFK/+C5Ec6zGkAsRhrgQhvhqIFD74/pNi6r+srKKmCd1FREwvooYsxg/hVcRQatmsoPmZbLNLZ8xPZN9gaUz2UGDmWw55TNoJlt/+UzY7PIZHwmTmbV4WV/5jI+f9Ycy6QE6nIFtQVRMHS8QtwVR2BZEJNkCRmo7IscWALnm6PkituB8mfUzG8dzFZEajwAhjKwiIuKuPqW4+t/IqZ+JIquIGLKKiCOriASyikiS0STLhvjjNft0bKUQppdK0nbiXFJ34sLm7cSFTd0Vj5gdS8y1TiyBEZeOJSLkI7Z7LbgrHsbgRkD3j2AQ4e+Kh3XFEmF+LBFk3kPpbyNiCb2BQggJFCQqenqSKTqwaIikRBQ9JTNQWDeegUJ+ogttw+KBQr6iPR3v1h8oRJBAIYUECmkkUMgggUIWCRRyeKAQKfnPNLmYFt8OnnU6iWt5/EWgGaRSIerxR7GF1ZgxfD3/sCVpaUngxLqrkQ38jZX8j7/fiY5MN5pOdFRjdCSaadEbHQVqjo4CJkRHgEGYz78uPWzkuvSI8evSx0zyQv5V2hHmdek+lYSwQHcrRuoKAXHzcT84gxbq+EhJofHKlPxLkGq1DC0yoNBGwEgWvOQrg96XDp5iyOr9YhaTsyX/UkP3pWe4nMjqE70MG6vl43FfekR/oEpQcZzvSz+mKohhEsy9qpZUJl6YHjTlwvRJvlMEx/dhen87oj/4FdyYqq0adC5QEj0+F6aPxcS0vYmW/DcqPxjUtbV6DhvMxprjamwRE6HTvbA+ZEzXhwysD1FJ+pBBDwLUEs9H2GKYmUT1lxhx6Xg+Qz5qPVJUKDRSxfNRDG4G0iMMgwwQz0cg+YRxzYD1j1ER3ySoDoul7lzK8k1R1FlQ35wVm3YRGEfS02YRNuTIdxWbvo92j0qSBzx6mzPS1ScPLAFzJPa068iX/COUxhEinZJ0Uiqlos44zwcdHlgGpqmWKRx8D4gQQHAFei/TUwfiCuj3UYaCkK80bkLTwOzhaiEtPXu65H9AR7uwYI29nBbDvZzSFZBeAeFP84WfpTFYjJonaa7/lEDY2OKTGE9aMNby88NiCVqmTXwnO9XzUR2sT5vH+iiX9WE85tJtpVVUplhP6FgMApoycl4xrPe8YorNn8+SGSD4DEpcQF6DiIWMkz8b7/lgi1wxjl8RrSpTYCxh14P8RQH9NSyvkeAcHQJmT2HKNzb7UzqUL2qe8gWNKF+Qq3wxVPlStBDESJrrzw2kalS+lEpMWMr3jHG7G+DY3Wcn1uWGuayP4ntXulmvOg2PsT5p7GAehD7K+gDucsdSJ//LZ33gQbZJRxgfKPmVyvPOnICs69g2rLU5QAbIhC2SmwlbZPhcdITLdPxcdATX9zF7/GvTmgNMaDo4YF46OFB7OthSzQEunJjmAPpyvPrZwu9WHUSddAA/7yzoC1O4LwzUTWwYxPeFMSO+ME0PiqFhUNqYTvDDoJjeMIjlC2OlgI5m7DHUR1OGkqAIXDIeRqrEgvwlQRYhlUsg6sliahElHyFEjGRlsqVAdmJDxKyRrEzW1KxM1EiwCqpFTm9WJsrgT64UaOerRc6gWuSQUxZZ2n4RmFYzlOYdZTIQnbwmjzJNomK7KBqOo1YR2ffilouE1ZtzEQxuFIq20Z03YHMuDMknWB7G7wrOrj0LzEKONRJouPkbmVBpTVhkoz5m+mmFmPkb9THTNuoBWxAz/7RCxAqnFdITfawxKn5aIS37tEKMxAw+utiKHF1sQ44utiNxL/u0QmD++B5rdGIJ28US5zuxhPViCRDXqNqXqwrFBXQxZrouxszXxRiqi7D5jaG7jUlj05mVfI8CYcXENCWNGFlOR/UupyPsEpg1SPKdcTzGcUmIGsRI1LBNt7BAUtk8NVB8FNA+aEKUIGykM29Eb2deYDF4k67OvGFlU2CqwCEZg32FlUEkIMbuWeBdcE8t53YI290OYe2eWpP0dgioFyxYhELAZLXDD+xBkk8i/cdCYE+toImnvg301HpN9sQxv6dWaNL01ArKbZVhqKcWlnyyWE+tsZjlSM3d9rHkk5n2w+mp9eqEkyiWcHpqGewawYklwqXAY4a6RgSNranoVUmQbZ0+abRrRIC7WHuqsgwLfEZA3CTWrgKZlCeQTIrY0UgoqEMKMRgMJlA3VKHEEb1YKfAkn8lBGrOoscopWvSibKy+PrFdI0JG2iGY0zUi8JSe3sKGVhcmdo0ImdI1YpLnQsajTNi8q/SUgMZiZcLVu7rAjQ3/uHfZD/y3sS77E3qTnvXv5wF6v4Um0RZySKjLfoh8NKfLfgjL8+nvsh8yu8u+qtk9M4v/a31d9v38FQ+0he3cHb1G2u7AuN+4AceQ42ANmE7mzzU7ECz9FHKE1b7Caj3HZc5Wlqjj0ruVFah5KysAyafoVhbHcYVKwQA//RQy0rQ0bLxpabgUjPAzE2Fm+kl1xxwTdFsl5g/GBcTNX2MNg5+UFFZaLJhG0k9iBXtwERyYbsOalvqNJdw4ohctBZsMNS3ln2eO6hM9dhow2DIe6aewHZqWHlMVxDDVEsq+ppqWToKF9/0Gr7C3VNPS8yemaSmcfvIr6ac6iE7jf1V8cKZzVTwz1HGuiq8xineuil9l0lXxwfOcq+LH2SM6V8UbLkhzropfY7Or4oNvM/mqeOem8JpvCn/q1wLLe34MGTUeQ44toq+DY8gY4jfipseQcdhvxCT5jTirg5EUvwEcd4ubHUNebJ0YEiMuHUPGyUdtXESe9uLFRVF1DBnD4MZJhqExJAkGiCGjkHyCtVdADKk6uMuquwrejMSQIvVvMf3t9uOILRCMEq4QtwUJ2BbEJdmCBN5kTr4tSCwWsQWLjcSQMfCNd1w3McfczP1KqnK7VrT88k62JqSebPVLEq0osknhqtm1xgUMcBzR8AT5rsKsYTpnmKigvkpAlRKEKrEHJQFrmFDpIyVayVJwj8gOtqBAzZEqUCHzBCokT6DONVOg7rGBQN2l/RLlHsSV+i/VCFa/invdRihG0w4W4bTpNjENi3BCkginUZbWersWaBMZdzBlyO+Gr1hOKyL8COt2BZ4IM6/V4YlwDhDhLIk9q3Vj8EMCdCd0uIGKy9MqCiAXt+DxM0HkLBA/pyFug83dltFH+aA3KUrngp8EZQSgujLvQuZdpuE+BfRn4N6glfW9Aor4fmBQI7p5n8awaiwFn+Bv3TNkIs/NOuBY5VUIsvD6Mr+5aJ7V4LZWeqVUH8nC7Gt8zFKAiOTJCJsGnioFv0H0vBVRUZ6pSLEuECLw0up1inzU39yVLxdpvXKRY17VFPw23CAkI88pzpHqFDPmOcUM4hTzkuK6PIvPsFNsZDnF52mn2Mh1io30xI1cSS8AuteIK3ahFPy+AN2Vq+eWgFRDBT2HG8B8KfiiDgMIfGoaNzNjwH/MNzONRsxMnsUxUhw0ZiavskEaj98IiTIWGzQC4UMejEV0hw9ZOkj4DSgyvCBhCdO8hS9TQL/EP2KqgCK+ElqbccwuglW8FPwTP0iIIx1nDTqDqEryWM7gL3wdiaLt1uPGMFPdasnE7B98zOKgiKDaGy+F6vnaOxHsCHl1sINZ6xvHPzlaCil7a+HHwdX3ajpzqDwmkB3dJL02J4IfeLc3g+z2Zom1O/1BvlIoWXPuCduHBc+n+4Cj/oplYyL7mPI1GZ3SrMAj52DJcr7C2GhWQJb9OneKBNImSdN3LJPmp02SaNoEbqucRO+KjYvs9gjS8TipdIybR8e4YTqWx90qsDYjLmqBAT61WTrEw9IhjkqHuF06xK2yIfZLR3FIOsRh2RA3yQbYJxvgzdYn4lN7rC/dJmjgiA0g7rSBUu+wvA4+tcsGKmMDMh6wgXzL9/23W58xozYI82wg33fIhjggHcU7ja0e9KNBFjGQBWYPVwvM1vauYhygKw+7lF1ZlpwGVoEyf5+qP8CoRJtNVaKRL6exK8Ggc3bIIt4vVG4C881P/my85xO4f6zG8i4d6+e4+fePYelHV80VojGhQiCYDUmVSJQzXDtoVia5O1UMjU/yNR5IACdVFoCxSxzaDuZAla2J0C7RvLMCo5edqXtAAb1H4Iwrv7+E33h/CX8pNMrfmvAzU5O95JdDx/jK2dJjdbeEYpchrGSesAkdqlmnscxu3HInbFYiJ2yi6Akbzbv26iPV9Lqj+kh1JOqsPlI3tU2pPrpqONET34Wc6CmrRTgnYA19XLVIAGqq+BxWQU+iFDrK3xxKogXH+m1rEnOpCfLRrFvN4/D1zYr99QpEXHyjnUaLjnzoreYJ2mxjMQKBVdWoQ4a/vma7YGBHww9HEj5JkYQf0R0XsqnnpzkRQOwLdshAsCXBieJ0DJh/yCCA6jy8ARqg6Rjk7mgE0QPXMEB4qWsY4mHpEEelQ9wuHeJW2RD7paM4JB3isGyIm2QD7JMN8BbpRHy3dIg7pUPcawOIO22gMDssL98mmMbdNhAe+S7mkPVZvUs6xD2TUWNus75fNYExu63PGPlKfdD6H32HbIgD0lG809iSST8avhq3cS4Buh2eILaNEzSwjXOC4DaOkgkzb3ltIE0x4cvrWtpD+KBel5OnVUxAqAA4QD7W0kLPp24V48fgBkiGoWdVSDDAWRUfJJ86dziUv0dURoixfRI+jt80nHFvDj97rfPeHB9zCyV8ko5+0sxC9ohKQlig36gYqZMFxI3fqjqInp2IkJLCunYkPBNpGi52RcscoGcPcoEUg8EE6sCwkN4v9jH71Ydn85nsM3JdYsj4dYljWJ0zHk3DAwZa8vjGu2n4MVVBDBO/WSskiD4zm4b7TWkaPsnjF8HtAZLTkGIbCZdqaxp+MTuQ8k1Y0/BIpd/jcxCZivwjgqyzzMVSeKF2XlX7DPjEdpYuDlAec4pluF4UYeLApJeN8BX8betmI2V1RXpQs+qTNNFjkXwEYBaQ8+CgW2rWe6K0wCBQcyn8dv7hymawH0wZuSVs0EsV0PeBO/WZGnfq58A79WnuTn0zq3sFj/MtKOeztOFq0cF6xqn4LJf1RZT1WVIRmbpxHRkbclUQPfkLFxkU6XYaBLHhxkeN2ncqUeYelM/zTRy7QUL4JgThBIJwEkE4pdB3RBThFG7ixhC+eUKaLqTwpgsAzBxSFG2w509KZS0ZnXXCW/gmrhGsmSwjx25zFN6uw8QlajRxCdjEZbgmjsH5DJfzBZTzjMOoBR2szyJlUSDr8W4nSZW1ZOnGMMPEjQgIvC4Tl0daEGaQ4uAscuI3RzQM00bpSiRfFaNZp8NiVPhM99Nveu7nz9HVnxU5eHBh9+D6/p5aJ3r3TE9i75J5F5s+0dO+X/zhG0+uGjF9oh/5F1zgemyo1fSJPnbG686OXDVtM3+istUt/7mham+Yyz9VXwbtGFdVZyo/L4U/rrZj3iometeXipVjDghoB7irA1QzB6s/UP09VEWtotEf1VDFX4VRMVXawX42dkEtdkHIWFYAageEOAPCzKpxZZoAxZNwKfwIJF5e0WV6hWKfALjsliTPf/QOP3PBd3c/Y7ri3PGH+Wdsy3f+hj8R7R9cpfBzCkWe2CJwlZVLjO4B8dyMy/yrrFy0uwuAuRk3iRrl/xUdBk+yuOnJ3Mg2qgNwkgHUiJun8oY6BeIFxzSAb3zgGz/4RrHIyyomIgp2P4ogn01vJEbIRwBiFIHYRUGMko8AxBgCcSkFMUY+6j9+okDsxvsn6T8LokC8AT8Jov9IigLxOgpiknxEmgEm8K1YslsssBWbIH+tZys2xeuDBZIgzRy5QMfIDHNkl46RWebIpTpG5pgju3WMzDNHXqdjZCNz5PU6RjYxR64lR0KH4hhRRdH0qKIIRxUFSVEFI09YAKOKZhI1yj00c/1NMysXC/sbB+AkA8g65RyJaKXQRYoqdKnHMvA+he5KgBCZSkOGtT1luranYG13SdJ2xllHF6jtBRI1LIeYFEhMFhBJKHBFywH4mgIIKe8CUHmvI5SX1Xw2ciKSwMVaNoYQ6Q8rk87VGbXRiN/ARnc6fzOoiC7SIHzoQUXVB2EXeOjnc7jKMUObnmGVWDA2PSOn8zeDwgDtFXGazwAdLkXO1LEZ5KpxMyhQy8n0MLIFI1LpECZpQuljUQfrGX4jxGW9C2V9iFRDVrIvch69GTSmgKxLVSIXIzFCkjYzxMyUoSEEsjJpl6jWFzha/2a+1mckaX1G9UEGtD6MWHeQ9RmU9SrTyuTnQr7WZ8ANeETrx0BfoUPrk+ZpvYur9Rk0RtNvmzN6wzeQ9SEju/9Jvbv/Iea1apFlDK3vYvw0W4qslOXr0yxfv0lU8lBfPyZ5a/hanzWi9RlWMRLi6zPko35Lwvf1Wb2+Ps3m5zrzfP3Aa9LXZ0V9fVYH6yfE19/K0PpNzEvrIttN8PXKDUWR94hqfZqj9bdPiNanDWl9GCmwNKj1adzXj2n9Xr7Wp434+rE4a9Tqvj5txNdnWVzCfL0erZ8QX38PQ+vfw6wMi9xnqq//tGxff8Tx9biv/5B5vv7Djq+3tK//FEPrP82s1408Yaqv/55sX/8lx9fjvv7r5vn6kuPrLe3rv8vQ+u8xftpUivy3qb7+/2T7+hde677eXYuvd5ciP+VrvduIrx8D/Qur+3q3EV8fZokL5uvDVvX1f2Jo/f/BFa6aK03nV98ljAlngiM/f+V3H3Ajdlus+8BRRhTjZvYfiPyTrzIu1DW4jWGWVn0kA7OoW4cyP8j+aMSMukvRBvhuT6W8dDVdXqo8RugCU+UxirRcjtFFpspjfIvR+0KrRahwBOuhv5NAHv4aP4JxEKkE9yLU8yEUCkgq/o985fHLX3h53TTdp2ZYyIBG04e23KJMpov8mX6Qiij2QIP8qIKpGmCwevFE2/gKZvwqA5/wVQa+UnRKBaPOJrCIm1ExJdj7OyZeMeWDK6YaJFVMMUSAOJBVa7N1sPzbz+qMASurqu9UxfScwup9zivmCaCnTIBBQSB6UzViZ/U7ik4HzwssU77jNJA3wLTeqo4y5fk8BfQsfijCMqQeaJhXr+6z3L63FD1bRzjC1P0eHQbSw9J9N6b7nlL0TbSMC55iq0OuMfGi55Zgz9lQcRT6tdarg3246fZyTfeFwqabdlW9bNCX8BeZASMJBj9L30ljovHEfjoMoVdcDTWuuGLwisvHXXEF0DgAsmAoGbxoeyO/AG29YImjF4nvGljm/bRaw7GDX55+8W/e8qsWHeGY5jgMgY+L3d/IJS8u8EiNC1zmxQVwJbXKdWNXxDUIxQNwcOsnLap0kB7aasPcFlT9a8W57YG57ZbEbQ+av4O11UPTUYkewWtTGvCQEwQIX5tiGOJh6RBHpUPcLh3iVtkQ+6WjOCQd4rBsiJtkA+yTDfBGG0i3HfRlt3SIe21Ax502UOodltdBEz56jw1w3Gp9tZbP6m020MERG7BavoDvt4GXkR6gwLchWUdlbGDL5H/0HbIhDkhH8U7rU3GvDYTRDtHtkA2+Wr4flJ9L2OXEopNFZUYcx2rJj7ZDKGoHcztsA3O71fp0tEHkODgZI8fbbGAmhq1PxhEbWDIbMMYE27jD+jGUHcRxlw3EcTI6rfXj57TwjXH9aJCFSkYux72UfauXpwv4/VL27xvc4pfjdolcjuumCqqIqjYvXI2IEYzim5f8mUBhjmC1xAnipRpu8wtz3CKFOaqKTIqOSq33uwTE34MwRnn31O3SIe6UDnFENsQ+6ShulQ5xj3SIQ9IhjkqHOCwd4mYb8HrU+gK+zQYCvn0yWp4hGzDGBvK9z/qyI1++5ZNxrw08gvwAZb8NvNboZBTHSWkcx9MPuomjXOUfr6w8rGYer47dU3Np/ongWT3GWrJBFLbwWhI7Ie3VdzAUOx3jCb/4jkd+cscBY7kUYBB+aqTW06THgweyfOo3jHPm5TeqU0jlQ1gs0fGJYiZCRWIWOCe1yhhjKmedCFEh9IEphD6tELqr1FIRz1/9gervgSrdy4e3Yg9AF0P6lU/WDm5gY+fXYueHpLACUDsgwBkQZJ44VabxUVcgBkux92HX+MX+TaHDB0RsimCKKC5uU5Br/LyS8lOMXJ4XMQHu2g7RV+GwErXEd8O91FwKsx6l1THEVUdGs6kQ107Crf8I7FnN/2IfBa+Mq12g5kgVKL95AuWXJ1DnmilQX7CBQH1e/12HihFfpv9GwwA4JlgdU6ZXfDb0edj9gwvx+we1Z3vj5Ev03jzi0sE4cG9elPy1Chh09QtDS2Omm/0YrKUhSVoaQ6WW+ua4JLPPuPQxTn43fBN6TNHS79FamuBqKeNuyARXS5OAliZI7FndBWPPgPtc8EVg1JtI9U3l2/8H5CeAqjIvq49DrBRXbh+L/RCkgrYNWi+pUMCgFNq6IophlSrFfszvO8IwMUojuwXGsEqqEGTh9XN+Qw3GlaGRmukVUX0kC7Nf8zGLACKikO2dDNCRUux3/FYfmL0HtYtx7W2UxMrIxbcJI1IR1SsVCQaBoqXYywTtNSocQ/xI1PRoLwr7kZgkP8LgfAzxI0lJ0V6SxWfiu+GmrFElemHssKe4foTRtTLFlXS4hzCq1ulSXITuij9bAlKN05sSNX/JUjygw/wBnxrFjMwY6DDfyKSMGJkki1+kMIjc4ZyCBBkLNFNALJoEA1vdoUOcChDiYLvVKC9AWMI0bvFzFdB5eMWnCRCWkF9p0OjiWBUNBQj8PqlJvX1SAQ1pM9QnNaEjQNCtuy42ZlP4mHFF5J1sZhxnUoAQRAMEF6W7QfLRQDmWwQCB0z13jEAn65AKZo9aN0Z5Vyk+o8YetSFkzyKMdGCNIB2lYkgzyDiROngN9aEFeJoB9Ql1+5lS/ELtrFGEvimSvnDH+YRC+6WiCCcwMRxDV0czQBM6zidkdZxPcA1AVq/xZd8uE1/ANwBZgPZxzBOOgV6ko+N8rMb+h3Pg/ofR6t6Tfs5HuZzPoZyP05F7TgfrU6zkE4/1+NWhcVINmbrxDrrjPKKAqHeCLWaGXncSxKaiRgJnOOGW5seUSb6BA+Kk6xGEQwjCYQThiILwdlGEI5zVSc+ErE4i+OpEfwokUmNiLKKylYz0U3w938CleNeZsHOB8Q06DFyoRgMXhw1cjGvgUmgKRL8bSpE0oQxcWgfrGdn1cI1LnrDKVrJ0YxvDwG0XEHhdBg67XCtGZ9ThgCjCCIjgrHqUWWqwjIwUmQH/exVK7AHT/bX3JjXQoR7pTRo2rzdpGMkICtYxgOtjL6uOgfhuOKBWqmDid9BqF+VmBKNG4psYmCZDRWtsw+YQuC+7EtzEXMXfWYr/K+VsYiSJ9G8jxtBSwqN0TEr8SdBoQ+mwOuTCLg+yfPLSyyfAelYm0qpaHfk1ZbsYbVT7LeI3dYjpSiKmK8U2Ow8rU2YFqhU81Y/UikAIicqC1QRDVYYQnt53xWwuS0+reec5zLzXIf4VBcfHRCq8gmKTR8QNctD8Cq+gWIVXSJTgInUxxHfDkh9UmPUEbULCXIMcRh2Q4Oao6k5T1vZo/HP6C3KilNlNb9jy8KsIvbJJcPm6A2SsNG/9WkAXwUEp9aAkK0auvn11a4LL4wQ8X/pY7p9pTJP0fCkx0aJWtRnQwOdIm615l6+MulrciKeUq4aa9RvxJIkXwikV5ZQdjzXwkAzI3BQiRuXMMoOMq3TLkeIIr2UvAn6gqOwzNW/6GmN7Spy5SYW5F+pnboKcHQ7FKuT42QSRI20lcqwmyAFKXFYtcQnykaJhTiis6KMB5HWaPhcznkgMKV/0a/iLgpTmpbnOq5F1KRIhV6xrqeMvVTg39RmQB4zoplFMEN8oHt00wtFNUFJ000h7+2DV22uo0USiRoUWTZVxYH+FJnqyJmS5o7yD+ysYhrhdNsQ+G3z0TukQh6RDHLU+Y+5wWG1NVsONjawjPNukQ9xjfeMIH321DmOGbMAYGxjHbTaQxt02YPWQ9XXQBAM+LB3iZht8tQ2C0VEbxDw2YLUdgtGDkzEs2+mEPE7IYxW702dhYVQec9KR3GcDjzBsgvMHM6A5KgNKVHGyNrFzpcS7a05UzqHTfnAStGD6KbyCFp0CiRmYIC3obAx01/X3P/FfeffFEF8LNF8LVb4Cg4poVpUiYrMYEd8AFvIVwcZABbAxUDPWGKgoipkIFYlZKP0g3uaNsQYDmZAPMm0MJNXASJVjp3ZGy+NWgptaSneJZASrx9Cz7bOULvWB7YCgjZkhdTMkZd5mCHE61dkMmcAAZqt0iLtsEG3IX5Xstr7wSEwhEpZvUkbUw5NxOeZszznbc04eaGJlZ1LmgeyQI7dBqOd4VqtyRr5W32b9jz44GSMeM/aABAo9iTRnmllBmgxiRa26sgCnaxf0jUh6o0kUtnB6ownNL4Cpjyadac4Pb2jqW/bXfIcxvupPbaWQNKdgMvFUMM1ZANOcTWCas4ilOQuimIlQkZgF81F5+W4vIR9k2hhIKs3ZSOotlOZcTac5iW+rJjpZZyqSKeUHMf1nPolOqFDys5phbUFOjSjnoSrDria/4v75vaT4kYfTj1WuI0X+xw69KIgQELXt0YizDEl+B7V0+SfIOSXV6YIcaar1HklIkvgiJ2fG5IhJmixyQAI+VhEi2MX0JKcqP2gDBdFqZxuT5p1tTCIGPCzpbCPziCHx3fDJXeVsY/Ik2kxFqpoBTMzomRrherkE2PWEwJ4WrUQpeQJ4pHwleFR6mXK2cVB9d+onq3enruoeXLS6q797xaLu5f3dg6PaW1GrKqO5r/Qg+MsA+CYBvkkBt7GuBEe4Dqrx0fM/Ys9qhuYX0CYYQ10TpveGSMDqmpGkrozeNBlEXVOSekMwm7YS3w0fo6s66XNYPad46spoY5XjqmseUFfVYUdaXfOl5Nmgg1GUMnmuqJUIqkwNw0q071SAz8V4qGfLtk6kXYrYeqn+Y+IqkTO/XUqO5UpglciLffNHQSGjp80jEa0q2q1w+3JaJRpJxuvfpG7kKkUTIJ2NJP60dDaVkvNqFpy6WtlQ11prvUH9RxHVhpYAVaW/UpSsHKVvKrW/RQF+NcNZ6Tld+4//e+w4EQ8oSHOvuLrnzfeAedQDwhmU/Hivk7OyE2irpGfk7gIl32rSkxgX6dFPX+Lqk6Pnre1afv15vRu2PLqgd6B7zYrenpkLuvtvWD849svenn1khOEh2QD2hMog8y3Ae7YaNiTHg00/as+Feo3kQkFRyEsShSaWA4cMiaridJzrCrPSQPIMiVGAYoZkQqUnMS7So5++xgxJE2lICh4Ba4cYkrzKWcJcG1uFiy9DMIEQzL23G6kgN10gcN7WuhPSRkjHQ4t7F3atWLPhINMH5Jg2pKiyX5J5m7EqbzPm8TYzbrzNC/EW6lNZe0DXLjWgi5gX0EUQ1jSJssbQNl8eCR/yyrLvftTrp+QeRwGWqaq4hl6mFkvJ99csOG06kmpHxdfXZRgL2avrkxXQH6Q/IKMzKD7BxHNQXqmWrsk8S9cEBsVFEjVKlouksdR/SqqIBJxFHUGxMEheUGwUIB0UZ6wqPZlxkR799M0YCooLZFBc9AiY7gwcFDehgZNeQ3Ii7RBgUSiaLgpFfYcmaxGFIuqlNNRoJlGjNKpZhyFppqdrRpS0WYchEQbJMyRGAYoZkqzp0pM135BkJR25NWZIsvoMSVbIkGTJR8T8S1+BFU0P84vmC0RRbAXWLHUF1sRcgRWZ5qQgnbdNVuVtk3m8bRo33maFeCuQ1Mqazpqs+UmtrFhSKyfKGpGqD+K74dV1Vln2/cFaq+sce3X9ko618csgd4ysjbOl9mpB5F8pN0XQOWKsKIdRlEf8TMBxCUpTQmp1iizHlRNzXII2NW4sP5VDNEipTkkF7JCfSlH3i2atKlJZ80QqaxORytpCpNJ8o5xqArljxCjnSm2/VkA3Y0kIWYUqCfJnApsGTaZrUJP5mwZNYpsGBUkahLdAakLSq02KcJyEZkVTxpKYUMICEGVV3pcW5uZS6gS6ItiiIpUzT6RyNhGp2bYQqVk6jPI5kneR2r6lgH4TZpQzkoxyRsUeeD5ZpYVZnfON9/dFJM0X0TmfrOYAOYt+X1jSfGHEtCSsauFNrPhK2MTCL7WFhb9Gh4VfLtvCf0kBvdLEzX4DEj3hm/21JpvjQmJFfDe8OVhQmNWH7umljG3BAYNaANFS7VrSwtVSSvXqkOj1IHeMSHSh1PaYAnqD2fv0/KN4zehKS0OdVkTh2kxXuDZY4VolKVw7TY1WgoTkWd9PVM/6ruhe3r9x3eCc7oEZM2fvB0/Wtmz5wMXdXevm9Pd3bSSI2h4HR7TtZ56wPfIqiFHGy9lx6o/HPucAe+pCHDgevJD9+2Kc/ffm+AEDSHGGcACy1HmHolnbDPSTqKr8/aJOrK0Co4vpxFLvUUC/WydoBSdyDhboIf6N2E2IVHMKarQNKQqQk5OwDagvTVjGe77KQbCShPuVKyOfhQmzaPVaIG05X6fZV+iIMqpQSh3mM6qAMKqLYlRB5Xc1jCpCoRCYFr3v8n4weVwEM5DKxaep94G/WQkmm5bBo1XnM7ErWatKy+odkjqq/OBITQg+Iqa4byGx1fSSIZXomD0HO2HMW79WdUtqgSSPluNBYY4fg68NXQisq1/OuhU89YTyg4+ILDXFTpXX7xePE8LmLzXDYktNsbR4/T5YIhjBGvHdcJeHsMKsT6NZkZSxLWXoHDy/z0OEed9v6pP6/XcTras/omxlkSSFnDriMGIe5VWPGlGACa8erTEWgBWAuTyE2dBCvqsIxzdpVrboUIAWeuoWrgK0AgrQgkcvraXUU6Czqor5t0V3ViNV78QKmdruV0D/p06Vpr0dmKotsu79bqyqNTOIe7bmuLJOaWxHK0oz3YuF+A64xVU1zfG8qOkLYyxoLLUdUkD/wFAvtQjSYSFHGEhmrPQn5Qc/FtlyDppu0YLmbzkHxbacE5IsWoIVSRDfDXdXVPqspX6HbuSkBLoY8FstQCVtGVUkxChqS/2GVjb94Xe6ToBvCX5gglboGDpkKqAvExoBRMyLACLSUmVhIP9UGlMkaExOPFl2DJxAuiyITd/EHtMYh1JvBwyhVlPSrKpMtIaGS+mk8gOXeSs6I2027b6ig9tsCq7oUowVXTpCm3+iEy4wMbNhoFHjn8LXc9lSOqR/PZehjf+6mvf34Ozi/eevuRFcnRbghQiVOynqGNZ0rDkwOFsz6HnKoTOwI7SMmXBMn6DQr1GkBDdiujpHzC/BjYiV4KYkqTPehjOCJGgiCrOmWL8NZ7pDfyzXSKvzWpF0SbPp4thsfrqkWSxd0iJJHJk5i6Pg6reVfFdh1um0OLZyxbEV30dlD2oDxLGVxJ4Wx7ZSeiZMd8y65zHK6+nlOp8G0CoE4AVsH10PgPfRANqFAJxAA+gQAvA4DaBTCMAFNIApQgA+TgOYKgRgCw1gmhCAq2gAxwkBOJ4GcLwQgJ/SAE4QAnAxDeBEIQCfpAGcJARglAbwOiEAf6QBTBcCsJ8GcLIQgN/SAE4RAsDwf6fq6WDBbuE7Q2huF7KxQtUwUj4d3C6fCVj1JtLZ0FZ9Zqn1twrwt4ARDDMwLuKgx+KXFQroxfQSC45F8qbHInnzb1DOoyu/WkuDxSqZie/W0ZArvVR+z0zZZ9PS19RSZZBejRRawLmAArKwKMKww8jSJEtOpKNVOh3UB8mJ4A2LLJLibiQyANQ1HcRE1J0wxETUJR7ERNVrPDS/8pATad55yYk076LkRBXoG8DcB8PEhMTUzSVuYkKwiQlKMjEhWuWCYKY8TKKG7bI3YNTS4+Fex9BYTylTtS9bqboBF/kFwNe66K91IXUDQfJnGlq4EMlwizHnQnHJcMOS4ZIkGW6UVrAWumk6eirjboUm89CTeRDGKO/gW+INQzwsHeKodIjbpUPcKhtiv3QUh6RDHJYNcZNsgH2yAd4knYh7pEPcJx3iLukQt1me0yboyx7rm8Y+63PaDtZbvml86pB0iHsnozjutoE4jtgAovzAcYf1OdNnA8uz0wZ24nYbKOGw9a2jCV99cDL6hNtsIDx7rO8J+2ygMQet/9F3yIY4IB3FO6VBVB5D1mfMThuEPHZYtA7bgDND48drPFGsHw1i30FVk/5wtSZ9be+qkZEDQCeES9jl2+4LgN8vYP/eU3+AVZKN1mtfoK8A/NX6gPrKJkbrMHuXo1DrGRb0JFWC2jkhrJhXkth4yZ9BIJkVAdEK1GVs4hxfoV6mHQTM688QZYOewj/2zyhW9VblSUvYCPkIlWEqx/IzJ+kv1VT2mlcRo1knBTIzlB9MpzdtIPBKPf0iesNWeVOBe9GWh18l1ivSffm6A9VfZxROMFC/hoFwppSZrQA+XT89UiDCaRrhudSB/CyJXlXTZp1O/TJDDHpVnamfqPatVcBAOmWPFZsz5YZxDW2kUmY05b8+5fu/fxn2fPS7v+296Y8n7v/6RXs+98Fz9pWmv3HzohcP/XoewpdjNfHA5yO0yeC0ifBpkwIJzVePucimI1a2kEKKDtKEFNd67UCg5h7ZIbZdukZB8s2gdDN2oT21lQNVACO70B54FzotaRea4XfShN/RTusVJTgwrZdl54nvhotJPAqz3kq7xWjVbAMTR+mJo9xgKgGUQEVVXooSrUQps9iAy1mk3/jSB4Qy77VM+IG48i4MSZErghWIS/ErgvUfflUgdlMQG8lH/bV9CsTr8AZT+ov2FIjX452Q9J9XVSCuxfqFFAUOdSgQ51MQm8lH/ec1vKTn0MJsIR/1H8VQsLycgthKPkLnNFAscxTMNvIRgNmOwoxTMNvJRwH35TXdfXnNd19e1H1pqNFBokbZtA4dFqiDnq4DMZMdOkyQcZCN8kE2yQdZkA+yKB9ks3yQLfJBtsoH2SYfJJg3yNBHfqPVxT0URjxSib2IbIYyiATECu0PVlIO4UM6sxmE9a4iDpofViMfYtlP4+QtZe6ibXFUXvopiqz04DY+CaSkPknElqwUSHam8oP3vYaqhs93qoadqmEhiE7VsFM17FQN64foVA07VcOW4bQtqob3TEY6OjW+To3va1oc99rAs8pntR1qcpyKXKci16nInViNcSpynYpcpyJ3Yg2PU5Frq4rcueZX5M6VV5E7toNwRs3VVXXIloiOCtlZp1f/ChfieKvA9e4NKAwGdwa8knYGwkh1g4sqFCSayaTKtYRQxRSv2hfcHUsgm/N0MW+CfAQgJnkXjoG4pBBc6GqkFPkIVSMxcenSgUsjgstSWVVHCsRuWVVHCsTrZFUdKRCvl1V1pEBcK6vqSIE4X1bNEVG/nJVVdaRgebmsmiMCyxxec4RU5eppRXU2c+e+eLjiM7JXGjTfiym0faRpBID6aFL4kGjBq/oZ40Oa/lf5kGsMfsgVTMD5AwrgZeDOOmGjmKDfSjkGIsAvF8IjXpBifYPpPdsazPekDagn1VDDR6JGiYePJCwS4+hRlJMxcusBcApDjlylnHJVbPYGxg/cpdxW5Qe9WH2HV1J9h5f82RG4kELPJy/UssuNCK9PTH62iwuvDxZetyThZdgvNyi8fhI1ihH+yjiwQMRPT+ZHOOvnp5MNQzwsHeKodIjbpUPcKhtiv3QUh6RDHJYNcZNsgH3SABJ2bxJKowk47pQOcb8NvnqbdSXcPOHZJx3iiA2czB7pEHdbX3h220AHR2wAUX5ctsP6nJEvjgds4LbkW57brc8Y+R99SDrEvZNRY3ZOxpDnDtkQB6SjeKf1qbjFBoHjqPXJOGT9SLTP+i7LhAhqyPqmES44tVD8PTwZveCI9T96q/UNjwk6eJsNhGeHDTzrsA0sjzx7qzyGJqMx2zEZgx4TJHynDei4Q77OeCyvM7fYwJjZIJkgP6oftQHEvRYOHpXHnHyQDVYGKT8EMM/RbLWDAEk34k4tiuXEx0RmD9mAkPKZfcAG1kd+mPtuOzgGG+S5TIBoB/EZsYH4rIcAMmpuiTJQYBDWslfuETXXWEBk+hm1sTmkHVJzl3K3YcXIxwDXdEjNRUxvsyLreVivPT0ALqGL6hUCUaD9YjTX7g5WACvkolnhh6u0fZKqtBn6Tpwy0VAjQKJGcTJQGQdWaQfoyQKIaAT4kbFhiIelQxyVDnG7dIhbZUPsl47ikHSIw7IhbpINsE8aQMJwWl8aR2wAUb7l2WF9zvTZwDgekg5x72RizNFqgCQZxw3Wl8Y7ZEMckI7indan4k7rm287fPTQZLTet09GJzhs/Y82IYLabgM67rfBV2+bjAK+2frmdnIG9FukQ9xnfbflxFAWVcE9k1F27BBObLUBq3fYQMDl24nDkyrkUR5Dk9En2EHC99jAPtpg8S+R18qjx/I6c4sNjJkNgvrbrR9GmQBRft5/RL4O5uSDbLAySPkhgHmOZqsdBEi6EXeKMiwnPiYye8gGhJTP7AOTMsx9tx0cgx22FYYnpfiM2CJUiUEgXWhFJDCIcRGHaQXLm8UKlt1GCpY3Gy1Y1lSMxirI1WPd2Y/B5pawHq+hfQWwQnllJmIGsH42Jql+NkczPlZlvIYaeRI1SjjzlXFg/WyeniyPSHueH6oZhnhYOsRR6RC3S4e4VTbEfukoDkmHOCwb4ibZAPtkA7zZ+kSEQwHrSLcJGjhiA4g7baDUOyyvg3BezkJKKJ/V+23g/G3gqvusj6IJrN5uA8szan1W77aBk9lBHc7MkWtP/cuVHDKdl/yZoRWQ/s+udb18KXv5mzsO+P0y9u/zdeLL5eNEVst1jEO9yVJjpLKIzv+GvhwHXkQLXjUVEl9Ee+FFtF/SItpLS4MfXESHSdQoiQ1Xxq2CJmNcTxlGVMAB6AC0GEDoJrGV2jeeqq2DzrVT0CLVMWWD1Hg2dTdfjMRLZfO0vyQ8SKx8ix9y0Z/amjEMZbTUmDwGYO3a0VKUvrSSmC0tYGy8CN3T5M8cw1yDYVYeU9JUQnlslA+yST7IgnyQRfkgm+WDbJEPslU+yDb5INshkJH7F62/Vg0ys0XZyIHU8ZHKLaqVa1pPY989TRtOb6lxZsVwhsGz017mVdKXk94BIlH55tj7rpjBsKsrmbetN55Jm82ovEY2UdBRrkbuTk0Qbo/Vfafxv5QfnIP1xwkK7C9i/XGC5M80aLsQ/yN4jefF4v7HDfsflyT/40ZpRUU7BGoUHZVYCNxdYzSd8iCM8fATbIYhHpYOcVQ6xO3SIW6VDbFfOopD0iEOy4a4STbAPtkAb5JOxD3SIe6TDnGXdIjbLM9pE/Rlj/VNY5/1OW0H620Cq21AR/nCs9f6PgveRzUMcb8NwjwbBGV9NrA8+22A49BkdFu7bcCYERtAlG95dkxGy3ObDRzhHusrYZ8N/OBB63/0HbIhDkhH8U5pEJXHkPUZs9MG1tYO62o7rBKGxo/XeC5bPxpBYpDEc0Xui8y/B+EimdcgNH6P3vQIyds9ClGbO+7qo1+AyW5EbPzkz7R1EcR8nnLphGbHI1jFmyKFR4wUEfH9Hw+8/xOUtP+Di7+GGiESNYrUxFsfNF2Ini6EcC9E8koWyPK7VQ5AB+CkAujRmpqu6juw7CCEVER0qdwz5UFCpcZ/KBUR94ATqCsilL/HSeAiNREKIdg1EU0upbztSq2BU8opllVcY5NHFG8vSVQWUZpKCnARO+mphgsQNVisOspcIjAJEyKYpXWVRMVNqOwqH34Vi1f+c/m6AyTy89avJYeWEX8HXc8Ge1fBMhWPuHeNwt41LMm7RtGyJuokN4Eapd4xrnrH0GMC4wpQ82VRhM+Cx8S94nyOwXyOSuIzg1JRkM8JEjWKigkuWxL0ZAmELXYASFgmKuRUGKqX8brCyTBii2qfKEzKAawMtU8UrTosuC9E7dPEqi6VUuDEq+4AV55D4S8yro5LiqlfTvuNysGqOu2bRkSkmhApKCCMK5L00LxrJqWZSe86Lb3rSDqUHe/U58uA6d/U6YhV3ggqJD9WYQVwiVLT4wrwOdRy3UMSBKp3ZUVoHixC85aaLqRFJSgv7xCseSlvJUEUFjZPRdimZRBhQ3gdwg6FhKmXQTSswVMK+IGHqIqnoM1aLZD78FaDbIQCHpE0kWDGzCUe4ITMTxOF9GdJH61mSVd1D87tWjewfu0YXzSpT4LizORnqH4fI785A8pkHgDhu4Ck6zwwGQtBChxQT8r+n+Z8leonBohLy2FIpYmaZRqhbF7eMs2rXqYFMbghkmHocbQgvVBETqwFNXlqSnmU4OLbV//t+Udj+2/esOeTt8w+PtX1of3P/O7nX/3GI7Hfv/Bw3zOz4M985WgJ80uCmK0CE9BBVBWwBPT4z6cfpB8WuKAOiCEEYhcuwvqXzgrEpRTEKPmof5GmQOymIMZ0BDdxBOJ1FMQ4+ah/5aRAvJ6CmICjTuVFEoG4loKYJB8BiCkE4nwKYop8BCCmWRCVR/oQapp8BGBmECwvpyBmyEetvSJwibC3iSKI/8+KueCEuP/Pwv4/Isn/Z2lqRsAER45EjTJQOdI3A9MJNtEgQLrlg/TJBxmUDzIkH2RUPsiYfJBx+SAT8kEm5YNMyQeZlg8yIx+kXz5Ij3yQDQIVDBH+WmpAWUsxCk8Iiwq9CQNFKXGj6x32Siyub8njRpfe0Hod3d/ykk6ATit5Sk0PI/tb5NFWto93Iz7ea/oaH2lF4TavFYUb9PENJGqUGjTo0CwPOp1kNVAW/UCllVwlqNf8CiuzGsuxforot2I8gRtnA/+sIvT3CiwRyOSO7pVKksQLXas4OwE17QToZwlhVKntAwJP7gZCCCkd8QrVI9DjgWqEb/FLR8KgVigLPSbo7/B1Aks/gDoRZm0DIzoRJh8hRIBvDOGaHy01PUt8pUqW3KSeV1Sx/E64qLEyxxFwn9NrbNdcv5DHSKpgu8thgfSVLs0J0RsBxKdUS4g0v4rLSxecIjVdEDcvXRA3nC4oj7tVWohefgcf+jIM8bB0iKPSIW6XDnGrbIj90lEckg5xWDbETbIB9skGeLP1iQgfsrGOdJuggSM2gLjTBkq9w/I6CPeasJAbHLaBG9xpAzrusr44DtnAgtsghrKDnRi2gQ7ut4FWT0px3G2DCIW+8CFbffQKrHWzyHRe8meGls/6P9ukCx+yJ4td+JAzcOHDyWIXPkBbGkDyTGkEvJRZgFx4ZyV3U7icmVsrvIVI2bMumygsQn+QLxWusE6T9Yi8na2A1J2tiHk7W3D1iipji9UcNwnkjqMIawiQBfkgi/JBNssH2SIfZKt8kG3yQbbDyXG4fflSUNCRHZelKkAsq9dntH35fAJtkETC7cvHzOyNtEGKyzsIEtffvpwoD0ggW+EppO15I323hfIYVvzNHY5xxoyzczWRA9BaF/+sos0B9Aa+EsgPvolVY+uqiWA16ymep/zgrtfQrQmXi9ss59YEXurCuTVBCKJza4IMiM6tCTIgOrcmWFRfnFsTJov1dm5NkIPiXhsEPMPW12oTerZutr6TcVyCYyec21UmWKsnpTg6V25YVRydKzcsah2dKzekQHSu3JCBonPlhlWtrXPlhlXpaNsrN+abf+XGfJlXbhQvqHmXvw6pePCCTUTra265aaCpQRDeqfNK2qkL6q+KFGxc6GaLUNDsxoVvtk7jQoy4nD5ySE9AN69xoVvduNCLwQ2SDEMbF5JggMaFbkg+YVxfIZFiR+8mASBVnxFJVZ8R8mcG6m8WYEiCEEMIRGPNAMMIxKXGjtUjELsNtReMIxClNQNUIEprBqhAlNYMUIHIaQao1S5CWGPsFjwxxFulxRxGVNxbpWFvFZPkrRiNEIkbFzTUyJCoUaqfIeM4YDpGj8QMYk0IkA3yQfrkg/TLB+mVDzIkH2RYPsiofJBx+SAT8kEm5YNMyQcZEVhsxfgBcK3d5oLA+ioit9FWRF+cirUaWyBUS0+MJ8wrq5q+OIR0m+NfPOhBXN2EdpvzmFf27QFdne5uc26BRIXHNDVQVmrspMS4dZvTUDGLyFSHGFuPE5epDlimspJkqoNmchaUqU4SNUqmOivjwLLcTnqyTsRWd/I3vgxDPCwd4qh0iNulQ9wqG2K/dBSHpEMclg1xk2yAfbIB3mx9IsIbDdaRbhM0cMQGEHfaQKl3WF4H4SIsCymhfFbvt4Hzt4Gr7rOBDu5xGCMDxd02cAl0n5eO6qNXYHHRgUznJX9maL2i/7NN6vPSMU2sz0ungT4v08T6vCDbUT5Je2Y+HbLAboPA7bDQHKsszot/ENnbmNBz/jHzEj7w3oaKCQwWlceBJ8B99GQ+lOcOwEkFUMI5f7hrQAR8E69a0LIhaH49s/NJc4LTYKo5xWkw1ZyxToMpx7aJ2DblsUma3CuPBfkgi/JBNssH2SIfZKt8kG3yQbbD9Srj3WCqeYaEBlPgprFPuMGUr9Q8izZIUXnlllE5DaaIeqYU7WuUx0bUp7hLzf+p/OANr6EOMReJewSnQwwvG+V0iBGC6HSIkQHR6RAjA6LTIcai+uJ0iJks1tvpECMHRafzg1XDvEnZ+cHpEGNRxjgtOaxqJ5yWHBZ1W05LDikQnZYcMlB0WnJY1do6LTmsSkfbtuS40PyWHBfKbMnR/F2TW3Jot2KIw2ExASa7EbGJkT+jvsYn9jV57fZFvjJznfZNU/XRr31XIOVT865YfQxr3zXD5Kmgod36qSO/tVIVcXUZMP2bOnrbjvgi+Db4Am9rEqimWMbcm2zZpWzX/Yw6QEjWELAPEPqrslZrZxe3+A4b0tnFb15nF39VBTTUCJGoUeoRIgkLTMdoahFCNC6ESLdPHmsulsoan3ms8RlmTXncrdIYw13tGoZ4WDrEUekQt0uHuFU2xH7pKA5JhzgsG+Im2QD7ZAPcIJ2IO6VDHLG+dMMrIMMQ99vASgzbAMdtltdBOJtjFOKAdBTvtD4Vh2yg1HZw/SPWZ/VtNrBk8oVnt/UZs9n6KO61gezstEE0sXkyGsc+6yu1HTyCCRDli+OOySiOt9nADw5bn4x2WGAO2cCAD9vATmy1Ph1tsGQdHL8lK57J1o8GsTMhs0ND8CLg913s34dc4pupF4lsprqUzdQNIrseftM3pPzm73r4RXY9giRqlGQSbxsERDOICDt2Gk/iXmHva3+vsDzO2ZByNqScDamJjCycDSmr2h35sfg2G/BavlLvsLwOOjlSJ0dqJXF0dvac5LWTvJ5YJzM5k9fOtrBFjeNBp6pHAoo2qOpxNqScDSlnQ2qCee1sSFnL2iqPOWfxNkkWRnZIJcg3PLc7GUJHq52UzIRqjHzLM2L9r56cC5l9NrATNjjPYwMfY4ccz+2T0X6PY6oML6DRjwZZPCexqUiwx/w6uB6jdXDa3g3+6mMcv7eaQXXlWokFVN+QIPmonyWxKq20EEPkIwAxikBcSkGMko8AxDgCsZuCGCcfAYgJBOJ1FMQE+QhATCIQr6cgJslHAGIKgbiWgpgiHwGIaQTifApimnyESjeXKWINrloz6gscCBjKo5fR7yRTah1RgO+ttuR5cGH34Pr+HgrdDPlRECo0ATKIGYyRPxP+ujLcJexvO6TcfHEvjO289WsBqOB9HDn6E91cu5ylB+XIb9fSOks+6kckUzVVwKBGI9jn6UGN5Idosc+Tjwaw75KKfUYQ+wz5qFHLxspsjLLdJrHKWS2+FcAKtspMxAxg2W6jpLLdJhax2AHEo9UAYlX34NyudQPr144ptyYqIAjNjAua6vcxXP8MqHPYARC+C4hHLgObn0GQAgfUk7L/p45J1D8xQFw6uGgiH7URDSnB5UkffnXSV/5z+boDpKqNmTnmUBpuE8kw1RciGDSVMdD+JAfJJ4zrKyRSguN7SABa+jTq8EeNqDhj/mj85xMwNQUxbU+Km5qC+aamgNIKbk9XoOlYJM0AMF2Rnq6IsIYA6ZEPMiwfZEQ+yKx8kEH5IEPyQUblg4zLB5mQDzIpH2RKPsi0fJB++SDz8kFm5INsEAqbuZHggBIJMjJKR8FYjYg/mFFiJmE0WmPHkQl9AVuGtWzjLbGyrAsbifEEN+mFa7bU+qKycL2HiqiIdWGG3YQ0g4QNOdNXKDk4bMhIChtyaIqB6pNLoEapQV6Hq8ui00lWA2XJwlSCbL1cJag3rAS+qhLAN+1miMyVNpY+Q0fccgY97xmITYuQPwNBUgmfJh0G+8z7z19zoxYT/rBZzB7EZ5Jz0wZgVqn15YoBmLaO1uEzxdSojYZwVm0nvxU4s2n+nEnOopGMWVVzIWxWZsNmZZYks8L4mlmItM0mP1o/yNl6QVJcmy2Ja2eyvpOYRcM1NVI0yuXPGZBGA+5GsnGqtkhHclg+kq2ykRyUj2ObfJDt8kF2yKbkzfJx7JQPcop8kFNtAXKabH5vko/jcfJBxuSDPF4+yBOk295D8pE8UTqSe+UjeZJsJG+yshNTHl8nH+R0+SBPlg8yZQuQp2gDx5nVAgbNm9Mqb1Zp35xOolhePLZdDEayQGEA8ZhnLLDOLLVdpwB/M2/tdqxEiYXfKVRqhlj7zOLtyM1W78idqSIOY0nYtpAmr/JY0L4j1qZF5Uu7oS89jfulNEanldreSi9RZsm7omkWiC3AdFWmnYnwEiWtdp/6GiI3ScrKR5XfecQ+KaLMcQTUBy/4abTyzeQWN5xODzqNpAqls6eT6qs/81Lkpj1PQ9OeRVI8mfxZQaY9uUJLY9gE5qSaSNrAV2LNRPYcz6iglJ4vYDvPIIEDw85CyXaGyhBTZDur1NZDkA2aAtAZQt9zbOB9ytVdWXHgZXa8hQ16kF+edTZN0QhXIc6iB51NYqXNRJ5FPuo12ISKnUo5AmK6s3iO4PWvlDuwOHI2KGcce51i0Ht2qe1WrXSfSY6uKNwobdXfICnxdA6aeHqDgBCcQ6qVlp9n6yDhOYrMqoh4FjmUJuI5pbY9CqHA8yJvYMMmhYIB+w2ltndrGXQOi0G7kV/NgH81mxxQ+dUw8qtT4F+dqVInRXD0m8WZoKVW2Q8qbKxqDRI4nkkEjjSdG0ttdxCGB4oDIrXFAfX74TigkRsH4HUx+jeACdcWNrZDz8AkDPIujESkEfJTyvxJPS/wLYrdXwgNauYHho0MgWgutT3E90QtCCFAljTTg1pIvLSWq5l8NClCxSSzyJXMFiQuBMnQipIhQktmK0kH/bSNgJIZoQnLUhJlrZT6toBkJrgEKLCopjwGKTko0IpEy0FTjSuVRC1y0GxEDhjC00ySgZKDFpIO+mkbBOUgiFioJpYcrDdiGF0C1b8FTA5U9b+QHCTMk4MCVw6YTseAWSyictBM0kE/bXXJAXW3cIL8lIocLBeQg8TEyEHEkQOeHIChQxEIHVSlIXToUCy1/Q8/dGg2IiJF1FY2USJSJB8hEcmZJyJNRlxGk6kuoyhAW12mooiEFZQ7yam4VTYj5whILT/RkWNRFDEjOfIRkpHMRMpIwYiMFDnWFFv45ARoyzcjBcCM5HAzUii1/Y1vRopGRASPPHPGIs+seSKSM+JpcqZ6GvMjzwwSjWRV3CqbkSa4VHXR+mvVKOVJHEBhp4Zludn+AittrQwiATEEvj2uyAC4i581pk3ZUnuKr00FvKgXIi9maXL4GV6z4vd2W8VtOqqsFSvLF9xmSf6iGeNiUUdIkQNkNYvLaq7UPkVHMrJgnogkuCKSMxK+NrOsNOlAEBEpCqifLoObrRjO5Mtw/GXIcBboYU1cw1nUZzibmAuO9tP4hrMJEMYCLoxNpfZZhsIQQwte1XHOCVnwttsqAaZjwStgOFuMuD88nV3A09mCIXMTL2Ruv0iH4SyaJyIRI4uZiBERKZBUwUSkWX5urGI4j7LtxSJ+dQBkjBQEetig32poTyZjxBS1kFgJ9WAg9bNy0Eq7e9766osxWfsn/g+uEWjTeAwmAq0MOraV2t+hHCUaYOBGNtzQUa6lEZWWat0WBbpN9JSSml8VwMiRoDb4SFCLpCNBbSxhqVZDaqdtF5t2bJvrvLVdy68/r3fDlocW9y7sWrFmw0Gm5OXIryamIxgJhf7LkJqmsPZdM+nUy7rffp38OKNfAX6D6fn8MPnpcK6/WbF1VwrtYxqwN626Qx8IEYDwBPtYO92tpfYNOkoga3Sa9R+DnWYr12m2scjFo3E7PaiNpArlNNuF4ioCEi+2b0Nr+Zrx6H7MWm/j1/K1IUv2BcjmdhtiCFoRQ9DENwQJIz4+UWrfzffxKSP7rIzWgynMx+tpPpjSeqK36wizc8hS7+0kcszUwD6kDQDhEVLsNgApxDnnxRyVV9w552HnnJLknPMsLiuiQRVdEahR9kDVDQ6YTrCxEwEyKw2kcmxCMsCn7gIT8VaTnty4SI9++hKbD9Vo7tEFvQPda1b09sxc0N1/w/rBsV/29uwjyJv3kGzwCFg/ovsI2p8U6QU3lrNi2j5kUNXCMzB5G2WdCEwSvALohLqwOkVOYNYmZQwOUVJGEqJ8ycmjCdEg2pkkIeDndMXICWQHSjl2lTwX7EjLsAl+0xvL+GGb4JNkE/w0PaHe2YKtLxvY/Vz8prW+VN64hZtfesxqfomRl7ZmfvJRa2CIJjMNPAPToDYwPgyun2QZ2vySBAM0v2yAJBQikA+Io70kTDpU9JXav6YYtE+DwOm9igbuesavb6+ChZW/1P4Uf6/Cz+yQ4yUpBzI2oD46o/QBXsPG5ofKQuZpAQn1cmkURNd8XlK4aLyCpfbvIGF+kJYykBx+NTkCqhUPDNfLgxtC4EIkYckaQRJgWFgvJVnyFi61P8eXNy+NWZDL4QZ9WhBkYNVQav8BiRXpQx6r+pDlves2Ku3CDhow837wTQh844VdwEE9LkC/Q6go3g8pQSQ1nW/IIUH0qgn7iSphV3Sv7R7sVki73wBpG2Ay7RcgkyaYakCCKZ/pwZQPDqYaJAVTPtqWNoDLcz+JGhUL+3XYDi86nVnNKt3suM5bbzS60tWnr3I/A21uXKUOj6JtvxMJ4F1ibJ8jLnMu8wN4FxrAU9/sFpv2XGhaNz2tm/xueCWmXFnT/jda7IPcfE8QWQDCNwSB2VoylKJEK1Rq/4v2SzyVyVZq33jBNw3Vr6KMALRnFaiOKdOrYyv0eTEWM8BVRox8BCDGEYhd+N04lMglxERuLoRTEhW5BH4bDpyLeVC7wRwjKA8neZL4WokgcgpYKyXJX6sjCcbOQUe3IgcJsKKNYeQyphu5DGzkEpKMXAatwKK+OSvJyDGq78hexMj5B6UNbAejG0mOa+RyRiq+8/ziYVZlcr7UQW0gx0CzlALfpAn7UP52sBkhdL2RMi/7eqOOcxXQU2FbWFntKKAIjYPwQVdhSQ5WJ/DXYNg9XguMYRVTIcjCazp/Z5XhOdI10yut+kgWZjP4mCV5IrKRATpZ6jidv8GaRJwbqF0RepDKgGu9T4R8BGBGjUiFW69URBkEcpc6Xk/QXqPCrsrkq5H4La59FyKNMlyJomTZOzaIWjCOqI9ZsAuR9H4COWCSQmx4WkF4qSjCaUxIx9C9hC+kJtxZlpZ1Z1maK6SNeg1EjtmvpGMB30A0ArRPYdZ6DPQiHfVAtR5QmQNvtmW4m22Nkmo8G0maUEGInhbwWWTbD2R9HmV9ihuMvINuiYYoIGpBqaiG+GS4LC5DxzwEzlTUQ4hyNe6hTCQcoLtND9DdcIAekhSgM9IBISRAj0kK0GMs9hPfrWFDnHxXYdY6Wjfi3ACdsT6O82u0AIsVx+OlsbVfD+ipV9KeGso1hMHQPQKOiVYdGdd7u5n7WlHMFY6FI7co6v44mGpZTadaCEpQyRaCFlQ2kBBPOB8bppMxBK2q6RiKKQTq1LcQCMIY+7Xv3ORHw1TwIV8aQHOn71W+ZzeY0Ko9dxqXmjv1mpc79crLncZMzJ12HLJ+7rTjgP7caQNom3z83OkqMHe6SKHXLwTWdUqcvRBf1SE5vwieHSSuJ48B2cEI+WsVMMjgM7Q0arqWRmEtDUrS0igqtbXGFjFjsUUUiS2iitQ9YoPY4kNgbLEMDGOXIbFF5dsfBfkJoKrM28tANFrqeEkB/QnYoGuSf72kQkH4oAuWCAerT/OTfwwT4+Iuo3CsXCoEWXh9nr+CdrEOGtRKr7DqI1mYfYmPWZgnIuuY1TAdT/LzKmEjeRUfSikX5SZ85KN+RPhSEdErFWEGgSKljpIOqQBoH8ZoPxZIPs2nvcsI7f0sOhFYoUWUIpJfG+05cj9G+2fMk/tn+bSPGKF9mHWeG5H7MPmoP/qVKPduNu1fQAoOIyTS1dhh1unUL0mrC4RtAfLXKmCQKDJXzW6Osv2kxlVzEFmDhoig2WYrXMHgiONFx4Kjl+mECEzDGElDODwMV+jbmRBFGLXBY+j+1aTNrwS6+RU2dLowbsQGJ/Xa4Dhzd7DTZXzjMYQFgmOgvTr2FYI17ivE4X2FKHdfgcH5KJfzKZTzIXp9k9LB+hiSLQZZn0BZHyLVkKUbnXF6X6FT5JiRC9xXcJGfDCdvosjGaQzZOI0TSyrtYltZkJOuBhaj7XO/NP2HP/nYzfQlRBU5qFjSGifauab40sfOPWMPf6LaK4GRg1l6WnzUi5QpB8SQ+6d4QiVgfplyAK0bPlJjHucfeIsPN9uDMzXGDxrSgPqNhxxeaf5yY80Z3H/ULJ1/B6OzZWC2fY1insCL9fyAj/LggbC/1HmaAnwGYsa8ihmAT96oTph5yUdQ7KhzKD4SdUNnjTwkMNZZo87Z/ARNECBnACfnGPDX8wOuEF6lrztTHyLx0gZcQY0CQGuSIO/ASVDNV9VyBjkudex8tSK+pC3TeZAtSH4nOMirRs5PzqQ/e+ABHbmHhF1VQsoICEZtXlDV65BFjQvc71jO9ip1Wq9SR2JcltNOzS0rxG/qkJUZciTRo2aKm3zUy0mPLjGDZ0IGuRBDBQ5yqwe5jMykjxDOTM5MzkzOTHaeiTpBQxxLv39+rzoArw471vUB6R/gAjKsZLKXF81Q31PGCxniUwcmDUbopgpK6eih0h3Tc9dPXB9b/oufLp163b03PPniike3njHzT3PfdZ/70r9dsHnf0PkYkhCfPJhEQF/m091JwmtE9hrIR70hgSEp1+fdnZmcmZyZnJksMhPlPl2g+yRTNCz3SSwfvYD79NIe1sD3eLBVmsrN+GqMVjyMLF7FgcZXvfWu3/1z4KP1qd/8+fHvvufSZW9b+PE3rP7zI8WNn73ylPn7khiS0Jehi1boyzy6Z2owIn0eXTM1SJBzfa7amcmZyZnJmUn+TJQvbAB9YYNUXyjaUk+fx3CDHkM/5VTFTfQ5jIovPHFg/qdnLp/zm/ff7e76Xir8nVumfeLiPU9+u+eXpcvf+PiG05owJA0s8WBfaGiZ7B23/LJ+V21IOZyZnJmcmZyZOG7NA7o1j1S35uG5NY+x/J7UhZALcWvhez/41e3XLPj2bSef6O578vzW9Dsij5+8bdqh4tTfvfjiSZ63Sc5ceiU4bLcumXBLyJEaSuobUg5nJmcmZ6bX8EyUh/KCHopc+nA8lBvwUG7aiRn4HkMeylBAgHkoV/wfy69+9Kvzrr/l39d9pvP9Z71185Pndjx/Z+tj8y5o+ODmr7zHyMrGZWRJacj3Glqt6U9CGpJzQwkGZyZnJmcme8xkrGCkgeNsGvh3UogWjDTU6GwM+XbM2TR975QL//Xl7z1Uet83P777B1szv2xq9Z7x3l98+qEb/vut9zWef6uRJK4LkwmpbrRB8rq6QcIK3pByODM5MzkzjftMxnaHPBy/4QH8hod2LQa+x5DfMOSmMb/R/Kt3b37kpOebzuvIRG+7429DV/3Re9PXr377ix/92obb/vb0Y51GVgFopb5Uj6hf+pzdIWcmZ6bX8EzOTorRnZRpyWveH4w+vfy4Bbs+1fCtF90f6lo58/u/Ov3eRedN/8Ci0zZc6eyk1OChnByzM5Mzk/BMzq6D0V2HjmU/mbL9zV9f+Jat+xcd2ntJ5tSFV83ZduVFZ7+9ecmmrjet/ayz6yA6k5P5dWZyZiq/cjL0RjP0jc9/5sNn77nwC2+vv/Gvj33yHfO+sm7nP1N/+NZntz/5+SPvKj3xAydDX4PfcLKkzkyvmZmcbLbRbHbh5em/eOiZS1xfWjf05E+iXb/3Jn/5gbde0R49rueqq745fNX/Otls0Zmc3KUzk5P5fY1mfut+/dFvLNnyqwtW3PW5z/5gy3P/zH5tWfOPTr/1Xd+6dvd9z35o7ieczG8N1tzJ8zkzmTyTkyU1miWdXniwd8mc50br+/r+suaXJz3tOvHE6XMy7wt84PSr/j5/2i//6mRJRWdysm/OTE5GcVwzitMPvfUtpe/9aEvr/Lc8Hnnu6NFHP/DGFwbb/uXHD/9L/Re73tlzm5NRrMHGOpmqSTqTk30zmn2r6/3gJY+veeTauuaff23DR1fe8h+F3/9w79nTb7z0gbv33P3Z/4g72TfRmZz80WtqJidTZTRTFZjxn4f++5Rvxeqff3rg71ePfODG3635aq/77k8WL1rfX3fed852MlU1WD4n12KpmZysjtGsjuvmM7bf+RXPSY+6Nj1z5Ixr+h7/wutygwd++/Wng1f9+ca7Tv6hk9URncnJgIzDTE4GxGgGpOHvjV9Yl3ug7Ref+8xJH7m978WzPrXxiaPffuaDiT8ffOEzJy9JOhmQGuyRky3QMZOTLTCaLYg1/6rlTz855W3/fOJ10efvblj/01NPnPO3DdPXv/vsTe+/qP7KbzrZAtGZnJU1OYOzstalhr6PfKXrwfR2z293tF1676x/fqRr43mLVy146dSv7e8aHTxy843OyroGK+GsQrW2dhKsQrM/ecPfH54RGP2ft79wz0+XzP1B8zeuWPHxly7b+J7oReFPvSefcFahojM5Kzat/th2xZbOp+e9zR/7+hcv+/6Nl3z24ZcufPAbU6a9OOVz3z/wV29i2HW2s2KrQXed1c0aq6xuAl+Z+eSp1+//9qENbZGLnvjoB+7J/2dh295fNL/xV5ctev1jyaed1Y3oTM5KYI25K4F2/+vuy37j8/OLPZdfcOD5BUN33vDXF3Lz/3rHv2YCT77YcGHIWQnwNcqJmo1GzSed9q4XvvaFyzt+efd7Tzn04d/MWnjtwMqXc8HggT0PX/qFz75j8ySLmp0I02iEeeqK+f0vzHjfCZ7dPY1v+u4cz9t/PuVPfx+4/pedSc+64XWzZtk3wjRmXDyc65R1RGOixsVQNKbvAkRM2e+f13vjPvIPBOkWdg+u7+/Z8vAlPSteoVhZfMr0q9/y0CU9g92ruvvvv2LW6V9uqwP+3f7Df3536JbGX295YHF/17rRfdXx5QeXpIne/Po7b976xR8v5k/0wGW9XSv2AZZM+9JP0viDr9J4DJ/L1x2svgiUxeyY2BADy/Ou3PLgpetvWHfJSgJqoDT1RVohg8SnnjYT/tTKP/pTCVAArv4yrsdmIElQBrGUgay/NPXvWx449ufR0tQfY+RzYeRzUy8DGOGDOggfOnpZ98DA4tVdPerPCWCfEypN/dUx1V27drQUvresAuXfu8nPOqIWRI8YdzzKHEe0ahaqgAQ/LHxM0dXfpAxyQYMi9KAwSZMjiwZ7+7sJPCKkKQGANtBAFeougAb5HqnwhSVsAXJamj++0tSXFdrdQ2PtImlCvXWTske9VbkN6q2XlL6ywE9L03rqE5MEv5b/immo074JIsY5RH6k5l2Y/ETNuwisSBU0FB4reBHfWmbFtIxaVYjf1JljE7wToZtBrm6GaI0IVjWCEqoQKnIuEoiwMMOzekmKKqIMeUAytgF1Wm1ry1Mv4+nytEZl+unYvC5MhtyYDHlwGQI+J0hz0VelJ+KMggJy0QBDDJGPYOwWVgd8QXKQWcrhnRjlCKPK0YAqRxC19H6d6jFdol4s4OrFDGXeC+yiF13S9aLL0YtjRLC2XlwgUS+6uHpxiTLvNXbRi6XS9WKpoxfHiGBtvZgY+UREzScgvMHqcpL6Wh/5M4il9fS6KCQqOMzVSL12NVKvEn1NlohATGjyegGJ9HGX3mGUwEfPW9u1/PrzejdseXRB70D3mhW9PTMXdPffsH5w7Je9PftIAfeQqzrPRMm4pJyc11O4s+3Dyy4zPfn3cOjb5332Xv87+BOprKCvag6ZoujXiqK7aiOBAYvWX0sO8FeloGI2NldUWLGNCjbqFw1VIBVmafFu0L7xQxa3MlL7RaBs6/gi5oAA0+/7iOEVr18ZUJp2c5k7/w+QtgHIpXwGAA==",
-      "debug_symbols": "vb3fruW8cad9L+9xDsQqskjmVgaDwMl4BgYMO3CcD/gQ5N5nsSixnu725tbeWu+cuB/b3XwkLvGnPyxR//Xb//rjv/7n//mXP/3lf//1P3775//xX7/969/+9Oc//+n//Muf//pvf/j7n/76l9f/+l+/HeM/0qG//bP+0+vP/Ns/l/FnOf+08896/tnOP/v8Mx3nn+n8U84/9fzzbC+d7aWzvXS2l8720tmenO3J2Z6c7cnZnpztydmenO3J2Z6c7cnZnp7t6dmenu3p2Z6e7enZnp7t6dmenu3p2V4+28tne/lsL5/t5bO9fLaXz/by2V4+28tne+Vsr5ztlbO9crZXzvbK2V452ytne+Vsr5zt2dmene3Z2Z6d7dnZnp3t2dmene3Z2Z6d7dWzvXq2V8/26tlePdurZ3v1bK+e7dWzvXq218722tleO9trZ3vtbK+d7bWzvXa218722tleP9vrZ3v9bK+f7fWzvf5qr44/7fyznn+2889Xeyn9029yHBekC15Npjzg1WZqA/IF5QK7oF7QLni1LOOfj6EyIV0gF7xaljIgX1BOGANCbMAYoWN7xhCYUC6wC+oF7YKXXV87KGMgTEgXyAWj5bGpYzBMKBeMdvoLxvGedYBcoBfkC8oFdsFre7L/83ZBP2Ec+BPGL3cMkAv0gvHjj73wo3v0hh/eDukCuUAvyBe8tsfGPx8H+YR6Qbvg1bLJC8aBPiFd8GrHxl6MY9nGTzAO5gn9hHE4T0gXyAWv7amjnXFITygX2AXjKByKcVhP6CeMA7iOY8OP2PEzjUO2jW4Zx+yEPkHHQTshXSAXvNppNiBfUC6wC0bLdUC7YLT8OgB0HLQT0gVywavlnga82uky4PWv+mhwHLQT0gVygV6QLxiD6Bj/fhzHJ9VFbdEYoserb3QcyyelRWNwHnmQtzK2UOuitqhflI9FadEY62Ow6zi8T8qLyqLhSGVQXTQcaexR7heVY1FaJIt0UV7kjrEtxRbVRW1Rv8iORWmRLNJFedFy2HLYcthy2HLU5ajLUZejLkddjrocdTnqctTlqMvRlqMtR1uOthxtOdpytOVoy9GWoy1HX46+HH05+nL05ejL0ZejL0dfjn458nEsSotkkS7Ki8oiW1QXtUXLkZYjLUdajrQcaTnScqTlSMuRliMthyyHLIcshyyHLIcshyyHLIcshyyHj2SRQWmRLBqOcfLL48x0Ullki+qitmg4dLTi43xSWiSLhkN1UF5ULvLxq3mQ/73Rso/VcVLMPlYn2aK6qC3qF/lYzWVQWiSLdNFw5GHzsTppOLK3Uhe1Rf0iH6uT0qLhGCfF7GN1Ul5UFg1HGTYfq5OGo9RB/SIfq5PSouEYJ9XsY3VSXlQW2aK6aDjMW+kX+VidlBa5Yxw5PlYn5UXeymt/i4+8cYotPvIm6aKxLeMsW3y8TaqL2qKxLePcW3y8TUqLZJEuyov80nC04uNtUl3UFg1Hex1hxcfbpLRoOFoZpIvyIncMm4+3cVYuPt76Magt6hf5eJuUFsmi0V4fW+Vja1Jd1Bb1i3xsTUqLZJEuyouWIy9HXo68HHk5ynKU5SjLUZajLEdZjrIcZTnKcpTlsOXwsdXHMeRja9K4hD9GD41xJOMqo4xxdFJeVBbZorqoLeoXjXF0Ulq0HG052nI0d9ggW+SOcRy0tqhf1P3fjmOj+98be9Tbon6SHceisS3pGCSLdFFeNLYlySBbVBe1RcMxrpvM74EmpUWySBflRe4og2xRXdQWXX1qcixKi2SRLsqLyiJbVBe1Rcuhy6HLob4fNkgX5UVl0fW7mdZFbVG/KB+L0iI5f1XLuigvaucvbSVdv2WRRbooLyrXb1lsUV3UFvXrt7RjUVoki9YvaOsXtLJo/YK2fkFbv6CPMicfM2nskY8AGVvgI2BSWWSL6qK2aLQnr7OLjTPJSWmRLHKHDsqLyiJ3jK330TOpLeonVR89k9IiWeSOMigvKotskbf86sk6R8CrD6ofz2OPqh/Pk2SRLsqLyiI797L68TypLbp6qPrxPPa3+vE8SRbptR9+PE8qi2xRXdQWrR7y49n30o/nSbJo9VAuVx/4USyjD/wonqSL8qKyyBbVRW1Rv8iP4knLYcthy2HLYcthy2HLYcthy1GXoy5HXY66HHU56nLU5ZgjoA/Ki8pFfsSOBz3Vj9hJtmhs37hmrX7ETuonNT9iJ6VFsmh4swzKi8oiWzQc42FP82N3Ur9oPvPKg9IiWeSOMigvKotskTvGVvlYyHVQWiSLdJG31wf5g7Rj0GhvPE5qPhYmtUX9Ih8LZeybj4VJskgX+bO6sR8+Asa1cvMRMK6Gm4+AMrbAR4CNv+cjYFJaJIt0UV5UFg2Hjd4YV0snDce43m25X1SORWmRLNJFw1FHKz56Jtmiumg46tg3Hz1OPnomDce43m0+eibpIncMm4+eNnrXR8+kuqgt6hf56Jk0HG30uI+eSbooLyqLbFFd1Bb1i/zqa9JytOVoy9GWw0feuDJvfu6ZVBe5Y/San3uc/NwzKS2SRbooL6qLVnv9aq/7qB3X/N1H7SRZpIvyorLIFtVFbVG/KC1HWo60HGk50nKk5UjLkZYjLUdaDlkOWQ5ZDlkOWQ5ZDlkOWQ5ZDlkOXQ5dDl0OXQ5dDl0OXQ5dDl0OXY68HHk58nLk5cjLkZcjL0dejrwceTnKcpTlKMtRlqMsR1mOshxlOcpylOWw5bDlsOWw5bDlsOWw5bDlsOWw5ajLUZejLkddjrocdTnqctTlqMtRl6MtR1uOthxtOdpytOVoy9GWoy1HW46+HH05+nL05ejL0ZejL0dfjr4c/XKkYw30F6ZACdTAHFgCLbAGtsCwpbClsKWwpbClsKWwpbClsKWwpbBJ2CRsEjYJm4RNwiZhk7BJ2CRsGjYNm4bNk2A8AXlhDiyBrjDHFtgXegqMOZAXpkAJ1MAcWAItsAa2wL6whK2ErYSthK2ErYSthK2ErYSthM3CZmGzsFnYLGwWNgubhc3CZmGrYathq2GrYathq2GrYathq2GrYWtha2FrYWtha2FrYWtha2FrYWth62HrYeth62HrYeth62HrYeth68uWjiMwBUqgBubAEmiBNbAFhi2FLYUthS2FLYUthS2FLYUthS2FTcImYZOwSdgkbBI2CZuETcImYdOwadg0bBo2DZuGTcOmYdOwadgiS1JkSYosSZElKbIkRZakyJIUWZIiS1JkSYosSZElKbIkRZakyJIUWZIiS1JkSYosSZElKbIkRZakyJIUWZIiS9LMEnO0wBrotubYF84smTiqHsYj3OQlLBdq4Kh9ONw2suRCt3XHGtgCR33FmIBOXtpyYQqUQA3MgSXQAmtgCwxbD1sPW3ebd0nXwBxYAi2wBrbAfqFXxVyYAiVQA3NgCbTAGtgCw5bClsKWwpbc1hxzYAm0QG93/Fgy8kFHTU86q2km5sAS6DU14lgDW2Bf6AU0SR1dnB1rYAvsC/MRmAJ9IydqYA4sgRZYA1tgXzgG+oUpMGzFbV48V7xd7+pSA1tgX2hHYAqUQA3MgSXQbf5jWQ1sgX1hPQJToARqYA4sgWGrYathq2FrYWtha2FrYWtha2FrYWtha2FrYeth62HrYeth62HrYeth62HrYevL5jVDF6ZACdTAHFgCLbAGtsCwpbClsKWwpbClsKWwpbClsKWwpbBJ2CRsEjYJm4RNwiZhk7BJ2CRsGjYNm4ZNw6Zh07Bp2DRsGjYNWw5bDlsOWw5bDlsOWw5bDlsOWw5bCVsJWwlbCVsJWwlbCVsJWwlbCZuFzcJmYbOwWdgsbJElGlmikSUaWaKRJRpZopElGlmikSUaWaKRJRpZopElGlmikSUaWaKRJRpZopElGlmikSUaWaKRJRpZopElGlmikSVe66RjliV5sdOFJXDYdOKwjSqY5AVPF/YLveTpwhQogRqYA0ugBdbAFhi2FLYUthQ2Tw2dZdreQnfsCz0fTkyBEqiBY3vzrPUugRZYA4dtTFQkr3E60fPhxGEbMxTJy5wu1EC3NccSaIE10G2+kZ4EY5YjeWnThRqYA0e7YwbjhaPdoo6j3eLd50lwYl/oSXCi22aZuwRqYA50m++bD//i2+vD33xzfPibb44Pf/O/68P/RAnUwBxYAi1w2Mw7yof/RB/d89Dw0X1iDoxjx0f3iTWwBfaFPrpPTIFha2Hz0V195310n2iBNbAF9oU+uk9MgRKogWHrYeth62HrYfPRPaqgXneIR2AKlEANzIFu644WWANb4LCNeuXkpVYXpsBhG1MwyautXudcxxxYAodtTMgkr7i6sAW6bQxIL7q6MAVKoAbmwBJogTWwBYZNw6Zh07Bp2DRsGjYNm4ZNw6Zhy2HLYcthy2HLYcthy2HLYcthy2ErYSthK2ErYSthK2ErYSth86jw57Rer3WiR8UoeHthCpRADRw2f5BQPCq6HwQeFSfWwBbYF/qVwokpcNj6fBtHA/1sOv+Cn6Xn/9oC+8J5TTAxBUqgBubAEmiBYWtha2HrYeth62HrYeth62HrYeth62Hry2bHEZgCJVADc2AJtMAa2ALDlsKWwpbClsKWwpbClsKWwpbClsImYZOwSdgkbBI2CZuETcImYZOwadg0bBo2DZuGTcOmYdOwadg0bDlsOWw5bDlsOWw5bDlsOWw5bDlsJWwlbCVs8VTCSthK2ErYSthK2ErYLGwWNgubhc3CZmGzsFnYLGwWthq2GrYathq2GrYathq2yBKLLLHIEossscgSiyyxyBKLLLHIEossscgSiyyxyBKLLLHIEossscgSiyyxyBKLLLHIEosssciSGllSI0tqZEmNLKmRJTWypEaW1MiSGllSI0tqZEmNLKmRJTWypEaW1MiSGllSI0tqZEmNLKmRJTWypEaW1MiSGllSI0tqZEmNLKmRJTWypEaW1MiSGllSI0tqZEmNLKmRJTWypEaW1MiSGllSI0tqZEmNLKmRJTWypEaW1MiSGllSI0tqZEmNLKmRJTWypEaW1MiSGllSI0tqZEmNLKmRJTWypEaW1MiSGllSI0tqZEmNLKmRJTWypEaW1MiSGllSI0tqZEmNLKmRJTWypEaWVM+SPq6uqmfJiSlQAjUwB5ZAC6yBLTBsPWw9bD1sPWw9bD1sPWw9bD1sniU+E+RljxemQAl82bJPCnnp44Ul0AJrYAt027ix8QLIC1OgjL+bHDUwB5ZAC6yBLbAvFG9MHXNgCbTAGtgCvbFx9ep1kBemQAnUwBxYAm1h9sa8f/1V4hMlUANzYAkcjaXZWA1sgX2hv1zsR7VXQV4ogcPmsw9eCHlhCXSbi4vb/HcbSZDFu3okwYkjCS5MgRKogcPmD9i8JvJCC6yBLbAvrEdgCpRADQxbDVsNWw1bdZt3X+0L2xE4bH6H7UWSF2pgDiyBFlgDW2BfOJLgwrD1sPWwdbf5pvcSaIE1sAX2C72U8kK3qaMEuq065sASaIE1sAUOW/bGRhJcmAIlcNhGXXTywsoLS+Cw+XNEr63M/gzPiysv7AvHVcWFKVACNTAHlsBh82eDXmV5odt8czwqJnpUnJgC3dYch82f93mx5YUl0AJrYAvsCz1LxmuDyWsuLxw2f47oVZcX5sAS6O36DnlqTPTUODEFerv+a3pqnJgDS6AF1sBhq7OxvtBT48QUOGzVu89T48QcOGyjMjt52eWFNdBtLvbUqP4DeGr4ozSvvbxQAjUwB5bAYWve1Z4aJ7bAvtBT48QUKIEamANLYNha2FrYWtg8NZp3n6fGiRLoNu8dT40TS6DbfGR5apzYAvuJ4nWZF6ZACdTAHFgCLbAGtkC3VV+E5AhMgRKogTmwBFpgXej5MB6PiVdgXiiBGjjaHc/PxCswL7TAGtgC+0LPh+6NeT6cKIEa6LbuWAItsI7lQQ7HFtgX+ho9h4t9mZ5xZSNejPl6Ju2ogTmwBFpgDXSb/0K+fM9EX8HnxBQogRqYA0ugBdbAsJWwWdh8CZTD+8wXQTlRA4cteT/4cj8nWmANbIF9oa/+k7wxXwDoRAnUQLf5L+SLAZ1ogcMm/gv5qkAn9oW+NpC42JcH8qVxvBjzQg3MgSXQAt3mv5uvGXRiX+grB52YAiVQA3NgCbTAsPWw9WXzYswyXugSL8a8UALd1hxzYAm0QLeNTp3rb42rFZlLcJ0ogRqYA0vgaFdnYzWwBfaFvjpXPhxToAQOW06OObAEDtt4cUzmkl0ntsC+0Nfu8nWE5nJd4ypI5opdJ5ZAC/R2zdHb9f71fMjefZ4PJ6ZACXSb77Hnw4kl0AKHzRcpmmt6Fd9eD4Xim+OhUHxzPBR82aG5vteJObAEWmANbIHD5gsVzUW/TvR/5mIf3Se2QP9nvps+uk9MgRKogTlwbKQvTTRX+zqxBrbAYas+Anx0n5gCh82XN5pLgDXfNx/dJ5ZAC6yBLbAv9NF9YgqUwLD1sPWw+ehu/mv66D6xBbpt/LBeHnlhCvTGmuP4Z+NdAvE6x+KnRa9zvDAFjo0caxGI1zlemANLoAXWwBbotvFb+EpiF6ZACXRbdcyBJdBtvkM+eE9sgX2hD94TU6AEuq075sASaIFuK44tsC8cQ9qOuTpaCpTAMtC7ZJzG7Zj/rA/0fStHYAr0Fnx7x4i9MAeWQAusgS3Qbb5DdgSmQAmM38Lit7D4LSx+C4vfwuK3sPgtavwWNX6LGr9Fjd+ixm9R47eo8Vv4amhprjbXAvtCXxPNrx/mqmgnjn1L/gOMgX5hDiyBoyeT72Zzm4tbC+wL+xGYAiVQA4fNrzW8aPLC0a7MxfL6hV4eeeFo168qvDzyQg30dotjCbTAGtgC+8J0BLrNHCVQA3Og20b/esmj+aWElzxeKIGjhfHoRLzk8cISOLbXFw30kscLW2BfOEb3hSlQAt3mW6Y5sARaoPfOOBC9jNHU9y1rYA4sgRZYA8f2+vWDlzGe6KP7xBQ4bH6B4WWMF+bAYfOrCi9jvLAGus3FPrr9WsPLGM0vD7yM8UIJ1MAcWAKHzddA9DLGC1tgX+grF56YAiVQA3NgCQxbDVsNm4/u4n3mo/vEFOg27wcf3SfmwBJogTVw2Gw21hf66D4xBQ6bL83oZYwX5sBhMx9O4zRu1fdinMYvbIH9Qi9jvDAFSuCw1eSYA4fN13P0MsYLa2ALdNvYYy9jtPF0RryM8UIJ1MAcWAIt0G1zpc4WOGy+VKSXPF6YAiVwtOuXPl7ceGENbIHe7uhfL268MAVKoAbmwGHr3pgnwYk1sAUOm18b+VpuF6bAYfPrHS95vDAHus3FnhrdfwBPDT8BesnjhX2hp8aJKVAC3eZd7alxYgm0wBrYAvtCT40TU6AEhs3CZmEbqVH9eserHy9sgX2g7/xIjQtToARqYA582aqf0b088sIa2AKHzc/oXh55YQocNl9a18sjL8yBbvPfzddMPbEGtkC3+UZ2b7c6amAOLIHe7lyadrTr1wReCFn97O+FkBO9EPLCFDhsfhL2QsgLc2AJHDa/aPDqx+qnca9+rH6W9urHKnNd3KFQ/7sjFC7UwBxYAi2wBg7bKD8Vr348Ubxd3wbRwBxYAke7fpfvdY4XtsC+cITChSlw2Pxk6XWOF+bAEug27xKtgS3QbWMUep3jhSlw2OYywiMU6lxIeIRC9Xt0r3O80AJrYAvsC0coVF9f2OscL5TAYTMXj1C4sARaYA1sgcPmiwh7neOFKVAC3eZdYjmwBLrNu8RD4cQW6DY/5DwUTkyBEjhsfi70Je6qnwC9zvHCFtgX+vD3ZY29zrH6wwGvc6z+GMDrHC/MgSXQbb7HPvxPbIF9YXeb75sngZ/fvLixtrma9FD4TbwXN9Y2/64F1sAW2C/04sYLU6DbuqMGjnb93t/LGC9sgX2hD3+/G/cyxgslUANzYAm0sfDzbKwGtsC+cFwTND8zeBnjhRKoA8UxB5ZAt7lY3FYc3VYd+0I9AlOgBGqg27xTtQRaYA1sgX1hPgJToARqYNhy2HLYcthGKLTk3TdC4cQRChcOm58AvYzxQg3MgSXQAmtgC+wLzdtVRw3MgSXQ2/VOtRrYAvvCegSmwGETb2wM/wtzYAkcNj+/ecHihS1w2PxG1wsWL0yBbnNxc5v3+giF5repXrB4oQXWwBbYF44kaP7E20sTL8yBJdACa2AL7Bd6aeKFKVACNTAHlkALrIEtMGwpbClsKWwpbClsKWwpbClsPtD9Gb/XGF5YAi2wBrbAvtAH+okpUALDpmHTsPlA9wkDrzG8cNj8zt1rDE/0gX7iaMHv3L1CsPk9ulcInujD9MQUOLZsvMAlXiF4YQ4sgb5l1bEGtsC+cJy7m1+BeIXghRKogTmwBA6bX7h4heCFLbAv9MHrlyheIXihBGpgDiyBFlgDW2Bf2MLWwtbC5oPXL4i8QvDCEmiBbjPHFtgX9iMwBUqg27zXfUifWAK9sZElXurXxmto4qV+F+bAEjg20i/KvNTvwhbYF/rY9AcUXup3oQRq4Pq5vdTvQgtcP7eX+l24fm5fCfFCt2VHCdSFPgrPj1JIoAaOzfGrQV/BsPkVni9heGFf6OPt/LBFCvR2vc/8xHpiDiyBFlgDW6DbfNN9xJ6YAiVQA3NgCbTAGtgCw2Zhs7BZ2CxsFjYLm4XNwmZhs7DVsNWw1bDVsNWw1bDVsNWw1bDVsLWwtbC1sLWwtbC1sLWwtbC1sLWw9bD1sPWw9bD1sPWw9bD1sPWw9WXzSr4LU6AEamAOLIEWWANbYNhS2FLYUthS2FLYUthS2FLYUthS2CRsEjYJm4RNwiZhk7BJ2CRsEjY/d/u9k1fyXSiBblPHHFgCh83vs7yS78IWOGx+9+WVfBemQAnUwBxYAi2wBrbAsJWwlbB5ajTfec8Hfz7pNXsX9oWeDyd6C9VRAjUwB5ZA317vSc+HE1tgX+j5cGIKlEANzIElMGw1bDVsHgp+m+qFes3vQr1Q70INzIEl0AKHwh/ZeqHehX2hh8KJKVACNdDPDL6RPuZP7Ceq1+FdmAIlUAN909WxBFpgDWyBfaGP+RNToARqYNhS2FLYUthS2FLYJGwSNgmbhE3CJmGTsEnYJGwSNg2bhk3DpmHTsGnYNGwaNg2bhi2HLYcthy2HLYcthy2HLYcthy2HrYSthK2ErYSthK2ErYSthK2ErYTNwmZhs7BZ2CxsFjYLm4XNwmZhq2GrYathq2GrYathq2GrYathq2FrYWtha2FrYWtha2FrYWtha2FrYethm1FRHSVQA1+KPh5YqZfkXVgDW2C/0EvyLkwDq6MEamAOdFtztMAa6Lbu2BemI3DYxsMi9UK9CzUwBw5b8o0cUdHHAyD1krwT/VNrJ6ZAbzc7ervF0ds1xxJogTXQbb7H0hfqEZgC3eb7NvKhi2/vyIcuvjkjH7r45ox86DL/bgvsC0c+XJgCJVADh029o0Y+XDjaVd+G4n/BxaUEWmANbIF94RjSXb37xpC+UAI10G3eJVYCLdBtfpRYC+wL6xGYAiVQA93m/VBLoAXWQFf4DzsGZM/eUWNk9fG8RL0y7kINzIEl0AKHIntH+SA7sV/olXEXus0cJVAD3VYdS6AF1sAW2Bf6IDvRbc1RAjUwB7pi/IRebJW8Oky92mqxgSu4gXuwf4Tr4gQWsILhrfBWeCu8Fd4Kb4O3wdvgbfA2eOfHtcpkBfvfKd5V/jm8iw1cwQ3cF3tJVfLCGfWaqsXuHbf+6lVVi93rv4vXVS02sHvHUwz10qrFPdg/3nVxAgtYwRk8vdXZwBXcwD1YDnACC1jBGQyvwCvwCrwCr8Kr8Cq8Cq/Cq/D6J71s3NXp/DDmxQrO4AI2cAU3cA/2j3xdDG+Bt8Bb4C3wFngLvAXeAq/Ba/DO8TuPwzl+T8axWnGszvF7cgHP7TmcK7iBe/Acv+OZms7PYF4sYPRDQz809ENDPzT0Q0M/NPTD+bE9H4/n5/YmC1gXz49czn2cn7m8WMAKzuACjv6Zn7y8uIGjf+aHL2c/zE9fXizg6J/5AcyLC9jAFdzA0T/zY5jnvksCCxj9o+gfRf8o+kfRP4r+UfSPon8U/aPoH0X/ZPRPRv9k9A/Gb8b4zRi/GeM3Y/xmjN+M8ZsL+qegfwr6p6B/DP1j6B9D/xj6x9A/hv4x9I+hfwz9Y+ifiv6p6J+K/qnon4r+qeifiv6p6J+K/qnon4b+aeifhv5p6J+O/unon47+6eifjv7p6J+O/unon47+6dE/5Yj+mR/RvFjA0T/lyOACNnAFN3D0T0nRPyUlsICjf+bHMuc+zs9lXixgBWdwAUf/zE9nXtzA6B9F/yj6R9E/iv5R9I+ifxT9o+gfRf8o+iejfzL6J6N/MvqnoH8K+qegfwr6p6B/CvqnoH8K+qegfwr6x9A/hv4x9I+hfwz9Y+gfQ/8Y+sfQP4b+qeifiv6p6J+K/pljOfs+zrF8cgU38LyO9X2cY/nkBBbwvH72/Z3n6JML2MDzOrY4N3Bf7HVC3T/Y7nVCF6bAcaPj32b3OqELc2AJHPc848mvep3QhS2wL/RnDOMZr3qd0IUSqIE5sARaYA1sgX2hhk3DpmHzBwv+5Xmv/emjCFi99udEf4RwYgr0FrKjBubAEmgLizfmP0BJgRKogd6Y/xb+uOFEC6yBLbAv9McN/ljLVyi7UAI1MAeWQAusC/1hQfdf3h8WdP9h/WHBiTWwBfaF7QhMgRKogTkwbH68H/7Ezet1FjdwD/Zz4MUJLGAFZ3ABw9vh7fD28HpJz+IEFrCCM7iADVzBDQxvgjfBm+BN8CZ4E7wJ3gRvgjfBK/AKvAKvwCvwCrwCr8Ar8Aq8Cq/Cq/AqvAqvwqvwKrwKr8Kb4c3wZngzvBneDG+GN8Ob4c3wFngLvAXeAm+Bt8Bb4C3wFngLvAavwWvwGrwGr8Fr8Bq8Bq/BW+Gt8FZ4K7wV3gpvhbfCW+Gt8DZ4G7wN3gZvg7fBi7yqyKuKvKrIq4q8qsiriryqyKuKvKrIq4q8qsiriryqyKuGvGrIq4a8asirhrxqyKuGvGrIq4a8asirhrxqyKuGvGrIq4a8asirhrxqyKuGvGrIq4a8asirhrxqyKuGvGrIq4a8asirhrxqyKuGvGrIq4a8asirhrxqyKuGvGrIq4a8asirhrxqyKuGvGrIq4a8asirhrxqyKuGvGrIq4a8asirhrxqyKuGvGrIq4a8asirhrxqyKuGvGrIq4a8asirhrxqyKuGvGrIq4a8asirhrxqyKuGvGrIq4a8asirhrxqyKuGvGrIq4a8asirhrxqyKuGvGpnXhVnA1fw9B7OPfjMq8nTW50FrOAMLmADV3AD98X9zKvJCSxgBWdwARu4ghsY3gRvgjfBm+BN8CZ4E7wJ3gRvglfgFXgFXoFX4BV4BV6BV+AVeBVehVfhVXgVXoVX4VV4FV6FN8Ob4c3wZngzvBneDG+GN8Ob4S3wFngLvAXeAm+Bt8Bb4C3wFngNXoPX4DV4DV6D1+A1eA1eg7fCW+Gt8FZ4K7wV3jOvunMFN3APPvNqcgILWMEZXMDwNngbvA3eDm+Ht8Pb4e3w9uXNx7HmS/ORDnACC1jBGVzABq7gBoZX4BV4BV6BV+AVeAVegVfgFXgVXoVX4VV4Fd685mzzMZ87njznEuffyeACXnOY+cgV3MA9uBzgBBawgjO4gOEt8BZ45/PIUQqQD1vPAvNhFdzAPbiuZ4H5qAksYAWvZ4H5qAVs4Aqezzt9O8/5BOdzPmFyAgtYwfM5q+/jOU842cAV7N7m2zyfQU6e8xInJ7CAFZzBBWzgCoa3hzcdB3h6xVnACs7g6VVnA1dwA/fgmQ8nT292FrCCZ5vjmE9zjI9HsznNMX6ygBU8t7k6F7CBK3huc3fuwXOMn5zAcWwkVXAGF7CBK7it4ySdcxTO5xzF5ASecw7eJzMrTs7Bc96g++87x2D3Pp9j8OQG7sFzDJ6cwO7t/rvMMXhyBhfw9PpvMcfgyQ08vd4PcwyenMACVnAGF/D0el/NMXhyA/fgOe6691tf9S9ZYr49S8y3Z4n59izz+D+5ght4zedkOeflJiewgOexJM4ZXMBrPidLzLdnifn2LDHfnkUOcAILeM3nZJlj5+QCNvB0pcHzWjdN9muP5G3Oa9qTe/C8pj05gQWs4AwuYAPDm+HN8BZs57xGPdnAsx3fx3mNenIPnteoJyewgBWcwQVs4On1Y29eo548veNYnXVwF/vfF9/meW15cg+e15YnJ7CAFZzBBWxgeBu8Dd553Si+X/O6cbyOnGe92yG+X/M+92RvU/34n/e5J/fFs97t4gQWsIIz2L2jiDXPerdjrJWVZ73bMV7azbPe7Rilp3nWtR2jwjPPuraLFZzBBWzgGjzvW0flap71axcLWMEZXMAGnv0zcmbWnR3Z93feb55s4Ar2/c3eJ3NsTp5j8+QEFrCCM7iADVzB8GZ4C7wF3gJvgbfAW+At8BZ4C7wFXoPX4DV4DV6D1+A1eA1eg9fgrfBWeCu8Fd4Kb4W3wlvhrfBWeBu8Dd4Gb4O3wdvgbfA2eBu8Dd4Ob4e3w9vh7fB2eDu8Hd4Obw/vrK27OIEFrOAMLmADV3ADw5vgTfAmeBO8Cd4Eb4I3wZvgTfAKvAKvwCvwCrwCr8Ar8Aq8Aq/Cq/AqvAqvwqvwKrwKL/IqI68y8iojrzLyKiOvMvIqI68y8iojrzLyKiOvMvIqI68y8iojrzLyKiOvMvIqI68y8iojrzLyKiOvMvIqI68y8iojrzLyKiOvMvIqI68y8iojrzLyKiOvMvIqI68y8iojrzLyKiOvMvIqI68y8iojrzLyKiOvMvIqI68y8iqfWSTOCs7gAjZwBTdwX1zOLJqcwAJWcAYXsIEruIHhTfAmeBO8Cd4Eb4I3wZvgTfAmeAVegVfgFXgFXoFX4BV4BV6BV+FVeBVehVfhVXgVXoVX4VV4M7wZ3gxvhjfDm+HN8GZ4M7wZ3gJvgbfAW+At8BZ4C7wF3gJvgdfgNXgNXoPX4DV4DV6D1+A1eCu8Fd4Kb4W3wlvhrfBWeCu8Fd4Gb4O3wdvgbfA2eBu8Dd4Gb4O3w9vhRV4V5FVBXhXkVUFeFeRVQV4V5JUhrwx5ZcgrQ14Z8sqQV4a8MuSVIa8MeWXIK0NeGfLKkFeGvDLklSGvDHllZ4Z057kNxdm3wZ8t28yQkxNYwArOwTMHxtI92WYOnCxgBWdwARu4ghu4Bxd4C7wF3jnGx0I/2eYYL94Pc4yf3IPnGD85gQWs4AwuYAPDa/AavHMsm/fnHLPm2z/H7MkV3MA9eI7ZkxNYwArOYHgbvA3eBu8ca2OZoHzWQ/rzurMe0vmshzw5gQWs4AwuYANXcAPDm+BN8M4x5c/0znrIkzO4gA1cwQ08vWNMnfWQJ7t3LFySz3rIkxWcwQVs4Apu4B48x+/J8Cq8Cq/CO68BfJ7irIc8uYIbuAfPsX9yAk+v988c+ydPb3UuYANXcAP34Dn2T05g9/pcwFkPeXIGF7CBK7iBe/DMh+79NvPhZAErOIML2MAV3MA9uMJb4a3wzqzofpxXjIWGsdAwFhrGYMMYbBiDDWOwYQw2jMGGMdjg7fB2eDu8HWOwYwx2jMGOMdgxBjvG4Jk5g8+aRh+DZ03jyTEWzprGkzO4gA1cwQ0cY/CsaTw5geFN8CZ4E7wpxuBZ03hyA8cYPGsaT05gAccYPGsaT44xeNY0nlzBDRxj8KxpPDmBBRxj8KxpPLmADVzBDRxj8KxpPDnGwlnTeLKCM7iADVzBDRxj8KxpPBneAm+Bt8R4PGsUfa7wrFE8OYFnO36snhkyOYML2MAV3MA9+MyQyQkMb4W3wjuvSXwe86xRPLmCG7gHz/w5OYEFrOAMhrfB2+CdOePzoWfN4ezPmScnFzD6raPfOvqtR7+dNYcnJ7CAFZzBBWzgCm7g6Lez5vDkBBawgjO4gA1cwQ0Mr8Ar8M7c8H4+awh9TvmsITy5B898ODmBBazgDC7guf3duYIbuAef+TA5gQWs4Awe3jTqY/OsIby4gpuzOvdgz4eLE1jACs7gAjZwBcNb4DV4bbafnWc7/ntZBTdwD64HOIEFrOAMLmB4K7wV3jbb9z738Z58PnrW+F1s4Apu4B7sOXBxAgt4/tvXWHs9npx/pzoLWMFz27pzAfu2jQ8+FF8A7sXJuYF7sI/lixPYvWMB7DJrBS/OYPeKb3My8PSa8/T6Nvv4Surb5uPrZB8XSb1NHxcXC1jBGVzABq7gBu7BBd4Cb4F3HvPq+zKP+ZMbeLbZBs9j/uQEFrCCM7iADVzBDQxvhbfCO8eC+rExj/nsv+885k/uwX5OvDiBfdvGc5sy699S9t+6F7CBK7iB++JZ/3ZxAgtYwRlcwOGdtW1p1D2WWdt2sYAVnMEFbOAKbsF+HZvGesVl1rxdnMEFbOAKbuAe7OepixMYXoVX4dXZZnbuwXOsnZzAs03vwzmmxhrTJc0xdXIFN3APnmPq5AQWsIIzGN4Cb4F3jqnxbKqkOaZOVnAGF7CBK7iBe/AcUyfDW+Gt8M6xNp6VlTSP+fFV0yLz2B6LZJdZw5bGs6kya9guNnAFN3APnsf5yQksYAXDm+BN8M5jY9TdlVkPdrGAFZzBBWzB83gY9ZBF5vFwsoBnm805gwvYwBXcwD145vDJCSxgeA1eg9fgNXgNXoO3wlvhrfBWeCu8Fd4Kb4W3wlvhbfA2eBu8Dd4Gb4O3wdvgbfA2eDu8Hd4Ob4e3w9vh7fB2eDu8PbyzDu3iBBawgjO4gA1cwQ0Mb4I3wZvgTfAmeBO8Cd4Eb4I3wSvwCrwCr8Ar8Aq8Aq/AK/AKvAqvwqvwKrwKr8Kr8Cq8Cq/Cm+HN8GZ4M7wZ3gxvhjfDm+HN8BZ4C7wFXuSVIq8UeaXIK0VeKfJKkVeKvFLklSKvFHmlyCtFXinySpFXirxS5JUirxR5pcgrRV4p8kqRV4q8UuSVIq8UeaXIK0VeKfJKkVeKvFLklSKvFHmlyCtFXinySpFXirxS5JUirxR5Nevf0nhWXGb928Vt8ax5S+PZb5k1bxcL2F3jG19l1rxdXMDT1Z19X8bz2DJr2y5OYG9/PF8ts7bt5JkD3f/OHL/dt3OO35MzeP59/7dz/Hbf5jl+T/b9Hc+IyqwHO3mO38lzHI1nJmXWZV2s4AwuYANXcAP34DmOTobX4DV4fSzI4fvrY+HiBBZn318fCxdncAEbuIIbuAe3A5zA8DZ4G7wN3gZvg7fB2+Dt8HZ4O7wd3j69/pv2AjZwBTdwXzzrry5OYAErOIML2MAV3MDwJngTvAneBG+CN8Gb4E3wJngTvAKvTK85C1jBGTy9zdnAFdzAPVjjOryc59zJDex/f6zLXWbd1MUJLGAFZ3ABG7iCGxjeAm+Bt8Bb4C3wFngLvAXeAm+B1+A1eA1eg9fgNXgNXoPX4DV4K7wV3gpvhbfCW+Gt8FZ4K7wV3gZvg7fB2+Bt8DZ4G7wN3gZvg7fD2+Ht8HZ4O7wd3g5vh7fD28M766YuTmABKziDC9jAFdzA8CZ4E7wJ3gRvgjfBm+BN8CZ4E7wCr8Ar8Aq8Aq/AK/AKvAKvwKvwKrwKr8Kr8Cq8Cq/Cq/Airwx5ZcgrQ14Z8sqQV4a8MuSVIa8MeWXIK0NeGfLKkFeGvDLklSGvDHllyCtDXhnyypBXhrwy5JUhrwx5ZcgrQ14Z8sqQV4a8MuSVIa8MeWXIK0NeGfLKkFeGvLIzr7JzDz7zavJ0mbOCM3i6qvN0decKbuAePDNqfNmhzHX5RNw7M8rnMua6fBe7d3zIs8x6M/G5jLku38Xu1dmme3W22RfPOjQZ75GVWYd2sYAVnMEFbOAKbuAenOBN8CZ4E7wJ3gTvzB+fa6hn/nTnBBbw/LeTfdvGe3Bl1oyJzzXMmrGLE1jACs7gArbgmQM+fzFrvS4u4Pn31bmCG7gHzxw4OYEFrOAMLmB4C7wF3gKvwWvwGrwGr8Fr8Bq8Bq/Ba/BWeCu8Fd4Kb4W3wlvhrfBWeCu8Dd4Gb4O3wdvgbfA2eBu8Dd4Gb4e3w9vh7fB2eDu8Hd4Ob4e3h3fWiV2cwAJWcAYXsIEruIHhTfAmeBO8Cd4Eb4I3wZvgTfAmeAVegVfgFXgFXoFX4BV4BV6BV+FVeBVehVfhVXgVXoVX4VV4M7wZ3gxvhjfDm+FFXjXkVUNeNeRVQ1415FVDXjXkVUNeNeRVQ1415FVDXjXkVUNeNeRVQ1415FVDXjXkVUNeNeRVQ1415FVDXjXkVUNeNeRVQ1415FVDXjXkVUNeNeRVQ1415FVDXjXkVUNeNeRVQ1415FVDXjXkVUNeNeRVQ1415FVDXjXkVUNeNeRVQ1415FVHXnXkVUdedeRVR1515FVHXnXkVUdedeRVR1515FVHXnXkVUdedeRVR1515FVHXnXkVUdedeRVR1515FVHXnXkVUdedeRVR1515FVHXnXkVUdedeRVR1515FVHXnXkVUdedeRVR1515FVHXnXkVUdedeRVR1515FVHXnXkVUdedeRVR1515FVHXnXkVUdedeRVR1515FVHXnXkVUdedeRVR1515FVHXnXkVUdedeRVR1515FVHXnXkVUdedeRVR1515FVHXnXkVUdedeRVR1515FVHXnXkVUdedeRVR1515FVHXnXkVUdedeRVR1515FVHXnXkVUde9cgrOyKv7Ii8siPyyo7IKzsir+yIvLIj8sqOyCs7Iq/sOOBN8CZ4E7wJ3jOvzLmADTxdzbkHnxk1ed032SEKzmBvf7w3Z3P9vYsruIF78MylkxNYwArOYHgVXoVX4VV4M7wZ3gxvhjfDm+HN8GZ4M7wZ3gJvgbfAW+At8BZ4C7wF3gJvgdfgNXgNXoPX4DV4DV6D1+A1eCu8Fd4Kb4W3wlvhrfBWeCu8Fd4Gb4O3wdvgbfA2eBu8Dd4Gb4O3w9vh7fB2eDu8Hd4Ob4e3w9vDO+shL05gASs4gwvYwBXcwPAmeBO8Cd4Eb4I3wZvgTfAmeBO8Aq/AK/AKvAIv8iohrxLyKiGvEvIqIa8S8iohrxLyKiGvEvIqIa8S8iohrxLyKiGvEvIqIa8S8iohrxLyKiGvEvIqIa8S8iohrxLyKiGvEvIqIa8S8iohrxLyKiGvEvIqIa8S8iohrxLyKiGvEvIqIa8S8iohrxLyKiGvEvIqIa8S8iohrxLyKiGvEvIqIa8S8iohrxLyKiGvEvIqIa8S8iohrxLyKiGvEvIqIa8S8iohrxLyKiGvEvIqIa8S8iohrxLySpBXgrwS5JUgrwR5JcgrQV4J8kqQV4K8EuSVIK8EeSXIK0FeCfJKkFeCvBLklSCvBHklyCtBXgnySpBXgrwS5JUgrwR5JcgrQV4J8kqQV4K8EuSVIK8EeSXIK0FeCfJKkFeCvBLklSCvBHklyCtBXgnySpBXgrwS5JUgrwR5JcgrQV4J8kqQV4K8EuSVIK8EeSXIK0FeCfJKkFeCvBLklSCvBHklyCtBXgnySpBXgrwS5JUgrwR5JcgrQV4J8kqQV4K8EuSVIK8EeSXIK0FeCfJKzrzKzj34zKvJc76pOys4gwvYwBXcwH2xnvNrkxNYwArO4AI2cAU3MLwJ3gRvgjfBm+BN8CZ4E7wJ3gSvwCvwCrwCr8Ar8Aq8Aq/AK/AqvAqvwqvwKrwKr8Kr8Cq8Cm+GN8Ob4c3wZngzvBneDG+GN8Nb4C3wFngLvAXeAm+Bt8Bb4C3wGrwGr8Fr8Bq8Bq/Ba/AavAZvhbfCW+Gt8FZ4zxqAyQau4JkVzbkHnxk12dsf79HYrAe+uIANXMEN3INnFp2cwAKGt8Pb4e3wdng7vD28szb44gQWsIIzuIANHN5Z9yvjvR6ba1peXMDz35pzBc9t7s49eGbLyb7NY91pm2taXqzgDC5gA1dwA/fgmS0nw6vwKrwKr8Kr8Cq8Cq/Cm+HN8GZ4M7wZ3gzvzJbqv8vMlpMbuAfPbKn+G81sOVnACs7BMx/GuiI2658vFvD8t9U5gwvYwBXcwD145sPJCSxgeCu8Fd4Kb4W3wlvhbfA2eBu8Dd4Gb4O3wdvgbfA2eDu8Hd4Ob4e3w9vh7fB2eDu8Pbxn7fTJCSxgBWdwARu4ghsY3gRvgjfBm+BN8CZ4E7wJ3gRvglfgFXgFXoFX4BV4BV6BV+AVeBVehVfhVXgVXoVX4VV4FV6FN8Ob4c3wZngzvBneDG+GN8Ob4S3wFngLvAXeAm+Bt8Bb4C3wFngNXoPX4EVeFeRVQV4V5FVBXhXkVUFeFeRVQV4V5FVBXhXkVUFeFeRVQV4V5FVBXhXkVUFeFeRVQV4V5FVBXhXkVUFeFeRVQV4V5FVBXhXkVUFeFeRVQV4V5FVBXhXkVUFeGfLKkFeGvDLklSGvDHllyCtDXhnyypBXZw32eB/KzhrskwXsrvFulJ111ycb2F3jmzt21l2f3INnRo3v49hZdz2+TWNn3fXJCs7gAjZwBTdwD54ZdTK8Cq/Cq/AqvAqvwqvwKrwZ3gxvhjfDm+HN8GZ4M7wZ3gzvzKjuv93MqJMFrGD3dv+NZkadbOAaPLOo++8+M6f7bzoz5+QCNvBsx5x9+7sfhzNzum//zJyTE1jACs7gAjZwBTcwvJ45Or6JaXPtzYsFrOAMLmADV3AD9+AOb4e3wzszZ7yLZ2dN9ckFbOAKbuC++KypPjmBBazgDJ77m5wNXMEN3IPTAU5gASs4g+FNs/1xTM46ah3v39mso9bxHpnNtTovzuACnttvzhXcwD1YD3ACC1jBGVzA8Cq8Cq/Cm+HN8Obprc4Kdm/yvvI8udjAFdzAPdjzRJO36XlysYAVPL1+nJQCNrB7x/pLNuu3L3av+O/oOXNxArtXfN89fy7OYPeKuzx/Lq7gBu7B9QAnsIAVnMHwVngrvBXeCm+Dt8Hb4G3wNnhn/qj34cwf9XEx8+fkBu7BM39OTmABKziDCxjeDm+Ht4d31m9fnMACVnAGF7CBK7iB4U3wJngTvAneBG+CN8Gb4E3wJngFXoFX4J15NdbUslm/ffH0ZmcDV3ADT+84Nmb9to73R2zWb18sYAVncAEb2L1eEzXrt0+eGeV1WbNm++LpKs4KzuACNnAFT5c59+CZUScnsIAVnMEFbOAKhndm0fh+qM3a7IsVnMGz/e5s4Apu4B48s+jk6fXfdGbRyQp2r88rzdrsiw1cwQ3cg2cWnZzA89m4u+a91ckV3MA9eN5bnZzAAlZwBsPb4e3wdnh7eM+665MTWMAKzuACNnAFNzC8Cd4Eb4I3wZvgTfAmeBO8Cd4Er8Ar8Aq8Aq/AK/AKvAKvwCvwKrwKr8Kr8Cq8Cq/Cq/AqvApvhjfDm+HN8GZ4M7wZ3gxvhjfDW+At8BZ4C7wF3gJvgbfAW+At8Bq8Bq/Ba/AavAavwWvwGrwGb4W3wlvhrfBWeCu8Fd4Kb4W3wtvgbfCe77p2ZwVn8Jx/n3/fwBU8M3Ccp2Z9tY71/WzWV1/sGTvW1rNZX33xzFh3zeufkz1jfY5p1ldf3C+us75axxxTnfXVFwtYwRlcwAau4AbuwQneBG+CN8Gb4E3wJngTvAneBK/AO69/xrp2ddZdX6zgDJ7e6mzgCm7gHjyvW8Z8XJ310hc3cA+e1zAnJ7CAFZzBBQxvhjfDm+Et8BZ4C7wF3gJvgbfAO683xrd666xhvriBfRuqH5PzeuPkBBawgjO4gA1cwQ0Mb4O3wdvgbfA2eBu8Dd4Gb4O3wdvh7fB2eDu8Hd4Ob4e3w9vh7eGdNcwXJ7CAFZzBBWzgCm5geBO8Cd4Eb4I3wZvgTfAmeBO8CV6BV+AVeAVegVfgFXgFXoFX4FV4FV6FV+FVeBVehVfhVXgV3gxvhjfDm+HN8GZ4M7wZ3gxvhrfAW+At8BZ4C7wF3gJvgbfAW+A1eA1eg9fgNXgNXoPX4DV4kVcJeZWQVwl5lZBXCXmVkFcJeZWQVwl5lZBXCXmVkFcJeZWQVwl5lZBXCXmVkFcJeZWQVwl5lZBXCXmVkFcJeZWQVwl5lZBXCXmVkFeCvBLklSCvBHklyCtBXgnySpBXgrwS5JUgrwR5JcgrQV4J8kqQV4K8EuSVIK8EeSXIK0FeCfJKkFeCvBLklSCvBHklyCtBXsmZV+acwAKeruZcwAZ215i/q7Nu+eIePDPq5AQWsO/j+BZMnXXLFxewgafXt2Fm1Mk9eGbU+P5LnXXL2n2/ZkadrGD39vlvC9jAFdzAPXhm1MkJLGAFw2vwGrwGr8Fr8HpG5cP31zMqH/5be0ZdrOAMLmADV3AD9+B2gOFt8DZ4G7wN3gZvg7fB2+Dt8HZ4O7wd3g5vh7fD2+Ht8PbwzhrmixN4etVZwdObnQvYwBU8vc3ZvWNdpjprmC9OYAErOIML2L1jzqXOGuaL/V54zK3Us2755AQWsIIzuIANXMENDK/Cq/AqvAqvwqvwKrwKr8Kr8GZ4M7wZ3gxvhjfDm+HN8GZ4M7wF3gJvgbfAW+At8BZ4C7wF3gKvwWvwGrwGr8Fr8Bq8Bq/Ba/BWeCu8Fd4Kb4W3wlvhrfBWeCu8Dd4Gb4O3wdvgbfA2eBu8Dd4Gb4e3w9vh7fB2eDu8Hd4Ob4e3h/esZx7PpupZz3yygOe7JM05gwt4eidXcAPPjBoZmM8sys4KzuACNnAFN3APlgOcwPAKvAKvwCvwCrwCr8Cr8Cq8Cu/ME3GeeXKy9794X808OXk+w/R+O58VT57bac4GruC5nf5b5x5cDnACC1jBGVzABq5geAu8Bq/Ba/AavAavwWvwGrwGr02v9+G85jk5gQXs3jHvX2ed88UFbOAaPK9PxjeY6qxJvriCfdvGN5jqrEk+eV6fnJzAAlZwBhewgSsY3h7eWZN8cQILWMEZXMAGruAGhjfBm+BN8CZ4E7wJ3gRvgjfBm+AVeAVegVfgFXgFXoFX4BV4BV6FV+FVeBVehVfhVXgVXoVX4c3wZngzvBneDG+GN8Ob4c3wZngLvAXeAm+Bt8Bb4C3wFngLvAVeg9fgNXgNXoPX4DV4DV6D1+Ct8FZ4K7wV3gpvhbfCW+Gt8FZ4G7wN3gZvg7fB2+Bt8DZ4kVcFeVWQVwV5VZBXBXlVkFcFeVWQVwV5VZBXBXllyCtDXhnyypBXhrwy5JUhrwx5ZcgrQ14Z8sqQV4a8MuSVIa8MeWXIK0NeGfLKkFeGvDLklSGvDHllyCtDXhnyypBXhrwy5JUhrwx5ZcgrO/OqOmdwAU9Xd27gHjwzatSJ1VmTfLGA3aXJOYML2MAV3MA9eGbUyQksYHhnRvl116w9zur9MLNo1DjVuebzyTOLTk5gASs4gwvYwNNrzg3cg2cWnZzAAlZwBhewgeGt8FZ4G7wN3gZvg7fB2+Bt8DZ4G7wN3g5vh7fD2+Ht8HZ4O7wd3g5vD++sVb44gQWs4AwuYANXcAPDm+BN8CZ4E7wJ3gRvgjfBm+BN8Aq8Aq/AK/AKvAKvwCvwCrwCr8Kr8Cq8Cq/Cq/AqvAqvwqvwZngzvBneDG+GN8Ob4c3wZngzvAXeAm+Bt8Bb4C3wFngLvAXeAq/Ba/AavAavwWvwGrzIq4q8qsiriryqyKuKvKrIq4q8qsiriryqyKuKvKrIq4q8qsiriryqyKuKvKrIq4q8qsiriryqyKuKvKrIq4q8qsiriryqyKuKvKrIq4q8qsirhrxqyKuGvGrIq4a8asirhrxqyKuGvGrIq4a8asirhrxqyKtZ25xHTW+dtc0XG9hdo763znrmk2dGnZzAAlZwBhewgX0fR81wnfXMF/fgmVEnJ7CAFZzBBWxgeBVehTfDm+HN8GZ4M7wZ3gxvhjfDm+Et8BZ4C7wF3gJvgbfAW+At8BZ4DV6D1+A1eA1eg9fgNXgNXoO3wlvhrfBWeCu8Fd4Kb4W3wlvhbfA2eBu8Dd4Gb4O3wdvgbfA2eDu8Hd4Ob4e3w9vh7fB2eDu8PbyzLvriBBawgjO4gA1cwQ0Mb4I3wZvgTfAmeBO8Cd4Eb4I3wSvwCrwCr8Ar8Aq8Ai/yqiOvOvKqI6868qojrzryqiOvOvKqI6868qojrzryqiOvOvKqI6868qojrzryqiOvOvKqI6868qojrzryqiOvOvKqI6868qojrzryqiOvOvKqI6868qojrzryqiOvOvKqI6868qojrzryqiOvOvKqI6868qojrzryqiOvOvKqI6868qojrzryqiOvOvKqI6868qojrzryqiOvOvKqI6868qojrzryqiOvOvKqI6868qojr3rkVTsir9oRedWOyKt2RF61I/KqHZFX7Yi8akfkVTsir9pxwJvgTfAmeBO8Cd4Eb4I3wZvgTfAKvAKvwCvwCrwCr8Ar8Aq8Aq/Cq/AqvAqvwqvwKrwKr8Kr8GZ4M7wZ3gxvhjfDm+HN8GZ4M7wF3gLvmVfVWcEZ7K4y2V2j/r/Ntakv7sEzo05OYAErOIML2MDwGrwGb4W3wlvhnVlkx+CZLScnsIB9O8e7DG3WY19cwAau4AbuwTNbTk5gAcPb4e3wdng7vDNbxjsFbdZjT5712BcnsIAV7N6xblWb9dgXG7iC3Ttq/Nqsxz55ZsvJ7h3rU7VZj52Lu2a2nJzB02vOBq7g6W3OPXhmy8kJLGAFZ3ABG7iC4RV4FV6FV+FVeBVehVfhVXgVXoU3w5vhzfBmeDO8Gd4Mb4Y3w5vhLfAWeAu8Bd4Cb4G3wDtzZnznus167Ivd28bYnPXYFyewgN3b/HibOdP8mJk5c7KBK7iBe/DMmZOntzoLeGapb/P5PXQfI+f30Cc38Gzf933m0skJLGAF+35139+ZSycbuIIbuAfPXDo5gQWsYHg7vB3eDm+Ht4d31l1fnMACVnAGF7CBK7iB4U3wJngTvAneBG+CN8Gb4E3wJngFXoFX4BV4BV6BV+AVeAVegVfhVXgVXoVX4VV4FV6FV+FVeDO8Gd4Mb4Y3w5vhzfBmeDO8Gd4Cb4G3wFvgLfAWeAu8Bd4Cb4F35sxYd6jN2uk81hRqZ81zz84FbOAKnu2bcw+e+XDy3K/qLGAFZ3ABG7iCp7c59+AzHyYn8HQV5/lvu3NffNYtn5zAY5vLWOumzbrlizO4OKuzgSu4gXuwj/GLk3N2nt7iPL3mPL3VebbZnHuwHOAEnm36fvk4LaPmuc0a4JJ8X/yYT+Mbo23W9F7s3jS5gA1cwQ3cg/2YvziBZ5veD2W26f1QKriBe7Ad4AT2/U3eh36evTiDC9jAFdzAPbjONv13qRlcwLNN/71qBTdwD24HOIEFrODZpv++rYF7cJ9t+u/eE1jACs7gAjZwXTxraMuoCWyzhvZiBXuboyawzRraiw1cwQ3cg+d4OXl6xXl61VnBGVzABq7g6c3OPXiOqZMTWMAKzuASrEf0iaLfFP2mGvuo6DdFvyn6TdFvin5T9Fs+oq9yiv3N6LeMfsvot4x+y+i3Od7nfmX0W0a/FfRbQb8V9FtBvxX02xzjMsbarKEtY12pNmtoLxawgmc71bmADVzBDdyD6/Q25wQWsIIzuIANPL0+dmYOqP/uMwcmzxw4OYEFrGD3qv/Wfg692MAV3MA9eGbFyQmc47eYmTD7eWbCyRXcwNGfs/724gQWsIIzOPqzHAau4AbuwekAJ7Cs32LW387+nPW3FxewgSu4gaM/Z/3txQksYAVncAEbeLY/xuCss714tl+cBazgDC5gA8/98j6feXJyD555cnICuzd7P8w8OTmDC9jAFdzAPXjmQ/Z+mNcGfn0y612LPzOc9a4XZ/D0ZmcDV/D0ej/MHJg8c+DkBBawgjN4es3ZwBXcwD32a47r7MfqHNcnG7iCG7gHz3FdvM05rk8WsILd68+4Zv1q8eeTs3714gpu4L541q9enMACVnAGF7CBK9i9/oxi1q+ePMf7yQksYAVnsHv9WeWsX73YvabO09uce/zvc7yfPL2+nXO8n6zgDC5gA1dwCx5j/DW556iBObAEWmANbAOrY184xvaFKdBtvsNZA3Og23zLsgXWwGHzx9ZelnriuEK4MAUO2/w5xuVBnz067gz6WLymeUHqhS2wLzRv1xy9Xd8L83Z9c0ZM9Oq2kRLdHxJ7IeqFFlgDh80fFnsR6okjHy5MgcPmD5O96LSPbxo0rznt/mjYS067P1H0itPefDdHGFzYF45LggtToARq4LD5U0WvNL1wHKjmN5WziPTiBBawgjO4gA1cwQ0c3llEenEC+9/3m9BZ/HmyD2TzG65Z/Hmxb6ffBM3iz4sz2LfTb4Jm8af5Dcss/ry4BfuANb9gnkWeFys4gwvYwBXcwD3YT9wXw6vwKrw62xmH1SzONL8In8WZFys4g+d2ZmcDV3ADz+0cR+gszrw4gQWs8buUDC5gA1dwA0+v/3Z2gBNYwHOb/ff1E675BdIskrzYwBXcwD3YL7xNvZ/9wvtiASt4er3fWgEbeHp9H1sD9+A5Hk9OYAEreHq9/+d4PNnAFTxd43iYxY02FnBrs7jx4gpu4B48x+PJCSxgBWcwvAneBO8cX36xNwsUL7bgHLk0C/wuLmADV3ADRy7NAr+LE1jA8BZ4C7zz+PSLyVmYd/Hcr/l3CtjAvp0+qT0L8y7uwX4henECC1jBGVzABoa3wlvhnce5X0zOgjrzyaNZUHdxD57H88m+ncV/u3k8n6zgDPbt9AvRWVB3cQU3sHv9YnUW1F2cwAJWcAZPrzkbuIIbeHpHn8yCuosTWMAKzuDp7c4GruAGdq9fHc2CuosTWMAKzmD3+sXtLKi7uIIbeHpHhsyCuosTeHq9P+f56+QcPMemX5vNgjTzK7JZkHZxBhewgSvYt9Mv52ZB2snzPHJyArvXL9NmQdrFGeze6vs1x+nJFdzAPXiO05MTeHqzs4IzuICny3+veUPnky+zAOziBBawgjO4gA1cwQ28vH0WgF08/20ZPG+yxqRPn0VZZUzW9FmUdXEGF/BspzlXcAP34HmTdXICT293nll9OM+sTs4zq8V5niPUuQbPhyrN92s+VDlZwArO4AI2cAX7fjXvq/lQpXk/zIcqzfdlPlRpvi/zocrJCs7gAjZwBTdwD54PaU+Gt8Bb4C3wFngLvAXeAm+B1+A1eA1eg9fgNXgN3vkwp/vvPh/mTJ4PZ7ofA/PBS/djoGLbKratYdsatq1h2xq2rWHbGratYdsa+qTB2+Dt8HZ4O7wd3g5vh7fD2+Ht8PbwzuKrixNYwLr6cxZfXdxX36ZzvItzbNsslLrYwBXcwNg2wbYJtk2wbaJgeAVegVfgFXgFXoVX4VV4FV6FV+FVeBVejeNzFkqdPMf17M85Zmd/YswmjNmEMZswZhPGbMKYTRizCWM2YcwmjNmEMZswZhPGbMKYTRizCWM2YcwmjNlZ1HQxvAZvhbfCOx/Azn6rOD7nuJ59OMfs7EOM2YQxmzBmE8ZswphNGLMJYzZhzCaM2YQxmzBmE8ZswphNGLMJYzZhzCaMWcGYFYxZwZidhUkXZ3BZfSXnedz5PI8n57L6TTBmBWNWMGYFY1YwZgVjVjBmBWNWMGYFY1YwZgVjVjBmBWNWMGYFY1YwZgVjVjBmBWNWMGZnEdHZPxizsyjo7Ksc5xTBeVYwZgVjVjBmBWNWMGYFY1YwZgVjVjBmBWNWMGYFY1YwZgVjVjBmBWNWMGYFY1YwZgXn2bno4sk1ckxq5JjgPCs4zwrOs4LzrGDMCsasYMwKxqxgzArGrGDMCsasYMwKxqxgzArGrGDMCsasYMxKR5/06JOzcMj75CwK8j45i4L8355FQScnsIAVnMEFbOAKbmB4MWYVY1YxZhVjVjFmFWNWMWbnwobnvkv0yVyo8OwHjbGjim1TbFvGtuHaWHFtrLg2VlwbK66NFdfGimtjxZhVjFnFmFWMWcWYVYxZxZg9i5rm/pbI2LNIae67RcYqxpdifCnOiYpzouKcqDgnzgUDL8a2VWxbRZ9UeCu8uDZWjFnFmFWM2bNIae5jU3Cci8+io7m/GF+K8aUYX4rxpRhfinOi4pyYcU7MOCdmnBMzzokZ58SzMOlkA1dwHMNnYdLkFOP6LCLyfcwYXxnjK2N8ZYyvjPGVMb4yxlfG+Mo4J2acEzPOiRnnxIxzYsY58Sw6mvuiGRzX9meB0NwvjK+M8ZUxvjLGV8b4yhhfGeMrY3xljK+M8ZUxvjLOiRnnxLko37n9Bb+XReacxT9zXzC+MsZXxvjKGF8Z4ytjfGWMr4zxlTG+MsZXxvjKGF9n8c/c5jm+TrbY/vP5j28/zl8Z56+M8ZUxvjLGV8b4yhhfGeMrY3wVjK+C8XUW8Ph2FtwnngU5vs1nsY1vc8H5q+D8VXD+Kjh/FZy/Cs5fBeOrYHwVjK+C8XUW28xtkwyO4/wsmJnbievDguvDguvDgnu6gvNXwfmr4PxVcP4qOH+dBTNzezK2LWPbCrYNY6FgLBSMhYLrw4Lrw4Lrw4Lrw4Lrw7OoZm6DYdsMv2nFb4qxUDAWCsZCwVgoGAsFY6FgLBSMhYKxUDAWCsZCwVgoGAsFY6FgLBSMhYKxcBa3TBeu5c5iFfeehSjuPQtR/N8aruUM13KGaznDtdxZiDLbTxkcv/tZNDJdOC8YzguG84LhvGC47jKJc5ZpnLNM45xlOG4Nx63huJ2LlZ3t4Li1HMfGXFjsbBMZbjhuDddIhmskwzWS4RrJcI1keNZnuAcxPOszPOuzyr+Dfmjoh3mcVP/f53Fysm9DnX/HwBXcwN7+mEfoc4GsMp7/97lA1sUZXMAGruAGnu2P5/CzRuLiBBawgjO4gKe3OFdwA/fgmbcnJ7CAFTxd5mzgCm7gHjyvYU5OYAErOIPhVXhnbo+PsPdZX3FxD57H/8kJLGD8phm/acZvmvGbzjwfZT991leU8fJgn3UUF2dwARt4jvHDuYHn+B3HYT2zffIcv35Mnvf+/vfPe//JGVzABobX4D2vnZzPa6fJCayx7xX7OMfpyQ3cgxv6qqHNhn05nxX4/p7PCiaX2PeGfWnYl4Z9adiXjn3p8HZ4O/qwow87+vDMCt/3Hvs4F6e6WMAKzuBosx0Grmt/23k+mtzXvrcU+9JSAgtYwRkMb4I3VXADRx82gUvgErgELoFL4BK4zvud7NyDz/udyQksYAVn8PSqs4EreHr1v//7n37781//7Q9//9Nf//Ivf//bH//42z//1/of/uO3f/4f//Xbv//hb3/8y99/++e//Oef//xPv/1/f/jzf/pf+o9//8Nf/M+//+Fvr//3tTd//Mv/ev35avB//+nPfxz03/8U//r4+J+2Ngqv/V+PYo/VwGsS54cm0sdN5FHF5S287thWA1V++Pfy8b/3z9L6v389MYgNqP32PvQx7+otvB7c1w/3IW+2wb/nODciJ0ETx90mkheOehMvLKuJ3n5owTYbMaaeZ0dWbELrdxuo4xpk/pbJVgNa6g8NtM0+WL024TVLUj9son/chBzt+jnlNfP2YRNp84O+nuBfXfl6UN8/bGPza1gdLy16E/Y6YUZvyk+bsTkwXw+yryNbXhcE0Ub58dgerx0++023OzKKi84dsfbxjpRNGxJtvJ7UrzbKj1uRNofW63CQdWRgjP3cRP24iZ6u3uyN47zeb6GvEXak8nETu8NTchxaJTYj/xgVsjk6X3PaqyuOkj7cDNlkpnm56PxFzLgZP8Xm5vAcX6m/2nidvz5uY3N4Sr4OjNeMTLRwfPPA6B8fGNvDs63OeE3EfNTEZpCMBVxW8pWPB4lsDq5qq42xnjdGe/6xjfZ4oEl/PND0eDrQti3cG2gqjwea6vOBpvn5QNPyfKCpPR1otw+Mjwfa/vC8NdC2o6SW64Q2Vtf9cJTk4/EoyenxKMnydJRsW7g3SnJ+PEpyeT5Ksj0fJbk+HyW5PR0ltw+Mj0fJ/vB8PkpaubZirFX74Sgp8niUFH08Skp+Okq2LdwbJcUej5JSn4+S0p6PktKfjxI7no6S2wfGx6Nkf3g+HiVjSczrqu3YXHFZfnyIW3l6iG9buHeIW318iFt7fohbf36I1+P5IV7T00P89oGxuVzaHp/rNxkrg358R7BrQ/TqjKb94zNB3RxerawnbG33HKLa9lnG9YxMGsda+0J/5LTusrLax/vSHo/X2p+O120L98ZrS4/Ha5Pn47Xp8/Ha8vPx2srT8Xr7wPjmeOXxyWd+Xxmv2dbz8Nw+Hq+tP3wg3o+nT8S3u+HrnczdKHlzm7Z7pmIruVJLHz5T6fr4GrY/P8H3xyf4/vwE35+f4PsbTvD9DSf4dLzhDJ+Ox6f4/vwUvz9AHz96bP3aj/G22cfP54+ym35qPaafcIaXn56iHm94RH88f0Z/vOEh/fH8KX1Kb3hMn9IbntOn9IYH9Sk9f1J/vOFR/e0jVcrmSN02ojkaqR83spsMurs3uza01hxn2vrRnG3azSjdnTNNuzml27Omkp5Pm+5/m7oONG26iSLZPrlPK1df4/Cwj+dO5fm5P8njk/++iZuJJs9P/0necP5P8o4LAH3HBYA+vgC4f4BsMkA+mWU64lhlv/5yrG6bqdVWM9125QK7p/l95aukYh/ep2/HcHbFvANJdnw8hrU+H3zaHg++bRM3B18+ng++7cTC3cG3mzG6PfiyvmHwbSee7g0+rb/v5cTr8MzrSG394yM1v+FIzc+P1PyGI7W84Ugt7zhSyzuO1PKOI7U8P1Lz736kIlN7+t6F7+tfrnIwkc3hXp4XmaTyvMok2eMyk30TN4eMPS80SfaGSpNkbyg1SfaGWpNkj4tN7h8gu7Ku5+Umu7ljPa7fdryK/PHDld18VDW7ru/GhyQ/vi7bTUiltH7cpD1/fF227RA9Vofo8c1O1fV02RT3Z78UYu4itdY1GVTxaPeXNsrzBNlNSt2tCLXnCbKberibILsppdsJ0o43JMhuZup2guzmpm4myO0DZJMg+wPVShyo+r02Wrv6Q/pxfNhG29VHlfV4xkrP32xjVc5t29jvy5oZki6bfXk8fbpv4m4d9vZhVdzo6qEfDrq+OUrzGi4ZQ+6XFp5P46btNMTdob+bYUqp1etQfz1uxCsov4zbvnvE+3rWtpp5PVRMm2Y2F8xlTaQWyR8P//64lO/uVmjaNLHtD3+8f/ZHQhHHL1Xyu7mqsb7pNRfaG3+b46dGdvP9JQ628W2TtNmW3USArcNNLMe22Fe2xD+Rc25JybLZkt0xK+sy4vW08OPj5CvbYrtt2TfTSjSDq80vNtPWu2Tj9cfj+81INKP9u83Udd4ZTW6OmN0k1uspjsS1q37vd7r9tsnzSax9E7WuM+BuV7bHbcNxq989bu2I49ZS+u5PbCVFM30TUKm949fpz3+d/vzX2feIxkFvZTMEt29HxeP41wSdfhST+xespK5ORT3Rl5qwtRWtftTEJ6cwWa8hvth2/WGPr5W2lyg9LnRS17LZkN0sVo7dyXVzdXH/QvjjarH9a1KrcEM2T1r39+JxP6/t463YXcPmFUavH+bj54qye1NKU1rz2K9j5OMNeT7ZKvp4snXfxL17C9Hnk62ib5hsFX3DZKvkN0y2Sn482Xr/ANlUaO4P1JzWgbp5QXLbRilXf2ip9s02cn/cRrUo07T+zTZyXW2Uj9vYzTvdfDjxSRu3Hk7s96VJVI7k+ryNkr7Xhq0zv7bNvmxfkGlxydzzbvTrbrYnoj3hXclfNqQ8/3H3bTz/cXNaIZSlHB9vxy5SvcvPCxkEyNc6Vdaoy/n4uFN30065rALtuvltbZOn2tejfO2yuWndTV3leFiTj7q59N/NXcm6WpbC7dAv9MeqYCv52Pwsu10p643HXOrHJX2ynbe6Ny8h9rwYQOxxMcC+iZuXMfV5MYDUNxQDSH1DMYA/D3p8GVMfFwPcP0A2lzH7A/XWvMS+jXvzElLfcNreb8etOQVpj0sB9k3cHDD3d2WzRII+vCv8JArXrmTb3tHtGvHvEp7nqE1hlOymnG6WN0vbDZeb5c3SdpMBN8ubpW1fCrhX3rzt1xJ3ykXq5sfZzRrdO0Z2Ldz9ZXbvrtz+ZXaTV7d/md2Toff8MtIx3bP7ZervOXpLXrFcyrG5kNm9ZaX+kHT+vIIHZfaVJvq6u9SjfdCE7matclqFza/LwQ+fX257I7LsNTXTvpdlpa/Dw4728TsjXuzz8c6sa3aNE+7reuCnJsrTmbP9VqzXKjOuP37diu1KFHU9JH8xztr2lUbitbN09KN8a2fWfXI5Nl26f8mqao+dwcNp+1Ij93pk38i9HtkeqeYl/uf1FB4Lfelwt6qx9KCV7zVSj/WQqx678/92S3pUviX7OMt0947UvRTRN7xmpe94zUrf8ZqVvuM1q/3v6+VX86eRzWlGt++clFjxc8xWf5gCu3doatxl1pp0syWbaC3HehxSEgubf6qx1N0UlaT17r1o+vCuSnfvWd17tKO7Carsz5/OU80Pc+7HT4307cNhXQ8h9eOKEd3NUKWq63H5izfVK7p70UrxnDp/+IToky05GoafHJst2dZZ5/UQ4MXy8RTiZ8e9RXlFrfKdrK+xXm/tXT4+7nfL+t2ceNM3vGilz1+00je8aKVveNFK3/Gilb7jRSt9x4tW+vxFK33Di1afHKi3Jt72bdybePukjVsTb/s27k28fdLGrYk33b1odXNu5pM2bj3B2+/LvYm3+218PPG2b+PexJvulvq7O/G23ZCbE29a2ht+3Pb7/rg3J950N1l1d+JtvyH3Jt50N1d18+ps95bV3Yk33b1ldXfiTbdPm29NvO3749bE26f3AKxYTR/dA+yW/bt5j7e7eE99VbqlXj8+1uvzVX21Pl7Wd9/EzSuh+nxhX61vWNlX6xuW9tX6hrV9tT5+I+D+AbK5EtreZcrqkNeP9PGVUHvHWfv+LdWmuFvbth56pdAPRe9fuLmzvN6ReD0W1c12lMdpuL13v5mG20xu65Md+cjfO0DyuqeTsrkU2i4BeO9Et10E8O6JbjfP9Dq7rauHo6fvNnLzbNkfl6nsO/V5mYrVtqYiun48yaS7imw5YokWPE+Rrzys7hpPvHvu33vi3eOy7uj1w2fv/fmZ/5PtiDd4Xtt0fG9C497O5N2rAzd35pPtuLUzny0pFNF+aPp4LaC8na+6Vw6V37AoYH6+KGB+w6KA+Q2LAuZ3LAqY37EoYH7HooD5+ftU+Q2LAn5yoN4qh9q3ca8cKu/mmW7es3/Sxq1Lu0/25VZJVZbHJVX7Ju4Outu7svnQytOSqk8CNd4FTof9sKDxT8NlN0tleV0dWkFZxuvB5k+N7Fac0PWdqK6oIvi1kV0eHms59v6arN40srmh0hxTTNGvYj+dMXfTVGJrrksMj9u+1Mjr8nRtSLdNI7tJqhIrgRXBzVBqX9mQFhvSP96QT441KzjW2scLxmTNj5+HZH2+xkrWx2us7Ju4mSP6fI2VrG9YYyXnN6yxkvMb1ljJ+fEaK/cPkM3JW/Pj5yE5P3/DZL8d92b/c348+5/zG2b/c37D7H8ub3gsk3fzS/duu/edeuu2e//b3nsss2/j3mOZvHsT6ubxUez5Y5m8+xrV3ccynzRy77FM3q3zdvP42HbqrePjs8VzCyoAuYz+T+fc7WL+95ZX2zdxa3W1bM9XV8v2hjO/PT/z2xvO/PaGM7+948xf33Hmr+8489fnZ357w5nfnq+utm/j5m17fb662idt3LsCseerq+XnH6fKb/g61Rd25ePDo8nD2/ZPwvTO8hh593Gqm6XD2zaaxNehM79Z+9MqovtG6oqgVvXjpUhl+3D5KPHbHrb5yPS+lRYrzafj4w/T5dafn6b68fw0tX+Z6taI2TZxc8Rs56dunqbesRJg3r1Mdfs0tZuiun2a2n6y6t5p6vYBsjlN7Q/Ue6epbRv3TlPleF7u90kb905T+325dZoqx/PP+h7Pv+v7hV35+Du0x+NX/rZ5mmLBsYPzhr98rvl4nqclPc/Tkh7n6b6Jm59sTs/ztKQ35KlPDjzN05LekKclPc7T+wfI5sPNx/M83bdxM0/leRZ+sh33snA/PXVrwGybuDlgjjdk4XZu6nkWSo8hpyrfvELNsYrqkaV/t5VYL/fI5eMPDpddddvNV3SKPi9MLfq4MHXfxM3DTJ8XphZ9Q2Fq0TcUphZ9Q2Fq0ceFqfcPkE0u7w/UW6/o7Nu494rOJ23cekVn38a9V3Q+aePWKzolP18+rbxhcmu/L/de0bnfxscTIPs27r2iU3bzUndf0dluyM1XdMr2G1U3f9x9G89/3Juv6JSyXZP63is6+w2594pOKY+nUMvutae7U2RlNzF1d3ar7Ba2uze7te+Pe0XHu+uYFEu5pNet5uY6xh4vTLXdDo2Xr5Pu7nO3Mw/3CluKPa9KLfa4KnXfxM3rKXtelVrqG6pSS31DVWqpb6hKLfVxVer9A2RzPWXbValuFbaUN0wr7bfjXmFL2b07dTOV67bSf80a5B/eW/ipJqXsVulLJdZd0I8DdbsdNwtsym5u6odPOPzw7QW938jdKp3Stqti332Nq7TtfO7dpT6+sjWbdTpK++QGPhIpH/rdrbm/U7tqqlvrl+ybwC1N/7iJ7ZJ9z5u4eTmybeLW635lP6V687DfzlLdLE4ru1mqu11qz7vUHnfp9tMYt0PAjuP/5ZZsAsC2H2G5HwD9Lalmu6mmewGwb+LWoWaH/a5N3Dta903cO0a2Z2Bdq1Nm3QSAbWci7p6Bt5c1t26u9ldX90pL923cKy213VzVvSs0281U3b1vtt1M1d3S0k8auXfzbbtvUt082Ledeuv4+CzJbi459pVmNp/Ms+33oG6eNm0323QziOTx29j7Jm5eidR3/DZfaWb727R3/Db9+W/Tn/82/elvs3tY1CJG2tE+LjEz3X+r705JhL3hs1T2/LNU9obPUtkbPktl7/gslb3js1T2js9S2fPPUtkbPkv1yYF6qyRi38a9kgh7w3SVvWG66pN9uVVWYfnxkpT7Ju4Outu78vHhUR6v979L03RcG9HSpqjCtt+kuvfg3cob0rQ8T9PyhjQtb0jT8o40Le9IU3tHmtrzNC1vSNOijx+82+4Fhrsptt2Oew/ebTcRcfO2bjfLZLLqGEy2x8c7Lk7t+ZXltj/u3ZFtf5Z7d+z7Nm7esdfHi1FafcNilFbLG+7Y6xtWtLTdMn83j4/6eEXL/blyLb/QElaT+GWSenebfe9N0H0Tt94Etd0E0937n936fnfP2O1xtf++iZtn7GbPz9j7e/2bZ+zd56hun7F3U0q3z9i792NunrFvHyCbM/b+QL13/7Nt4+b9T8/P73/6G64c9vty7/6nP65P2Tdxd9Dd3pUPD496PP1S+idheudN0Lp7Alvj+Ko9fXwPVY/nH0qvx/N7qHo8vofaN3Hv4KjH83uo15zi80SuxxvuoWp6wz1UTY/voe4fIH1zgDz/UPq+jXvF4J+0casYfN/GvWLwT9q4VQxe0/Ml/T9p49bZZb8v94rB77fx8Q3Qvo17xeBV3vCh9O2G3CwGr/L80eknbTz/cW8Wg1d5w4fS9xtyrxi86uMPpVd9w4fSq77hQ+lVH8957vvj3lJYx+M7030Tt+5M63Yq6t6dad1ORd28DtLHy6Xsm7h5HbSdhrp5HZTlDddB209O3b0O2n1y6vZ1UC6Pr4NuHyCb66D9gXrrznTfxr0707pb0e/u6WXfxr3Ty35fbt2Z1iLPB93tzfj4py354V3lJ0F4665yt5xfbWttoNfh9fErMXU3FXX3rrK8IU3L8zQtb0hTe0Oa2jvS1N6RpvaONLXnaVrekKb7A/XeXeW2jZt3lfs27t1Vbtu4eVe5b+PeXWV9/hbqJ23cOzNs9+XmXeXtNjZ3lds2bt5V7iaibt9Vbt/cvHlXWd9w2q/99/1x795V7t+ZunlXud2Qm3eV7XGpdG1vKJWu7Q1VzrU9njPd98e9OdP2+K5y38S9u8r9y0n37iq7PL8O6o9X9Nk3cfM6qJfn10G7l5NuXwft5pFuXwf19obroN3npm5eB90+QDbXQfsD9d5d5baNe3eVbfeM7ubp5ZM27p1e9vty666yHY+Xm943cXfQ3d6V+vGu9Id3pp+E6Z0707abiKpefT3vTO2HFdF/vDPdrn1377ywb+LWeaGl5yuit/R8RfSWnh+i6fkh2tLzFdFbesOK6E3esCJ6kzesiN7k8Yro9w+QXr95oN46L+zbuHlekOcron/Sxq3zwif7cu+8II8fSu2buDnodPtQar0X/bpk1w8H3XYaag2XXNLHLTx/NNb0Dauitv0SfkmjlWQct8dPzWwOstbX2aH1JptGdnf7JXrlxfZxCWzbLuNnq1/E8BKgfWVLSnz9s5TNm4Qtb9+NrvFuNCqcf8mzL2yLbbblk2ZaiWZ+eB3wS820g5+ZP77fTKwgwwfuX2ymroAcTW6OmLy7udJ4zKRdv/c73R4C+Q03Vy0/vrnaN1HXGxO7/tjtyhdG826S6uZo3m/J7dG8fSWGKx0cm17ZN3IzEr6wQ7tI+KSZu5Gwb+Z2JHzWzM1I2DdzOxJ2c1f3I2F/cm3xOSs5jo9DYTd9lXJeL/zlujlm7l/CfXxZbOXh/fAnN5G37oe3r1G1dexbw0oyP3+AZdtIPdZ3xurRdNPI7h1/WeunqOAzsvaVJtaSkKpH+6iJ3Xp/9z52vu/S3nv0Rvu4N7Zv/Nzbjrot7rz1kZ+2ewEqWcW6R9HGWHTox0Z2b6gcK0OEayf92si2qLrENX7rHzeyPVBlzdRW4Tdof/lpdg8J8nqzLGV8ZVjyT+Nuu+Sff3L3Op3rx43st8Qi45HNv27J5pKgrFA1zDxJbvebsPWlYsNV1i9NbHel4KyHqacv9sfNTt3NX6We1rh5MQaOfeVA6ysRC46RXw60bbeumUU+qfzaL7MqAszyd5tYD02yfdzE/iSzTv/WbZOIXZ7H2baN41iVCQeS6Jc2ttec8dxENX0cRNtJrLuRuF1i7y2R2NeWVH7d+9ffZrc29b1SrbabxLr5KLrvX6m681Rs38S9p2J991LVzedR/dDnz6P67p2Zu4+i++6VqLt30X27wN69u+jbB8jmUfT+QL1VqrVv416p1idt3CrV2rdxr1TrkzZulWr19Hy69ZM27j1W3+7LvVKt+218XKq1b+NeqVbfTWbdLdXabsjNUq2+ncy6+ePu23j+494s1erbt6pulmrtN+ReqVaXxx9M7/KGD6Z3ecO3zrs8XpBy3x+3SrU+eVDlC9We1/6W0nefd/mSVVczfdMn+oYF/7s+XvC/f7JU4PMHzxbfcXz1zrHZmd28aV2h+HqkoB/cU+2baLLuVF+P27/XxFrs63VP0r83mXX7QPukmbsHWn5DmUDPj8sE9k3cO9A+6ZG7B9p2ob57B9q2iXsH2r6JOwfa8+/r9fyGO6ry/I6qvOGOqrzhjqq8446qvOOOqrzjjqrY81H7/I7q+df1nn9b7/mX9Z5/Nq3b3ZdN6rf68t793PNv+3V7/sb/J23cuuDf7skq99L2cblXt/aGPWm/657cuyt9/oXC598n7PUNS1J8Mkhu/iTye/4kd+8lt+9S3byXfP5dwb796MS9O8ndTNTtO8mW3nAnuV1U696d5LY/bt1JHs8n9/p7Pjt1PJ/c67v3qHK/jo+S0oeTN3ebkG82cW+KcdvEvSnG4/kE4xvmbHvX59OL+964NTO4b+LWzOAnTdyZGdyt0xipIQnlW0nuN5GOtext0vSdJlJfJTCSSvmwiXTs5o1uTi1+0si9Oc5XI/K8ZuPVij6foXy1kp9PUW5/4baa4Ksy/+DnufmNKDxZkC80oboCWTOXSjyOn1vZPS49VsE8Pxcp98fMumeTA3c7YwH8H7di+52pWtdy0ak2fj1X81faef3TdbC1H2q/fm3n6TsAn+1SlAyPu9n6/V1ai5e8OPVdO7uXqW/Vs33Wxp2Ctlcb25fc71SSfX64rLNnS3yK82uf7Ar0yvqdX3ft5eMfejeddPdY2X5PaF2RaDk2jezernrlUlyhtXLsOmX7yacU2ZRwoEixb7fS39FKzt9uZT3blmTHrpXtakgpvreEYTi+m/hTK9v5ulgHXnBB/w9a2VaW6noe8cPNyRdbiW+E/vDNgi+2Ek/MxPo7WvmhDFq/8hv1vp5NHDh2f21l9+6VpVWrbomfYfjaL93XhUI5RL7bSryZm18x8d1+aRWvK277ZbMtr3u2um7fpH2zd0te904v7N/9jeraFqu5v2OPdPtL386XXUplfTynML59t2ukrcsxvgv+DzZlc56v/g16b6XymVb6+Vo7b7+kuj5m8kJctvyyJXV7G6NxG5M3jezmjMdnB68z4+sGrWx2aNe38daI8BO1/+A0cv80jYvuX0/Tu89V3b52Kc+vc7fbcffaZfviVItpl9SMdzO/dsruSVd8RPg1E4QJwm5f2hpbL5C8uO6upHbLKKXsLxCdm9OKfHixWx6/8frZlvR4Apg7fusv9Us/1gXDi/vulma7dGCydTZ6/fIYSD/fM5o875f9IoZHZG6yzZbs+yXFU9rX05tj1y+bo7dokTgz7sbA9uNNnoXns++2u13c1WGnuj5mlyquDfvPJ8bddFXXdevaFT/Ra5L151Z2CwP4aXO2cvRj00rdPctajSgqB8R+Plx2b2OJf4TwOuTSN1vRvi6AtNu2Fd1duti6vBTkbmpf2pQWm9J3m7I94jCBxVn3X4+43WtZt4+43TzY/SNu98XyLxxx/fkRt5sNu3/E7efU7h5x2zez7h5x+015yxEn6w4ty/aR2G5erMh6plyk28dXhW1bSbhOQ68bkfZxI/v9WZPIrwcEu6efuy9e3d+f/nvvj6a4a031u2cyXXdEL7TvnlVjmqyUtEun3TxZ7us5d+5avt3KGkIv/H4rPVrp322lRP1Z+eHW6tdr3O21j/QoxNDj+HY7WuLDt2rf3x4se9BNNtuTjm3wrjcmX9i+eb1cYjaim9bdtjx+JXbfxr0J6/3+yHGsV8lfJ4Dad/uzu0tLdU1OvhjHnv3cij2+/v9sSzTHlpTycSvbj2CvkpWeknzrWHmd0I6YSBNWz/zSt9upkaNEVWlnfMu3t0Zb3m2NPH84kNJ26jfHXdrrCc1uGG0XyXgds2ty/rVX+v121tn6xbYbBrtVBm/OyH3Sxq0ZuZTa4xm5r/TJNho+a6dFO618v53VMa87+91pKe2e1t39jfZt3PuNJP/uvxH7JB0PfqOKdtI3T9U/hkxu299od/zauuzN9ZCPQ2Y3//TapxXiLy76lp0quwqE9IaVDFN6vJThZ9txb1Yi6bZT+ppneXGRXaeUxxdln20Lfuhetz/Q4yLCfRs3L8r2+5NiimRUn+2Sd7ucYS2rrvvF+nHv7lux9dRjcH9+MZTS7hYnZX0+R5J20z43B9F2O+5eBu3m00bZW9Rqie0GUa7/T68QUy678M5vKMFJ5Xj+E72hBCdtXwt7/YDxE5Vjd6Va9t/9XJ3SlLO4+t1WcIP0tVaytHiUcxy7VuzxL7TfnXrE89RtpzyfTdtvSY+XIV+PPL778/Q1Dl8PZb/986Q1tZ1TLd/+kVft9OtRZN60slvK8NaPvC2tXQ3I6+EwBo/8vBW7531RSmrHD89/7he15jhIyg8P+37ZkPp7t3K3kDvtptDuLhI1nszsMv9mDXbaTqK9oQZb45LnhxrsX3q2bj8gc2fBy+2xprLuhJTVfP9gQx6vvLltopQ1rVLsh6njnwfwbvbs9klwN3n2GnRrCc8fL0f1K62keKck/fA0+OdWtrNNN2/f923cu33fTZ3dvX2/+ROb/HDT/UuP5Df8xLuJs9d9y4pYadtN2X2VM63bn/rDuzK/trJbMO5mrVrazZzdrVVLu5mzu7Vqqe9uoG7Xqn3St3V98ZQvdX3xF5KVTK+n9Pb9VvJqpR7fb0WjlbaLlbuD6If7yp9b2a90ePPhzO57XTcviffbcfPhzG4dO9P1xNV+eI/o5y6R4w0vqr5a2S3MffOVxs+25d6rqq9WdmvA3Xoj8bM27ryS+Mne3HxT9LM+ud2zu2cHN98W3V81vR6YfXBul5+3pf/erdy9vJbdV7xuX17LbrLs9uW1bGfLbl5ef3Jhq+v8odo2t2KSnl/Ybjckr4IuzTl/854wRd1FYt3Fr79yexzY270pKMT64Rru526V7SJI13HSfzju089tbMu212GimRXO+Uut+FJ85/5k3bWij6/SP2nj1lW6bNf9u3eVvu2RfKzLlHzgoP8HPVLf0CP1DT3Sf+ceibepXlfZddMju3mouz2yb+Nej6j+3j3S42mb7cbe9vsjt69ytksQ3rvK2adaj2f4/YdL869k9OsCZY0c/aE440ut2CroyVaP7z5DlHXWeV1yle+2Em8A2nFsz132hiuUrO+4Qtm+AXX7CiWX3/sKpehxnXqK/lBa9/OpdDcZ9oYrlHKkqLrNu3N6fvo12n0Ttw+U8pZL2fKWS9nyjkvZ7WWbf0jYG2l4w+cfbMkbvjvzasXe0iv19x4+Ocd1iqXd3VPpu4RbzwG5gqX+tAKJryz28bwe3pPgJ5/05/PY7k2uexfnn2zIqm59XcxuN2R3IbpWWlWcCttXeiTrOtqy8pHmrxvyfMGP/Zbk9UG71/1C321Jfcezod3LZPefYOy35e5V024m7O5zne2W3H6us9+fu71S37AK2D4N+oqUUfa0iYNdI6/YWq+B6Q+LmPzcyvZlsre0cvuMupvJun9Grf0d547t62S3z6i7n6jGV8vKrmt3M2I3r3d2m9HWIt/th2KBXzZjV9wV7+OgVLN95YCN72P2Q3absTtc21opN3Xc+9SfD7TdTNjtlxmkbV9mWKuNv34j/biN7TfLNN57wXftftmd7UzYUaOVo2LdHvtaKzW+0ll7/mYrbS0skw6uoPKVbpGIk9czadt0y/bD4CnHpiRjoJSvtdOwEHrvD9pZsX8IXrD7ajsxqfxiO3bt7OI2ZmETb7q12pdaWbPKiS/R/4NW9vtk2Kf6/T7W9dTpxSrfbwe/uaL485d2dP8xsPe0IynHapm2+a32rQhePcE19xdb0TXCJR+bVqRuP/ewHhxZY2XSzwtK6O6FstccRbwLWT9cU/rVyPPPLbymDR5/b+GTNu59cOHVyPMvLrwaecMnF16tvOGbC69W3vDRhaTp8VcXvnCg9M2Bsl1HVKJ2U7JujrbdlO69tdQ/2RIvpzyLM9JmS7aP6G8tZP5qY1f0JRoPtH8otTp+bmX72eRYpK+p7FrZJX89Gp5gbT6c/mpn9+y2xhqI/KK8fn9b5Nhty/ZFhryG0KiaKrt2tttzd3n0Vzu756/4Xkb+Zt9YFKJZ5tKDv2zJ9qWtWyvXfzICbi1d/8lQ1FWK/Tqnfnc851U+9npGmz5uRMvz8axv+Mbdq5XtR+5iAdCjp2+3cu8DB69W+vPjRB9/LO/T69JYcO1Qq5vryfz8bd1P2rg1Saz5+du6n/VJvEn36h/bXfNvb127Rt/23L95A9zjAyNHr8fH/dLe0C/7LZG4nuzlwy3ZT39g/EjdTDbrdrKsxbf3mqE+Vn7Opt1kmbY4altnEY18oZUcdx658rWXX1vJz0fQdkva+gZCbvhGxz/YEvudtyRe1Mod19j/YEva77sl5eBnS/JmS+wdRbZq7yiy/WRbbk6kqD0vkN1vyd2JlE/253av2BsmUvaJ0I94wZDLmP56tDyuV9wG3A/XXlzU49eA2y6buC5qX9Mtumml/u6t3J3S0fqOahqt76im0fqOapr9T5RqPInji2y/du7jahqtxxsefdV3PPpqb3j01d7x6Ku949FXe8ujr/aWR1/tLY++2hsefdV3PPravhZ799FXe8ejr+2W3H301d/w6Ku/5dFXf8ujr/6mR1/9DY+++pseffU3Pfrqb3r01d/w6GvbBj6b2z9uIx9vePDV3/DgazsQ7z742jZy88FXPp4/+MrHOx585eMdD74+aeXmg698PH/wte/Zmw++tu/PaCzRwkWiv/gWjkbhYk6bt3Byerp6x2evJNy8P82pvOFO7JMXG+6V6G3353aJnr5jf/Jubux+iZ7sn56ty+v8w1Lt6Sut5Phan+nxcSt5+yWUt7Ry94Yub6eA7t7Q5e3k2N0buiz2hhu6T37oWHr4x+8g/tK57ekNXZb0jt9nu2ZMFGeUtj1Udq2UWP/SfliV/Es7FBeCymvbL7YSS9i8TgLtu62kqJ3n5w5+bWUfc/GORCotffiIc9vK3Y/F5t281u0XLbK2dwzE7ezY3YH4yfHf1ik+/fBh0y8duj1GUZLdANjObd39ifI7Aje/JXDzWwI32+/+O2vBG/PbX6i9YyjuFzNcK0W+nmP2zbbsVlUsx7rsL4mzJz/XsuX9k8V7zyTydiLn5l3Mfo27m88k8naC7O4zibx9n+z+fXfeTpLdu+/+ZFtuP5PIpb3lmcRnQwAzS7XKx0Pgk4GkGEgffvEsb98quzdhvR0Ad59o59082d0n2v4+w8Mn2vs2bj7RzvaGdYvy9s2nu0+0826S7PYT7bxbX/H2E+28f+Bz64n2/QNl80R7n9k3n2jn3STZ3SfaXwmn3cPbXJ8/vN1uy+3avLybI7v76Glf63Hr0dP+N775iDLfnh/ePaJszycccpN3PKLcTZLdf0S5b+XuI8rdJNnd46Q9f5S9Xxr4iFPgIfxE5tcWO17D+NXKZvHmvJskE1vndKl8kvalVjTmul/YvttKjltvPjD94sLL8UmOsU7OZlv685Vsy91DHzdB/2BDtq+/rK593ch/+PLgvo22XkC09nG54idtrGsua/XjNrY/sKx1PVTk+O5hIke0cmz6tRzP17H9pI1bha3leL6O7Sc9orEv5fv9uupRVcy+3Qq25UErLX7j9u1A0RTP8lL9diur+PJRK+umXfVBRMYzTl5i/BqRn3xSZH0u+sX4OuYvn33ZfWolFos0/Xg6aN/GzbWy9m3cmpb65Htz64qp87XJr32z7tZr3vtvCt7sj30bt/rjky9Zxnezj7r7AuW+lZUF5cj9u62kWJYqpfztbVkf1Xy18v0vfK63dMsnXwLffbojx1dYt995+UIr+dutxMo4ueu3W1mB8mrQvttKiRWUSvp278aKoK+nl9/+Um5Zz+RfDW5/o/1tf7xInXmt8tONS9HnL+F80sa9axV9/hLOvkfiMa3oD9cHv/TI5tcpNRYq5m3YVzYkr1UsXr9M3m3IGz4QXfQtH4jeTsWug+S1C+nj/fmklbVkxGsOx77dylp8RYrt+nY3LXbz1mffxr1bn0/auHXrc5TtolK98+WO4+Mtqc8H4Cdbsr5XMbYkf7wlu9qZVtc6xS8um5gtZVvpi69Hve4Xtu3sjjh8QJMn5q5famQ9cx7fNNw0sntyIGs6q/NLHr+8Y1h2k2K25iwrV1zp5Stbouv9tc5Shn+wJZuo7UeO1Zj6sWtl+x2cmOPDzY/9fMztPzS2phvFsCzo11p5PcyMBcNt18ru3aaS1jJXr6sDPGNtX9qUFpvStzu0H0LrsunTIbRvJ95YEWu7dnbzWXc/H1P2i9Tf+3xM+WSd31ufjynbSbHbn4/5LHbXhMmI4I9i93ia/rv7fouZLJYH/rwgz7aJddOReKh9pYkWBUmtfWsrXk8A8WX3/r0mSnyzFpMkX9kRFJa09L3ubLJmspt+a0eSrDnoxIeqX2lCV0HV67nR95rI6+ozZa6m9ZUmYrWynPvjrfhuE1HOWzBR+8uiVaXp49PD7tmyRU2kYZS8HgDeb6KvT0lUflPpu03UbzVR4yFsRZJ/pYm2jowfPrv6pSZqfLm1fm9HGuqUcF77ShNd4gOl5Vu/iMTlpQi+MvJzE6n07eu2EeM/fPf4/gcjpcfFQv/Wzyq6poNeaN9rYq3P+XqwUL7ZhEQT9riJ8t2twGOR43tNWPQFp9q/uRVdvtfEOqN9u4mb34Kz4+k3xrcbca+gynaved0uqLLtJ8LGDfa6Au1pU4th2zUQJcooXtzSrp3dEvUpvuTBGPypQsXS88KsT/YnrZuE8dWsTV2I7RZCbH0dso1r6/5SgGq7l71uF6zZbiXEu/2yXZOxlFjP5/WUYXe87FZCnAucz2b02P3SN48WTe/ZI9vu0bYdnPeK2G4E7F4FuvnJ88/2qZXYpx9q6L62T+1gWe7xoJ14Qsmbka+2U9cj8dHmto93dYpa1+Zo192RsxtP8ZB/38Z2jywWpSqW0rd7xkq8iWB9l1fyjtJY0zck8LaN9/SuxvFiZXf87j4jdnO2YN/GvdmCT9q4NVvwyZlNMm7qbdsnjz+I+8nFR9yzvFjLblN2EwY59ijX7clkW6GeNK6okvXNyTqnd5zydxNDXznR7j8ldvdE+4Wt2Z4k9+3cP0luXwK7eZL8ZJ9unyT37dw/SX7Wzt2T5L6d+yfJ7Zswt0+Su63pFpVL1tpmNJS3XACXN1wAlzec9PeTvrf3pr5hb+rvuzdFSiyWaLsLD3vDJYMd/w/3pu4y4ZNzSUyEH3Icm+N+N991/8y2T4T7F5mftHP7InM37XX/+Lf2hiOm/b5HzFcuMndrHd69yNy2cfMic9/GvYvM/JbHHvUdK89Zfb7y3L6Nm8dJLe+59tl+W+zmtc9+W+5fXbbt90cbri53PbNv5e416hf2aXuN+kk7t68L9+3cvy78rJ2714X7du5fF+4+OXb/unC/NffPSZ+0c/uc1NM7sma3kuLdrNm28ZasuX9OesMbYvaGN8Tsm2+I/c/Xf/nDv/3pb//y57/+2x/+/qe//uU/Xv/uv0dTf/vTH/71z388/+v//s+//Bv+37////9+/T//+rc//fnPf/o///Lvf/vrv/3xf/3n3/44Whr/32/H+R//Q+X1JESllP/5T7+l13/v7XVZ1ltpr/+u4//vrwnLfBw2/v80/0F+/QO1//nfYwv/Lw=="
+      "debug_symbols": "vb3RjuU6cmb9LufaF4ogGST9KoOB0fb0DBpodBvt9g/8MPzusxmUGKuqOpnK1D5z47NsV3JpU+IniQxJ//Xb//rjv/7n//mXP/3lf//1P3775//xX7/969/+9Oc//+n//Muf//pvf/j7n/76l9f/9b9+O8b/kCP99s/pn17/zb/9cxn/Led/7fxvPf/bzv/2+V85zv/K+V89/5vO/57tydmenO3J2Z6c7cnZnp7t6dmenu3p2Z6e7enZnp7t6dmenu3p2V4620tne+lsL53tpbO9dLaXzvbS2V4620tne/lsL5/t5bO9fLaXz/by2V4+28tne/lsL5/tlbO9crZXzvbK2V452ytne+Vsr5ztlbO9crZnZ3t2tmdne3a2Z2d7drZnZ3t2tmdne3a2V8/26tlePdurZ3v1bK+e7dWzvXq2V8/26tleO9trZ3vtbK+d7bWzvXa218722tleO9trZ3v9bK+f7fWzvX6218/2+qu9Ov5r53/r+d92/vfVnsg//abHcYFc8GpS8oBXm9IG5AvKBXZBvaBd8GpZx5+PoTJBLtALXi1rGZAvKCeMAaE2YIzQsT1jCEwoF9gF9YJ2wcueXj9Qx0CYIBfoBaPlsaljMEwoF4x2+gvG8Z7TAL0gXZAvKBfYBa/tyf7n7YJ+wjjwJ4w9dwzQC9IFY+ePX+FH9+gNP7wd5AK9IF2QL3htj40/Hwf5hHpBu+DVsukLxoE+QS54tWPjV4xj2cYuGAfzhH7COJwnyAV6wWt76mhnHNITygV2wTgKh2Ic1hP6CeMAruPY8CN27KZxyLbRLeOYndAnpHHQTpAL9IJXO80G5AvKBXbBaLkOaBeMll8HQBoH7QS5QC94tdxlwKudrgNef9VHg+OgnSAX6AXpgnzBGETH+PtxHJ9UF7VFY4ger75J41g+SRaNwXnkQd7K2MJUF7VF/aJ8LJJFY6yPwZ7G4X1SXlQWDYeUQXXRcMj4RblfVI5FskgXpUV5kTvGthRbVBe1Rf0iOxbJIl2UFuVFy2HLYcthy2HLUZejLkddjrocdTnqctTlqMtRl6MuR1uOthxtOdpytOVoy9GWoy1HW462HH05+nL05ejL0ZejL0dfjr4cfTn65cjHsUgW6aK0KC8qi2xRXdQWLYcshyyHLIcshyyHLIcshyyHLIcshy6HLocuhy6HLocuhy6HLocuhy6Hj2TVQbJIFw3HOPnlcWY6qSyyRXVRWzQcabTi43ySLNJFw5HSoLyoXOTjN+VB/u9Gyz5Wx0kx+1idZIvqoraoX+RjNZdBskgXpUXDkYfNx+qk4cjeSl3UFvWLfKxOkkXDMU6K2cfqpLyoLBqOMmw+VicNR6mD+kU+VifJouEYJ9XsY3VSXlQW2aK6aDjMW+kX+VidJIvcMY4cH6uT8iJv5fV7i4+8cYotPvImpUVjW8ZZtvh4m1QXtUVjW8a5t/h4mySLdFFalBf5peFoxcfbpLqoLRqO9jrCio+3SbJoOFoZlBblRe4YNh9v46xcfLz1Y1Bb1C/y8TZJFumi0V4fW+Vja1Jd1Bb1i3xsTZJFuigtyouWIy9HXo68HHk5ynKU5SjLUZajLEdZjrIcZTnKcpTlsOXwsdXHMeRja9K4hD9GD41xpOMqo4xxdFJeVBbZorqoLeoXjXF0kixajrYcbTmaO2yQLXLHOA5aW9Qv6v6349jo/u/GL+ptUT/JjmPR2BY5BumitCgvGtsiOsgW1UVt0XCM6ybze6BJskgXpUV5kTvKIFtUF7VFV5+aHotkkS5Ki/KissgW1UVt0XKk5UjLkfx32KC0KC8qi679Zqkuaov6RflYJIv03KuW06K8qJ172opc+7LoorQoLyrXviy2qC5qi/q1L+1YJIt00dqDtvaglUVrD9rag7b2oI8yJx8zMn6RjwAdW+AjYFJZZIvqorZotKevs4uNM8lJskgXuSMNyovKIneMrffRM6kt6idVHz2TZJEuckcZlBeVRbbIW371ZJ0j4NUH1Y/n8YuqH8+TdFFalBeVRXb+yurH86S26Oqh6sfz+L3Vj+dJuihdv8OP50llkS2qi9qi1UN+PPuv9ON5ki5aPZTL1Qd+FOvoAz+KJ6VFeVFZZIvqoraoX+RH8aTlsOWw5bDlsOWw5bDlsOWw5ajLUZejLkddjrocdTnqcswR0AflReUiP2LHRE/1I3aSLRrbN65Zqx+xk/pJzY/YSbJIFw1v1kF5UVlki4ZjTPY0P3Yn9YvmnFceJIt0kTvKoLyoLLJF7hhb5WMh10GySBelRd5eH+QTaceg0d6YTmo+Fia1Rf0iHwtl/DYfC5N0UVrkc3Xjd/gIGNfKzUfAuBpuPgLK2AIfATb+nY+ASbJIF6VFeVFZNBw2emNcLZ00HON6t+V+UTkWySJdlBYNRx2t+OiZZIvqouGo47f56HHy0TNpOMb1bvPRMyktcsew+ehpo3d99Eyqi9qifpGPnknD0UaP++iZlBblRWWRLaqL2qJ+kV99TVqOthxtOdpy+MgbV+bNzz2T6iJ3jF7zc4+Tn3smySJdlBblRXXRaq9f7XUfteOav/uonaSL0qK8qCyyRXVRW9QvkuWQ5ZDlkOWQ5ZDlkOWQ5ZDlkOXQ5dDl0OXQ5dDl0OXQ5dDl0OXQ5UjLkZYjLUdajrQcaTnScqTlSMuRliMvR16OvBx5OfJy5OXIy5GXIy9HXo6yHGU5ynKU5SjLUZajLEdZjrIcZTlsOWw5bDlsOWw5bDlsOWw5bDlsOepy1OWoy1GXoy5HXY66HHU56nLU5WjL0ZajLUdbjrYcbTnacrTlaMvRlqMvR1+Ovhx9Ofpy9OXoy9GXoy9HvxxyrIH+QgnUwBSYA0ugBdbAFhg2CZuETcImYZOwSdgkbBI2CZuETcOmYdOwadg0bBo2DZuGTcOmYUthS2FLYfMkGDMgL8yBJdAV5tgC+0JPgbEG8kIJ1MAUmANLoAXWwBbYF5awlbCVsJWwlbCVsJWwlbCVsJWwWdgsbBY2C5uFzcJmYbOwWdgsbDVsNWw1bDVsNWw1bDVsNWw1bDVsLWwtbC1sLWwtbC1sLWwtbC1sLWw9bD1sPWw9bD1sPWw9bD1sPWx92eQ4AiVQA1NgDiyBFlgDW2DYJGwSNgmbhE3CJmGTsEnYJGwSNg2bhk3DpmHTsGnYNGwaNg2bhi2FLYUthS2FLYUthS2FLYUthS2FLbJEIkskskQiSySyRCJLJLJEIkskskQiSySyRCJLJLJEIkskskQiSySyRCJLJLJEIkskskQiSySyRCJLJLJEZpaYowXWQLc1x75wZsnEUfUwpnDFS1guTIGj9uFw28iSC93WHWtgCxz1FWMBWry05UIJ1MAUmANLoAXWwBYYth62HrbuNu+SngJzYAm0wBrYAvuFXhVzoQRqYArMgSXQAmtgCwybhE3CJmETtzXHHFgCLdDbHTtLRz6kUdMjZzXNxBxYAr2mRh1rYAvsC72ARpKji7NjDWyBfWE+AiXQN3JiCsyBJdACa2AL7AvHQL9QAsNW3ObFc8Xb9a4uNbAF9oV2BEqgBqbAHFgC3eY7y2pgC+wL6xEogRqYAnNgCQxbDVsNWw1bC1sLWwtbC1sLWwtbC1sLWwtbC1sPWw9bD1sPWw9bD1sPWw9bD1tfNq8ZulACNTAF5sASaIE1sAWGTcImYZOwSdgkbBI2CZuETcImYdOwadg0bBo2DZuGTcOmYdOwadhS2FLYUthS2FLYUthS2FLYUthS2HLYcthy2HLYcthy2HLYcthy2HLYSthK2ErYSthK2ErYSthK2ErYStgsbBY2C5uFzcJmYYssSZElKbIkRZakyJIUWZIiS1JkSYosSZElKbIkRZakyJIUWZIiS1JkSYosSZElKbIkRZakyJIUWZIiS1JkSYosSZElKbLEa53SWGURL3a6sAQOW5o4bKMKRrzg6cJ+oZc8XSiBGpgCc2AJtMAa2ALDJmGTsEnYPDXSLNP2FrpjX+j5cKIEamAKHNubZ613CbTAGjhsY6FCvMbpRM+HE4dtrFCIlzldmALd1hxLoAXWQLf5RnoSjFUO8dKmC1NgDhztjhWMF452S3Ic7RbvPk+CE/tCT4IT3TbL3DUwBeZAt/lv8+FffHt9+Jtvjg9/883x4W/+b334n6iBKTAHlkALHDbzjvLhP9FH9zw0fHSfmAPj2PHRfWINbIF9oY/uEyUwbC1sPrqr/3gf3SdaYA1sgX2hj+4TJVADU2DYeth62HrYeth8dI8qqNcd4hEogRqYAnOg27qjBdbAFjhso15ZvNTqQgkctrEEI15t9TrnOubAEjhsY0FGvOLqwhbotjEgvejqQgnUwBSYA0ugBdbAFhi2FLYUthS2FLYUthS2FLYUthS2FLYcthy2HLYcthy2HLYcthy2HLYcthK2ErYSthK2ErYSthK2EjaPCp+n9XqtEz0qRsHbCyVQA1PgsPlEQvGo6H4QeFScWANbYF/oVwonSuCw9fk0Tgr0s+n8B36Wnv/XFtgXzmuCiRKogSkwB5ZACwxbC1sLWw9bD1sPWw9bD1sPWw9bD1sPW182O45ACdTAFJgDS6AF1sAWGDYJm4RNwiZhk7BJ2CRsEjYJm4RNw6Zh07Bp2DRsGjYNm4ZNw6ZhS2FLYUthS2FLYUthS2FLYUthS2HLYcthy2HLYcthy2HLYcthy2HLYSthK2ErYYtZCSthK2ErYSthK2ErYbOwWdgsbBY2C5uFzcJmYbOwWdhq2GrYathq2GrYathq2CJLLLLEIkssssQiSyyyxCJLLLLEIkssssQiSyyyxCJLLLLEIkssssQiSyyyxCJLLLLEIkssssQiS2pkSY0sqZElNbKkRpbUyJIaWVIjS2pkSY0sqZElNbKkRpbUyJIaWVIjS2pkSY0sqZElNbKkRpbUyJIaWVIjS2pkSY0sqZElNbKkRpbUyJIaWVIjS2pkSY0sqZElNbKkRpbUyJIaWVIjS2pkSY0sqZElNbKkRpbUyJIaWVIjS2pkSY0sqZElNbKkRpbUyJIaWVIjS2pkSY0sqZElNbKkRpbUyJIaWVIjS2pkSY0sqZElNbKkRpbUyJIaWVIjS2pkSY0sqZElNbKkRpbUyJIaWVI9S/q4uqqeJSdKoAamwBxYAi2wBrbAsPWw9bD1sPWw9bD1sPWw9bD1sHmW+EqQlz1eKIEa+LJlXxTy0scLS6AF1sAW6LZxY+MFkBdKoI5/K44pMAeWQAusgS2wL1RvLDnmwBJogTWwBXpj4+rV6yAvlEANTIE5sATawuyNef/6o8QnamAKzIElcDQms7Ea2AL7Qn+42I9qr4K8UAOHzVcfvBDywhLoNhcXt/l+G0mQ1bt6JMGJIwkulEANTIHD5hNsXhN5oQXWwBbYF9YjUAI1MAWGrYathq2GrbrNu6/2he0IHDa/w/YiyQtTYA4sgRZYA1tgXziS4MKw9bD1sHW3+ab3EmiBNbAF9gu9lPJCtyVHDXRbdcyBJdACa2ALHLbsjY0kuFACNXDYRl20eGHlhSVw2Hwe0Wsrs8/heXHlhX3huKq4UAI1MAXmwBI4bD436FWWF7rNN8ejYqJHxYkS6LbmOGw+3+fFlheWQAusgS2wL/QsGY8NitdcXjhsPo/oVZcX5sAS6O36D/LUmOipcaIEeru+Nz01TsyBJdACa+Cw1dlYX+ipcaIEDlv17vPUODEHDtuozBYvu7ywBrrNxZ4a1XeAp4ZPpXnt5YUamAJzYAkctuZd7alxYgvsCz01TpRADUyBObAEhq2FrYWthc1To3n3eWqcqIFu897x1DixBLrNR5anxoktsJ+oXpd5oQRqYArMgSXQAmtgC3Rb9ZeQHIESqIEpMAeWQAusCz0fxvSYegXmhRqYAke7Y/5MvQLzQgusgS2wL/R86N6Y58OJGpgC3dYdS6AF1vF6kMOxBfaF/o6ew8X+mp5xZaNejPmak3ZMgTmwBFpgDXSb7yF/fc9Ef4PPiRKogSkwB5ZAC6yBYSths7D5K1AO7zN/CcqJKXDYxPvBX/dzogXWwBbYF/rbf8Qb8xcAnaiBKdBtvof8ZUAnWuCwqe8hfyvQiX2hvxtIXeyvB/JX43gx5oUpMAeWQAt0m+83f2fQiX2hvznoRAnUwBSYA0ugBYath60vmxdjlvFAl3ox5oUa6LbmmANLoAW6bXTqfP/WuFrR+QquEzUwBebAEjjaTbOxGtgC+0J/O1c+HCVQA4cti2MOLIHDNh4c0/nKrhNbYF/o7+7y9wjN13WNqyCdb+w6sQRaoLdrjt6u96/nQ/bu83w4UQI10G3+iz0fTiyBFjhs/pKi+U6v4tvroVB8czwUim+Oh4K/dmi+3+vEHFgCLbAGtsBh8xcVzZd+neh/5mIf3Se2QP8z/5k+uk+UQA1MgTlwbKS/mmi+7evEGtgCh636CPDRfaIEDpu/3mi+Aqz5b/PRfWIJtMAa2AL7Qh/dJ0qgBoath62HzUd3873po/vEFui2sWO9PPJCCfTGmuP4s/EsgXqdY/HTotc5XiiBYyPHuwjU6xwvzIEl0AJrYAt029gX/iaxCyVQA91WHXNgCXSb/yAfvCe2wL7QB++JEqiBbuuOObAEWqDbimML7AvHkLZjvh1NAjWwDPQuGadxO+af9YH+28oRKIHegm/vGLEX5sASaIE1sAW6zX+QHYESqIGxLyz2hcW+sNgXFvvCYl9Y7Isa+6LGvqixL2rsixr7osa+qLEv/G1oMt821wL7Qn8nml8/zLeinTh+m/gOGAP9whxYAkdPiv/M5jYXtxbYF/YjUAI1MAUOm19reNHkhaNdnS/L6xd6eeSFo12/qvDyyAtToLdbHEugBdbAFtgXyhHoNnPUwBSYA902+tdLHs0vJbzk8UINHC2MqRP1kscLS+DYXn9poJc8XtgC+8Ixui+UQA10m29ZyoEl0AK9d8aB6GWMlvy35RSYA0ugBdbAsb1+/eBljCf66D5RAofNLzC8jPHCHDhsflXhZYwX1kC3udhHt19reBmj+eWBlzFeqIEpMAeWwGHzdyB6GeOFLbAv9DcXniiBGpgCc2AJDFsNWw2bj+7ifeaj+0QJdJv3g4/uE3NgCbTAGjhsNhvrC310nyiBw+avZvQyxgtz4LCZD6dxGrfqv2Kcxi9sgf1CL2O8UAI1cNiqOObAYfP3OXoZ44U1sAW6bfxiL2O0MTujXsZ4oQamwBxYAi3QbfNNnS1w2PxVkV7yeKEEauBo1y99vLjxwhrYAr3d0b9e3HihBGpgCsyBw9a9MU+CE2tgCxw2vzbyd7ldKIHD5tc7XvJ4YQ50m4s9NbrvAE8NPwF6yeOFfaGnxokSqIFu86721DixBFpgDWyBfaGnxokSqIFhs7BZ2EZqVL/e8erHC1tgH+g/fqTGhRKogSkwB75s1c/oXh55YQ1sgcPmZ3Qvj7xQAofNX63r5ZEX5kC3+X7zd6aeWANboNt8I7u3Wx1TYA4sgd7ufDXtaNevCbwQsvrZ3wshJ3oh5IUSOGx+EvZCyAtzYAkcNr9o8OrH6qdxr36sfpb26seq8724Q5H8345QuDAF5sASaIE1cNhG+al69eOJ6u36NmgKzIElcLTrd/le53hhC+wLRyhcKIHD5idLr3O8MAeWQLd5l6Qa2ALdNkah1zleKIHDNl8jPEKhzhcJj1Cofo/udY4XWmANbIF94QiF6u8X9jrHCzVw2MzFIxQuLIEWWANb4LD5S4S9zvFCCdRAt3mXWA4sgW7zLvFQOLEFus0POQ+FEyVQA4fNz4X+irvqJ0Cvc7ywBfaFPvz9tcZe51h9csDrHKtPA3id44U5sAS6zX+xD/8TW2Bf2N3mv82TwM9vXtxY23yb9FD4TbwXN9Y2/60F1sAW2C/04sYLJdBt3TEFjnb93t/LGC9sgX2hD3+/G/cyxgs1MAXmwBJo48XPs7Ea2AL7wnFN0PzM4GWMF2pgGqiOObAEus3F6rbi6Lbq2BemI1ACNTAFus07NZVAC6yBLbAvzEegBGpgCgxbDlsOWw7bCIUm3n0jFE4coXDhsPkJ0MsYL0yBObAEWmANbIF9oXm7yTEF5sAS6O16p1oNbIF9YT0CJXDY1Bsbw//CHFgCh83Pb16weGELHDa/0fWCxQsl0G0ubm7zXh+h0Pw21QsWL7TAGtgC+8KRBM1nvL008cIcWAItsAa2wH6hlyZeKIEamAJzYAm0wBrYAsMmYZOwSdgkbBI2CZuETcLmA93n+L3G8MISaIE1sAX2hT7QT5RADQxbClsKmw90XzDwGsMLh83v3L3G8EQf6CeOFvzO3SsEm9+je4XgiT5MT5TAsWXjAS71CsELc2AJ9C2rjjWwBfaF49zd/ArEKwQv1MAUmANL4LD5hYtXCF7YAvtCH7x+ieIVghdqYArMgSXQAmtgC+wLW9ha2FrYfPD6BZFXCF5YAi3QbebYAvvCfgRKoAa6zXvdh/SJJdAbG1nipX5tPIamXup3YQ4sgWMj/aLMS/0ubIF9oY9Nn6DwUr8LNTAFrt3tpX4XWuDa3V7qd+Ha3f4mxAvdlh01MC30UXh+lEIDU+DYHL8a9DcYNr/C81cYXtgX+ng7P2whgd6u95mfWE/MgSXQAmtgC3Sbb7qP2BMlUANTYA4sgRZYA1tg2CxsFjYLm4XNwmZhs7BZ2CxsFrYathq2GrYathq2GrYathq2GrYatha2FrYWtha2FrYWtha2FrYWtha2HrYeth62HrYeth62HrYeth62vmxeyXehBGpgCsyBJdACa2ALDJuETcImYZOwSdgkbBI2CZuETcKmYdOwadg0bBo2DZuGTcOmYdOw+bnb7528ku9CDXRbcsyBJXDY/D7LK/kubIHD5ndfXsl3oQRqYArMgSXQAmtgCwxbCVsJm6dG8x/v+eDzk16zd2Ff6PlwordQHTUwBebAEujb6z3p+XBiC+wLPR9OlEANTIE5sASGrYaths1DwW9TvVCv+V2oF+pdmAJzYAm0wKHwKVsv1LuwL/RQOFECNTAF+pnBN9LH/In9xOR1eBdKoAamQN/05FgCLbAGtsC+0Mf8iRKogSkwbBI2CZuETcImYdOwadg0bBo2DZuGTcOmYdOwadhS2FLYUthS2FLYUthS2FLYUthS2HLYcthy2HLYcthy2HLYcthy2HLYSthK2ErYSthK2ErYSthK2ErYStgsbBY2C5uFzcJmYbOwWdgsbBa2GrYathq2GrYathq2GrYathq2GrYWtha2FrYWtha2FrYWtha2FrYWth62GRXVUQNT4EvRx4RV8pK8C2tgC+wXeknehTKwOmpgCsyBbmuOFlgD3dYd+0I5AodtTBYlL9S7MAXmwGET38gRFX1MACUvyTvRP7V2ogR6u9nR2y2O3q45lkALrIFu81+sfWE6AiXQbf7bRj509e0d+dDVN2fkQ1ffnJEPXee/bYF94ciHCyVQA1PgsCXvqJEPF452k29D8X/g4lICLbAGtsC+cAzpnrz7xpC+UANToNu8S6wEWqDb/CixFtgX1iNQAjUwBbrN+6GWQAusga7wHTsGZM/eUWNk9TFfkrwy7sIUmANLoAUORfaO8kF2Yr/QK+MudJs5amAKdFt1LIEWWANbYF/og+xEtzVHDUyBOdAVYxd6sZV4oVjyaqvFBq7gBu7B/hGuiwWs4ASGt8Jb4a3wVngrvA3eBm+Dt8Hb4J0f1yqTE9j/TfF95J/Du9jAFdzAfbGXVImX3iSvqVrs3rFalbyqarF7/UDzuqrFBnbvmOZIXlq1uAf7x7suFrCCEziDp7c4G7iCG7gH6wEWsIITOIPhVXgVXoVX4U3wJngTvAneBG+C1z/p5TUuaX4Y8+IEzuACNnAFN3AP9o98XQxvgbfAW+At8BZ4C7wF3gKvwWvwzvE7j8M5fk/GsVpxrM7xe3IB+/b4Xcj8/OXFDdyD5/gdM21pfgbzYgWjHxr6oaEfGvqhoR8a+qGhH86P7fl4PD+3N1nBafH8yOX8jfMzlxcrOIEzuICjf/JRwQ0c/TM/fDn7YX768mIFR//MD2BeXMAGruAGjv6ZH8M8f7sKWMHon4T+SeifhP5J6J+E/knon4T+SeifhP5J6J+M/snon4z+wfjNGL8Z4zdj/GaM34zxmzF+c0H/FPRPQf8U9I+hfwz9Y+gfQ/8Y+sfQP4b+MfSPoX8M/VPRPxX9U9E/Ff1T0T8V/VPRPxX9U9E/Ff3T0D8N/dPQPw3909E/Hf3T0T8d/dPRPx3909E/Hf3T0T89+qcc0T/zI5oXKzj6pxwZXMAGruAGjv4pEv1TRMAKjv6ZH8ucv3F+LvNiBSdwBhdw9M/8dObFDYz+SeifhP5J6J+E/knon4T+SeifhP5J6J+E/snon4z+yeifjP4p6J+C/inon4L+Keifgv4p6J+C/inon4L+MfSPoX8M/WPoH0P/GPrH0D+G/jH0j6F/Kvqnon8q+qeif+ZY9luFMsfyyRXcwPP6yn/jHMsnC1jB8/rZf+88R59cwAaefZucG7gv9jqh7h9s9zqhCyVw3Oj4t9m9TujCHFgCxz3PmPlNXid0YQvsC32OYczxJq8TulADU2AOLIEWWANbYF+YwpbClsLmEwv+5Xmv/emjCDh57c+JPoVwogR6C9kxBebAEmgLizdWHCVQA1OgN+b7wqcbTrTAGtgC+0KfbvBpLX9D2YUamAJzYAm0wLrQJwu673mfLOi+Y32y4MQa2AL7wnYESqAGpsAcGDY/3g+fcfN6ncUN3IP9HHixgBWcwBlcwPB2eDu8Pbxe0rNYwApO4AwuYANXcAPDK/AKvAKvwCvwCrwCr8Ar8Aq8Cq/Cq/AqvAqvwqvwKrwKr8Kb4E3wJngTvAneBG+CN8Gb4E3wZngzvBneDG+GN8Ob4c3wZngzvAXeAm+Bt8Bb4C3wFngLvAXeAq/Ba/AavAavwWvwGrwGr8Fr8FZ4K7wV3gpvhbfCW+Gt8FZ4K7wN3gZvg7fB2+Bt8CKvKvKqIq8q8qoiryryqiKvKvKqIq8q8qoiryryqiKvKvKqIa8a8qohrxryqiGvGvKqIa8a8qohrxryqiGvGvKqIa8a8qohrxryqiGvGvKqIa8a8qohrxryqiGvGvKqIa8a8qohrxryqiGvGvKqIa8a8qohrxryqiGvGvKqIa8a8qohrxryqiGvGvKqIa8a8qohrxryqiGvGvKqIa8a8qohrxryqiGvGvKqIa8a8qohrxryqiGvGvKqIa8a8qohrxryqiGvGvKqIa8a8qohrxryqiGvGvKqIa8a8qohrxryqiGvGvKqIa8a8qohrxryqiGvGvKqIa/amVfF2cAVPL2Hcw8+82ry9FZnBSdwBhewgSu4gfvifubVZAErOIEzuIANXMENDK/AK/AKvAKvwCvwCrwCr8Ar8Cq8Cq/Cq/AqvAqvwqvwKrwKb4I3wZvgTfAmeBO8Cd4Eb4I3wZvhzfBmeDO8Gd4Mb4Y3w5vhzfAWeAu8Bd4Cb4G3wFvgLfAWeAu8Bq/Ba/AavAavwWvwGrwGr8Fb4a3wVngrvBXeCu+ZV925ghu4B595NVnACk7gDC5geBu8Dd4Gb4e3w9vh7fB2ePvy5uNY66X5kAMsYAUncAYXsIEruIHhVXgVXoVX4VV4FV6FV+FVeBXeBG+CN8Gb4E3w5rVmm48573jyXEuc/yaDC3itYeYjV3AD9+BygAWs4ATO4AKGt8Bb4J3zkaMGIR+25gLzYRXcwD24rrnAfFQBKziB11xgPmoBG7iC53ynb+e5nuB8ridMFrCCE3jOs/pvPNcJJxu4gqfXt/lcJ3Q+1wknC1jBCZzBBWzgCoa3h1eOA+ze8VRnlrkucXICZ7B7R/FxlrkucXIFN3APnvlw8vSqs4ITeLY5jnmZY3yUFmeZY/xkBSfw3ObiXMAGruC5zdW5B88xfrKA49iQlMAZXMAGruC2jhM51yiczzWKyQKeaw7eJzMrTs7Bc92g+f6dY7B7n88xeHID9+A5Bk8WsHu775c5Bk/O4AKeXt8Xcwye3MDT6/0wx+DJAlZwAmdwAU+v99Ucgyc3cA+e4657v/VV/5I11tuzxnp71lhvz3qut0+u4AZe6zlZz9qZyQJW8DyWDucMLuC1npM11tuzxnp71lhvz6oHWMAKXus5WefYObmADTx/47gG0HmtK97OvKYdj8tmnde0J/fgeU17soAVnMAZXMAGhjfDm+Et2M55jXqygWc7fgzMa9STe/C8Rj1ZwApO4AwuYANPrzk38PT6sTGvUU/2f6++zfPa8uQePK8tTxawghM4gwvYwPA2eBu887pR/XfN68bxOHKe9W6H+u+a97kne5vJj+15n3tyXzzr3S4WsIITOIPdO4pY86x3O8a7svKsdzvGQ7t51rsdo/Q0z7q2Y1R45lnXdnECZ3ABG7gGz/vWUbmaZ/3axQpO4AwuYAPP/hljcNadHdl/77zfPNnAFey/N3ufzLE5eY7NkwWs4ATO4AI2cAXDm+Et8BZ4C7wF3gJvgbfAW+At8BZ4DV6D1+A1eA1eg9fgNXgNXoO3wlvhrfBWeCu8Fd4Kb4W3wlvhbfA2eBu8Dd4Gb4O3wdvgbfA2eDu8Hd4Ob4e3w9vh7fB2eDu8Pbyztu5iASs4gTO4gA1cwQ0Mr8Ar8Aq8Aq/AK/AKvAKvwCvwKrwKr8Kr8Cq8Cq/Cq/AqvApvgjfBm+BN8CZ4E7wJ3gQv8iojrzLyKiOvMvIqI68y8iojrzLyKiOvMvIqI68y8iojrzLyKiOvMvIqI68y8iojrzLyKiOvMvIqI68y8iojrzLyKiOvMvIqI68y8iojrzLyKiOvMvIqI68y8iojrzLyKiOvMvIqI68y8iojrzLyKiOvMvIqI68y8iojrzLyKp9ZpM4JnMEFbOAKbuC+uJxZNFnACk7gDC5gA1dwA8Mr8Aq8Aq/AK/AKvAKvwCvwCrwKr8Kr8Cq8Cq/Cq/AqvAqvwpvgTfAmeBO8Cd4Eb4I3wZvgTfBmeDO8Gd4Mb4Y3w5vhzfBmeDO8Bd4Cb4G3wFvgLfAWeAu8Bd4Cr8Fr8Bq8Bq/Ba/AavAavwWvwVngrvBXeCm+Ft8Jb4a3wVngrvA3eBm+Dt8Hb4G3wNngbvA3eBm+Ht8OLvCrIq4K8KsirgrwqyKuCvCrIK0NeGfLKkFeGvDLklSGvDHllyCtDXhnyypBXhrwy5JUhrwx5ZcgrQ14Z8srODOnOcxuKs2+DzxXbzJCTBazgBM7BMwfG817ZZg6crOAEzuACNnAFN3APLvAWeAu8c4yPZ8iyzTFevB/mGD+5B88xfrKAFZzAGVzABobX4DV451g27885Zn1u0+aYPbmCG7gHzzF7soAVnMAZDG+Dt8Hb4J1jzecPz3pInys76yGdz3rIkwWs4ATO4AI2cAU3MLwCr8A7x9R4X0k+6yFPzuACNnAFN/D0jjF11kOe7F6f/z/rIU9O4AwuYANXcAP34Dl+T4Y3wZvgTfDOawBfdzjrIU+u4AbuwXPsnyzg6fX+mWP/5OmtzgVs4Apu4B48x/7JAnbvqPXOZz3kyRlcwAau4AbuwTMffI3grIc8WcEJnMEFbOAKbuAeXOGt8FZ4Z1b4esRZ0ziP+Yax0DAWGsZgwxhsGIMNY7BhDDaMwYYx2ODt8HZ4O7wdY7BjDHaMwY4x2DEGO8bgmTmDz5pGH4NnTePJMRbOmsaTM7iADVzBDRxj8KxpPFnA8Aq8Aq/AKzEGz5rGkxs4xuBZ03iygBUcY/CsaTw5xuBZ03hyBTdwjMGzpvFkASs4xuBZ03hyARu4ghs4xuBZ03hyjIWzpvHkBM7gAjZwBTdwjMGzpvFkeAu8Bd4S4/GsUfR1wLNG8WQBz3b8WD0zZHIGF7CBK7iBe/CZIZMFDG+Ft8I7r0l8DfGsUTy5ghu4B8/8OVnACk7gDIa3wdvgnTnT/XibeTL7c+bJyQWMfuvot45+69FvZ83hyQJWcAJncAEbuIIbOPrtrDk8WcAKTuAMLmADV3ADw6vwKrwzN7yfzxrC8VBQPmsIT+7BMx9OFrCCEziDC3huf3eu4AbuwWc+TBawghM4g4dXRn1snjWEF1dwc07OPdjz4WIBKziBM7iADVzB8BZ4DV6b7Wfn2Y7vL6vgBu7B9QALWMEJnMEFDG+Ft8LbZvve5z7exdejZ43fxQau4AbuwZ4DFwtYwfNvX2PtNT05/011VnACz23rzgXs2zY++FD8BXAvFucG7sE+li8WsHvHC7DLrBW8OIPdq77NYuDpNefp9W328SXJt83H18k+LiR5mz4uLlZwAmdwARu4ghu4Bxd4C7wF3nnMJ/8t85g/uYFnm23wPOZPFrCCEziDC9jAFdzA8FZ4K7xzLCQ/NuYxn33/zmP+5B7s58SLBezbNuZtyqx/k+z7uhewgSu4gfviWf92sYAVnMAZXMDhnbVtMuoSy6xtu1jBCZzBBWzgCm7Bfh0r433FZda8XZzBBWzgCm7gHuznqYsFDG+CN8GbZpvZuQfPsXaygGeb3odzTI13TBeZY+rkCm7gHjzH1MkCVnACZzC8Bd4C7xxTY26qyBxTJydwBhewgSu4gXvwHFMnw1vhrfDOsTbmyorMY3581bToPLbHS7LLrGGTMTdVZg3bxQau4AbuwfM4P1nACk5geAVegXceG+Pt2WXWg12s4ATO4AK24Hk8jM+WFZ3Hw8kKnm025wwuYANXcAP34JnDJwtYwfAavAavwWvwGrwGb4W3wlvhrfBWeCu8Fd4Kb4W3wtvgbfA2eBu8Dd4Gb4O3wdvgbfB2eDu8Hd4Ob4e3w9vh7fB2eHt4Zx3axQJWcAJncAEbuIIbGF6BV+AVeAVegVfgFXgFXoFX4FV4FV6FV+FVeBVehVfhVXgV3gRvgjfBm+BN8CZ4E7wJ3gRvgjfDm+HN8GZ4M7wZ3gxvhjfDm+Et8BZ4C7zIq4S8SsirhLxKyKuEvErIq4S8SsirhLxKyKuEvErIq4S8SsirhLxKyKuEvErIq4S8SsirhLxKyKuEvErIq4S8SsirhLxKyKuEvErIq4S8SsirhLxKyKuEvErIq4S8SsirhLxKyKuEvErIq1n/JmOuuMz6t4vb4lnzJmPut8yat4sV7K7xTEGZNW8XF/B0dWf/LWM+tszatosF7O2P+dUya9tOnjnQ/d/M8dt9O+f4PTmD57/3v53jt/s2z/F7sv/eMUdUZj3YyXP8Tp7jaMyZlFmXdXECZ3ABG7iCG7gHz3F0MrwGr8HrY0EP/70+Fi4WsDr77/WxcHEGF7CBK7iBe3A7wAKGt8Hb4G3wNngbvA3eBm+Ht8Pb4e3w9un1fdoL2MAV3MB98ay/uljACk7gDC5gA1dwA8Mr8Aq8Aq/AK/AKvAKvwCvwCrwKr06vOSs4gTN4epuzgSu4gXtwiuvwcp5zJzew//vxXu4y66YuFrCCEziDC9jAFdzA8BZ4C7wF3gJvgbfAW+At8BZ4C7wGr8Fr8Bq8Bq/Ba/AavAavwVvhrfBWeCu8Fd4Kb4W3wlvhrfA2eBu8Dd4Gb4O3wdvgbfA2eBu8Hd4Ob4e3w9vh7fB2eDu8Hd4e3lk3dbGAFZzAGVzABq7gBoZX4BV4BV6BV+AVeAVegVfgFXgVXoVX4VV4FV6FV+FVeBVehTfBm+BN8CZ4E7wJ3gRvgjfBi7wy5JUhrwx5ZcgrQ14Z8sqQV4a8MuSVIa8MeWXIK0NeGfLKkFeGvDLklSGvDHllyCtDXhnyypBXhrwy5JUhrwx5ZcgrQ14Z8sqQV4a8MuSVIa8MeWXIK0NeGfLKzrzKzj34zKvJ02XOCZzB01Wdp6s7V3AD9+CZUePLDmW+l0/VvTOjfC1jvpfvYveOD3mWWW+mvpYx38t3sXvTbNO9abbZF886NB3PkZVZh3axghM4gwvYwBXcwD1Y4BV4BV6BV+AVeGf++FpDPfOnOwtYwfNvJ/u2jefgyqwZU19rmDVjFwtYwQmcwQVswTMHfP1i1npdXMDz3yfnCm7gHjxz4GQBKziBM7iA4S3wFngLvAavwWvwGrwGr8Fr8Bq8Bq/BW+Gt8FZ4K7wV3gpvhbfCW+Gt8DZ4G7wN3gZvg7fB2+Bt8DZ4G7wd3g5vh7fD2+Ht8HZ4O7wd3h7eWSd2sYAVnMAZXMAGruAGhlfgFXgFXoFX4BV4BV6BV+AVeBVehVfhVXgVXoVX4VV4FV6FN8Gb4E3wJngTvAneBG+CN8Gb4M3wZngzvBneDG+GF3nVkFcNedWQVw151ZBXDXnVkFcNedWQVw151ZBXDXnVkFcNedWQVw151ZBXDXnVkFcNedWQVw151ZBXDXnVkFcNedWQVw151ZBXDXnVkFcNedWQVw151ZBXDXnVkFcNedWQVw151ZBXDXnVkFcNedWQVw151ZBXDXnVkFcNedWQVw151ZBXHXnVkVcdedWRVx151ZFXHXnVkVcdedWRVx151ZFXHXnVkVcdedWRVx151ZFXHXnVkVcdedWRVx151ZFXHXnVkVcdedWRVx151ZFXHXnVkVcdedWRVx151ZFXHXnVkVcdedWRVx151ZFXHXnVkVcdedWRVx151ZFXHXnVkVcdedWRVx151ZFXHXnVkVcdedWRVx151ZFXHXnVkVcdedWRVx151ZFXHXnVkVcdedWRVx151ZFXHXnVkVcdedWRVx151ZFXHXnVkVcdedWRVx151ZFXHXnVkVcdedWRVx151ZFXHXnVkVcdedWRVx151ZFXHXnVkVcdedUjr+yIvLIj8sqOyCs7Iq/siLyyI/LKjsgrOyKv7Ii8suOAV+AVeAVegffMK3MuYANPV3PuwWdGTV73TXZoAmewtz+em7P5/r2LK7iBe/DMpZMFrOAEzmB4E7wJ3gRvgjfDm+HN8GZ4M7wZ3gxvhjfDm+Et8BZ4C7wF3gJvgbfAW+At8BZ4DV6D1+A1eA1eg9fgNXgNXoO3wlvhrfBWeCu8Fd4Kb4W3wlvhbfA2eBu8Dd4Gb4O3wdvgbfA2eDu8Hd4Ob4e3w9vh7fB2eDu8PbyzHvJiASs4gTO4gA1cwQ0Mr8Ar8Aq8Aq/AK/AKvAKvwCvwKrwKr8Kr8Cq8yCtBXgnySpBXgrwS5JUgrwR5JcgrQV4J8kqQV4K8EuSVIK8EeSXIK0FeCfJKkFeCvBLklSCvBHklyCtBXgnySpBXgrwS5JUgrwR5JcgrQV4J8kqQV4K8EuSVIK8EeSXIK0FeCfJKkFeCvBLklSCvBHklyCtBXgnySpBXgrwS5JUgrwR5JcgrQV4J8kqQV4K8EuSVIK8EeSXIK0FeCfJKkFeCvBLklSCvBHklyCtBXgnySpFXirxS5JUirxR5pcgrRV4p8kqRV4q8UuSVIq8UeaXIK0VeKfJKkVeKvFLklSKvFHmlyCtFXinySpFXirxS5JUirxR5pcgrRV4p8kqRV4q8UuSVIq8UeaXIK0VeKfJKkVeKvFLklSKvFHmlyCtFXinySpFXirxS5JUirxR5pcgrRV4p8kqRV4q8UuSVIq8UeaXIK0VeKfJKkVeKvFLklSKvFHmlyCtFXinySpFXirxS5JUirxR5pcgrRV4p8kqRV4q8UuSVIq8UeaXIK0VeKfJKz7zKzj34zKvJc72pOydwBhewgSu4gfvidK6vTRawghM4gwvYwBXcwPAKvAKvwCvwCrwCr8Ar8Aq8Aq/Cq/AqvAqvwqvwKrwKr8Kr8CZ4E7wJ3gRvgjfBm+BN8CZ4E7wZ3gxvhjfDm+HN8GZ4M7wZ3gxvgbfAW+At8BZ4C7wF3gJvgbfAa/AavAavwWvwGrwGr8Fr8Bq8Fd4Kb4W3wlvhPWsAJhu4gmdWNOcefGbUZG9/PEdjsx744gI2cAU3cA+eWXSygBUMb4e3w9vh7fB2eHt4Z23wxQJWcAJncAEbOLyz7lfHcz0232l5cQHPvzXnCp7b3J178MyWk32bxzurbb7T8uIEzuACNnAFN3APntlyMrwJ3gRvgjfBm+BN8CZ4E7wZ3gxvhjfDm+HN8M5sqb5fZrac3MA9eGZL9X00s+VkBSdwDp75MN4rYrP++WIFz7+tzhlcwAau4AbuwTMfThawguGt8FZ4K7wV3gpvhbfB2+Bt8DZ4G7wN3gZvg7fB2+Dt8HZ4O7wd3g5vh7fD2+Ht8PbwnrXTJwtYwQmcwQVs4ApuYHgFXoFX4BV4BV6BV+AVeAVegVfhVXgVXoVX4VV4FV6FV+FVeBO8Cd4Eb4I3wZvgTfAmeBO8Cd4Mb4Y3w5vhzfBmeDO8Gd4Mb4a3wFvgLfAWeAu8Bd4Cb4G3wFvgNXgNXoMXeVWQVwV5VZBXBXlVkFcFeVWQVwV5VZBXBXlVkFcFeVWQVwV5VZBXBXlVkFcFeVWQVwV5VZBXBXlVkFcFeVWQVwV5VZBXBXlVkFcFeVWQVwV5VZBXBXlVkFcFeWXIK0NeGfLKkFeGvDLklSGvDHllyCtDXp012ON5KDtrsE9WsLvGs1F21l2fbGB3je/g2Fl3fXIPnhk1vl9jZ931+MS4nXXXJydwBhewgSu4gXvwzKiT4U3wJngTvAneBG+CN8Gb4M3wZngzvBneDG+GN8Ob4c3wZnhnRnXfdzOjTlZwAru3+z6aGXWygWvwzKLu+31mTvd9OjPn5AI28GzHnH37ux+HM3O6b//MnJMFrOAEzuACNnAFNzC8njlpfBPT5rs3L1ZwAmdwARu4ghu4B3d4O7wd3pk541k8O2uqTy5gA1dwA/fFZ031yQJWcAJn8Py94mzgCm7gHiwHWMAKTuAMhldm++OYnHXUaTx/Z7OOOo3nyGy+q/PiDC7guf3mXMEN3IPTARawghM4gwsY3gRvgjfBm+HN8Obprc4J7F7xvvI8udjAFdzAPdjzJIm36XlysYITeHr9OCkFbGD3jvcv2azfvti96vvRc+ZiAbtX/bd7/lycwe5Vd3n+XFzBDdyD6wEWsIITOIPhrfBWeCu8Fd4Gb4O3wdvgbfDO/EnehzN/ko+LmT8nN3APnvlzsoAVnMAZXMDwdng7vD28s377YgErOIEzuIANXMENDK/AK/AKvAKvwCvwCrwCr8Ar8Cq8Cq/CO/NqvFPLZv32xdObnQ1cwQ08vePYmPXbaTw/YrN++2IFJ3AGF7CB3es1UbN+++SZUV6XNWu2L56u4pzAGVzABq7g6TLnHjwz6mQBKziBM7iADVzB8M4sGt8AtVmbfXECZ/BsvzsbuIIbuAfPLDp5en2fziw6OYHd6+tKszb7YgNXcAP34JlFJwt4zo27a95bnVzBDdyD573VyQJWcAJnMLwd3g5vh7eH96y7PlnACk7gDC5gA1dwA8Mr8Aq8Aq/AK/AKvAKvwCvwCrwKr8Kr8Cq8Cq/Cq/AqvAqvwpvgTfAmeBO8Cd4Eb4I3wZvgTfBmeDO8Gd4Mb4Y3w5vhzfBmeDO8Bd4Cb4G3wFvgLfAWeAu8Bd4Cr8Fr8Bq8Bq/Ba/AavAavwWvwVngrvBXeCm+Ft8Jb4a3wVngrvA3eBu/5rGt3TuAMnuvv898buIJnBo7z1KyvTuP9fjbrqy/2jB3v1rNZX33xzFh3zeufkz1jfY1p1ldf3C+us746jTWmOuurL1ZwAmdwARu4ghu4Bwu8Aq/AK/AKvAKvwCvwCrwCr8I7r3/Ge+3qrLu+OIEzeHqrs4EruIF78LxuGetxddZLX9zAPXhew5wsYAUncAYXMLwZ3gxvhrfAW+At8BZ4C7wF3gLvvN4Y3+Gts4b54gb2bah+TM7rjZMFrOAEzuACNnAFNzC8Dd4Gb4O3wdvgbfA2eBu8Dd4Gb4e3w9vh7fB2eDu8Hd4Ob4e3h3fWMF8sYAUncAYXsIEruIHhFXgFXoFX4BV4BV6BV+AVeAVehVfhVXgVXoVX4VV4FV6FV+FN8CZ4E7wJ3gRvgjfBm+BN8CZ4M7wZ3gxvhjfDm+HN8GZ4M7wZ3gJvgbfAW+At8BZ4C7wF3gJvgdfgNXgNXoPX4DV4DV6D1+BFXgnySpBXgrwS5JUgrwR5JcgrQV4J8kqQV4K8EuSVIK8EeSXIK0FeCfJKkFeCvBLklSCvBHklyCtBXgnySpBXgrwS5JUgrwR5pcgrRV4p8kqRV4q8UuSVIq8UeaXIK0VeKfJKkVeKvFLklSKvFHmlyCtFXinySpFXirxS5JUirxR5pcgrRV4p8kqRV4q8UuSVnnllzgJW8HQ15wI2sLvG+l2ddcsX9+CZUScLWMH+G8e3YOqsW764gA08vb4NM6NO7sEzo8b3X+qsW07df9fMqJMT2L19/m0BG7iCG7gHz4w6WcAKTmB4DV6D1+A1eA1ez6h8+O/1jMqH72vPqIsTOIML2MAV3MA9uB1geBu8Dd4Gb4O3wdvgbfA2eDu8Hd4Ob4e3w9vh7fB2eDu8PbyzhvliAU9vck7g6c3OBWzgCp7e5uze8V6mOmuYLxawghM4gwvYvWPNpc4a5ov9XnisrdSzbvlkASs4gTO4gA1cwQ0Mb4I3wZvgTfAmeBO8Cd4Eb4I3wZvhzfBmeDO8Gd4Mb4Y3w5vhzfAWeAu8Bd4Cb4G3wFvgLfAWeAu8Bq/Ba/AavAavwWvwGrwGr8Fb4a3wVngrvBXeCm+Ft8Jb4a3wNngbvA3eBm+Dt8Hb4G3wNngbvB3eDm+Ht8Pb4e3wdng7vB3eHt6znnnMTdWznvlkBc9nSZpzBhfw9E6u4AaeGTUyMJ9ZlJ0TOIML2MAV3MA9WA+wgOFVeBVehVfhVXgVXoU3wZvgTfDOPFHnmScne/+r99XMk5PnHKb32zlXPHlupzkbuILndvq+zj24HGABKziBM7iADVzB8BZ4DV6D1+A1eA1eg9fgNXgNXpte78N5zXOygBXs3rHuX2ed88UFbOAaPK9PxjeY6qxJvriCfdvGN5jqrEk+eV6fnCxgBSdwBhewgSsY3h7eWZN8sYAVnMAZXMAGruAGhlfgFXgFXoFX4BV4BV6BV+AVeBVehVfhVXgVXoVX4VV4FV6FN8Gb4E3wJngTvAneBG+CN8Gb4M3wZngzvBneDG+GN8Ob4c3wZngLvAXeAm+Bt8Bb4C3wFngLvAVeg9fgNXgNXoPX4DV4DV6D1+Ct8FZ4K7wV3gpvhbfCW+Gt8FZ4G7wN3gZvg7fB2+Bt8DZ4kVcFeVWQVwV5VZBXBXlVkFcFeVWQVwV5VZBXBXllyCtDXhnyypBXhrwy5JUhrwx5ZcgrQ14Z8sqQV4a8MuSVIa8MeWXIK0NeGfLKkFeGvDLklSGvDHllyCtDXhnyypBXhrwy5JUhrwx5ZcgrO/OqOmdwAU9Xd27gHjwzatSJ1VmTfLGC3ZXEOYML2MAV3MA9eGbUyQJWMLwzo/y6a9Ye5+T9MLNo1DjV+c7nk2cWnSxgBSdwBhewgafXnBu4B88sOlnACk7gDC5gA8Nb4a3wNngbvA3eBm+Dt8Hb4G3wNngbvB3eDm+Ht8Pb4e3wdng7vB3eHt5Zq3yxgBWcwBlcwAau4AaGV+AVeAVegVfgFXgFXoFX4BV4FV6FV+FVeBVehVfhVXgVXoU3wZvgTfAmeBO8Cd4Eb4I3wZvgzfBmeDO8Gd4Mb4Y3w5vhzfBmeAu8Bd4Cb4G3wFvgLfAWeAu8BV6D1+A1eA1eg9fgNXiRVxV5VZFXFXlVkVcVeVWRVxV5VZFXFXlVkVcVeVWRVxV5VZFXFXlVkVcVeVWRVxV5VZFXFXlVkVcVeVWRVxV5VZFXFXlVkVcVeVWRVxV5VZFXDXnVkFcNedWQVw151ZBXDXnVkFcNedWQVw151ZBXDXnVkFeztjmPmt46a5svNrC7Rn1vnfXMJ8+MOlnACk7gDC5gA/tvHDXDddYzX9yDZ0adLGAFJ3AGF7CB4U3wJngzvBneDG+GN8Ob4c3wZngzvBneAm+Bt8Bb4C3wFngLvAXeAm+B1+A1eA1eg9fgNXgNXoPX4DV4K7wV3gpvhbfCW+Gt8FZ4K7wV3gZvg7fB2+Bt8DZ4G7wN3gZvg7fD2+Ht8HZ4O7wd3g5vh7fD28M766IvFrCCEziDC9jAFdzA8Aq8Aq/AK/AKvAKvwCvwCrwCr8Kr8Cq8Cq/Cq/AqvMirjrzqyKuOvOrIq4686sirjrzqyKuOvOrIq4686sirjrzqyKuOvOrIq4686sirjrzqyKuOvOrIq4686sirjrzqyKuOvOrIq4686sirjrzqyKuOvOrIq4686sirjrzqyKuOvOrIq4686sirjrzqyKuOvOrIq4686sirjrzqyKuOvOrIq4686sirjrzqyKuOvOrIq4686sirjrzqyKuOvOrIq4686sirjrzqyKuOvOrIq4686pFX7Yi8akfkVTsir9oRedWOyKt2RF61I/KqHZFX7Yi8ascBr8Ar8Aq8Aq/AK/AKvAKvwCvwKrwKr8Kr8Cq8Cq/Cq/AqvApvgjfBm+BN8CZ4E7wJ3gRvgjfBm+HN8GZ4M7wZ3gxvhjfDm+HN8BZ4C7xnXlXnBM5gd5XJ7hr1/22+m/riHjwz6mQBKziBM7iADQyvwWvwVngrvBXemUV2DJ7ZcrKAFezbOZ5laLMe++ICNnAFN3APntlysoAVDG+Ht8Pb4e3wzmwZzxS0WY89edZjXyxgBSewe8d7q9qsx77YwBXs3lHj12Y99skzW05273g/VZv12Lm4a2bLyRk8veZs4Aqe3ubcg2e2nCxgBSdwBhewgSsYXoU3wZvgTfAmeBO8Cd4Eb4I3wZvgzfBmeDO8Gd4Mb4Y3w5vhzfBmeAu8Bd4Cb4G3wFvgLfDOnBnfuW6zHvti97YxNmc99sUCVrB7mx9vM2eaHzMzZ042cAU3cA+eOXPy9FZnBc8s9W0+v4fuY+T8HvrkBp7t+2+fuXSygBWcwP67uv/emUsnG7iCG7gHz1w6WcAKTmB4O7wd3g5vh7eHd9ZdXyxgBSdwBhewgSu4geEVeAVegVfgFXgFXoFX4BV4BV6FV+FVeBVehVfhVXgVXoVX4U3wJngTvAneBG+CN8Gb4E3wJngzvBneDG+GN8Ob4c3wZngzvBneAm+Bt8Bb4C3wFngLvAXeAm+Bd+bMeO9Qm7XTebxTqJ01zz07F7CBK3i2b849eObDyfN3VWcFJ3AGF7CBK3h6m3MPPvNhsoCnqzjPv+3OffFZt3yygMc2l/Gumzbrli/O4OKcnA1cwQ3cg32MXyzO2Xl6i/P0mvP0VufZZnPuwXqABTzb9N/l47SMmuc2a4CL+G/xY17GN0bbrOm92L0yuYANXMEN3IP9mL9YwLNN74cy2/R+KBXcwD3YDrCA/feK96GfZy/O4AI2cAU3cA+us03fLzWDC3i26furVnAD9+B2gAWs4ASebfr+bQ3cg/ts0/d7F7CCEziDC9jAdfGsoS2jJrDNGtqLE9jbHDWBbdbQXmzgCm7gHjzHy8nTq87Tm5wTOIML2MAVPL3ZuQfPMXWygBWcwBlcgtMRfZLQbwn9llL8xoR+S+i3hH5L6LeEfkvot3xEX2WJ35vRbxn9ltFvGf2W0W9zvM/fldFvGf1W0G8F/VbQbwX9VtBvc4zrGGuzhraM90q1WUN7sYITeLZTnQvYwBXcwD24Tm9zFrCCEziDC9jA0+tjZ+ZA8v0+c2DyzIGTBazgBHZv8n3t59CLDVzBDdyDZ1acLOAc+2JmwuznmQknV3ADR3/O+tuLBazgBM7g6M9yGLiCG7gHywEWsK59MetvZ3/O+tuLC9jAFdzA0Z+z/vZiASs4gTO4gA082x9jcNbZXjzbL84KTuAMLmADz9/lfT7z5OQePPPkZAG7N3s/zDw5OYML2MAV3MA9eOZD9n6Y1wZ+fTLrXYvPGc5614szeHqzs4EreHq9H2YOTJ45cLKAFZzAGTy95mzgCm7gHr9rjuvsx+oc1ycbuIIbuAfPcV28zTmuT1ZwArvX57hm/Wrx+clZv3pxBTdwXzzrVy8WsIITOIML2MAV7F6fo5j1qyfP8X6ygBWcwBnsXp+rnPWrF7vXkvP0Nuce//c53k+eXt/OOd5PTuAMLmADV3ALHmP8tbjnmAJzYAm0wBrYBlbHvnCM7Qsl0G3+g3MKzIFu8y3LFlgDh82nrb0s9cRxhXChBA7b3B3j8qDPHh13Bn28vKZ5QeqFLbAvNG/XHL1d/xXm7frmjJjo1W0jJbpPEnsh6oUWWAOHzSeLvQj1xJEPF0rgsPlkshed9vFNg+Y1p92nhr3ktPuMolec9uY/c4TBhX3huCS4UAI1MAUOm88qeqXpheNANb/ZnEWkFwtYwQmcwQVs4Apu4PDOItKLBTz/fXfuwT6QzW8MZ/Hnxb6dfiM2iz8vzmDfTr8Rm8Wf5jdNs/jz4hass333qoITOIML2MAV3MA9OB1geBO8CV4/EZvfIMziTPML+1mceXECZ7Bvp1/8z+LMiyu4gX07/SJ8FmdeLGAFp9gvJYML2MAV3MDT6/vODrCAFTy32fdvnb/X+6oWsIEruIF7sF94m1/IzSLJixWcwO5N3m9+gr7YwO71i7RZJHlxD57j8WQBKziBp9f7f47Hkw1cwdM1jodZ3Gij+LDN4saLK7iBe/AcjycLWMEJnMHwCrwC7xxf4+VybRYoXmzBOXJpFvhdXMAGruAGjlyaBX4XC1jB8BZ4C7zz+PSLt1mYd7H/+zz/TQEb2LfTLxpnYd7FPdgvRC8WsIITOIML2MDwVngrvPM49wvUWVBnvvg+C+ou7sHzeD55bqfvu3k8n5zAGezbOV522mZB3cUV3MDuHS8PbLOg7mIBKziBM3h6s7OBK7iBp3f0ySyou1jACk7gDJ7e6mzgCm7g6R15NQvqLhawghM4g93rF1yzoO7iCm5g9/pV2Syou1jA7vXLtVlQd3EOnmPTL9NmQZr5xdksSLs4gwvYwBU8t7M59+B5HjlZwO71y79ZkHZxBrvXL/tmQdrFFdzAPXiO05MFPL3qnMAZXMDzN/r+mjd03ftw3tCdLGAFJ3AGF7CBK7iBl7fPArCL59/mwfMmayyy9FmUVcYCUJ9FWRdncAHPdqpzBTdwD543WScLeHqb8/R255nVh/PManE2cA2ekyrNf9ecVDlZwQmcwQVs4Ar239W8r+akSvN+mJMqzX/LnFRp/lvmpMrJCZzBBWzgCm7gHjwnaU+Gt8Bb4C3wFngLvAXeAm+B1+A1eA1eg9fgNXgN3jmZ03y/z8mcyXNypvsxMCdeuu/rim2r2LaGbWvYtoZta9i2hm1r2LaGbWvokwZvg7fD2+Ht8HZ4O7wd3g5vh7fD28M7i68uFrCC0+rPWXx1cV99K+d4F+fYtlkodbGBK7iBsW2KbVNsm2LbNIHhVXgVXoVX4VV4E7wJ3gRvgjfBm+BN8CZ4UxyfcuaA8xzXsz/nmJ39iTErGLOCMSsYs4IxKxizgjErGLOCMSsYs4IxKxizgjErGLOCMSsYs4IxKxizYvAavAZvhbfCOydgZ79VHJ9zXM8+nGN29iHGrGDMCsasYMwKxqxgzArGrGDMCsasYMwKxqxgzArGrGDMCsasYMwKxqxizCrGrGLM6pHAGVxWX83CpJPP8/jhXFa/KcasYswqxqxizCrGrGLMKsasYswqxqxizCrGrGLMKsasYswqxqxizCrGrGLMKsasYswqxqymOKcoxuwsCjr7Ksc5RXGeVYxZxZhVjFnFmFWMWcWYVYxZxZhVjFnFmFWMWcWYVYxZxZhVjFnFmFWMWcWYVYxZxXlWLXJsFhSd/VMjxxTnWcV5VnGeVZxnFWNWMWYVY1YxZhVjVjFmFWNWMWYVY1YxZhVjVjFmFWNWMWYVY1Y7+qRHn5yFQ94nZ1GQ98lZFOR/exYFnSxgBSdwBhewgSu4geHFmE0YswljNmHMJozZhDGbMGaTxthJGn0yX1R49kOKsZMSti1h2zK2DdfGCdfGCdfGCdfGCdfGCdfGCdfGCWM2YcwmjNmEMZswZhPGbMKYPYua5u8tkbFnkdL87RYZmzC+EsZXwjkx4ZyYcE5MOCemim2r2LaKbavokwpvhRfXxgljNmHMJozZs0hp/saWwHEuPouO5u/F+EoYXwnjK2F8JYyvhHNiwjkx45yYcU7MOCdmnBMzzolnYdLJBq7gOIbPwqTJEuP6LCLy35gxvjLGV8b4yhhfGeMrY3xljK+M8ZVxTsw4J2acEzPOiRnnxIxz4ll0NH9LyuC4tj8LhObvwvjKGF8Z4ytjfGWMr4zxlTG+MsZXxvjKGF8Z4yvjnJhxTswlMicX7C+LzDmLf+ZvwfjKGF8Z4ytjfGWMr4zxlTG+MsZXxvjKGF8Z4ytjfJ3FP3Obz/E12WL7z/kf336cvzLOXxnjK2N8ZYyvjPGVMb4yxlfG+CoYXwXj6yzg8e0suE88C3J8m89iG9/mgvNXwfmr4PxVcP4qOH8VnL8KxlfB+CoYXwXj6yy2mdumGRzH+VkwM7cT14cF14cF14cF93QF56+C81fB+avg/FVw/joLZub2ZGxbxrYVbBvGQsFYKBgLBdeHBdeHBdeHBdeHBdeHZ1HN3AbDthn2acU+xVgoGAsFY6FgLBSMhYKxUDAWCsZCwVgoGAsFY6FgLBSMhYKxUDAWCsZCwVg4i1umC9dyZ7GKe89CFPeehSj+t4ZrOcO1nOFaznAtdxaizPYlg2O/n0Uj04XzguG8YDgvGM4Lhusu0zhnzZeYne2nOGcZjlvDcWs4bi3HsWE4bi3HsTFfLHa2iQw3HLeGayTDNZLhGslwjWS4RjLM9RnuQQxzfYa5Pqv8N+iHhn6Yx0mdnMG+DdXbmcfJyRXcwN7+mMPv8wVZr9HhnMAZXMAGruAGnu2P+eRZI3GxgBWcwBlcwNNbnCu4gXvwzNuTBazgBJ4uczZwBTdwD57XMCcLWMEJnMHwJnhnbo+PsPdZX3FxD57H/8kCVjD2acY+zdinGft05vko++mzvqKMhwf7rKO4OIML2MDz+D+cG3ge2+M4rGe2Txawxr8/s31yBhewgeE1eM9rJ+fz2mmygFP89orfOMfpyQ3cgxv6qqHNht9y3nf4bzznCiYXMH5Lw29p+C0Nv6Xjt3R4O7wdfdjRhx19eGaF//Yev3G+nOpiBSdwBkeb7TBwXb+xneejyXE8NInf0kTACk7gDIZX4JUKbuDow6ZwKVwKl8KlcClcCtd5XkvOPfi835ksYAUncAZPrzobuIKnV//7v//ptz//9d/+8Pc//fUv//L3v/3xj7/983+t/8N//PbP/+O/fvv3P/ztj3/5+2///Jf//POf/+m3/+8Pf/5P/0f/8e9/+Iv/9+9/+Nvr//v6NX/8y/96/ffV4P/+05//OOi//yn++vj4T1sbhdf+16PYYzXQ+w8tyMct5FFA5Q28btjW39cft0A//nv/Kq3//WvCYP291Hr7J/RROuMt9PFnH/yEvNkE/5rj3IYsGi20uy2IV416Cy8s0YL90IJttmGsNc9urLEFr/WDuw3UcZEyd6TYauA1ifRDA23zG6xem/BaIqkfNtE/bkKPdu1MfS27fdiEbHbna/r+6srXLH3/sI3N3rA6nlj0Jux1toze1J82Y3NYqhcrzc14XQ1EG+XHI3uUHj7bp9sfMkrozx9i7eMfUjZtaLTxmqZfbZSfRvjm0HodDrqODIywn5uoHzfR5erN3jjKy/0W+hphh5SPm9gdnprj0CqxGVl+DKvN0fla0F5dcRT5cDN0k5jmdZRzj5hxM34Kzc3hOT5Rf7XxOnl93Mbm8NR8HRiv5Zho4ajfOzD6xwfG9vBsqzNeqzAfNbEZJOPtLSv5yseDRDcH13jb+dnGeJk3Rrv+2EZ7PNC0Px5o6Xg60LYt3BtoSR8PtJSeD7SUnw+0VJ4PtGRPB9rtA+PjgbY/PG8NtO0oqeU6oY1X6344SvLxeJRkeTxKsj4dJdsW7o2SnB+Pklyej5Jsz0dJrs9HSW5PR8ntA+PjUbI/PJ+PklaurRgvqv1wlBR9PEpKejxKSn46SrYt3BslxR6PklKfj5LSno+S0p+PEjuejpLbB8bHo2R/eD4eJeN9mNdV27G54rL8+BC38vQQ37Zw7xC3+vgQt/b8ELf+/BCvx/NDvMrTQ/z2gbG5XNoen2ufjNeCfnxHsGtD09UZLfWPzwR1c3i1subX2m4eotp2LuOaIdPGsfbTTMT2t2RZd1k52ce/pT0er7U/Ha/bFu6N1yaPx2vT5+O1pefjteXn47WVp+P19oHxzfHK45Nzfl8Zr9nWZHhuH4/X1h9Oh/fj6Xz49mf4y07mzyh5c5u2m1OxlVzS5MM5lZ4eX8P25yf4/vgE35+f4PvzE3x/wwm+v+EEL8cbzvByPD7F9+en+P0B+njqsfXrd4xHzT6enz/KbvWp9Vh9whlef5qIPd4wRX88n6M/3jBJfzyfpRd5wzS9yBvm6UXeMFEv8nym/njDVP3tI1XL5kjdNpJyNFI/bmS3GHT31+zaSLXmONPWj9ZsZbeidHfNVHZrSrdXTVWeL5vu901dB1pqaRNFup25l5Wrr3F42Mdrp/r83C/6+OS/b+Jmounz07/oG87/ou+4AEjvuABIjy8A7h8gmwzQT1aZjjhW2a+/HKvbZmq11Uy3XbnAbja/r3xVKfbhffp2DGdXzDsQsePjMZzq88GX2uPBt23i5uDLx/PBt11YuDv4ditGtwdfTm8YfNuFp3uDL9Xf93LidXjmdaS2/vGRmt9wpObnR2p+w5Fa3nCklnccqeUdR2p5x5Fanh+p+Xc/UpGpXb534fv6y1UOpro53MvzIhMpz6tMxB6XmeybuDlk7HmhidgbKk3E3lBqIvaGWhOxx8Um9w+QXVnX83KT3dpxOq59O55D/nhyZbceVf3dY3Mxvpt+fF22W5ASWTtXUs8fX5dtOyQd15B54Tc7NWm0gfuzXwoxd5Fa61oMqpja/aWN8jxBdotSdytC7XmC7JYe7ibIbknpdoK04w0JsluZup0gu7Wpmwly+wDZJMj+QLUSB2r6XhutXf2h/Tg+bKPt6qPKmp6x0vM321iVc9s29r9lrQxp181vebx8um/ibh32drIqbnTTkT4cdH1zlOY1XDKG3C8tPF/Gle0yxN2hv1thkteJ5DrUX9ONeALll3Hbd1O8r7m21cxrUlE2zWwumMtaSC2aPx7+/XEp392tSLJpYtsfPr1/9oegiOOXKvndWtV4uem1Ftob9s3Rfmpkt95f4mAbHzaRzbbsFgJsHW5qObbFvrIl/n2cc0tK1s2W7I5ZXZcRr9nCj4+Tr2yL7bZl30wr0QyuNr/YTFtPko3nHY/vN6PRTOrfbaau885ocnPE7BaxXvNrNa5d0/f20+2nTZ4vYu2b6Ovo3/6U7XHbcNym7x63dsRxayLf3cVWJJrpm4CS9o6905/vnf587+x7JMVBb2UzBLdPR8V0/GuBLn0Uk/sHrLSuTkU90ZeaqLFf6kdNfHIK0/UY4ott1x/2+Fppe4nS40JHeiqbDdmtYuX4Obluri7uXwh/XC22f0xqFW7oZqZ1fy8ucS/ePt6K3TVsXmH02jEfzyvq7kmpJLLWsV/HyMcb8nyxVdPjxdZ9E/fuLTQ9X2zV9IbFVk1vWGzV/IbFVs2PF1vvHyCbCs39gZplHaibByS3bZRy9Ucq1b7ZRu6P26gWZZrWv9lGrquN8nEbu3Wnm5MTn7Rxa3Ji/1uaRuVIrs/bKPK9Nmyd+VPb/JbtAzKtrmO9593oT7vVnoh2wbOSv2xIeb5z920837lZVghlLcfH27GLVO/y80IGAfK1TtU16nI+Pu7U3bJTLqtAu272rW3yNPVjBVnXzU3rbukqx2TNK4k3l/67tStdV8tauB3yhf5YFWwlH5vdsvspZT3xmEv9uKRPt+tW99Yl1J4XA6g9LgbYN3HzMqY+LwbQ+oZiAK1vKAbw+aDHlzH1cTHA/QNkcxmzP1BvrUvs27i3LqH1Daft/XbcWlPQ9rgUYN/EzQFz/6dsXpGQHt4VfhKF66dk297R7RoxXefbuimM0t2S083yZm274XKzvFnbbjHgZnmztu1DAffKm7f9WuJOuWjd7JzdqtG9Y2TXwt09s3t25fae2S1e3d4zu5mh9+wZ7Vju2e2Z+nuO3pJXLJdybC5kdk9ZJZ8knbtXMVFmX2mir7vLdLQPmki7Vassq7A5S/pw/nLbG5Flr6WZ9r0sK30dHna0j58Z8WKfj3/MumZPccLVnH5qojxdOdtvxXqsMuP649et2L6Jota1HHNUnLXtK43EY2dy9KN868es++RybLp0/5BVTT1+DCan7UuN3OuRfSP3emR7pJqX+J/XU5gW+tLhbjXFqwetfK+ReqxJrnrszv/bLelR+Sb2cZal3TNS91IkveExq/SOx6zSOx6zSu94zGq/f738au4a3Zxm0vaZk5rXLMSL9cMU2D1DU+Mus1ZJmy3ZRGs51oYUYWHzTzWWabdEpbKevdckH95Vpd1zVvemdtJugSr7/NN5quGa+0/FHmn3mNVrRjitScj0ccVI2q1QSU059m/aVK+k3YNWCfPU+cMZok+25GgYfnpstmRbZ53XJMCL9eMlxE+O+xTTs6+01e9kfY339dbe9ePjfvdav5sLb+kND1ql5w9apTc8aJXe8KBVeseDVukdD1qldzxolZ4/aJXe8KDVJwfqrYW3fRv3Ft4+aePWwtu+jXsLb5+0cWvhLe0etLq5NvNJG7dm8Pa/5d7C2/02Pl5427dxb+Et7V71d3fhbbshNxfeUmlv2Lnt9925Nxfe0m6x6u7C235D7i28pd1a1c2rs91TVncX3tLuKau7C29pO9t8a+Ft3x+3Ft4+vQdIuAeQj+4Bdq/9u3mPt7t4l26rrKvXj4/1+vytvqk+fq3vvombV0L1+Yt9U33Dm31TfcOrfVN9w7t9U338RMD9A2RzJbS9y9TVITrmuj5qo73jrH3/lmpT3J1261W6yt71h6L3L9zcWV7PSLymRdNmO8rjNNzeu99Mw20mt/XJjnzk7x0ged3TadlcCm1fAXjvRLd9CeDdE91unek1utbVw9Hlu43cPFv2x2Uq+059XqZita2liJ4+XmRKu4psPeIVLZhP0a9MVvcUM9499+/NePe4rDt6/XDuvT8/83+yHfEEz2ubju8taNz7MXn36MDNH/PJdtz6MZ+9Uiii/Ujy8buA8na96l45VH7DSwHz85cC5je8FDC/4aWA+R0vBczveClgfsdLAfPz56nyG14K+MmBeqscat/GvXKovFtnunnP/kkbty7tPvktt0qqsj4uqdo3cXfQ3f4pmw+tPC2p+iRQ41lgOeyHFxr/NFx2q1SW19WhFZRlpJJ+amT3xom0vhPVE6oIfm1kl4fHeh17fy1WbxrZ3FClHEtM0a9q+acmdplqa63r9XfyvUZel6drQ7ptGtktUpV4E1hR3AxJ+8qGtNiQ/vGGfHKsWcGx1j5+YUxO+fF8SE7P37GS0+N3rOybuJkj6fk7VnJ6wztWcn7DO1ZyfsM7VnJ+/I6V+wfI5uSd8uP5kJyfP2Gy3457q/85P179z/kNq/85v2H1P5c3TMvk3frSvdvufafeuu3e79t70zL7Nu5Ny+Tdk1A3j49iz6dl8u5rVHenZT5p5N60TN695+3m8bHt1FvHx2cvz7WI9srX6P90zt2+zP/e69X2Tdx6u1q2529Xy/aGM789P/PbG8789oYzv73jzF/fceav7zjz1+dnfnvDmd+ev11t38bN2/b6/O1qn7Rx7wrEnr9dLT//OFV+w9epvvBTPj48mj68bf8kTO+8HiPvPk51s3R420bT+Dp05jdrf3qL6L6RuiKo1fTxq0h1O7l8lJgXPmzzkel9Ky3eNC/Hxx+my9vHqW6epvrx/DS1f5jq1ojZNnFzxGzXp26ept7xJsC8e5jq9mlqt0R1+zS1/WTVvdPU7QNkc5raH6j3TlPbNu6dpsrxvNzvkzbunab2v+XWaaoczz/rezz/ru8XfsrH36E9Hj/yt81TiReOHVw3/OVzzcfzPC3yPE+LPM7TfRM3P9ksz/O0yBvy1BcHnuZpkTfkaZHHeXr/ANl8uPl4nqf7Nm7mqT7Pwk+2414W7penbg2YbRM3B8zxhizcrk09z8J4g6McKek3r1BRk3pk7d9tJd6Xe+Ty8QeHy6667eYjOiU9L0wt6XFh6r6Jm4dZel6YWrbLDndzOb2hMLWkNxSmlvS4MPX+AbLJ5f2BeusRnX0b9x7R+aSNW4/o7Nu494jOJ23cekSn7Bem7l2zv2Fxa/9b7j2ic7+NjxdA9m3ce0Sn7Nal7j6is92Qm4/olO03qm7u3H0bz3fuzUd0ym4R5e4jOvsNufeITimPl1DL7rGnu0tkZbcwdXd1q+xebHdvdWvfH/eKjnfXMRKvcpHXrebmOsYev5hqux0pHr6WtLvP3a483CtsKfa8KrXY46rUfRM3r6fseVVqqW+oSi31DVWppb6hKrXUx1Wp9w+QzfXU7kC9WdhS3rCstN+Oe4UtZffs1M1UrttK/7VqkH94buGnmpSye0uflPisRfo4ULfbcbPApuzWpn74hMMP316Q+43crdIpbftW7LuPcZXd41P3X/Xxla3ZvKejtE9u4COR8pG+uzX3f9SumurW+0v2TeCWpn/cxPaVfc+buHk5sm3i1uN+Zb+kevOw365S3SxOK7tVqrtdas+71B536fbTGLdDwI7j/+WWbALAth9huR8A/S2pZrulpnsBsG/i1qFmh/2uTdw7WvdN3DtGtmfgtN5OmdMmAGy7EnH3DLy9rLl1c7W/urpXWrpv415pqe3Wqu5dodluperufbPtVqrulpZ+0si9m2/bfZPq5sG+7dRbx8dnSXbzlWNfaWbzyTzbfg/q5mnTdqtNN4NIHz+NvW/i5pVIfce++Uoz233T3rFv+vN905/vm/503+wmi1rESDvaxyVmtnvd382SCHvDZ6ns+Wep7A2fpbI3fJbK3vFZKnvHZ6nsHZ+lsuefpbI3fJbqkwP1VknEvo17JRH2huUqe8Ny1Se/5VZZheXHr6TcN3F30N3+KR8fHuXx+/53aSrHtRFNNkUVtv0m1b2JdytvSNPyPE3LG9K0vCFNyzvStLwjTe0daWrP07S8IU1LejzxbrsHGO6m2HY77k28224h4uZt3W6VyXTVMZhuj493XJza8yvLbX/cuyPb7pZ7d+z7Nm7esdfHL6O0+oaXUdruNX+379j3jdy8Y9+95u/m8VEfv9Fyf660OFfibRK/LFLvbrPvPQm6b+LWk6C2W2C6e//T0vMzdntc7b9v4uYZu9nzM/b+Xv/mGXv3OarbZ+zdktLtM/bu+ZibZ+zbB8jmjL0/UO/d/2zbuHn/0/Pz+5/+hiuH/W+5d//TH9en7Ju4O+hu/5QPD496PP1S+idheudJ0Lqbga1xfNUuH99D1eP5h9Lr8fweqh6P76H2Tdw7OOrx/B7qtab4PJHr8YZ7qCpvuIeq8vge6v4B0jcHyPMPpe/buFcM/kkbt4rB923cKwb/pI1bxeBVnr/S/5M2bp1d9r/lXjH4/TY+vgHat3GvGLzqGz6Uvt2Qm8XgVZ9PnX7SxvOde7MYvOobPpS+35B7xeA1Pf5Qek1v+FB6TW/4UHpNj9c89/1x71VYx+M7030Tt+5M63Yp6t6dad0uRd28DkqPX5eyb+LmddB2GermdVDWN1wHbT85dfc6aPfJqdvXQbk8vg66fYBsroP2B+qtO9N9G/fuTOvujX53Ty/7Nu6dXva/5dadaS36fNDd3oyPd23JD+8qPwnCW3eVu9f51bbeDfQ6vD5+JKbulqLu3lWWN6RpeZ6m5Q1pam9IU3tHmto70tTekab2PE3LG9J0f6Deu6vctnHzrnLfxr27ym0bN+8q923cu6usz59C/aSNe2eG7W+5eVd5u43NXeW2jZt3lbuFqNt3ldsnN2/eVdY3nPZr/3137t27yv0zUzfvKrcbcvOusj0ula7tDaXStb2hyrm2x2um+/64t2baHt9V7pu4d1e5fTjp5l1l1+fXQf3xG332Tdy8Durl+XXQ7uGk29dBu3Wk29dBvb3hOmj3uamb10G3D5DNddD+QL13V7l/Eu/WXWXbzdHdPL180sa908snTxXeuatsx+PXTe+buDvobv+U+vFP6Q/vTD8J0zt3pm23EFW9+nremdoPb0T/8c50++67e+eFfRO3zgtNnr8RvUl5fF5o8vwQleeHaJPnb0Rv8oY3ojd9wxvRm77hjehNH78R/f4B0us3D9Rb54V9GzfPC/r8jeiftHHrvPDJb7l3XtDHk1L7Jm4OurSdlFrPRb8u2dOHg267DLWGSy7ycQvPp8ZaesNbUdv+FX6SohXB/MnPTwG33Uv8Wl9nh9abbhrZ3e2X6JUX28clsG37Gj9b/aKGhwDtK1tS4uufpWyeJGx5+2x0jWejj/xxnn1hW2yzLZ80sx4GHGzfbabFKz1Lk+P7zcQbZDjh/sVm6grI0eTmiMm7m6vU1ld4U0/f20+3h0B+w81Vy49vrvZNrLe/6q4/dj/lC6N5t0h1czTvt+T2aN4+EsM3HRybXtk3cjMSvvCDdpHwSTN3I2HfzO1I+KyZm5Gwb+Z2JOzWru5Hwv7kGq0ciovAX0Jht3wlOa8H/nLdHDP3L+E+viy28vB++JObyFv3w9vHqNo69q3hTTI/f4Bl20g9yrVj6tHSppHdM/663p+SFJ+Rta80sV4JmdLRPmpi976/ex8733dp7z16o33cG9snfu5tR90Wd976yE/bPQAlVvHeo2jjtVz5UyO7J1SOlSHKdyf92si2qLrENX7rHzeyPVB1rdRW5Tdof9k1u0mCvJ4sk4yvDGv+KUC2r/zzT+5ep/P0cSP7LYnv+xVk869bsrkkKCtUDStPmu1+E7a+VGy4yvqlie1PKTjrYenpi/1xs1O3z1Mdvqw0j7SDcx72lQOtr0QsOEZ+OdC23bpWFjlT+bU9syoCzPJ3m1iTJtk+bmJ/klkLz9Ztk4hdn8fZto3jWJUJB5Lolza215wxb5KSfBxE20Wsu5G4fcXeWyKxry2p/Lr3r/tm927qe6VabbeIdXMquu8fqbozK7Zv4t6sWN89VHVzPqof6fl8VN89M3N3KrrvHom6exfdty/Yu3cXffsA2UxF7w/UW6Va+zbulWp90satUq19G/dKtT5p41apVpfny62ftHFvWn37W+6Vat1v4+NSrX0b90q1+m4x626p1nZDbpZq9e1i1s2du2/j+c69WarVt09V3SzV2m/IvVKtvnsi6l6pVtc3fDC96xu+dd718Qsp9/1xq1Trk4kqf1Htee1vIt+d7/JXVl3N9E2fpDe88L+nxy/83zfxjolni+84vnrn2PyY3bppXaH4mlJIH9xT7Ztouu5UX9Pt32uixn6p/XuLWbcPtE+auXug5TeUCfT8uExg38S9A+2THrl7oG1f1HfvQNs2ce9A2zdx50B7/n29nt9wR1We31GVN9xRlTfcUZV33FGVd9xRlXfcURV7Pmqf31E9/7re82/rPf+y3vPPpnW7+7BJ/VZf3rufe/5tv27Pn/j/pI1bF/zbX7LKvVL7uNyrW3vDL2m/6y+5d1f6/AuFz79P2OsbXknxySC5uUv099wld+8lt89S3byXfP5dwb796MS9O8ndStTtO8kmb7iT3L5U696d5LY/bt1JHs8X9/p7Pjt1PF/c67vnqHK/jo8i8uHizd0m9JtN3Fti3DZxb4nxeL7A+IY12757BOru8uK+N26tDO6buLUy+EkTd1YGd+9pjNRQQfmW6P0mZD2LoZLkO01IXyUwKqV82IQcu3Wjm0uLnzRyb43z1Yg+r9l4tZKer1C+WsnPlyi3ezjGCx+V+Qe75+Y3ojCzoF9oIqUVyK94jwTp7edGdrOlx6qX59ci9f6QWbdsr/TAR2/T8dNWbD8zVet6W7TUxo/nJv1KO68/Xcda+6H069d2nj4C8NlPiorhcTNbv/+T1rtLXix9187uWepb5WyftXGnnu3VxvYZ9zuFZJ8fLuvk2YSTOL/2ya4+r6z9/LppLx/v6N1q0t1jZfs5oXVBksqxaWT3cNUrluICrZVj1ynbLz5JRJPgQHkl57db6e9oJedvt7KmtlXs2LWyK/jLq4zyFdmYaTt+2Uvbr6avrxWkXvuulX0B//rmAW9+v9pKiVly3hR8sZUc21LaO1qxtGtlt48szs1V86aV3aNXxR89nrcYTfSbezrbehbgdS8s323lkLiRTfW7/VLiGxmco/gH/bLblraubXOT+t3elXXF8ML2zVZe1/prWSWn9o5fpNs9fTtfdimV0+MlhfHpu10jbQ1pPgr+DzZlc56v/gl6b6XycJH6cyPbD6mub5m8EJctP5/pc93exaS4i8mbRnZLxuOrg9eZ8XV/VjY/aNe3qUbf1u3J6P5pGhfdv56md1+run3tUp5f52634+61y/a5qRarLtKM733/tVN2E13xDeHXQhDWB3v+0tbYen7kxXV3JbV7i9JrASoeVrL04dTKq5XHD7x+tiU57q9eMy32cSu7funH+qb4i/vulmb75kCx9ez8a89jIP18z2j6vF/27zA8InPFNluy7xeJSdrX5M2x65fN0VvSuh4rWXdjYPvtJs/C84qh7W4Xd2XYUte37KRiXbn/PKx3q1U9rVvXnrCLXtn1cyu79wL4aXO2cvRj00rdTWWtRhIKB15Hzs9t7A4X/wbhdcjJN1tJfc0dv+4Gtq2k3WWU5TUPjtyV9qVNabEpfbcp2yMO61dcdP/1iNs9lXX7iNstg90/4nYfLP/CEdefH3G7xbD7R9x+Se3uEbd9MOvuEbfflLcccboeJs66nRLbLYsVXafnojgn/nJV2LaFhOs0ZDW3jxvZ/561hpy17mY/dx+8uv97+u/9e9Iq03ph/e6ZLK07ohfad8+qsUpWiuzSabdMlvu6a809lW+3sobQC7/fSo9W+ndbKVF+Vn64tfr1Gnd77ROllvJK3+Pb7aQS371N9v3twVsPuulme+TYBu96YPKF7ZvXyyVWI16TWnW3LY+fiN23cW+9ev979DhiCvQ1yd93v2d7l4YXJyTFQusvv8geX/9/siUq8fDkZllEju03sFfFShfRbx0rrxPaEQtpyuKZX/p2uzRylCgq7Yzv49tbk1rebY0+nxwQ2a785rhLe83Q7IbR9h0Zr2N2rc2/flX6fjvrbP1i2w2D3UsGb67IfdLGrRU5kfZ4Re4rfbKNhs/aadFOK99vZ3XM685+d1qS3Wzd3X20b+PePtL8u+8j9okcD/ZRRTvyzVP1jyHzmorf7aPtQsu67M310I9DZrv+dJQV4i8u6S0/quwqEOQNLzIUefwmw8+2496qhKRtp3RZR8zRi+46pTy+KPtsW7Cje93uoMc1hPs2bl6U7X+PxBLJKD7bJe/2bYbdu/68WJX8ce/uW0Ed8ov784shkd0tjuT0fI1Edss+NwfRdjvuXgbt1tNG1VvUaqntBlGu/0+vECWXXXjnN5TgSDme76I3lODI9qmw1w6MXVSO3ZVq2X/2c3VKS1zFle+2ghukr7WStcVUznHsWrHHe2j/c+oR86nbTnm+mrbfkh7PQr6mPL67e6L65jUp++3dI2tpO0st397Jq3Q6j+Xsj1vZvcnw1k7eVtauBvQ1OYzBc/y8Fbv5viglteOH+Z/bjzpojoOk/DDZ98uG1N+7lbt13LJbQrv7jiiRuq31vVmCLdtFtDeUYKe45PmhBPuXnq3b78fced/l9lhLuu6Exl3ebkMev3hz20Qpa1ml2A9Lx7+0Ut9wEtwtnr0G3XqD54+Xo19qReKREvlhNvjnVrarTTdv3/dt3Lt93y2d3b19v7mLTX+46f6lR/IbdvFu4ex137IiVtt2U3Yf5ZR1+1N/eFTm11Z274u7Wasmu5Wzu7Vqsls5u1urJn13A3W7Vu2Tvq3rg6fS6nf3kK5kqvrDAtwXW8mrlXp8v5UUrbRdrNwdRD/cV/7cyv5FhzcnZ3af67p5SbzfjpuTM7vX2FlaM66WZXPq0OMNz6m+Wtm9l/vmE42fbcu9J1VfrexeAXfrgcTP2rjzROInv+bmg6Kf9cntnt1d0t58WHR/1fSaMPvg3H78vC39927l7uW17j7idfvyWneLZbcvr3W7Wnbz8vqTC9u0zh8ptc2tmMrzC9vthuRV0JVyzt+8J5SouxDWXfy6l9vjwN7+moJCrB+u4X7uVt2+A+k6TjqPe+0/t7Et216HSco/VDh/qRV/E9/5e3LatZIeX6V/0satq3Tdvvbv3lX6tkfysS5T8qFt1yP1DT1S39Aj/XfuEYlaPfmhFuznHtmtQ93tkX0b93okpd+7R3rMttlu7G0/P3L7Kmf7BsJ7Vzn7VOsxh99/uDT/Ska/LlDWyEk/FGd8qRVLqzbO6vHdOURdZ53XJVf5biu9xUzIsT132RuuUHJ6xxXK9gmo21coufzeVyglHdepp6QfSut+PpXuFsPecIVSDomq27w7p+enH6PdN3H7QClvuZQtb7mULe+4lN1etsXDvA1P+PyDLXnDZ2derdhbeqX+3sMn57hOMdndPZW+S7g1D8gXWOpPTwT4i8U+XtfDcxL84lP6+Ty2e5Lr3sX5JxuyqltfF7PbDdldiNo6F6K2pH6lR3JaR1tOnNL8dUOev/BjvyU5nmEvue+2pL5jbmj3MNn9GYz9tty9atqthN2d19luye15nf3vudsr9Q0vAdunQV+RMsqeNnGwa+QVW+sxsMSXmPzSyvZhsre0cvuMulvJun9Grf0d547t42S3z6i7XVTjo2Vl17W7FbGb1zu7zfDPs80TO4sFft2MXXFXPHeFG5f6lQM2Po/ZD91txu5wbevtJ9Jx71N/PtB2K2G3H2bQtn2YYb1a5rWP0sdt7H5OT/HcCz5r98vP2a6EHTVaOSre2/PFVmp8pLP2/M1W/OtZZyv9KN/qFo04ec1J26Zbtt8FlxybIsZASV9rp+E96L0/aGfF/qF4wO6r7cSi8ovt2LWzi9tYhRXedI83dnyllbWqLHyI/h+0sv9Nht9Uv9/Hac06vTjp99vBPk8o/vylnbT/Fth72lHJ8bJM2+yrfSuKR0+Q4l9sJa0RrvnYtKJ1+7WHNXFkjZVJP79QIu0eKHutUcSzkPXDV0q/Gnn+tYXXMu/jzy180sa97y28Gnn+wYVXI2/44sKrlTd8cuHVyhu+uSBJHn904QsHSt8cKNv3iGrUbmpOm6Ntt6R771Xqn2yJxLvOkmy2ZDtFf+s95q82dkVfmmJCm6VWP30dfFyrbe5BqsX0SNJdK7vkr0fDDNbmu+mvdnZzt+vhav3hg/Ly/W3RY7ct2wcZ8hpCo2qq7NrZbs/dt6O/2tnNv+JzGfmbfWNRiGZZ02ZLtg9t3Xpx/Scj4Nab6z8ZimmVYr/Oqd8dz3nd1bzmaOXjRlJ5Pp7TGz5x92pl+427Gq9n6vLtVu593+DVSn9+nKTH38r79Lo0Xrh2JKub68n8/GndT9q4tUic8vOndT/rkxw3MqnY7pp/e+vaU/Rtz/2bN8A9nus7ej0+7pf2hn7Zb4nG9WQvH27JfvkD40frZrE5bRfLWnx6rxnqY/Xn66/dYllqcdQ2fCFO8vGFVnLceeTKx15+bSU/H0HbLfnhpaqy2xL7nbckHtTKHdfY/2BL2u+7JeXgV0vyZkvsHUW2yd5RZPvJttxcSEn2vEB2vyV3F1I++T23e8XesJCyT4R+xAOGfI3pr0fL43rFbcD9cO3Fl3r8GnDb1yaui9rXckvatFJ/91buLumk+o5qmlTfUU2T6juqafa7SGrMxPFBtl8793E1TarHG6a+6jumvtobpr7aO6a+2jumvtpbpr7aW6a+2lumvtobpr7qO6a+to/F3p36au+Y+tpuyd2pr/6Gqa/+lqmv/papr/6mqa/+hqmv/qapr/6mqa/+pqmv/oapr20b+Gpu/7iNfLxh4qu/YeJrOxDvTnxtG7k58ZWP5xNf+XjHxFc+3jHx9UkrNye+8vF84mvfszcnvrbPz6R4RQtfEv3Fp3BSFC5m2TyFk+Xp2zs+eyTh5v1plvKGO7FPHmy4V6K3/T23S/TSO35Plv6GO8vto2MS8xCvG3jeRPWvtMKvSaTj41by9ksob2nl7g1d3i4B3b2hy9vFsbs3dFntDTd0n+zoePXwD99B/LVz29Mbuqzyjv2zfWdMFGeUtj1Udq2UeP+l8Um0L7WStGKBQL7bSrzC5nUSaN9tRaJ2np87+LWVbUDVfMRVIK8m7Qut3P1WbE7bD9XcfNAip/aOgbhdHbs7ED85/ts6xQs/bPq1Q7fHKOIv+rWV7drW3V2U3xG4+S2Bm98SuNl+9/2cCp6Y3+6h9o6huH+Z4XpT5Gses2+2ZfdWxXKsTSnC1ZOfa9nyfmbx3pxE3i7k3LyL2b/j7uacRN4ukN2dk8jb58nu33fn7SLZvfvuT7bl9pxELu0tcxKfDIH4zt6Lm348BD4ZSAkDST5sZftU2b0F6+0AuDujnXfrZHdntLPlxzPa+zZuzmhne8N7i/L2yae7M9p5t0h2e0Y7796veHtGO+8nfG7NaN8/UDYz2vvMvjmjnXeLZHdntL8STrvJ21yfT95ut+V2bV7erZHdnXra13rcmnra7+ObU5T59vrwboqyPV9wyE3fMUW5WyS7P0W5b+XuFOVukezucdKeT2XvXw18xCnwUH4i82svO17D+NXK5uXNebdIprZeEaKVM2lfaiXFWvcL23dbyXHrzQnTL754OT7JMd6Ts9mW/vxNtuXuoY+boH+wIdvHX1bXvm7kP3x4cN9GWw8gWvu4XPGTNmqcj+vHbWx3sK73eiTV47uHiR7RyrHp13I8f4/tJ23cKmwtx/P32H7SIyl+S/l+v6561KRm324F2/KglRb7uH07UJLEXJ7Ub7eyii8ftbJu2lN6EJExx8lLjF8j8pNPivDryu3Db1fvP7USL4u09PFy0L6Nm+/K2rdxa1nqk+/NrSumzscmv9bGrce8998UvNkf+zZu9ccnX7KM72YfdfcFyn0rKwvKkft3W5F4LZVI/va2rI9qvlr5/hc+14ph+eRL4LtPd+T4Cuv2Oy9faCV/u5V4M07u6dutrO/Pvxq077ZS4g1KRb7du/FG0Nfs5be/lFvWnPyrwe0+2t/2x4PUmdcqP924lPT8IZxP2rh3rZKeP4Sz75GYptX0w/XBLz2y2TulxouKeRv2lQ3J6y0Wrz2Tdxvyhg9El/SWD0Rvl2LXQfK6vZWPf88nraxXRrzWcOzbrayXr2ixXd/ulsVu3vrs27h36/NJG7dufY6yXYUt8czYax7v40G8e7fi3QH42ZYotmTTJ7sy31bXe4pfXDYxW8q20hdfj3rdL2zb2R1x+IAmT8xdvtTImnMe3zTcNLKbOdC1nNX5JY9fnjEsu0UxW69YrHzjSk9f2ZK0nl/rLGX4B1uyidp+5HgbUz92rWy/gxNrfLj5sfxzG9sPja3lxtcfyjdbeU1mxgvDbdfK7tmmIuv156+rA8yxti9tSotN6dsftB9C67Lp0yG0byeeWFFru3Z261l3Px9T9i+pv/f5mPLJe35vfT6mbBfFbn8+5rPYXVOKL9aPYvd4mv67+36LlSyWB/78Qp5tE+umQ3iofaWJFgVJrX1rK14zgPiye/9eE6vm7IXyrR8S78GVJt/rzqZrJbulb/0Q0bUGLZxU/UoTaRVUveaNvtdEXlefkvk2ra80EW8ry/l7fZGjFrdglfWXN06V3crXzWzfTQyntVD7mvfD4vUh95uIr4q9TlnPm7BvNZGjMo2v8PpKE2Utu40v036viSjKKfa9H1Lis4L8hPhXmrA10BK/c/qFJiQ+UCr80MjPTUjZPQomUevx40eL6/3taPFh6vat3fqK4Kidx9sbv9TEuhLTI+VvNhFfHk/lcRP5u1sR55Lcv9dEib7ASfG7W9G+NdDufoXNtitaT79Ze7OUyY79eyLvlTLZ7oGk8Z3ENVCky6YKwnaPe70u3FYBg/y4c35tp+7OTPENDR6p9ec2ti9/ulUS9cnvkXV5Pr5XtanIsN17DFtflz+Nb7X9pfTTdt8Ku10qZtvXId7sl+1Xy0qJN+m87u93x4tsa7nX/KakY7un7x0tP5x3H/wi2/6ibTs4aRW13QiQ5x8b/+w3xenvxfbt39TwMBvvAL7eTrz4hbcBX22nrsno0eauj3fvR5S4bhxPk++OnN14Wuttum9j+4ssXgdVTOTbPWNFop2+y6vd+xHvJ42+IYG3bbynd1McL1Z2x+/u3Yg35+n3bdybp/+kjVvz9J+c2TTjdtq2fVIeXgR9dvHR4xpGeiq7Tdl+zyJ+Ua7bk8luaw6JZYNDfrip/flkvVvrun/K31awfOFEm+UdJ9ovbM32JLlv5/5JcvtRsZsnyU9+0+2T5L6d+yfJz9q5e5Lct3P/JLldALt9ktxtTbeoGbIfbsR/Hg3lLRfA5Q0XwOUNJ/1dn3zh15Q3/Jry+/6aoiVeU2i7C4/yhkuG0v4f/pq6y4RPziUxeF6zFsfmuDd9x5ltnwj3LzI/aef2Raa9411eZs/f5bVv4w1HzFcuMrfPg928yNw/U3bvInPfxr2LzPyWaY/t02C3j5PtKxNvHifbNm4eJ9sXQH7h2mf7MNjNa5/9tty/uty+C08bri63PdPfcY36hd+0vUb9pJ3b14X7du5fF37Wzt3rwn07968Ltx/qun1duN+a++ekT9q5fU5q73ga1/rzp3H3bbwla+6fk3bV4HfPSds2bp6T9m18eE76n6//5Q//9qe//cuf//pvf/j7n/76l/94/d1/j6b+9qc//Ouf/3j+r//7P//yb/j//v3///fr//Ovf/vTn//8p//zL//+t7/+2x//13/+7Y+jpfH/++04/8f/SPqafkhayv/8p9/k9b/39rose60wttf/nsb/v79W5fNx2Pj/y/yD/PqDZP/zv8cW/l8="
     }
   ],
   "outputs": {
@@ -3003,59 +3003,7 @@
       "path": "std/aes128.nr",
       "source": "// docs:start:aes128\n/// Given a plaintext as an array of bytes, returns the corresponding aes128 ciphertext (CBC mode). Input padding is performed using PKCS#7, so that the output length is `input.len() + (16 - input.len() % 16)`.\npub fn aes128_encrypt<let N: u32>(\n    input: [u8; N],\n    iv: [u8; 16],\n    key: [u8; 16],\n) -> [u8; N + 16 - N % 16] {\n    let padding_length = (16 - N % 16) as u8;\n    let mut padded_input: [u8; N + 16 - N % 16] = [0; N + 16 - N % 16];\n    for i in 0..N {\n        padded_input[i] = input[i];\n    }\n    for i in N..N + 16 - N % 16 {\n        padded_input[i] = padding_length;\n    }\n    let output = aes128_encrypt_padded_input(padded_input, iv, key);\n    output\n}\n\n#[foreign(aes128_encrypt)]\nfn aes128_encrypt_padded_input<let N: u32>(input: [u8; N], iv: [u8; 16], key: [u8; 16]) -> [u8; N] {}\n\n// docs:end:aes128\n"
     },
-    "100": {
-      "function_locations": [
-        {
-          "name": "generate_contract_library_methods_compute_note_hash_and_nullifier",
-          "start": 534
-        },
-        {
-          "name": "generate_contract_library_method_compute_note_hash",
-          "start": 2449
-        },
-        {
-          "name": "generate_contract_library_method_compute_note_nullifier",
-          "start": 7674
-        }
-      ],
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec/compute_note_hash_and_nullifier.nr",
-      "source": "use crate::logging;\nuse crate::macros::{notes::NOTES, utils::get_trait_impl_method};\n\n/// Generates two contract library methods called `_compute_note_hash` and `_compute_note_nullifier`, plus a\n/// (deprecated) wrapper called `_compute_note_hash_and_nullifier`, which are used for note discovery (i.e. these are\n/// of the `aztec::messages::discovery::ComputeNoteHash` and `aztec::messages::discovery::ComputeNoteNullifier` types).\npub(crate) comptime fn generate_contract_library_methods_compute_note_hash_and_nullifier() -> Quoted {\n    let compute_note_hash = generate_contract_library_method_compute_note_hash();\n    let compute_note_nullifier = generate_contract_library_method_compute_note_nullifier();\n\n    quote {\n        $compute_note_hash\n        $compute_note_nullifier\n\n        /// Unpacks an array into a note corresponding to `note_type_id` and then computes its note hash (non-siloed) and inner nullifier (non-siloed) assuming the note has been inserted into the note hash tree with `note_nonce`.\n        ///\n        /// This function is automatically injected by the `#[aztec]` macro.\n        #[contract_library_method]\n        #[allow(dead_code)]\n        unconstrained fn _compute_note_hash_and_nullifier(\n            packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n            owner: aztec::protocol::address::AztecAddress,\n            storage_slot: Field,\n            note_type_id: Field,\n            contract_address: aztec::protocol::address::AztecAddress,\n            randomness: Field,\n            note_nonce: Field,\n        ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n            _compute_note_hash(packed_note, owner, storage_slot, note_type_id, contract_address, randomness).map(|note_hash| {\n\n                let siloed_note_hash = aztec::protocol::hash::compute_siloed_note_hash(contract_address, note_hash);\n                let unique_note_hash = aztec::protocol::hash::compute_unique_note_hash(note_nonce, siloed_note_hash);\n                \n                let inner_nullifier = _compute_note_nullifier(unique_note_hash, packed_note, owner, storage_slot, note_type_id, contract_address, randomness);\n\n                aztec::messages::discovery::NoteHashAndNullifier {\n                    note_hash,\n                    inner_nullifier,\n                }\n            })\n        }\n    }\n}\n\ncomptime fn generate_contract_library_method_compute_note_hash() -> Quoted {\n    if NOTES.len() == 0 {\n        // Contracts with no notes still implement this function to avoid having special-casing, the implementation\n        // simply throws immediately.\n        quote {\n            /// This contract does not use private notes, so this function should never be called as it will unconditionally fail.\n            ///\n            /// This function is automatically injected by the `#[aztec]` macro.\n            #[contract_library_method]\n            unconstrained fn _compute_note_hash(\n                _packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n                _owner: aztec::protocol::address::AztecAddress,\n                _storage_slot: Field,\n                _note_type_id: Field,\n                _contract_address: aztec::protocol::address::AztecAddress,\n                _randomness: Field,\n            ) -> Option<Field> {\n                panic(f\"This contract does not use private notes\")\n            }\n        }\n    } else {\n        // Contracts that do define notes produce an if-else chain where `note_type_id` is matched against the\n        // `get_note_type_id()` function of each note type that we know of, in order to identify the note type. Once we\n        // know it we call the correct `unpack` method from the `Packable` trait to obtain the underlying note type, and\n        // compute the note hash (non-siloed).\n\n        // We resolve the log format calls here so that the resulting Quoted values can be spliced into the quote\n        // block below.\n        let warn_length_mismatch = logging::aztecnr_warn_log_format(\n            \"Packed note length mismatch for note type id {0}: expected {1} fields, got {2}. Skipping note.\",\n        );\n        let warn_unknown_note_type = logging::aztecnr_warn_log_format(\"Unknown note type id {0}. Skipping note.\");\n\n        let mut if_note_type_id_match_statements_list = @[];\n        for i in 0..NOTES.len() {\n            let typ = NOTES.get(i);\n\n            let get_note_type_id = get_trait_impl_method(\n                typ,\n                quote { crate::note::note_interface::NoteType },\n                quote { get_id },\n            );\n            let unpack = get_trait_impl_method(\n                typ,\n                quote { crate::protocol::traits::Packable },\n                quote { unpack },\n            );\n\n            let compute_note_hash = get_trait_impl_method(\n                typ,\n                quote { crate::note::note_interface::NoteHash },\n                quote { compute_note_hash },\n            );\n\n            let if_or_else_if = if i == 0 {\n                quote { if }\n            } else {\n                quote { else if }\n            };\n\n            if_note_type_id_match_statements_list = if_note_type_id_match_statements_list.push_back(\n                quote {\n                    $if_or_else_if note_type_id == $get_note_type_id() {\n                        // As an extra safety check we make sure that the packed_note BoundedVec has the expected\n                        // length, since we're about to interpret its raw storage as a fixed-size array by calling the\n                        // unpack function on it.\n                        let expected_len = <$typ as $crate::protocol::traits::Packable>::N;\n                        let actual_len = packed_note.len();\n                        if actual_len != expected_len {\n                            $warn_length_mismatch([note_type_id, expected_len as Field, actual_len as Field]);\n                            Option::none()\n                        } else {\n                            let note = $unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n\n                            Option::some($compute_note_hash(note, owner, storage_slot, randomness))\n                        }\n                    }\n                },\n            );\n        }\n\n        let if_note_type_id_match_statements = if_note_type_id_match_statements_list.join(quote {});\n\n        quote {\n            /// Unpacks an array into a note corresponding to `note_type_id` and then computes its note hash (non-siloed).\n            ///\n            /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteHash` type, and so it can be used to call functions from that module such as `do_sync_state` and `attempt_note_discovery`.\n            ///\n            /// This function is automatically injected by the `#[aztec]` macro.\n            #[contract_library_method]\n            unconstrained fn _compute_note_hash(\n                packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n                owner: aztec::protocol::address::AztecAddress,\n                storage_slot: Field,\n                note_type_id: Field,\n                _contract_address: aztec::protocol::address::AztecAddress,\n                randomness: Field,\n            ) -> Option<Field> {\n                $if_note_type_id_match_statements\n                else {\n                    $warn_unknown_note_type([note_type_id]);\n                    Option::none()\n                }\n            }\n        }\n    }\n}\n\ncomptime fn generate_contract_library_method_compute_note_nullifier() -> Quoted {\n    if NOTES.len() == 0 {\n        // Contracts with no notes still implement this function to avoid having special-casing, the implementation\n        // simply throws immediately.\n        quote {\n            /// This contract does not use private notes, so this function should never be called as it will unconditionally fail.\n            ///\n            /// This function is automatically injected by the `#[aztec]` macro.\n            #[contract_library_method]\n            unconstrained fn _compute_note_nullifier(\n                _unique_note_hash: Field,\n                _packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n                _owner: aztec::protocol::address::AztecAddress,\n                _storage_slot: Field,\n                _note_type_id: Field,\n                _contract_address: aztec::protocol::address::AztecAddress,\n                _randomness: Field,\n            ) -> Option<Field> {\n                panic(f\"This contract does not use private notes\")\n            }\n        }\n    } else {\n        // Contracts that do define notes produce an if-else chain where `note_type_id` is matched against the\n        // `get_note_type_id()` function of each note type that we know of, in order to identify the note type. Once we\n        // know it we call the correct `unpack` method from the `Packable` trait to obtain the underlying note type, and\n        // compute the inner nullifier (non-siloed).\n\n        // We resolve the log format calls here so that the resulting Quoted values can be spliced into the quote\n        // block below.\n        let warn_length_mismatch = logging::aztecnr_warn_log_format(\n            \"Packed note length mismatch for note type id {0}: expected {1} fields, got {2}. Skipping note.\",\n        );\n        let warn_unknown_note_type = logging::aztecnr_warn_log_format(\"Unknown note type id {0}. Skipping note.\");\n\n        let mut if_note_type_id_match_statements_list = @[];\n        for i in 0..NOTES.len() {\n            let typ = NOTES.get(i);\n\n            let get_note_type_id = get_trait_impl_method(\n                typ,\n                quote { crate::note::note_interface::NoteType },\n                quote { get_id },\n            );\n            let unpack = get_trait_impl_method(\n                typ,\n                quote { crate::protocol::traits::Packable },\n                quote { unpack },\n            );\n\n            let compute_nullifier_unconstrained = get_trait_impl_method(\n                typ,\n                quote { crate::note::note_interface::NoteHash },\n                quote { compute_nullifier_unconstrained },\n            );\n\n            let if_or_else_if = if i == 0 {\n                quote { if }\n            } else {\n                quote { else if }\n            };\n\n            if_note_type_id_match_statements_list = if_note_type_id_match_statements_list.push_back(\n                quote {\n                    $if_or_else_if note_type_id == $get_note_type_id() {\n                        // As an extra safety check we make sure that the packed_note BoundedVec has the expected\n                        // length, since we're about to interpret its raw storage as a fixed-size array by calling the\n                        // unpack function on it.\n                        let expected_len = <$typ as $crate::protocol::traits::Packable>::N;\n                        let actual_len = packed_note.len();\n                        if actual_len != expected_len {\n                            $warn_length_mismatch([note_type_id, expected_len as Field, actual_len as Field]);\n                            Option::none()\n                        } else {\n                            let note = $unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n\n                            // The message discovery process finds settled notes, that is, notes that were created in\n                            // prior transactions and are therefore already part of the note hash tree. The note hash\n                            // for nullification is hence the unique note hash.\n                            $compute_nullifier_unconstrained(note, owner, unique_note_hash)\n                        }\n                    }\n                },\n            );\n        }\n\n        let if_note_type_id_match_statements = if_note_type_id_match_statements_list.join(quote {});\n\n        quote {\n            /// Computes a note's inner nullifier (non-siloed) given its unique note hash, preimage and extra data.\n            ///\n            /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteNullifier` type, and so it can be used to call functions from that module such as `do_sync_state` and `attempt_note_discovery`.\n            ///\n            /// This function is automatically injected by the `#[aztec]` macro.\n            #[contract_library_method]\n            unconstrained fn _compute_note_nullifier(\n                unique_note_hash: Field,\n                packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n                owner: aztec::protocol::address::AztecAddress,\n                _storage_slot: Field,\n                note_type_id: Field,\n                _contract_address: aztec::protocol::address::AztecAddress,\n                _randomness: Field,\n            ) -> Option<Field> {\n                $if_note_type_id_match_statements\n                else {\n                    $warn_unknown_note_type([note_type_id]);\n                    Option::none()\n                }\n            }\n        }\n    }\n}\n"
-    },
     "101": {
-      "function_locations": [
-        {
-          "name": "AztecConfig::new",
-          "start": 1648
-        },
-        {
-          "name": "AztecConfig::custom_message_handler",
-          "start": 2156
-        },
-        {
-          "name": "aztec",
-          "start": 3050
-        },
-        {
-          "name": "generate_contract_interface",
-          "start": 6527
-        },
-        {
-          "name": "generate_sync_state",
-          "start": 8389
-        },
-        {
-          "name": "generate_offchain_receive",
-          "start": 9443
-        },
-        {
-          "name": "check_each_fn_macroified",
-          "start": 11087
-        }
-      ],
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec.nr",
-      "source": "mod compute_note_hash_and_nullifier;\n\nuse crate::{\n    macros::{\n        calls_generation::{\n            external_functions::{generate_external_function_calls, generate_external_function_self_calls_structs},\n            internal_functions::generate_call_internal_struct,\n        },\n        dispatch::generate_public_dispatch,\n        emit_public_init_nullifier::generate_emit_public_init_nullifier,\n        internals_functions_generation::{create_fn_abi_exports, process_functions},\n        storage::STORAGE_LAYOUT_NAME,\n        utils::{is_fn_contract_library_method, is_fn_external, is_fn_internal, is_fn_test, module_has_storage},\n    },\n    messages::discovery::CustomMessageHandler,\n};\n\nuse compute_note_hash_and_nullifier::generate_contract_library_methods_compute_note_hash_and_nullifier;\n\n/// Configuration for the [`aztec`] macro.\n///\n/// This type lets users override different parts of the default aztec-nr contract behavior, such\n/// as message handling. These are advanced features that require careful understanding of\n/// the behavior of these systems.\n///\n/// ## Examples\n///\n/// ```noir\n/// #[aztec(aztec::macros::AztecConfig::new().custom_message_handler(my_handler))]\n/// contract MyContract { ... }\n/// ```\npub struct AztecConfig {\n    custom_message_handler: Option<CustomMessageHandler<()>>,\n}\n\nimpl AztecConfig {\n    /// Creates a new `AztecConfig` with default values.\n    ///\n    /// Calling `new` is equivalent to invoking the [`aztec`] macro with no parameters. The different methods\n    /// (e.g. [`AztecConfig::custom_message_handler`]) can then be used to change the default behavior.\n    pub comptime fn new() -> Self {\n        Self { custom_message_handler: Option::none() }\n    }\n\n    /// Sets a handler for custom messages.\n    ///\n    /// This enables contracts to process non-standard messages (i.e. any with a message type that is not in\n    /// [`crate::messages::msg_type`]).\n    ///\n    /// `handler` must be a function that conforms to the\n    /// [`crate::messages::discovery::CustomMessageHandler`] type signature.\n    pub comptime fn custom_message_handler(_self: Self, handler: CustomMessageHandler<()>) -> Self {\n        Self { custom_message_handler: Option::some(handler) }\n    }\n}\n\n/// Enables aztec-nr features on a `contract`.\n///\n/// All aztec-nr contracts should have this macro invoked on them, as it is the one that processes all contract\n/// functions, notes, storage, generates interfaces for external calls, and creates the message processing\n/// boilerplate.\n///\n/// ## Examples\n///\n/// Most contracts can simply invoke the macro with no parameters, resulting in default aztec-nr behavior:\n/// ```noir\n/// #[aztec]\n/// contract MyContract { ... }\n/// ```\n///\n/// Advanced contracts can use [`AztecConfig`] to customize parts of its behavior, such as message\n/// processing.\n/// ```noir\n/// #[aztec(aztec::macros::AztecConfig::new().custom_message_handler(my_handler))]\n/// contract MyAdvancedContract { ... }\n/// ```\n#[varargs]\npub comptime fn aztec(m: Module, args: [AztecConfig]) -> Quoted {\n    let num_args = args.len();\n    let config = if num_args == 0 {\n        AztecConfig::new()\n    } else if num_args == 1 {\n        args[0]\n    } else {\n        panic(f\"#[aztec] expects 0 or 1 arguments, got {num_args}\")\n    };\n\n    // Functions that don't have #[external(...)], #[contract_library_method], or #[test] are not allowed in contracts.\n    check_each_fn_macroified(m);\n\n    // We generate new functions prefixed with `__aztec_nr_internals__` and we replace the original functions' bodies\n    // with `static_assert(false, ...)` to prevent them from being called directly from within the contract.\n    let functions = process_functions(m);\n\n    // We generate structs and their implementations necessary for convenient functions calls.\n    let interface = generate_contract_interface(m);\n    let self_call_structs = generate_external_function_self_calls_structs(m);\n    let call_internal_struct = generate_call_internal_struct(m);\n\n    // We generate ABI exports for all the external functions in the contract.\n    let fn_abi_exports = create_fn_abi_exports(m);\n\n    // We generate `_compute_note_hash`, `_compute_note_nullifier` (and the deprecated\n    // `_compute_note_hash_and_nullifier` wrapper) and `sync_state` functions only if they are not already implemented.\n    // If they are implemented we just insert empty quotes.\n    let contract_library_method_compute_note_hash_and_nullifier = if !m.functions().any(|f| {\n        // Note that we don't test for `_compute_note_hash` or `_compute_note_nullifier` in order to make this simpler\n        // - users must either implement all three or none.\n        // Down the line we'll remove this check and use `AztecConfig`.\n        f.name() == quote { _compute_note_hash_and_nullifier }\n    }) {\n        generate_contract_library_methods_compute_note_hash_and_nullifier()\n    } else {\n        quote {}\n    };\n    let process_custom_message_option = if config.custom_message_handler.is_some() {\n        let handler = config.custom_message_handler.unwrap();\n        quote { Option::some($handler) }\n    } else {\n        quote { Option::<aztec::messages::discovery::CustomMessageHandler<()>>::none() }\n    };\n\n    let offchain_inbox_sync_option = quote {\n        Option::some(aztec::messages::processing::offchain::sync_inbox)\n    };\n\n    let sync_state_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { sync_state }) {\n        generate_sync_state(process_custom_message_option, offchain_inbox_sync_option)\n    } else {\n        quote {}\n    };\n\n    if m.functions().any(|f| f.name() == quote { offchain_receive }) {\n        panic(\n            \"User-defined 'offchain_receive' is not allowed. The function is auto-injected by the #[aztec] macro. See https://docs.aztec.network/errors/7\",\n        );\n    }\n    let offchain_receive_fn_and_abi_export = generate_offchain_receive();\n\n    let (has_public_init_nullifier_fn, emit_public_init_nullifier_fn_body) = generate_emit_public_init_nullifier(m);\n    let public_dispatch = generate_public_dispatch(m, has_public_init_nullifier_fn);\n\n    quote {\n        $interface\n        $self_call_structs\n        $call_internal_struct\n        $functions\n        $fn_abi_exports\n        $contract_library_method_compute_note_hash_and_nullifier\n        $public_dispatch\n        $sync_state_fn_and_abi_export\n        $emit_public_init_nullifier_fn_body\n        $offchain_receive_fn_and_abi_export\n    }\n}\n\ncomptime fn generate_contract_interface(m: Module) -> Quoted {\n    let calls = generate_external_function_calls(m);\n\n    let module_name = m.name();\n\n    let has_storage_layout = module_has_storage(m) & STORAGE_LAYOUT_NAME.get(m).is_some();\n    let storage_layout_getter = if has_storage_layout {\n        let storage_layout_name = STORAGE_LAYOUT_NAME.get(m).unwrap();\n        quote {\n            pub fn storage_layout() -> StorageLayoutFields {\n                $storage_layout_name.fields\n            }\n        }\n    } else {\n        quote {}\n    };\n\n    let library_storage_layout_getter = if has_storage_layout {\n        quote {\n            #[contract_library_method]\n            $storage_layout_getter\n        }\n    } else {\n        quote {}\n    };\n\n    quote {\n        pub struct $module_name {\n            pub target_contract: aztec::protocol::address::AztecAddress\n        }\n\n        impl $module_name {\n            $calls\n\n            pub fn at(\n                addr: aztec::protocol::address::AztecAddress\n            ) -> Self {\n                Self { target_contract: addr }\n            }\n\n            pub fn interface() -> Self {\n                Self { target_contract: aztec::protocol::address::AztecAddress::zero() }\n            }\n\n            $storage_layout_getter\n        }\n\n        #[contract_library_method]\n        pub fn at(\n            addr: aztec::protocol::address::AztecAddress\n        ) -> $module_name {\n            $module_name { target_contract: addr }\n        }\n\n        #[contract_library_method]\n        pub fn interface() -> $module_name {\n            $module_name { target_contract: aztec::protocol::address::AztecAddress::zero() }\n        }\n\n        $library_storage_layout_getter\n\n    }\n}\n\n/// Generates the `sync_state` utility function that performs message discovery.\ncomptime fn generate_sync_state(process_custom_message_option: Quoted, offchain_inbox_sync_option: Quoted) -> Quoted {\n    quote {\n        pub struct sync_state_parameters {\n            pub scope: aztec::protocol::address::AztecAddress,\n        }\n\n        #[abi(functions)]\n        pub struct sync_state_abi {\n            parameters: sync_state_parameters,\n        }\n\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n        unconstrained fn sync_state(scope: aztec::protocol::address::AztecAddress) {\n            let address = aztec::context::UtilityContext::new().this_address();\n            aztec::messages::discovery::do_sync_state(\n                address,\n                _compute_note_hash,\n                _compute_note_nullifier,\n                $process_custom_message_option,\n                $offchain_inbox_sync_option,\n                scope,\n            );\n        }\n    }\n}\n\n/// Generates an `offchain_receive` utility function that lets callers add messages to the offchain message inbox.\n///\n/// For more details, see `aztec::messages::processing::offchain::receive`.\ncomptime fn generate_offchain_receive() -> Quoted {\n    quote {\n        pub struct offchain_receive_parameters {\n            pub messages: BoundedVec<\n                aztec::messages::processing::offchain::OffchainMessage,\n                aztec::messages::processing::offchain::MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL,\n            >,\n        }\n\n        #[abi(functions)]\n        pub struct offchain_receive_abi {\n            parameters: offchain_receive_parameters,\n        }\n\n        /// Receives offchain messages into this contract's offchain inbox for subsequent processing.\n        ///\n        /// Each message is routed to the inbox scoped to its `recipient` field.\n        ///\n        /// For more details, see `aztec::messages::processing::offchain::receive`.\n        ///\n        /// This function is automatically injected by the `#[aztec]` macro.\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n        unconstrained fn offchain_receive(\n            messages: BoundedVec<\n                aztec::messages::processing::offchain::OffchainMessage,\n                aztec::messages::processing::offchain::MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL,\n            >,\n        ) {\n            let address = aztec::context::UtilityContext::new().this_address();\n            aztec::messages::processing::offchain::receive(address, messages);\n        }\n    }\n}\n\n/// Checks that all functions in the module have a context macro applied.\n///\n/// Non-macroified functions are not allowed in contracts. They must all be one of\n/// [`crate::macros::functions::external`], [`crate::macros::functions::internal`] or `test`.\ncomptime fn check_each_fn_macroified(m: Module) {\n    for f in m.functions() {\n        let name = f.name();\n        if !is_fn_external(f) & !is_fn_contract_library_method(f) & !is_fn_internal(f) & !is_fn_test(f) {\n            // We  don't suggest that #[contract_library_method] is allowed because we don't want to introduce another\n            // concept\n            panic(\n                f\"Function {name} must be marked as either #[external(...)], #[internal(...)], or #[test]\",\n            );\n        }\n    }\n}\n"
-    },
-    "103": {
       "function_locations": [
         {
           "name": "create_stub_base",
@@ -3105,7 +3053,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/calls_generation/external_functions_stubs.nr",
       "source": "//! Stubs are auto-generated wrapper functions that provide an ergonomic interface for cross-contract calls. ! Instead\n// of manually serializing arguments and creating call interfaces, stubs allow natural syntax, e.g. for ! enqueuing\n// calls to public functions: ! !   ExternalContract.at(address).some_method(arg1, arg2).enqueue()\n\nuse crate::macros::utils::compute_fn_selector;\nuse crate::protocol::meta::utils::derive_serialization_quotes;\nuse std::meta::unquote;\n\ncomptime global FROM_FIELD: TypedExpr = {\n    let from_field_trait = quote { crate::protocol::traits::FromField }.as_trait_constraint();\n    let function_selector_typ = quote { crate::protocol::abis::function_selector::FunctionSelector }.as_type();\n    function_selector_typ.get_trait_impl(from_field_trait).unwrap().methods().filter(|m| {\n        m.name() == quote { from_field }\n    })[0]\n        .as_typed_expr()\n};\n\n/// Utility function creating stubs used by all the stub functions in this file.\ncomptime fn create_stub_base(f: FunctionDefinition) -> (Quoted, Quoted, Quoted, Quoted, u32, Quoted, u32, Field) {\n    // Dear privacy adventurer, chances are, you've command+clicked on the name of an external function call -- seeking\n    // to view that function -- only to end up here. Here's an explanation: The external contract that you're calling\n    // was likely annotated with the `#[aztec]` annotation -- as all good aztec contracts are. This triggers a macro\n    // which generates a \"contract interface\" for that contract, which is effectively a pretty interface that gives\n    // natural contract calling semantics:\n    //\n    // `MyImportedContract.at(some_address).my_method(arg1, arg2).enqueue();\n    //\n    // Unfortunately, the usage of macros makes it a bit of a black box. To actually view the target function, you\n    // could instead command+click on `MyImportedContract`, or you can just manually search it. If you want to view the\n    // noir code that gets generated by this macro, you can use `nargo expand` on your contract.\n    let fn_name = f.name();\n    let fn_parameters = f.parameters();\n    let fn_parameters_list = fn_parameters.map(|(name, typ): (Quoted, Type)| quote { $name: $typ }).join(quote {,});\n\n    let (serialized_args_array_construction, serialized_args_array_len_quote, serialized_args_array_name) =\n        derive_serialization_quotes(fn_parameters, false);\n    let serialized_args_array_len: u32 = unquote!(quote { ($serialized_args_array_len_quote) as u32 });\n\n    let fn_name_str = f\"\\\"{fn_name}\\\"\".quoted_contents();\n    let fn_name_len: u32 = unquote!(quote { $fn_name_str.as_bytes().len()});\n    let fn_selector: Field = compute_fn_selector(f.name(), f.parameters());\n\n    (\n        fn_name, fn_parameters_list, serialized_args_array_construction, serialized_args_array_name,\n        serialized_args_array_len, fn_name_str, fn_name_len, fn_selector,\n    )\n}\n\npub(crate) comptime fn create_private_stub(f: FunctionDefinition) -> Quoted {\n    let (fn_name, fn_parameters_list, serialized_args_array_construction, serialized_args_array_name, serialized_args_array_len, fn_name_str, fn_name_len, fn_selector) =\n        create_stub_base(f);\n    let fn_return_type = f.return_type();\n\n    quote {\n        pub fn $fn_name(self, $fn_parameters_list) -> aztec::context::calls::PrivateCall<$fn_name_len, $serialized_args_array_len, $fn_return_type> {\n            $serialized_args_array_construction\n            let selector = $FROM_FIELD($fn_selector);\n            aztec::context::calls::PrivateCall::new(\n                self.target_contract,\n                selector,\n                $fn_name_str,\n                $serialized_args_array_name,\n            )\n        }\n    }\n}\n\npub(crate) comptime fn create_private_static_stub(f: FunctionDefinition) -> Quoted {\n    let (fn_name, fn_parameters_list, serialized_args_array_construction, serialized_args_array_name, serialized_args_array_len, fn_name_str, fn_name_len, fn_selector) =\n        create_stub_base(f);\n    let fn_return_type = f.return_type();\n\n    quote {\n        pub fn $fn_name(self, $fn_parameters_list) -> aztec::context::calls::PrivateStaticCall<$fn_name_len, $serialized_args_array_len, $fn_return_type> {\n            $serialized_args_array_construction\n            let selector = $FROM_FIELD($fn_selector);\n            aztec::context::calls::PrivateStaticCall::new(\n                self.target_contract,\n                selector,\n                $fn_name_str,\n                $serialized_args_array_name,\n            )\n        }\n    }\n}\n\npub(crate) comptime fn create_public_stub(f: FunctionDefinition) -> Quoted {\n    let (fn_name, fn_parameters_list, serialized_args_array_construction, serialized_args_array_name, serialized_args_array_len, fn_name_str, fn_name_len, fn_selector) =\n        create_stub_base(f);\n    let fn_return_type = f.return_type();\n\n    quote {\n        pub fn $fn_name(self, $fn_parameters_list) -> aztec::context::calls::PublicCall<$fn_name_len, $serialized_args_array_len, $fn_return_type> {\n            $serialized_args_array_construction\n            let selector = $FROM_FIELD($fn_selector);\n            aztec::context::calls::PublicCall::new(\n                self.target_contract,\n                selector,\n                $fn_name_str,\n                $serialized_args_array_name,\n            )\n        }\n    }\n}\n\npub(crate) comptime fn create_public_static_stub(f: FunctionDefinition) -> Quoted {\n    let (fn_name, fn_parameters_list, serialized_args_array_construction, serialized_args_array_name, serialized_args_array_len, fn_name_str, fn_name_len, fn_selector) =\n        create_stub_base(f);\n    let fn_return_type = f.return_type();\n\n    quote {\n        pub fn $fn_name(self, $fn_parameters_list) -> aztec::context::calls::PublicStaticCall<$fn_name_len, $serialized_args_array_len, $fn_return_type> {\n            $serialized_args_array_construction\n            let selector = $FROM_FIELD($fn_selector);\n            aztec::context::calls::PublicStaticCall::new(\n                self.target_contract,\n                selector,\n                $fn_name_str,\n                $serialized_args_array_name,\n            )\n        }\n    }\n}\n\npub(crate) comptime fn create_utility_stub(f: FunctionDefinition) -> Quoted {\n    let (fn_name, fn_parameters_list, serialized_args_array_construction, serialized_args_array_name, serialized_args_array_len, fn_name_str, fn_name_len, fn_selector) =\n        create_stub_base(f);\n    let fn_return_type = f.return_type();\n\n    quote {\n        pub fn $fn_name(self, $fn_parameters_list) -> aztec::context::calls::UtilityCall<$fn_name_len, $serialized_args_array_len, $fn_return_type> {\n            $serialized_args_array_construction\n            let selector = $FROM_FIELD($fn_selector);\n            aztec::context::calls::UtilityCall::new(\n                self.target_contract,\n                selector,\n                $fn_name_str,\n                $serialized_args_array_name,\n            )\n        }\n    }\n}\n\n// Self-call stub generation functions for CallSelf, CallSelfStatic, EnqueueSelf, and EnqueueSelfStatic structs. Unlike\n// the stubs above, the self-call stubs directly perform the call instead of returning a struct that can be later used\n// to perform the call.\n\n/// Creates a stub for calling a private function (or static private function if `is_static` is true) from private\n/// context (for CallSelf<&mut PrivateContext> and CallSelfStatic<&mut PrivateContext>).\npub comptime fn create_private_self_call_stub(f: FunctionDefinition, is_static: bool) -> Quoted {\n    let (fn_name, fn_parameters_list, serialized_args_array_construction, serialized_args_array_name, _, _, _, fn_selector) =\n        create_stub_base(f);\n    let fn_return_type = f.return_type();\n\n    quote {\n        pub fn $fn_name(self, $fn_parameters_list) -> $fn_return_type {\n            $serialized_args_array_construction\n            let selector = $FROM_FIELD($fn_selector);\n            let args_hash = aztec::hash::hash_args($serialized_args_array_name);\n            aztec::oracle::execution_cache::store($serialized_args_array_name, args_hash);\n            let returns_hash = self.context.call_private_function_with_args_hash(\n                self.address,\n                selector,\n                args_hash,\n                $is_static\n            );\n            returns_hash.get_preimage()\n        }\n    }\n}\n\n/// Creates a stub for calling a public function from public context (for CallSelf<PublicContext>)\npub comptime fn create_public_self_call_stub(f: FunctionDefinition) -> Quoted {\n    let (fn_name, fn_parameters_list, serialized_args_array_construction, serialized_args_array_name, _, fn_name_str, _, fn_selector) =\n        create_stub_base(f);\n    let fn_return_type = f.return_type();\n\n    // TODO: It makes sense to drop the use of PublicStaticCall struct here and just perform the call directly but\n    // before doing that we need to drop the use of slices from return values because we cannot return slices from an\n    // unconstrained function. This is not a priority right now.\n    quote {\n        pub fn $fn_name(self, $fn_parameters_list) -> $fn_return_type {\n            $serialized_args_array_construction\n            let selector = $FROM_FIELD($fn_selector);\n            unsafe {\n                aztec::context::calls::PublicCall::new(\n                    self.address,\n                    selector,\n                    $fn_name_str,\n                    $serialized_args_array_name,\n                ).call(self.context)\n            }\n        }\n    }\n}\n\n/// Creates a static stub for calling a public view function from public context (for CallSelfStatic<PublicContext>)\npub comptime fn create_public_self_call_static_stub(f: FunctionDefinition) -> Quoted {\n    let (fn_name, fn_parameters_list, serialized_args_array_construction, serialized_args_array_name, _, fn_name_str, _, fn_selector) =\n        create_stub_base(f);\n    let fn_return_type = f.return_type();\n\n    // TODO: It makes sense to drop the use of PublicStaticCall struct here and just perform the call directly but\n    // before doing that we need to drop the use of slices from return values because we cannot return slices from an\n    // unconstrained function. This is not a priority right now.\n    quote {\n        pub fn $fn_name(self, $fn_parameters_list) -> $fn_return_type {\n            $serialized_args_array_construction\n            let selector = $FROM_FIELD($fn_selector);\n            unsafe {\n                aztec::context::calls::PublicStaticCall::new(\n                    self.address,\n                    selector,\n                    $fn_name_str,\n                    $serialized_args_array_name,\n                ).view(self.context)\n            }\n        }\n    }\n}\n\n/// Creates a static stub for enqueuing a public view function from private context (for EnqueueSelfStatic<&mut\n/// PrivateContext>)\npub comptime fn create_public_self_enqueue_static_stub(f: FunctionDefinition) -> Quoted {\n    let (fn_name, fn_parameters_list, serialized_args_array_construction, serialized_args_array_name, _serialized_args_array_len, _fn_name_str, _fn_name_len, fn_selector) =\n        create_stub_base(f);\n\n    quote {\n        pub fn $fn_name(self, $fn_parameters_list) {\n            $serialized_args_array_construction\n            let selector = $FROM_FIELD($fn_selector);\n            let calldata = [aztec::protocol::traits::ToField::to_field(selector)].concat($serialized_args_array_name);\n            let calldata_hash = aztec::hash::hash_calldata_array(calldata);\n            aztec::oracle::execution_cache::store(calldata, calldata_hash);\n            self.context.call_public_function_with_calldata_hash(\n                self.address,\n                calldata_hash,\n                /*is_static_call=*/ true,\n                /*hide_msg_sender=*/ false,\n            );\n        }\n    }\n}\n\n/// Creates a stub for enqueuing a public function from private context (for EnqueueSelf<&mut PrivateContext>)\npub comptime fn create_public_self_enqueue_stub(f: FunctionDefinition) -> Quoted {\n    let (fn_name, fn_parameters_list, serialized_args_array_construction, serialized_args_array_name, _serialized_args_array_len, _fn_name_str, _fn_name_len, fn_selector) =\n        create_stub_base(f);\n\n    quote {\n        pub fn $fn_name(self, $fn_parameters_list) {\n            $serialized_args_array_construction\n            let selector = $FROM_FIELD($fn_selector);\n            let calldata = [aztec::protocol::traits::ToField::to_field(selector)].concat($serialized_args_array_name);\n            let calldata_hash = aztec::hash::hash_calldata_array(calldata);\n            aztec::oracle::execution_cache::store(calldata, calldata_hash);\n            self.context.call_public_function_with_calldata_hash(\n                self.address,\n                calldata_hash,\n                /*is_static_call=*/ false,\n                /*hide_msg_sender=*/ false,\n            );\n        }\n    }\n}\n"
     },
-    "106": {
+    "104": {
       "function_locations": [
         {
           "name": "generate_public_dispatch",
@@ -3119,7 +3067,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/dispatch.nr",
       "source": "use crate::macros::internals_functions_generation::external_functions_registry::get_public_functions;\nuse crate::protocol::meta::utils::get_params_len_quote;\nuse crate::utils::cmap::CHashMap;\nuse super::functions::initialization_utils::EMIT_PUBLIC_INIT_NULLIFIER_FN_NAME;\nuse super::utils::compute_fn_selector;\nuse std::panic;\n\n/// Generates a `public_dispatch` function for an Aztec contract module `m`.\n///\n/// The generated function dispatches public calls based on selector to the appropriate contract function. If\n/// `generate_emit_public_init_nullifier` is true, it also handles dispatch to the macro-generated\n/// `__emit_public_init_nullifier` function.\npub comptime fn generate_public_dispatch(m: Module, generate_emit_public_init_nullifier: bool) -> Quoted {\n    let functions = get_public_functions(m);\n\n    let unit = get_type::<()>();\n\n    let seen_selectors = &mut CHashMap::<Field, Quoted>::new();\n\n    let mut ifs = functions.map(|function: FunctionDefinition| {\n        let parameters = function.parameters();\n        let return_type = function.return_type();\n\n        let fn_name = function.name();\n        let selector: Field = compute_fn_selector(fn_name, parameters);\n\n        // Since function selectors are computed as the first 4 bytes of the hash of the function signature, it's\n        // possible to have collisions. With the following check, we ensure it doesn't happen within the same contract.\n        let existing_fn = seen_selectors.get(selector);\n        if existing_fn.is_some() {\n            let existing_fn = existing_fn.unwrap();\n            panic(\n                f\"Public function selector collision detected between functions '{fn_name}' and '{existing_fn}'\",\n            );\n        }\n        seen_selectors.insert(selector, fn_name);\n\n        let params_len_quote = get_params_len_quote(parameters);\n\n        let initial_read = if parameters.len() == 0 {\n            quote {}\n        } else {\n            // The initial calldata_copy offset is 1 to skip the Field selector The expected calldata is the\n            // serialization of\n            // - FunctionSelector: the selector of the function intended to dispatch\n            // - Parameters: the parameters of the function intended to dispatch That is, exactly what is expected for\n            // a call to the target function, but with a selector added at the beginning.\n            quote {\n                let input_calldata: [Field; $params_len_quote] = aztec::oracle::avm::calldata_copy(1, $params_len_quote);\n                let mut reader = aztec::protocol::utils::reader::Reader::new(input_calldata);\n            }\n        };\n\n        let parameter_index: &mut u32 = &mut 0;\n        let reads = parameters.map(|param: (Quoted, Type)| {\n            let parameter_index_value = *parameter_index;\n            let param_name = f\"arg{parameter_index_value}\".quoted_contents();\n            let param_type = param.1;\n            let read = quote {\n                let $param_name: $param_type = aztec::protocol::traits::Deserialize::stream_deserialize(&mut reader);\n            };\n            *parameter_index += 1;\n            quote { $read }\n        });\n        let read = reads.join(quote { });\n\n        let mut args = @[];\n        for parameter_index in 0..parameters.len() {\n            let param_name = f\"arg{parameter_index}\".quoted_contents();\n            args = args.push_back(quote { $param_name });\n        }\n\n        // We call a function whose name is prefixed with `__aztec_nr_internals__`. This is necessary because the\n        // original function is intentionally made uncallable, preventing direct invocation within the contract.\n        // Instead, a new function with the same name, but prefixed by `__aztec_nr_internals__`, has been generated to\n        // be called here. For more details see the `process_functions` function.\n        let name = f\"__aztec_nr_internals__{fn_name}\".quoted_contents();\n        let args = args.join(quote { , });\n        let call = quote { $name($args) };\n\n        let return_code = if return_type == unit {\n            quote {\n                $call;\n                // Force early return.\n                aztec::oracle::avm::avm_return([]);\n            }\n        } else {\n            quote {\n                let return_value = aztec::protocol::traits::Serialize::serialize($call);\n                aztec::oracle::avm::avm_return(return_value.as_vector());\n            }\n        };\n\n        let if_ = quote {\n            if selector == $selector {\n                $initial_read\n                $read\n                $return_code\n            }\n        };\n        if_\n    });\n\n    // If we injected the auto-generated public function to emit the public initialization nullifier, then\n    // we'll also need to handle its dispatch.\n    if generate_emit_public_init_nullifier {\n        let name = EMIT_PUBLIC_INIT_NULLIFIER_FN_NAME;\n        let init_nullifier_selector: Field = compute_fn_selector(name, @[]);\n\n        ifs = ifs.push_back(\n            quote {\n            if selector == $init_nullifier_selector {\n                $name();\n                aztec::oracle::avm::avm_return([]);\n            }\n        },\n        );\n    }\n\n    if ifs.len() == 0 {\n        // No dispatch function if there are no public functions\n        quote {}\n    } else {\n        let ifs = ifs.push_back(quote { panic(f\"Unknown selector {selector}\") });\n        let dispatch = ifs.join(quote {  });\n\n        let body = quote {\n            // We mark this as public because our whole system depends on public functions having this attribute.\n            #[aztec::macros::internals_functions_generation::abi_attributes::abi_public]\n            pub unconstrained fn public_dispatch(selector: Field) {\n                $dispatch\n            }\n        };\n\n        body\n    }\n}\n\ncomptime fn get_type<T>() -> Type {\n    let t: T = std::mem::zeroed();\n    std::meta::type_of(t)\n}\n"
     },
-    "116": {
+    "114": {
       "function_locations": [
         {
           "name": "generate_private_external",
@@ -3129,7 +3077,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/internals_functions_generation/external/private.nr",
       "source": "use crate::macros::{\n    functions::initialization_utils::has_public_init_checked_functions,\n    internals_functions_generation::external::helpers::{create_authorize_once_check, get_abi_relevant_attributes},\n    utils::{\n        fn_has_allow_phase_change, fn_has_authorize_once, fn_has_noinitcheck, is_fn_initializer, is_fn_only_self,\n        is_fn_view, module_has_initializer, module_has_storage,\n    },\n};\nuse crate::protocol::meta::utils::derive_serialization_quotes;\nuse std::meta::type_of;\n\npub(crate) comptime fn generate_private_external(f: FunctionDefinition) -> Quoted {\n    let module_has_initializer = module_has_initializer(f.module());\n    let module_has_storage = module_has_storage(f.module());\n\n    // Private functions undergo a lot of transformations from their Aztec.nr form into a circuit that can be fed to\n    // the Private Kernel Circuit. First we change the function signature so that it also receives\n    // `PrivateContextInputs`, which contain information about the execution context (e.g. the caller).\n    let original_params = f.parameters();\n\n    let original_params_quotes =\n        original_params.map(|(param_name, param_type)| quote { $param_name: $param_type }).join(quote {, });\n\n    let params = quote { inputs: aztec::context::inputs::PrivateContextInputs, $original_params_quotes };\n\n    let mut body = f.body().as_block().unwrap();\n\n    // The original params are hashed and passed to the `context` object, so that the kernel can verify we've received\n    // the correct values.\n    let (args_serialization, _, serialized_args_name) = derive_serialization_quotes(original_params, false);\n\n    let storage_init = if module_has_storage {\n        // Contract has Storage defined so we initialize it.\n        quote {\n            let storage = Storage::init(&mut context);\n        }\n    } else {\n        // Contract does not have Storage defined, so we set storage to the unit type `()`. ContractSelfPrivate\n        // requires a storage struct in its constructor. Using an Option type would lead to worse developer experience\n        // and higher constraint counts so we use the unit type `()` instead.\n        quote {\n            let storage = ();\n        }\n    };\n\n    let contract_self_creation = quote {\n        #[allow(unused_variables)]\n        let mut self = {\n            $args_serialization\n            let args_hash = aztec::hash::hash_args($serialized_args_name);\n            let mut context = aztec::context::PrivateContext::new(inputs, args_hash);\n            $storage_init\n            let self_address = context.this_address();\n            let call_self: CallSelf<&mut aztec::context::PrivateContext> = CallSelf { address: self_address, context: &mut context };\n            let enqueue_self: EnqueueSelf<&mut aztec::context::PrivateContext> = EnqueueSelf { address: self_address, context: &mut context };\n            let call_self_static: CallSelfStatic<&mut aztec::context::PrivateContext> = CallSelfStatic { address: self_address, context: &mut context };\n            let enqueue_self_static: EnqueueSelfStatic<&mut aztec::context::PrivateContext> = EnqueueSelfStatic { address: self_address, context: &mut context };\n            let internal: CallInternal<&mut aztec::context::PrivateContext> = CallInternal { context: &mut context };\n            aztec::contract_self::ContractSelfPrivate::new(&mut context, storage, call_self, enqueue_self, call_self_static, enqueue_self_static, internal)\n        };\n    };\n\n    let original_function_name = f.name();\n\n    // Modifications introduced by the different marker attributes.\n    let internal_check = if is_fn_only_self(f) {\n        let assertion_message = f\"Function {original_function_name} can only be called by the same contract\";\n        quote { assert(self.msg_sender() == self.address, $assertion_message); }\n    } else {\n        quote {}\n    };\n\n    let view_check = if is_fn_view(f) {\n        let assertion_message = f\"Function {original_function_name} can only be called statically\".as_quoted_str();\n        quote { assert(self.context.inputs.call_context.is_static_call, $assertion_message); }\n    } else {\n        quote {}\n    };\n\n    let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n        let has_public_fns_with_init_check = has_public_init_checked_functions(f.module());\n        (\n            quote { aztec::macros::functions::initialization_utils::assert_initialization_matches_address_preimage_private(*self.context); },\n            quote { aztec::macros::functions::initialization_utils::mark_as_initialized_from_private_initializer(self.context, $has_public_fns_with_init_check); },\n        )\n    } else {\n        (quote {}, quote {})\n    };\n\n    // Initialization checks are not included in contracts that don't have initializers.\n    let init_check = if module_has_initializer & !is_fn_initializer(f) & !fn_has_noinitcheck(f) {\n        quote { aztec::macros::functions::initialization_utils::assert_is_initialized_private(self.context); }\n    } else {\n        quote {}\n    };\n\n    // Phase checks are skipped in functions that request to manually handle phases\n    let initial_phase_store = if fn_has_allow_phase_change(f) {\n        quote {}\n    } else {\n        quote { let within_revertible_phase: bool = self.context.in_revertible_phase(); }\n    };\n\n    let no_phase_change_check = if fn_has_allow_phase_change(f) {\n        quote {}\n    } else {\n        quote {   \n            assert_eq(\n                within_revertible_phase,\n                self.context.in_revertible_phase(),\n                f\"Phase change detected on function with phase check. If this is expected, use #[allow_phase_change]\",\n            ); \n        }\n    };\n\n    // Inject the authwit check if the function is marked with #[authorize_once].\n    let authorize_once_check = if fn_has_authorize_once(f) {\n        create_authorize_once_check(f, true)\n    } else {\n        quote {}\n    };\n\n    // Finally, we need to change the return type to be `PrivateCircuitPublicInputs`, which is what the Private Kernel\n    // circuit expects.\n    let return_value_var_name = quote { macro__returned__values };\n\n    let return_value_type = f.return_type();\n    let return_value = if body.len() == 0 {\n        quote {}\n    } else if return_value_type != type_of(()) {\n        // The original return value is serialized and hashed before being passed to the context.\n        let (body_without_return, last_body_expr) = body.pop_back();\n        let return_value = last_body_expr.quoted();\n        let return_value_assignment = quote { let $return_value_var_name: $return_value_type = $return_value; };\n\n        let (return_serialization, _, serialized_return_name) =\n            derive_serialization_quotes([(return_value_var_name, return_value_type)], false);\n\n        body = body_without_return;\n\n        quote {\n            $return_value_assignment\n            $return_serialization\n            self.context.set_return_hash($serialized_return_name);\n        }\n    } else {\n        let (body_without_return, last_body_expr) = body.pop_back();\n        if !last_body_expr.has_semicolon()\n            & last_body_expr.as_for().is_none()\n            & last_body_expr.as_assert().is_none()\n            & last_body_expr.as_for_range().is_none()\n            & last_body_expr.as_assert_eq().is_none()\n            & last_body_expr.as_let().is_none() {\n            let unused_return_value_name = f\"_{return_value_var_name}\".quoted_contents();\n            body = body_without_return.push_back(quote { let $unused_return_value_name = $last_body_expr; }\n                .as_expr()\n                .unwrap());\n        }\n        quote {}\n    };\n\n    let context_finish = quote { self.context.finish() };\n\n    // Preserve all attributes that are relevant to the function's ABI.\n    let abi_relevant_attributes = get_abi_relevant_attributes(f);\n\n    let fn_name = f\"__aztec_nr_internals__{original_function_name}\".quoted_contents();\n\n    let to_prepend = quote {\n        aztec::oracle::version::assert_compatible_oracle_version();\n        $contract_self_creation\n        $initial_phase_store\n        $assert_initializer\n        $init_check\n        $internal_check\n        $view_check\n        $authorize_once_check\n    };\n\n    let body_quote = body.map(|expr| expr.quoted()).join(quote { });\n\n    // `mark_as_initialized` is placed after the user's function body. If it ran at the beginning, the contract\n    // would appear initialized while the initializer is still running, allowing contracts called by the initializer\n    // to re-enter into a half-initialized contract.\n    let to_append = quote {\n        $return_value\n        $mark_as_initialized\n        $no_phase_change_check\n        $context_finish\n    };\n\n    quote {\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_private]\n        $abi_relevant_attributes\n        fn $fn_name($params) -> return_data aztec::protocol::abis::private_circuit_public_inputs::PrivateCircuitPublicInputs {\n            $to_prepend\n            $body_quote\n            $to_append\n        }\n    }\n}\n"
     },
-    "117": {
+    "115": {
       "function_locations": [
         {
           "name": "generate_public_external",
@@ -3139,7 +3087,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/internals_functions_generation/external/public.nr",
       "source": "use crate::macros::{\n    internals_functions_generation::external::helpers::{create_authorize_once_check, get_abi_relevant_attributes},\n    utils::{\n        fn_has_authorize_once, fn_has_noinitcheck, is_fn_initializer, is_fn_only_self, is_fn_view,\n        module_has_initializer, module_has_storage,\n    },\n};\n\npub(crate) comptime fn generate_public_external(f: FunctionDefinition) -> Quoted {\n    let module_has_initializer = module_has_initializer(f.module());\n    let module_has_storage = module_has_storage(f.module());\n\n    // Public functions undergo a lot of transformations from their Aztec.nr form.\n    let original_params = f.parameters();\n\n    let args_len_quote = if original_params.len() == 0 {\n        // If the function has no parameters, we set the args_len to 0.\n        quote { 0 }\n    } else {\n        // The following will give us <type_of_struct_member_1 as Serialize>::N + <type_of_struct_member_2 as\n        // Serialize>::N + ...\n        original_params\n            .map(|(_, param_type): (Quoted, Type)| {\n                quote {\n            <$param_type as $crate::protocol::traits::Serialize>::N\n        }\n            })\n            .join(quote {+})\n    };\n\n    let storage_init = if module_has_storage {\n        quote {\n            let storage = Storage::init(context);\n        }\n    } else {\n        // Contract does not have Storage defined, so we set storage to the unit type `()`. ContractSelfPublic requires\n        // a storage struct in its constructor. Using an Option type would lead to worse developer experience and\n        // higher constraint counts so we use the unit type `()` instead.\n        quote {\n            let storage = ();\n        }\n    };\n\n    // Unlike in the private case, in public the `context` does not need to receive the hash of the original params.\n    let contract_self_creation = quote {\n        #[allow(unused_variables)]\n        let mut self = {\n            let context = aztec::context::PublicContext::new(|| {\n            // We start from 1 because we skip the selector for the dispatch function.\n            let serialized_args : [Field; $args_len_quote] = aztec::oracle::avm::calldata_copy(1, $args_len_quote);\n            aztec::hash::hash_args(serialized_args)\n            });\n            $storage_init\n            let self_address = context.this_address();\n            let call_self: CallSelf<aztec::context::PublicContext> = CallSelf { address: self_address, context };\n            let call_self_static: CallSelfStatic<aztec::context::PublicContext> = CallSelfStatic { address: self_address, context };\n            let internal: CallInternal<aztec::context::PublicContext> = CallInternal { context };\n            aztec::contract_self::ContractSelfPublic::new(context, storage, call_self, call_self_static, internal)\n        };\n    };\n\n    let original_function_name = f.name();\n\n    // Modifications introduced by the different marker attributes.\n    let internal_check = if is_fn_only_self(f) {\n        let assertion_message = f\"Function {original_function_name} can only be called by the same contract\";\n        quote { assert(self.msg_sender() == self.address, $assertion_message); }\n    } else {\n        quote {}\n    };\n\n    let view_check = if is_fn_view(f) {\n        let assertion_message = f\"Function {original_function_name} can only be called statically\".as_quoted_str();\n        quote { assert(self.context.is_static_call(), $assertion_message); }\n    } else {\n        quote {}\n    };\n\n    let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n        (\n            quote { aztec::macros::functions::initialization_utils::assert_initialization_matches_address_preimage_public(self.context); },\n            quote { aztec::macros::functions::initialization_utils::mark_as_initialized_from_public_initializer(self.context); },\n        )\n    } else {\n        (quote {}, quote {})\n    };\n\n    // Initialization checks are not included in contracts that don't have initializers.\n    let init_check = if module_has_initializer & !fn_has_noinitcheck(f) & !is_fn_initializer(f) {\n        quote { aztec::macros::functions::initialization_utils::assert_is_initialized_public(self.context); }\n    } else {\n        quote {}\n    };\n\n    // Inject the authwit check if the function is marked with #[authorize_once].\n    let authorize_once_check = if fn_has_authorize_once(f) {\n        create_authorize_once_check(f, false)\n    } else {\n        quote {}\n    };\n\n    let to_prepend = quote {\n        $contract_self_creation\n        $assert_initializer\n        $init_check\n        $internal_check\n        $view_check\n        $authorize_once_check\n    };\n\n    // `mark_as_initialized` is placed after the user's function body. If it ran at the beginning, the contract\n    // would appear initialized while the initializer is still running, allowing contracts called by the initializer\n    // to re-enter into a half-initialized contract.\n    let to_append = quote {\n        $mark_as_initialized\n    };\n\n    let fn_name = f\"__aztec_nr_internals__{original_function_name}\".quoted_contents();\n    let body = f.body();\n    let return_type = f.return_type();\n\n    // New function parameters are the same as the original function's ones.\n    let params = original_params.map(|(param_name, param_type)| quote { $param_name: $param_type }).join(quote {, });\n\n    // Preserve all attributes that are relevant to the function's ABI.\n    let abi_relevant_attributes = get_abi_relevant_attributes(f);\n\n    // All public functions are automatically made unconstrained, even if they were not marked as such. This is because\n    // instead of compiling into a circuit, they will compile to bytecode that will be later transpiled into AVM\n    // bytecode.\n    quote {\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_public]\n        $abi_relevant_attributes\n        unconstrained fn $fn_name($params) -> pub $return_type {\n            $to_prepend\n            $body\n            $to_append\n        }\n    }\n}\n"
     },
-    "118": {
+    "116": {
       "function_locations": [
         {
           "name": "generate_utility_external",
@@ -3149,7 +3097,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/internals_functions_generation/external/utility.nr",
       "source": "use crate::macros::utils::{fn_has_noinitcheck, module_has_initializer, module_has_storage};\n\npub(crate) comptime fn generate_utility_external(f: FunctionDefinition) -> Quoted {\n    let module_has_initializer = module_has_initializer(f.module());\n\n    // Initialize Storage if module has storage\n    let storage_init = if module_has_storage(f.module()) {\n        quote {\n            let storage = Storage::init(context);\n        }\n    } else {\n        // Contract does not have Storage defined, so we set storage to the unit type `()`. ContractSelfUtility\n        // requires a\n        // storage struct in its constructor. Using an Option type would lead to worse developer experience and higher\n        // constraint counts so we use the unit type `()` instead.\n        quote {\n            let storage = ();\n        }\n    };\n\n    // Create utility context\n    let contract_self_creation = quote {\n        #[allow(unused_variables)]\n        let mut self = {\n            let context = aztec::context::UtilityContext::new();\n            $storage_init\n            aztec::contract_self::ContractSelfUtility::new(context, storage)\n        };\n    };\n\n    // Initialization checks are not included in contracts that don't have initializers.\n    let init_check = if module_has_initializer & !fn_has_noinitcheck(f) {\n        quote {\n            aztec::macros::functions::initialization_utils::assert_is_initialized_utility(\n                self.context,\n            );\n        }\n    } else {\n        quote {}\n    };\n\n    // A quote to be injected at the beginning of the function body.\n    let to_prepend = quote {\n        aztec::oracle::version::assert_compatible_oracle_version();\n        $contract_self_creation\n        $init_check\n    };\n\n    let original_function_name = f.name();\n    let fn_name = f\"__aztec_nr_internals__{original_function_name}\".quoted_contents();\n    let body = f.body();\n    let params = f.parameters().map(|(param_name, param_type)| quote { $param_name: $param_type }).join(quote {, });\n    let return_type = f.return_type();\n\n    quote {\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n        unconstrained fn $fn_name($params) -> pub $return_type {\n            $to_prepend\n            $body\n        }\n    }\n}\n"
     },
-    "127": {
+    "125": {
       "function_locations": [
         {
           "name": "do_sync_state",
@@ -3171,7 +3119,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/mod.nr",
       "source": "use crate::logging::{aztecnr_debug_log, aztecnr_debug_log_format, aztecnr_warn_log_format};\nuse crate::protocol::address::AztecAddress;\n\npub(crate) mod nonce_discovery;\npub(crate) mod partial_notes;\npub(crate) mod private_events;\npub mod private_notes;\npub mod process_message;\n\nuse crate::{\n    capsules::CapsuleArray,\n    messages::{\n        discovery::process_message::process_message_ciphertext,\n        encoding::MAX_MESSAGE_CONTENT_LEN,\n        logs::note::MAX_NOTE_PACKED_LEN,\n        processing::{\n            get_private_logs, MessageContext, offchain::OffchainInboxSync, OffchainMessageWithContext,\n            pending_tagged_log::PendingTaggedLog, validate_and_store_enqueued_notes_and_events,\n        },\n    },\n    utils::array,\n};\n\npub struct NoteHashAndNullifier {\n    /// The result of [`crate::note::note_interface::NoteHash::compute_note_hash`].\n    pub note_hash: Field,\n    /// The result of [`crate::note::note_interface::NoteHash::compute_nullifier_unconstrained`].\n    ///\n    /// This value is unconstrained, as all of message discovery is unconstrained. It is `None` if the nullifier\n    /// cannot be computed (e.g. because the nullifier hiding key is not available).\n    pub inner_nullifier: Option<Field>,\n}\n\n/// A contract's way of computing note hashes.\n///\n/// Each contract in the network is free to compute their note's hash as they see fit - the hash function itself is not\n/// enshrined or standardized. Some aztec-nr functions however do need to know the details of this computation (e.g.\n/// when finding new notes), which is what this type represents.\n///\n/// This function takes a note's packed content, storage slot, note type ID, address of the emitting contract and\n/// randomness, and attempts to compute its inner note hash (not siloed by address nor uniqued by nonce).\n///\n/// ## Transient Notes\n///\n/// This function is meant to always be used on **settled** notes, i.e. those that have been inserted into the trees\n/// and for which the nonce is known. It is never invoked in the context of a transient note, as those are not involved\n/// in message processing.\n///\n/// ## Automatic Implementation\n///\n/// The [`[#aztec]`](crate::macros::aztec::aztec) macro automatically creates a correct implementation of this function\n/// for each contract by inspecting all note types in use and the storage layout. This injected function is a\n/// `#[contract_library_method]` called `_compute_note_hash`, and it looks something like this:\n///\n/// ```noir\n/// |packed_note, owner, storage_slot, note_type_id, _contract_address, randomness| {\n///     if note_type_id == MyNoteType::get_id() {\n///         if packed_note.len() != MY_NOTE_TYPE_SERIALIZATION_LENGTH {\n///             Option::none()\n///         } else {\n///             let note = MyNoteType::unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n///             Option::some(note.compute_note_hash(owner, storage_slot, randomness))\n///         }\n///     } else if note_type_id == MyOtherNoteType::get_id() {\n///           ... // Similar to above but calling MyOtherNoteType::unpack\n///     } else {\n///         Option::none() // Unknown note type ID\n///     };\n/// }\n/// ```\npub type ComputeNoteHash = unconstrained fn(/* packed_note */BoundedVec<Field, MAX_NOTE_PACKED_LEN>, /*\n owner */ AztecAddress, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress, /*\nrandomness */ Field) -> Option<Field>;\n\n/// A contract's way of computing note nullifiers.\n///\n/// Like [`ComputeNoteHash`], each contract is free to derive nullifiers as they see fit. This function takes the\n/// unique note hash (used as the note hash for nullification for settled notes), plus the note's packed content and\n/// metadata, and attempts to compute the inner nullifier (not siloed by address).\n///\n/// ## Automatic Implementation\n///\n/// The [`[#aztec]`](crate::macros::aztec::aztec) macro automatically creates a correct implementation of this function\n/// for each contract called `_compute_note_nullifier`. It dispatches on `note_type_id` similarly to\n/// [`ComputeNoteHash`], then calls the note's\n/// [`compute_nullifier_unconstrained`](crate::note::note_interface::NoteHash::compute_nullifier_unconstrained) method.\npub type ComputeNoteNullifier = unconstrained fn(/* unique_note_hash */Field, /* packed_note */ BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n/* owner */ AztecAddress, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress,\n/* randomness */ Field) -> Option<Field>;\n\n/// Deprecated: use [`ComputeNoteHash`] and [`ComputeNoteNullifier`] instead.\npub type ComputeNoteHashAndNullifier<Env> = unconstrained fn[Env](/* packed_note */BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n/* owner */ AztecAddress, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress,\n/*randomness */ Field, /* note nonce */ Field) -> Option<NoteHashAndNullifier>;\n\n/// A handler for custom messages.\n///\n/// Contracts that emit custom messages (i.e. any with a message type that is not in [`crate::messages::msg_type`])\n/// need to use [`crate::macros::AztecConfig::custom_message_handler`] with a function of this type in order to\n/// process them. They will otherwise be **silently ignored**.\npub type CustomMessageHandler<Env> = unconstrained fn[Env](\n/* contract_address */AztecAddress,\n/* msg_type_id */ u64,\n/* msg_metadata */ u64,\n/* msg_content */ BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n/* message_context */ MessageContext,\n/* scope */ AztecAddress);\n\n/// Synchronizes the contract's private state with the network.\n///\n/// As blocks are mined, it is possible for a contract's private state to change (e.g. with new notes being created),\n/// but because these changes are private they will be invisible to most actors. This is the function that processes\n/// new transactions in order to discover new notes, events, and other kinds of private state changes.\n///\n/// The private state will be synchronized up to the block that will be used for private transactions (i.e. the anchor\n/// block. This will typically be close to the tip of the chain.\npub unconstrained fn do_sync_state<CustomMessageHandlerEnv>(\n    contract_address: AztecAddress,\n    compute_note_hash: ComputeNoteHash,\n    compute_note_nullifier: ComputeNoteNullifier,\n    process_custom_message: Option<CustomMessageHandler<CustomMessageHandlerEnv>>,\n    offchain_inbox_sync: Option<OffchainInboxSync<()>>,\n    scope: AztecAddress,\n) {\n    aztecnr_debug_log!(\"Performing state synchronization\");\n\n    // First we process all private logs, which can contain different kinds of messages e.g. private notes, partial\n    // notes, private events, etc.\n    let logs = get_private_logs(contract_address, scope);\n    logs.for_each(|i, pending_tagged_log: PendingTaggedLog| {\n        if pending_tagged_log.log.len() == 0 {\n            aztecnr_warn_log_format!(\"Skipping empty log from tx {0}\")([pending_tagged_log.context.tx_hash]);\n        } else {\n            aztecnr_debug_log_format!(\"Processing log with tag {0}\")([pending_tagged_log.log.get(0)]);\n\n            // We remove the tag from the pending tagged log and process the message ciphertext contained in it.\n            let message_ciphertext = array::subbvec(pending_tagged_log.log, 1);\n\n            process_message_ciphertext(\n                contract_address,\n                compute_note_hash,\n                compute_note_nullifier,\n                process_custom_message,\n                message_ciphertext,\n                pending_tagged_log.context,\n                scope,\n            );\n        }\n\n        // We need to delete each log from the array so that we won't process them again. `CapsuleArray::for_each`\n        // allows deletion of the current element during iteration, so this is safe.\n        // Note that this (and all other database changes) will only be committed if contract execution succeeds,\n        // including any enqueued validation requests.\n        logs.remove(i);\n    });\n\n    if offchain_inbox_sync.is_some() {\n        let msgs: CapsuleArray<OffchainMessageWithContext> = offchain_inbox_sync.unwrap()(contract_address, scope);\n        msgs.for_each(|i, msg| {\n            process_message_ciphertext(\n                contract_address,\n                compute_note_hash,\n                compute_note_nullifier,\n                process_custom_message,\n                msg.message_ciphertext,\n                msg.message_context,\n                scope,\n            );\n            // The inbox sync returns _a copy_ of messages to process, so we clear them as we do so. This is a\n            // volatile array with the to-process message, not the actual persistent storage of them.\n            msgs.remove(i);\n        });\n    }\n\n    // Then we process all pending partial notes, regardless of whether they were found in the current or previous\n    // executions.\n    partial_notes::fetch_and_process_partial_note_completion_logs(\n        contract_address,\n        compute_note_hash,\n        compute_note_nullifier,\n        scope,\n    );\n\n    // Finally we validate all notes and events that were found as part of the previous processes, resulting in them\n    // being added to PXE's database and retrievable via oracles (get_notes) and our TS API (PXE::getPrivateEvents).\n    validate_and_store_enqueued_notes_and_events(contract_address, scope);\n}\n\nmod test {\n    use crate::{\n        capsules::CapsuleArray,\n        messages::{\n            discovery::{CustomMessageHandler, do_sync_state},\n            logs::note::MAX_NOTE_PACKED_LEN,\n            processing::{\n                offchain::OffchainInboxSync, pending_tagged_log::PendingTaggedLog, PENDING_TAGGED_LOG_ARRAY_BASE_SLOT,\n            },\n        },\n        test::helpers::test_environment::TestEnvironment,\n    };\n    use crate::protocol::address::AztecAddress;\n\n    #[test]\n    unconstrained fn do_sync_state_does_not_panic_on_empty_logs() {\n        let mut env = TestEnvironment::new();\n        let scope = env.create_light_account();\n\n        let contract_address = AztecAddress { inner: 0xdeadbeef };\n\n        env.utility_context_at(contract_address, |_| {\n            let base_slot = PENDING_TAGGED_LOG_ARRAY_BASE_SLOT;\n\n            let logs: CapsuleArray<PendingTaggedLog> = CapsuleArray::at(contract_address, base_slot, scope);\n            logs.push(PendingTaggedLog { log: BoundedVec::new(), context: std::mem::zeroed() });\n            assert_eq(logs.len(), 1);\n\n            let no_handler: Option<CustomMessageHandler<()>> = Option::none();\n            let no_inbox_sync: Option<OffchainInboxSync<()>> = Option::none();\n            do_sync_state(\n                contract_address,\n                dummy_compute_note_hash,\n                dummy_compute_note_nullifier,\n                no_handler,\n                no_inbox_sync,\n                scope,\n            );\n\n            assert_eq(logs.len(), 0);\n        });\n    }\n\n    unconstrained fn dummy_compute_note_hash(\n        _packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n        _owner: AztecAddress,\n        _storage_slot: Field,\n        _note_type_id: Field,\n        _contract_address: AztecAddress,\n        _randomness: Field,\n    ) -> Option<Field> {\n        Option::none()\n    }\n\n    unconstrained fn dummy_compute_note_nullifier(\n        _unique_note_hash: Field,\n        _packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n        _owner: AztecAddress,\n        _storage_slot: Field,\n        _note_type_id: Field,\n        _contract_address: AztecAddress,\n        _randomness: Field,\n    ) -> Option<Field> {\n        Option::none()\n    }\n}\n"
     },
-    "128": {
+    "126": {
       "function_locations": [
         {
           "name": "attempt_note_nonce_discovery",
@@ -3229,7 +3177,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/nonce_discovery.nr",
       "source": "use crate::messages::{discovery::{ComputeNoteHash, ComputeNoteNullifier}, logs::note::MAX_NOTE_PACKED_LEN};\n\nuse crate::logging::{aztecnr_debug_log_format, aztecnr_warn_log_format};\nuse crate::protocol::{\n    address::AztecAddress,\n    constants::MAX_NOTE_HASHES_PER_TX,\n    hash::{compute_note_hash_nonce, compute_siloed_note_hash, compute_unique_note_hash},\n    traits::ToField,\n};\n\n/// A struct with the discovered information of a complete note, required for delivery to PXE. Note that this is *not*\n/// the complete note information, since it does not include content, storage slot, etc.\npub(crate) struct DiscoveredNoteInfo {\n    pub(crate) note_nonce: Field,\n    pub(crate) note_hash: Field,\n    pub(crate) inner_nullifier: Field,\n}\n\n/// Searches for note nonces that will result in a note that was emitted in a transaction. While rare, it is possible\n/// for multiple notes to have the exact same packed content and storage slot but different nonces, resulting in\n/// different unique note hashes. Because of this this function returns a *vector* of discovered notes, though in most\n/// cases it will contain a single element.\n///\n/// Due to how nonces are computed, this function requires knowledge of the transaction in which the note was created,\n/// more specifically the list of all unique note hashes in it plus the value of its first nullifier.\npub(crate) unconstrained fn attempt_note_nonce_discovery(\n    unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n    first_nullifier_in_tx: Field,\n    compute_note_hash: ComputeNoteHash,\n    compute_note_nullifier: ComputeNoteNullifier,\n    contract_address: AztecAddress,\n    owner: AztecAddress,\n    storage_slot: Field,\n    randomness: Field,\n    note_type_id: Field,\n    packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n) -> BoundedVec<DiscoveredNoteInfo, MAX_NOTE_HASHES_PER_TX> {\n    let discovered_notes = &mut BoundedVec::new();\n\n    aztecnr_debug_log_format!(\n        \"Attempting nonce discovery on {0} potential notes on contract {1} for storage slot {2}\",\n    )(\n        [unique_note_hashes_in_tx.len() as Field, contract_address.to_field(), storage_slot],\n    );\n\n    let maybe_note_hash = compute_note_hash(\n        packed_note,\n        owner,\n        storage_slot,\n        note_type_id,\n        contract_address,\n        randomness,\n    );\n\n    if maybe_note_hash.is_none() {\n        aztecnr_warn_log_format!(\n            \"Unable to compute note hash for note of id {0} with packed length {1}, skipping nonce discovery\",\n        )(\n            [note_type_id, packed_note.len() as Field],\n        );\n    } else {\n        let note_hash = maybe_note_hash.unwrap();\n        let siloed_note_hash = compute_siloed_note_hash(contract_address, note_hash);\n\n        // We need to find nonces (typically just one) that result in the siloed note hash that being uniqued into one\n        // of the transaction's effects.\n        // The nonce is meant to be derived from the index of the note hash in the transaction effects array. However,\n        // due to an issue in the kernels the nonce might actually use any of the possible note hash indices - not\n        // necessarily the one that corresponds to the note hash. Hence, we need to try them all.\n        for i in 0..MAX_NOTE_HASHES_PER_TX {\n            let nonce_for_i = compute_note_hash_nonce(first_nullifier_in_tx, i);\n            let unique_note_hash_for_i = compute_unique_note_hash(nonce_for_i, siloed_note_hash);\n\n            let matching_notes = bvec_filter(\n                unique_note_hashes_in_tx,\n                |unique_note_hash_in_tx| unique_note_hash_in_tx == unique_note_hash_for_i,\n            );\n            if matching_notes.len() > 1 {\n                let identical_note_hashes = matching_notes.len();\n                // Note that we don't actually check that the note hashes array contains unique values, only that the\n                // note we found is unique. We don't expect for this to ever happen (it'd indicate a malicious node or\n                // PXE, which are both assumed to be cooperative) so testing for it just in case is unnecessary, but we\n                // _do_ need to handle it if we find a duplicate.\n                panic(\n                    f\"Received {identical_note_hashes} identical note hashes for a transaction - these should all be unique\",\n                )\n            } else if matching_notes.len() == 1 {\n                let maybe_inner_nullifier_for_i = compute_note_nullifier(\n                    unique_note_hash_for_i,\n                    packed_note,\n                    owner,\n                    storage_slot,\n                    note_type_id,\n                    contract_address,\n                    randomness,\n                );\n\n                if maybe_inner_nullifier_for_i.is_none() {\n                    // TODO: down the line we want to be able to store notes for which we don't know their nullifier,\n                    // e.g. notes that belong to someone that is not us (and for which we therefore don't know their\n                    // associated app-siloed nullifer hiding secret key).\n                    // https://linear.app/aztec-labs/issue/F-265/store-external-notes\n                    aztecnr_warn_log_format!(\n                        \"Unable to compute nullifier of unique note {0} with note type id {1} and owner {2}, skipping PXE insertion\",\n                    )(\n                        [unique_note_hash_for_i, note_type_id, owner.to_field()],\n                    );\n                } else {\n                    // Note that while we did check that the note hash is the preimage of a unique note hash, we\n                    // perform no validations on the nullifier - we fundamentally cannot, since only the application\n                    // knows how to compute nullifiers. We simply trust it to have provided the correct one: if it\n                    // hasn't, then PXE may fail to realize that a given note has been nullified already, and calls to\n                    // the application could result in invalid transactions (with duplicate nullifiers). This is not a\n                    // concern because an application already has more direct means of making a call to it fail the\n                    // transaction.\n                    discovered_notes.push(\n                        DiscoveredNoteInfo {\n                            note_nonce: nonce_for_i,\n                            note_hash,\n                            inner_nullifier: maybe_inner_nullifier_for_i.unwrap(),\n                        },\n                    );\n                }\n                // We don't exit the loop - it is possible (though rare) for the exact same note content to be present\n                // multiple times in the same transaction with different nonces. This typically doesn't happen due to\n                // notes containing random values in order to hide their contents.\n            }\n        }\n    }\n\n    *discovered_notes\n}\n\n// There is no BoundedVec::filter in the stdlib, so we use this until that is implemented.\nunconstrained fn bvec_filter<Env, T, let MAX_LEN: u32>(\n    bvec: BoundedVec<T, MAX_LEN>,\n    filter: fn[Env](T) -> bool,\n) -> BoundedVec<T, MAX_LEN> {\n    let filtered = &mut BoundedVec::new();\n\n    bvec.for_each(|value| {\n        if filter(value) {\n            filtered.push(value);\n        }\n    });\n\n    *filtered\n}\n\nmod test {\n    use crate::{\n        messages::logs::note::MAX_NOTE_PACKED_LEN,\n        note::{\n            note_interface::{NoteHash, NoteType},\n            note_metadata::SettledNoteMetadata,\n            utils::compute_note_hash_for_nullification,\n        },\n        oracle::random::random,\n        test::mocks::mock_note::MockNote,\n        utils::array,\n    };\n\n    use crate::protocol::{\n        address::AztecAddress,\n        hash::{compute_note_hash_nonce, compute_siloed_note_hash, compute_unique_note_hash},\n        traits::{FromField, Packable},\n    };\n\n    use super::attempt_note_nonce_discovery;\n\n    // This implementation could be simpler, but this serves as a nice example of the expected flow in a real\n    // implementation, and as a sanity check that the interface is sufficient.\n\n    unconstrained fn compute_note_hash(\n        packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n        owner: AztecAddress,\n        storage_slot: Field,\n        note_type_id: Field,\n        _contract_address: AztecAddress,\n        randomness: Field,\n    ) -> Option<Field> {\n        if (note_type_id == MockNote::get_id()) & (packed_note.len() == <MockNote as Packable>::N) {\n            let note = MockNote::unpack(array::subarray(packed_note.storage(), 0));\n            Option::some(note.compute_note_hash(owner, storage_slot, randomness))\n        } else {\n            Option::none()\n        }\n    }\n\n    unconstrained fn compute_note_nullifier(\n        unique_note_hash: Field,\n        packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n        owner: AztecAddress,\n        _storage_slot: Field,\n        note_type_id: Field,\n        _contract_address: AztecAddress,\n        _randomness: Field,\n    ) -> Option<Field> {\n        if (note_type_id == MockNote::get_id()) & (packed_note.len() == <MockNote as Packable>::N) {\n            let note = MockNote::unpack(array::subarray(packed_note.storage(), 0));\n            note.compute_nullifier_unconstrained(owner, unique_note_hash)\n        } else {\n            Option::none()\n        }\n    }\n\n    global VALUE: Field = 7;\n    global FIRST_NULLIFIER_IN_TX: Field = 47;\n    global CONTRACT_ADDRESS: AztecAddress = AztecAddress::from_field(13);\n    global OWNER: AztecAddress = AztecAddress::from_field(14);\n    global STORAGE_SLOT: Field = 99;\n    global RANDOMNESS: Field = 99;\n\n    #[test]\n    unconstrained fn no_note_hashes() {\n        let unique_note_hashes_in_tx = BoundedVec::new();\n        let packed_note = BoundedVec::new();\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash,\n            compute_note_nullifier,\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            MockNote::get_id(),\n            packed_note,\n        );\n\n        assert_eq(discovered_notes.len(), 0);\n    }\n\n    #[test]\n    unconstrained fn failed_hash_computation_is_ignored() {\n        let unique_note_hashes_in_tx = BoundedVec::from_array([random()]);\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            |_, _, _, _, _, _| Option::none(),\n            compute_note_nullifier,\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            MockNote::get_id(),\n            BoundedVec::new(),\n        );\n\n        assert_eq(discovered_notes.len(), 0);\n    }\n\n    #[test]\n    unconstrained fn failed_nullifier_computation_is_ignored() {\n        let note_index_in_tx = 2;\n        let note_and_data = construct_note(VALUE, note_index_in_tx);\n\n        let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n            random(), random(), random(), random(), random(), random(), random(),\n        ]);\n        unique_note_hashes_in_tx.set(note_index_in_tx, note_and_data.unique_note_hash);\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash,\n            |_, _, _, _, _, _, _| Option::none(),\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            MockNote::get_id(),\n            BoundedVec::from_array(note_and_data.note.pack()),\n        );\n\n        assert_eq(discovered_notes.len(), 0);\n    }\n\n    struct NoteAndData {\n        note: MockNote,\n        note_nonce: Field,\n        note_hash: Field,\n        unique_note_hash: Field,\n        inner_nullifier: Field,\n    }\n\n    unconstrained fn construct_note(value: Field, note_index_in_tx: u32) -> NoteAndData {\n        let note_nonce = compute_note_hash_nonce(FIRST_NULLIFIER_IN_TX, note_index_in_tx);\n\n        let hinted_note = MockNote::new(value)\n            .contract_address(CONTRACT_ADDRESS)\n            .owner(OWNER)\n            .randomness(RANDOMNESS)\n            .storage_slot(STORAGE_SLOT)\n            .note_metadata(SettledNoteMetadata::new(note_nonce).into())\n            .build_hinted_note();\n        let note = hinted_note.note;\n\n        let note_hash = note.compute_note_hash(OWNER, STORAGE_SLOT, RANDOMNESS);\n        let unique_note_hash = compute_unique_note_hash(\n            note_nonce,\n            compute_siloed_note_hash(CONTRACT_ADDRESS, note_hash),\n        );\n        let inner_nullifier = note\n            .compute_nullifier_unconstrained(OWNER, compute_note_hash_for_nullification(hinted_note))\n            .expect(f\"Could not compute nullifier for note owned by {OWNER}\");\n\n        NoteAndData { note, note_nonce, note_hash, unique_note_hash, inner_nullifier }\n    }\n\n    #[test]\n    unconstrained fn single_note() {\n        let note_index_in_tx = 2;\n        let note_and_data = construct_note(VALUE, note_index_in_tx);\n\n        let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n            random(), random(), random(), random(), random(), random(), random(),\n        ]);\n        unique_note_hashes_in_tx.set(note_index_in_tx, note_and_data.unique_note_hash);\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash,\n            compute_note_nullifier,\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            MockNote::get_id(),\n            BoundedVec::from_array(note_and_data.note.pack()),\n        );\n\n        assert_eq(discovered_notes.len(), 1);\n        let discovered_note = discovered_notes.get(0);\n\n        assert_eq(discovered_note.note_nonce, note_and_data.note_nonce);\n        assert_eq(discovered_note.note_hash, note_and_data.note_hash);\n        assert_eq(discovered_note.inner_nullifier, note_and_data.inner_nullifier);\n    }\n\n    #[test]\n    unconstrained fn multiple_notes_same_preimage() {\n        let first_note_index_in_tx = 3;\n        let first_note_and_data = construct_note(VALUE, first_note_index_in_tx);\n\n        let second_note_index_in_tx = 5;\n        let second_note_and_data = construct_note(VALUE, second_note_index_in_tx);\n\n        // Both notes have the same preimage (and therefore packed representation), so both should be found in the same\n        // call.\n        assert_eq(first_note_and_data.note, second_note_and_data.note);\n        let packed_note = first_note_and_data.note.pack();\n\n        let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n            random(), random(), random(), random(), random(), random(), random(),\n        ]);\n        unique_note_hashes_in_tx.set(first_note_index_in_tx, first_note_and_data.unique_note_hash);\n        unique_note_hashes_in_tx.set(second_note_index_in_tx, second_note_and_data.unique_note_hash);\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash,\n            compute_note_nullifier,\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            MockNote::get_id(),\n            BoundedVec::from_array(packed_note),\n        );\n\n        assert_eq(discovered_notes.len(), 2);\n\n        assert(discovered_notes.any(|discovered_note| {\n            (discovered_note.note_nonce == first_note_and_data.note_nonce)\n                & (discovered_note.note_hash == first_note_and_data.note_hash)\n                & (discovered_note.inner_nullifier == first_note_and_data.inner_nullifier)\n        }));\n\n        assert(discovered_notes.any(|discovered_note| {\n            (discovered_note.note_nonce == second_note_and_data.note_nonce)\n                & (discovered_note.note_hash == second_note_and_data.note_hash)\n                & (discovered_note.inner_nullifier == second_note_and_data.inner_nullifier)\n        }));\n    }\n\n    #[test]\n    unconstrained fn single_note_misaligned_nonce() {\n        let note_index_in_tx = 2;\n        let note_and_data = construct_note(VALUE, note_index_in_tx);\n\n        let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n            random(), random(), random(), random(), random(), random(), random(),\n        ]);\n\n        // The note is not at the correct index\n        unique_note_hashes_in_tx.set(note_index_in_tx + 1, note_and_data.unique_note_hash);\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash,\n            compute_note_nullifier,\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            MockNote::get_id(),\n            BoundedVec::from_array(note_and_data.note.pack()),\n        );\n\n        assert_eq(discovered_notes.len(), 1);\n        let discovered_note = discovered_notes.get(0);\n\n        assert_eq(discovered_note.note_nonce, note_and_data.note_nonce);\n        assert_eq(discovered_note.note_hash, note_and_data.note_hash);\n        assert_eq(discovered_note.inner_nullifier, note_and_data.inner_nullifier);\n    }\n\n    #[test]\n    unconstrained fn single_note_nonce_with_index_past_note_hashes_in_tx() {\n        let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n            random(), random(), random(), random(), random(), random(), random(),\n        ]);\n\n        // The nonce is computed with an index that does not exist in the tx\n        let note_index_in_tx = unique_note_hashes_in_tx.len() + 5;\n        let note_and_data = construct_note(VALUE, note_index_in_tx);\n\n        // The note is inserted at an arbitrary index - its true index is out of the array's bounds\n        unique_note_hashes_in_tx.set(2, note_and_data.unique_note_hash);\n\n        let discovered_notes = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash,\n            compute_note_nullifier,\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            MockNote::get_id(),\n            BoundedVec::from_array(note_and_data.note.pack()),\n        );\n\n        assert_eq(discovered_notes.len(), 1);\n        let discovered_note = discovered_notes.get(0);\n\n        assert_eq(discovered_note.note_nonce, note_and_data.note_nonce);\n        assert_eq(discovered_note.note_hash, note_and_data.note_hash);\n        assert_eq(discovered_note.inner_nullifier, note_and_data.inner_nullifier);\n    }\n\n    #[test(should_fail_with = \"identical note hashes for a transaction\")]\n    unconstrained fn duplicate_unique_note_hashes() {\n        let note_index_in_tx = 2;\n        let note_and_data = construct_note(VALUE, note_index_in_tx);\n\n        let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n            random(), random(), random(), random(), random(), random(), random(),\n        ]);\n\n        // The same unique note hash is present in two indices in the array, which is not allowed. Note that we don't\n        // test all note hashes for uniqueness, only those that we actually find.\n        unique_note_hashes_in_tx.set(note_index_in_tx, note_and_data.unique_note_hash);\n        unique_note_hashes_in_tx.set(note_index_in_tx + 1, note_and_data.unique_note_hash);\n\n        let _ = attempt_note_nonce_discovery(\n            unique_note_hashes_in_tx,\n            FIRST_NULLIFIER_IN_TX,\n            compute_note_hash,\n            compute_note_nullifier,\n            CONTRACT_ADDRESS,\n            OWNER,\n            STORAGE_SLOT,\n            RANDOMNESS,\n            MockNote::get_id(),\n            BoundedVec::from_array(note_and_data.note.pack()),\n        );\n    }\n}\n"
     },
-    "129": {
+    "127": {
       "function_locations": [
         {
           "name": "process_partial_note_private_msg",
@@ -3243,7 +3191,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/partial_notes.nr",
       "source": "use crate::{\n    capsules::CapsuleArray,\n    messages::{\n        discovery::{ComputeNoteHash, ComputeNoteNullifier, nonce_discovery::attempt_note_nonce_discovery},\n        encoding::MAX_MESSAGE_CONTENT_LEN,\n        logs::partial_note::{decode_partial_note_private_message, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN},\n        processing::{\n            enqueue_note_for_validation,\n            get_pending_partial_notes_completion_logs,\n            log_retrieval_response::{LogRetrievalResponse, MAX_LOG_CONTENT_LEN},\n        },\n    },\n    utils::array,\n};\n\nuse crate::logging::{aztecnr_debug_log_format, aztecnr_warn_log_format};\nuse crate::protocol::{address::AztecAddress, hash::sha256_to_field, traits::{Deserialize, Serialize}};\n\n/// The slot in the PXE capsules where we store a `CapsuleArray` of `DeliveredPendingPartialNote`.\npub(crate) global DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT: Field = sha256_to_field(\n    \"AZTEC_NR::DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT\".as_bytes(),\n);\n\n/// A partial note that was delivered but is still pending completion. Contains the information necessary to find the\n/// log that will complete it and lead to a note being discovered and delivered.\n#[derive(Serialize, Deserialize)]\npub(crate) struct DeliveredPendingPartialNote {\n    pub(crate) owner: AztecAddress,\n    pub(crate) randomness: Field,\n    pub(crate) note_completion_log_tag: Field,\n    pub(crate) note_type_id: Field,\n    pub(crate) packed_private_note_content: BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>,\n}\n\npub(crate) unconstrained fn process_partial_note_private_msg(\n    contract_address: AztecAddress,\n    msg_metadata: u64,\n    msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n    tx_hash: Field,\n    scope: AztecAddress,\n) {\n    let decoded = decode_partial_note_private_message(msg_metadata, msg_content);\n\n    if decoded.is_some() {\n        // We store the information of the partial note we found in a persistent capsule in PXE, so that we can later\n        // search for the public log that will complete it.\n        let (owner, randomness, note_completion_log_tag, note_type_id, packed_private_note_content) = decoded.unwrap();\n\n        let pending = DeliveredPendingPartialNote {\n            owner,\n            randomness,\n            note_completion_log_tag,\n            note_type_id,\n            packed_private_note_content,\n        };\n\n        CapsuleArray::at(\n            contract_address,\n            DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n            scope,\n        )\n            .push(pending);\n    } else {\n        aztecnr_warn_log_format!(\n            \"Could not decode partial note private message from tx {0}, ignoring\",\n        )(\n            [tx_hash],\n        );\n    }\n}\n\n/// Searches for logs that would result in the completion of pending partial notes, ultimately resulting in the notes\n/// being delivered to PXE if completed.\npub(crate) unconstrained fn fetch_and_process_partial_note_completion_logs(\n    contract_address: AztecAddress,\n    compute_note_hash: ComputeNoteHash,\n    compute_note_nullifier: ComputeNoteNullifier,\n    scope: AztecAddress,\n) {\n    let pending_partial_notes = CapsuleArray::at(\n        contract_address,\n        DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n        scope,\n    );\n\n    aztecnr_debug_log_format!(\"{} pending partial notes\")([pending_partial_notes.len() as Field]);\n\n    // Each of the pending partial notes might get completed by a log containing its public values. For performance\n    // reasons, we fetch all of these logs concurrently and then process them one by one, minimizing the amount of time\n    // waiting for the node roundtrip.\n    let maybe_completion_logs =\n        get_pending_partial_notes_completion_logs(contract_address, pending_partial_notes, scope);\n\n    // Each entry in the maybe completion logs array corresponds to the entry in the pending partial notes array at the\n    // same index. This means we can use the same index as we iterate through the responses to get both the partial\n    // note and the log that might complete it.\n    assert_eq(maybe_completion_logs.len(), pending_partial_notes.len());\n\n    maybe_completion_logs.for_each(|i, maybe_log: Option<LogRetrievalResponse>| {\n        // We clear the completion logs as we read them so that the array is empty by the time we next query it.\n        // TODO(#14943): use volatile arrays to avoid having to manually clear this.\n        maybe_completion_logs.remove(i);\n\n        let pending_partial_note = pending_partial_notes.get(i);\n\n        if maybe_log.is_none() {\n            aztecnr_debug_log_format!(\"Found no completion logs for partial note with tag {}\")(\n                [pending_partial_note.note_completion_log_tag],\n            );\n\n            // Note that we're not removing the pending partial note from the capsule array, so we will continue\n            // searching for this tagged log when performing message discovery in the future until we either find it or\n            // the entry is somehow removed from the array.\n        } else {\n            aztecnr_debug_log_format!(\"Completion log found for partial note with tag {}\")([\n                pending_partial_note.note_completion_log_tag,\n            ]);\n            let log = maybe_log.unwrap();\n\n            // The first field in the completion log payload is the storage slot, followed by the public note\n            // content fields.\n            let storage_slot = log.log_payload.get(0);\n            let public_note_content: BoundedVec<Field, MAX_LOG_CONTENT_LEN - 1> = array::subbvec(log.log_payload, 1);\n\n            // Public fields are assumed to all be placed at the end of the packed representation, so we combine\n            // the private and public packed fields (i.e. the contents of the private message and public log\n            // plaintext) to get the complete packed content.\n            let complete_packed_note = array::append(\n                pending_partial_note.packed_private_note_content,\n                public_note_content,\n            );\n\n            let discovered_notes = attempt_note_nonce_discovery(\n                log.unique_note_hashes_in_tx,\n                log.first_nullifier_in_tx,\n                compute_note_hash,\n                compute_note_nullifier,\n                contract_address,\n                pending_partial_note.owner,\n                storage_slot,\n                pending_partial_note.randomness,\n                pending_partial_note.note_type_id,\n                complete_packed_note,\n            );\n\n            // TODO(#11627): is there anything reasonable we can do if we get a log but it doesn't result in a note\n            // being found?\n            if discovered_notes.len() == 0 {\n                panic(\n                    f\"A partial note's completion log did not result in any notes being found - this should never happen\",\n                );\n            }\n\n            aztecnr_debug_log_format!(\"Discovered {0} notes for partial note with tag {1}\")([\n                discovered_notes.len() as Field,\n                pending_partial_note.note_completion_log_tag,\n            ]);\n\n            discovered_notes.for_each(|discovered_note| {\n                enqueue_note_for_validation(\n                    contract_address,\n                    pending_partial_note.owner,\n                    storage_slot,\n                    pending_partial_note.randomness,\n                    discovered_note.note_nonce,\n                    complete_packed_note,\n                    discovered_note.note_hash,\n                    discovered_note.inner_nullifier,\n                    log.tx_hash,\n                    scope,\n                );\n            });\n\n            // Because there is only a single log for a given tag, once we've processed the tagged log then we simply\n            // delete the pending work entry, regardless of whether it was actually completed or not.\n            pending_partial_notes.remove(i);\n        }\n    });\n}\n"
     },
-    "130": {
+    "128": {
       "function_locations": [
         {
           "name": "process_private_event_msg",
@@ -3253,7 +3201,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_events.nr",
       "source": "use crate::{\n    event::event_interface::compute_private_serialized_event_commitment,\n    logging::aztecnr_warn_log_format,\n    messages::{\n        encoding::MAX_MESSAGE_CONTENT_LEN, logs::event::decode_private_event_message,\n        processing::enqueue_event_for_validation,\n    },\n};\nuse crate::protocol::{address::AztecAddress, traits::ToField};\n\npub(crate) unconstrained fn process_private_event_msg(\n    contract_address: AztecAddress,\n    msg_metadata: u64,\n    msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n    tx_hash: Field,\n    recipient: AztecAddress,\n) {\n    let decoded = decode_private_event_message(msg_metadata, msg_content);\n\n    if decoded.is_some() {\n        let (event_type_id, randomness, serialized_event) = decoded.unwrap();\n\n        let event_commitment =\n            compute_private_serialized_event_commitment(serialized_event, randomness, event_type_id.to_field());\n\n        enqueue_event_for_validation(\n            contract_address,\n            event_type_id,\n            randomness,\n            serialized_event,\n            event_commitment,\n            tx_hash,\n            recipient,\n        );\n    } else {\n        aztecnr_warn_log_format!(\n            \"Could not decode private event message from tx {0}, ignoring\",\n        )(\n            [tx_hash],\n        );\n    }\n}\n"
     },
-    "131": {
+    "129": {
       "function_locations": [
         {
           "name": "process_private_note_msg",
@@ -3267,7 +3215,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_notes.nr",
       "source": "use crate::{\n    logging::{aztecnr_debug_log_format, aztecnr_warn_log_format},\n    messages::{\n        discovery::{ComputeNoteHash, ComputeNoteNullifier, nonce_discovery::attempt_note_nonce_discovery},\n        encoding::MAX_MESSAGE_CONTENT_LEN,\n        logs::note::{decode_private_note_message, MAX_NOTE_PACKED_LEN},\n        processing::enqueue_note_for_validation,\n    },\n    protocol::{address::AztecAddress, constants::MAX_NOTE_HASHES_PER_TX, traits::ToField},\n};\n\npub(crate) unconstrained fn process_private_note_msg(\n    contract_address: AztecAddress,\n    tx_hash: Field,\n    unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n    first_nullifier_in_tx: Field,\n    compute_note_hash: ComputeNoteHash,\n    compute_note_nullifier: ComputeNoteNullifier,\n    msg_metadata: u64,\n    msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n    recipient: AztecAddress,\n) {\n    let decoded = decode_private_note_message(msg_metadata, msg_content);\n\n    if decoded.is_some() {\n        let (note_type_id, owner, storage_slot, randomness, packed_note) = decoded.unwrap();\n\n        attempt_note_discovery(\n            contract_address,\n            tx_hash,\n            unique_note_hashes_in_tx,\n            first_nullifier_in_tx,\n            compute_note_hash,\n            compute_note_nullifier,\n            owner,\n            storage_slot,\n            randomness,\n            note_type_id,\n            packed_note,\n            recipient,\n        );\n    } else {\n        aztecnr_warn_log_format!(\n            \"Could not decode private note message from tx {0}, ignoring\",\n        )(\n            [tx_hash],\n        );\n    }\n}\n\n/// Attempts discovery of a note given information about its contents and the transaction in which it is suspected the\n/// note was created.\npub unconstrained fn attempt_note_discovery(\n    contract_address: AztecAddress,\n    tx_hash: Field,\n    unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n    first_nullifier_in_tx: Field,\n    compute_note_hash: ComputeNoteHash,\n    compute_note_nullifier: ComputeNoteNullifier,\n    owner: AztecAddress,\n    storage_slot: Field,\n    randomness: Field,\n    note_type_id: Field,\n    packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n    recipient: AztecAddress,\n) {\n    let discovered_notes = attempt_note_nonce_discovery(\n        unique_note_hashes_in_tx,\n        first_nullifier_in_tx,\n        compute_note_hash,\n        compute_note_nullifier,\n        contract_address,\n        owner,\n        storage_slot,\n        randomness,\n        note_type_id,\n        packed_note,\n    );\n\n    if discovered_notes.len() == 0 {\n        // A private note message that results in no discovered notes means none of the computed note hashes matched\n        // any unique note hash in the transaction. This could indicate a malformed or malicious message (e.g. a sender\n        // providing bogus note content).\n        aztecnr_warn_log_format!(\n            \"Discarding private note message from tx {0} for contract {1}: no matching note hash found in the tx\",\n        )(\n            [tx_hash, contract_address.to_field()],\n        );\n    } else {\n        aztecnr_debug_log_format!(\n            \"Discovered {0} notes from a private message for contract {1}\",\n        )(\n            [discovered_notes.len() as Field, contract_address.to_field()],\n        );\n    }\n\n    discovered_notes.for_each(|discovered_note| {\n        enqueue_note_for_validation(\n            contract_address,\n            owner,\n            storage_slot,\n            randomness,\n            discovered_note.note_nonce,\n            packed_note,\n            discovered_note.note_hash,\n            discovered_note.inner_nullifier,\n            tx_hash,\n            recipient,\n        );\n    });\n}\n"
     },
-    "132": {
+    "130": {
       "function_locations": [
         {
           "name": "process_message_ciphertext",
@@ -3281,7 +3229,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/process_message.nr",
       "source": "use crate::messages::{\n    discovery::{\n        ComputeNoteHash, ComputeNoteNullifier, CustomMessageHandler, partial_notes::process_partial_note_private_msg,\n        private_events::process_private_event_msg, private_notes::process_private_note_msg,\n    },\n    encoding::{decode_message, MESSAGE_CIPHERTEXT_LEN, MESSAGE_PLAINTEXT_LEN},\n    encryption::{aes128::AES128, message_encryption::MessageEncryption},\n    msg_type::{\n        MIN_CUSTOM_MSG_TYPE_ID, PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID, PRIVATE_EVENT_MSG_TYPE_ID, PRIVATE_NOTE_MSG_TYPE_ID,\n    },\n    processing::MessageContext,\n};\n\nuse crate::logging::{aztecnr_debug_log, aztecnr_warn_log_format};\nuse crate::protocol::address::AztecAddress;\n\n/// Processes a message that can contain notes, partial notes, or events.\n///\n/// Notes result in nonce discovery being performed prior to delivery, which requires knowledge of the transaction hash\n/// in which the notes would've been created (typically the same transaction in which the log was emitted), along with\n/// the list of unique note hashes in said transaction and the `compute_note_hash` and `compute_note_nullifier`\n/// functions. Once discovered, the notes are enqueued for validation.\n///\n/// Partial notes result in a pending partial note entry being stored in a PXE capsule, which will later be retrieved\n/// to search for the note's completion public log.\n///\n/// Events are processed by computing an event commitment from the serialized event data and its randomness field, then\n/// enqueueing the event data and commitment for validation.\npub unconstrained fn process_message_ciphertext<CustomMessageHandlerEnv>(\n    contract_address: AztecAddress,\n    compute_note_hash: ComputeNoteHash,\n    compute_note_nullifier: ComputeNoteNullifier,\n    process_custom_message: Option<CustomMessageHandler<CustomMessageHandlerEnv>>,\n    message_ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n    message_context: MessageContext,\n    recipient: AztecAddress,\n) {\n    let message_plaintext_option = AES128::decrypt(message_ciphertext, recipient, contract_address);\n\n    if message_plaintext_option.is_some() {\n        process_message_plaintext(\n            contract_address,\n            compute_note_hash,\n            compute_note_nullifier,\n            process_custom_message,\n            message_plaintext_option.unwrap(),\n            message_context,\n            recipient,\n        );\n    } else {\n        aztecnr_warn_log_format!(\"Could not decrypt message ciphertext from tx {0}, ignoring\")([message_context.tx_hash]);\n    }\n}\n\npub(crate) unconstrained fn process_message_plaintext<CustomMessageHandlerEnv>(\n    contract_address: AztecAddress,\n    compute_note_hash: ComputeNoteHash,\n    compute_note_nullifier: ComputeNoteNullifier,\n    process_custom_message: Option<CustomMessageHandler<CustomMessageHandlerEnv>>,\n    message_plaintext: BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>,\n    message_context: MessageContext,\n    recipient: AztecAddress,\n) {\n    // The first thing to do after decrypting the message is to determine what type of message we're processing. We\n    // have 3 message types: private notes, partial notes and events.\n\n    // We decode the message to obtain the message type id, metadata and content.\n    let decoded = decode_message(message_plaintext);\n\n    if decoded.is_some() {\n        let (msg_type_id, msg_metadata, msg_content) = decoded.unwrap();\n\n        if msg_type_id == PRIVATE_NOTE_MSG_TYPE_ID {\n            aztecnr_debug_log!(\"Processing private note msg\");\n\n            process_private_note_msg(\n                contract_address,\n                message_context.tx_hash,\n                message_context.unique_note_hashes_in_tx,\n                message_context.first_nullifier_in_tx,\n                compute_note_hash,\n                compute_note_nullifier,\n                msg_metadata,\n                msg_content,\n                recipient,\n            );\n        } else if msg_type_id == PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID {\n            aztecnr_debug_log!(\"Processing partial note private msg\");\n\n            process_partial_note_private_msg(\n                contract_address,\n                msg_metadata,\n                msg_content,\n                message_context.tx_hash,\n                recipient,\n            );\n        } else if msg_type_id == PRIVATE_EVENT_MSG_TYPE_ID {\n            aztecnr_debug_log!(\"Processing private event msg\");\n\n            process_private_event_msg(\n                contract_address,\n                msg_metadata,\n                msg_content,\n                message_context.tx_hash,\n                recipient,\n            );\n        } else if msg_type_id < MIN_CUSTOM_MSG_TYPE_ID {\n            // The message type ID falls in the range reserved for aztec.nr built-in types but wasn't matched above.\n            // This most likely means the message is malformed or a custom message was incorrectly assigned a reserved\n            // ID. Custom message types must use IDs allocated via `custom_msg_type_id`.\n            aztecnr_warn_log_format!(\n                \"Message type ID {0} is in the reserved range but is not recognized, ignoring. See https://docs.aztec.network/errors/3\",\n            )(\n                [msg_type_id as Field],\n            );\n        } else if process_custom_message.is_some() {\n            process_custom_message.unwrap()(\n                contract_address,\n                msg_type_id,\n                msg_metadata,\n                msg_content,\n                message_context,\n                recipient,\n            );\n        } else {\n            // A custom message was received but no handler is configured. This likely means the contract emits custom\n            // messages but forgot to register a handler via `AztecConfig::custom_message_handler`.\n            aztecnr_warn_log_format!(\n                \"Received custom message with type id {0} but no handler is configured, ignoring. See https://docs.aztec.network/errors/2\",\n            )(\n                [msg_type_id as Field],\n            );\n        }\n    } else {\n        aztecnr_warn_log_format!(\"Could not decode message plaintext from tx {0}, ignoring\")([message_context.tx_hash]);\n    }\n}\n"
     },
-    "133": {
+    "131": {
       "function_locations": [
         {
           "name": "encode_message",
@@ -3343,7 +3291,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encoding.nr",
       "source": "// TODO(#12750): don't make these values assume we're using AES.\nuse crate::protocol::constants::PRIVATE_LOG_CIPHERTEXT_LEN;\nuse crate::utils::array;\n\n// We reassign to the constant here to communicate the distinction between a log and a message. In Aztec.nr, unlike in\n// protocol circuits, we have a concept of a message that can be emitted either as a private log or as an offchain\n// message. Message is a piece of data that is to be eventually delivered to a contract via the `process_message(...)`\n// utility function function that is injected by the #[aztec] macro. Note: PRIVATE_LOG_CIPHERTEXT_LEN is an amount of\n// fields, so MESSAGE_CIPHERTEXT_LEN is the size of the message in fields.\npub global MESSAGE_CIPHERTEXT_LEN: u32 = PRIVATE_LOG_CIPHERTEXT_LEN;\n\n// TODO(#12750): The global variables below should not be here as they are AES128 specific.\n// The header plaintext is 2 bytes (ciphertext length), padded to the 16-byte AES block size by PKCS#7.\npub(crate) global HEADER_CIPHERTEXT_SIZE_IN_BYTES: u32 = 16;\n// AES PKCS#7 always adds at least one byte of padding. Since each plaintext field is 32 bytes (a multiple of the\n// 16-byte AES block size), a full 16-byte padding block is always appended.\npub(crate) global AES128_PKCS7_EXPANSION_IN_BYTES: u32 = 16;\n\npub global EPH_PK_X_SIZE_IN_FIELDS: u32 = 1;\n\n// (15 - 1) * 31 - 16 - 16 = 402. Note: We multiply by 31 because ciphertext bytes are stored in fields using\n// bytes_to_fields, which packs 31 bytes per field (since a Field is ~254 bits and can safely store 31 whole bytes).\npub(crate) global MESSAGE_PLAINTEXT_SIZE_IN_BYTES: u32 = (MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31\n    - HEADER_CIPHERTEXT_SIZE_IN_BYTES\n    - AES128_PKCS7_EXPANSION_IN_BYTES;\n// The plaintext bytes represent Field values that were originally serialized using fields_to_bytes, which converts\n// each Field to 32 bytes. To convert the plaintext bytes back to fields, we divide by 32. 402 / 32 = 12\npub global MESSAGE_PLAINTEXT_LEN: u32 = MESSAGE_PLAINTEXT_SIZE_IN_BYTES / 32;\n\npub global MESSAGE_EXPANDED_METADATA_LEN: u32 = 1;\n\n// The standard message layout is composed of:\n//  - an initial field called the 'expanded metadata'\n//  - an arbitrary number of fields following that called the 'message content'\n//\n// ```\n// message: [ msg_expanded_metadata, ...msg_content ]\n// ```\n//\n// The expanded metadata itself is interpreted as a u128, of which:\n//  - the upper 64 bits are the message type id\n//  - the lower 64 bits are called the 'message metadata'\n//\n// ```\n// msg_expanded_metadata: [  msg_type_id    |  msg_metadata  ]\n//                        <---  64 bits --->|<--- 64 bits --->\n// ```\n//\n// The meaning of the message metadata and message content depend on the value of the message type id. Note that there\n// is nothing special about the message metadata, it _can_ be considered part of the content. It just has a different\n// name to make it distinct from the message content given that it is not a full field.\n\n/// The maximum length of a message's content, i.e. not including the expanded message metadata.\npub global MAX_MESSAGE_CONTENT_LEN: u32 = MESSAGE_PLAINTEXT_LEN - MESSAGE_EXPANDED_METADATA_LEN;\n\n/// Encodes a message following aztec-nr's standard message encoding. This message can later be decoded with\n/// `decode_message` to retrieve the original values.\n///\n/// - The `msg_type` is an identifier that groups types of messages that are all processed the same way, e.g. private\n/// notes or events. Possible values are defined in `aztec::messages::msg_type`.\n/// - The `msg_metadata` and `msg_content` are the values stored in the message, whose meaning depends on the\n/// `msg_type`. The only special thing about `msg_metadata` that separates it from `msg_content` is that it is a u64\n/// instead of a full Field (due to details of how messages are encoded), allowing applications that can fit values\n/// into this smaller variable to achieve higher data efficiency.\npub fn encode_message<let N: u32>(\n    msg_type: u64,\n    msg_metadata: u64,\n    msg_content: [Field; N],\n) -> [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] {\n    std::static_assert(\n        msg_content.len() <= MAX_MESSAGE_CONTENT_LEN,\n        \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\",\n    );\n\n    // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring of the\n    // message encoding below must be updated as well.\n    std::static_assert(\n        MESSAGE_EXPANDED_METADATA_LEN == 1,\n        \"unexpected value for MESSAGE_EXPANDED_METADATA_LEN\",\n    );\n    let mut message: [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] = std::mem::zeroed();\n\n    message[0] = to_expanded_metadata(msg_type, msg_metadata);\n    for i in 0..msg_content.len() {\n        message[MESSAGE_EXPANDED_METADATA_LEN + i] = msg_content[i];\n    }\n\n    message\n}\n\n/// Decodes a standard aztec-nr message, i.e. one created via `encode_message`, returning the original encoded values.\n///\n/// Returns `None` if the message is empty or has invalid (>128 bit) expanded metadata.\n///\n/// Note that `encode_message` returns a fixed size array while this function takes a `BoundedVec`: this is because\n/// prior to decoding the message type is unknown, and consequentially not known at compile time. If working with\n/// fixed-size messages, consider using `BoundedVec::from_array` to convert them.\npub unconstrained fn decode_message(\n    message: BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>,\n) -> Option<(u64, u64, BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>)> {\n    Option::some(message)\n        .and_then(|message| {\n            // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring\n            // of the\n            // message encoding below must be updated as well.\n            std::static_assert(\n                MESSAGE_EXPANDED_METADATA_LEN == 1,\n                \"unexpected value for MESSAGE_EXPANDED_METADATA_LEN\",\n            );\n            if message.len() < MESSAGE_EXPANDED_METADATA_LEN {\n                Option::none()\n            } else {\n                Option::some(message.get(0))\n            }\n        })\n        .and_then(|msg_expanded_metadata| from_expanded_metadata(msg_expanded_metadata))\n        .map(|(msg_type_id, msg_metadata)| {\n            let msg_content = array::subbvec(message, MESSAGE_EXPANDED_METADATA_LEN);\n            (msg_type_id, msg_metadata, msg_content)\n        })\n}\n\nglobal U64_SHIFT_MULTIPLIER: Field = 2.pow_32(64);\n\nfn to_expanded_metadata(msg_type: u64, msg_metadata: u64) -> Field {\n    // We use multiplication instead of bit shifting operations to shift the type bits as bit shift operations are\n    // expensive in circuits.\n    let type_field: Field = (msg_type as Field) * U64_SHIFT_MULTIPLIER;\n    let msg_metadata_field = msg_metadata as Field;\n\n    type_field + msg_metadata_field\n}\n\nglobal TWO_POW_128: Field = 2.pow_32(128);\n\n/// Unpacks expanded metadata into (msg_type, msg_metadata). Returns `None` if `input >= 2^128`.\nfn from_expanded_metadata(input: Field) -> Option<(u64, u64)> {\n    if input.lt(TWO_POW_128) {\n        let msg_metadata = (input as u64);\n        let msg_type = ((input - (msg_metadata as Field)) / U64_SHIFT_MULTIPLIER) as u64;\n        // Use division instead of bit shift since bit shifts are expensive in circuits\n        Option::some((msg_type, msg_metadata))\n    } else {\n        Option::none()\n    }\n}\n\nmod tests {\n    use crate::utils::array::subarray::subarray;\n    use super::{\n        decode_message, encode_message, from_expanded_metadata, MAX_MESSAGE_CONTENT_LEN, to_expanded_metadata,\n        TWO_POW_128,\n    };\n\n    global U64_MAX: u64 = (2.pow_32(64) - 1) as u64;\n    global U128_MAX: Field = (2.pow_32(128) - 1);\n\n    #[test]\n    unconstrained fn encode_decode_empty_message(msg_type: u64, msg_metadata: u64) {\n        let encoded = encode_message(msg_type, msg_metadata, []);\n        let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n            decode_message(BoundedVec::from_array(encoded)).unwrap();\n\n        assert_eq(decoded_msg_type, msg_type);\n        assert_eq(decoded_msg_metadata, msg_metadata);\n        assert_eq(decoded_msg_content.len(), 0);\n    }\n\n    #[test]\n    unconstrained fn encode_decode_short_message(\n        msg_type: u64,\n        msg_metadata: u64,\n        msg_content: [Field; MAX_MESSAGE_CONTENT_LEN / 2],\n    ) {\n        let encoded = encode_message(msg_type, msg_metadata, msg_content);\n        let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n            decode_message(BoundedVec::from_array(encoded)).unwrap();\n\n        assert_eq(decoded_msg_type, msg_type);\n        assert_eq(decoded_msg_metadata, msg_metadata);\n        assert_eq(decoded_msg_content.len(), msg_content.len());\n        assert_eq(subarray(decoded_msg_content.storage(), 0), msg_content);\n    }\n\n    #[test]\n    unconstrained fn encode_decode_full_message(\n        msg_type: u64,\n        msg_metadata: u64,\n        msg_content: [Field; MAX_MESSAGE_CONTENT_LEN],\n    ) {\n        let encoded = encode_message(msg_type, msg_metadata, msg_content);\n        let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n            decode_message(BoundedVec::from_array(encoded)).unwrap();\n\n        assert_eq(decoded_msg_type, msg_type);\n        assert_eq(decoded_msg_metadata, msg_metadata);\n        assert_eq(decoded_msg_content.len(), msg_content.len());\n        assert_eq(subarray(decoded_msg_content.storage(), 0), msg_content);\n    }\n\n    #[test]\n    unconstrained fn to_expanded_metadata_packing() {\n        // Test case 1: All bits set\n        let packed = to_expanded_metadata(U64_MAX, U64_MAX);\n        let (msg_type, msg_metadata) = from_expanded_metadata(packed).unwrap();\n        assert_eq(msg_type, U64_MAX);\n        assert_eq(msg_metadata, U64_MAX);\n\n        // Test case 2: Only log type bits set\n        let packed = to_expanded_metadata(U64_MAX, 0);\n        let (msg_type, msg_metadata) = from_expanded_metadata(packed).unwrap();\n        assert_eq(msg_type, U64_MAX);\n        assert_eq(msg_metadata, 0);\n\n        // Test case 3: Only msg_metadata bits set\n        let packed = to_expanded_metadata(0, U64_MAX);\n        let (msg_type, msg_metadata) = from_expanded_metadata(packed).unwrap();\n        assert_eq(msg_type, 0);\n        assert_eq(msg_metadata, U64_MAX);\n\n        // Test case 4: No bits set\n        let packed = to_expanded_metadata(0, 0);\n        let (msg_type, msg_metadata) = from_expanded_metadata(packed).unwrap();\n        assert_eq(msg_type, 0);\n        assert_eq(msg_metadata, 0);\n    }\n\n    #[test]\n    unconstrained fn from_expanded_metadata_packing() {\n        // Test case 1: All bits set\n        let input = U128_MAX as Field;\n        let (msg_type, msg_metadata) = from_expanded_metadata(input).unwrap();\n        assert_eq(msg_type, U64_MAX);\n        assert_eq(msg_metadata, U64_MAX);\n\n        // Test case 2: Only log type bits set\n        let input = (U128_MAX - U64_MAX as Field);\n        let (msg_type, msg_metadata) = from_expanded_metadata(input).unwrap();\n        assert_eq(msg_type, U64_MAX);\n        assert_eq(msg_metadata, 0);\n\n        // Test case 3: Only msg_metadata bits set\n        let input = U64_MAX as Field;\n        let (msg_type, msg_metadata) = from_expanded_metadata(input).unwrap();\n        assert_eq(msg_type, 0);\n        assert_eq(msg_metadata, U64_MAX);\n\n        // Test case 4: No bits set\n        let input = 0;\n        let (msg_type, msg_metadata) = from_expanded_metadata(input).unwrap();\n        assert_eq(msg_type, 0);\n        assert_eq(msg_metadata, 0);\n    }\n\n    #[test]\n    unconstrained fn to_from_expanded_metadata(original_msg_type: u64, original_msg_metadata: u64) {\n        let packed = to_expanded_metadata(original_msg_type, original_msg_metadata);\n        let (unpacked_msg_type, unpacked_msg_metadata) = from_expanded_metadata(packed).unwrap();\n\n        assert_eq(original_msg_type, unpacked_msg_type);\n        assert_eq(original_msg_metadata, unpacked_msg_metadata);\n    }\n\n    #[test]\n    unconstrained fn encode_decode_max_size_message() {\n        let msg_type_id: u64 = 42;\n        let msg_metadata: u64 = 99;\n        let mut msg_content = [0; MAX_MESSAGE_CONTENT_LEN];\n        for i in 0..MAX_MESSAGE_CONTENT_LEN {\n            msg_content[i] = i as Field;\n        }\n\n        let encoded = encode_message(msg_type_id, msg_metadata, msg_content);\n        let (decoded_type_id, decoded_metadata, decoded_content) =\n            decode_message(BoundedVec::from_array(encoded)).unwrap();\n\n        assert_eq(decoded_type_id, msg_type_id);\n        assert_eq(decoded_metadata, msg_metadata);\n        assert_eq(decoded_content, BoundedVec::from_array(msg_content));\n    }\n\n    #[test(should_fail_with = \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\")]\n    fn encode_oversized_message_fails() {\n        let msg_content = [0; MAX_MESSAGE_CONTENT_LEN + 1];\n        let _ = encode_message(0, 0, msg_content);\n    }\n\n    #[test]\n    unconstrained fn decode_empty_message_returns_none() {\n        assert(decode_message(BoundedVec::new()).is_none());\n    }\n\n    #[test]\n    unconstrained fn decode_message_with_oversized_metadata_returns_none() {\n        let message = BoundedVec::from_array([TWO_POW_128]);\n        assert(decode_message(message).is_none());\n    }\n}\n"
     },
-    "134": {
+    "132": {
       "function_locations": [
         {
           "name": "extract_many_close_to_uniformly_random_256_bits_using_poseidon2",
@@ -3429,7 +3377,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encryption/aes128.nr",
       "source": "use crate::protocol::{address::AztecAddress, public_keys::AddressPoint, traits::ToField};\n\nuse crate::{\n    keys::{\n        ecdh_shared_secret::{\n            compute_app_siloed_shared_secret, derive_ecdh_shared_secret, derive_shared_secret_field_mask,\n            derive_shared_secret_subkey,\n        },\n        ephemeral::generate_positive_ephemeral_key_pair,\n    },\n    logging::aztecnr_warn_log_format,\n    messages::{\n        encoding::{\n            EPH_PK_X_SIZE_IN_FIELDS, HEADER_CIPHERTEXT_SIZE_IN_BYTES, MESSAGE_CIPHERTEXT_LEN, MESSAGE_PLAINTEXT_LEN,\n            MESSAGE_PLAINTEXT_SIZE_IN_BYTES,\n        },\n        encryption::message_encryption::MessageEncryption,\n        logs::arithmetic_generics_utils::{\n            get_arr_of_size__message_bytes__from_PT, get_arr_of_size__message_bytes_padding__from_PT,\n        },\n    },\n    oracle::{aes128_decrypt::try_aes128_decrypt, random::random, shared_secret::get_shared_secret},\n    utils::{\n        array,\n        conversion::{\n            bytes_to_fields::{bytes_from_fields, bytes_to_fields},\n            fields_to_bytes::{fields_to_bytes, try_fields_from_bytes},\n        },\n        point::point_from_x_coord_and_sign,\n    },\n};\n\nuse std::aes128::aes128_encrypt;\n\n/// Computes N close-to-uniformly-random 256 bits from a given app-siloed shared secret.\n///\n/// NEVER re-use the same iv and sym_key. DO NOT call this function more than once with the same s_app.\n///\n/// This function is only known to be safe if s_app is derived from combining a random ephemeral key with an\n/// address point and a contract address. See big comment within the body of the function.\nfn extract_many_close_to_uniformly_random_256_bits_using_poseidon2<let N: u32>(s_app: Field) -> [[u8; 32]; N] {\n    /*\n     * Unsafe because of https://eprint.iacr.org/2010/264.pdf Page 13, Lemma 2 (and the two paragraphs below it).\n    *\n    * If you call this function, you need to be careful and aware of how the arg `s_app` has been derived.\n    *\n    * The paper says that the way you derive aes keys and IVs should be fine with poseidon2 (modelled as a RO),\n    * as long as you _don't_ use Poseidon2 as a PRG to generate the two exponents x & y which multiply to the\n    * shared secret S:\n    *\n    * S = [x*y]*G.\n    *\n    * (Otherwise, you would have to \"key\" poseidon2, i.e. generate a uniformly string K which can be public and\n    * compute Hash(x) as poseidon(K,x)).\n    * In that lemma, k would be 2*254=508, and m would be the number of points on the grumpkin curve (which is\n    * close to r according to the Hasse bound).\n    *\n    * Our shared secret S is [esk * address_sk] * G, and the question is: Can we compute hash(S) using poseidon2\n    * instead of sha256?\n    *\n    * Well, esk is random and not generated with poseidon2, so that's good.\n    * What about address_sk?\n    * Well, address_sk = poseidon2(stuff) + ivsk, so there was some discussion about whether address_sk is\n    * independent of poseidon2. Given that ivsk is random and independent of poseidon2, the address_sk is also\n    * independent of poseidon2.\n    *\n    * Tl;dr: we believe it's safe to hash S = [esk * address_sk] * G using poseidon2, in order to derive a\n    * symmetric key.\n    *\n    * If you're calling this function for a differently-derived `s_app`, be careful.\n    */\n    \n\n    /* The output of this function needs to be 32 random bytes.\n     * A single field won't give us 32 bytes of entropy. So we compute two \"random\" fields, by poseidon-hashing\n    * with two different indices. We then extract the last 16 (big endian) bytes of each \"random\" field.\n    * Note: we use to_be_bytes because it's slightly more efficient. But we have to be careful not to take bytes\n    * from the \"big end\", because the \"big\" byte is not uniformly random over the byte: it only has < 6 bits of\n    * randomness, because it's the big end of a 254-bit field element.\n    */\n\n    let mut all_bytes: [[u8; 32]; N] = std::mem::zeroed();\n    std::static_assert(N < 256, \"N too large\");\n    for k in 0..N {\n        let rand1: Field = derive_shared_secret_subkey(s_app, 2 * k);\n        let rand2: Field = derive_shared_secret_subkey(s_app, 2 * k + 1);\n\n        let rand1_bytes: [u8; 32] = rand1.to_be_bytes();\n        let rand2_bytes: [u8; 32] = rand2.to_be_bytes();\n\n        let mut bytes: [u8; 32] = [0; 32];\n        for i in 0..16 {\n            // We take bytes from the \"little end\" of the be-bytes arrays:\n            let j = 32 - i - 1;\n            bytes[i] = rand1_bytes[j];\n            bytes[16 + i] = rand2_bytes[j];\n        }\n\n        all_bytes[k] = bytes;\n    }\n\n    all_bytes\n}\n\nfn derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits<let N: u32>(\n    many_random_256_bits: [[u8; 32]; N],\n) -> [([u8; 16], [u8; 16]); N] {\n    // Many (sym_key, iv) pairs:\n    let mut many_pairs: [([u8; 16], [u8; 16]); N] = std::mem::zeroed();\n    for k in 0..N {\n        let random_256_bits = many_random_256_bits[k];\n        let mut sym_key = [0; 16];\n        let mut iv = [0; 16];\n        for i in 0..16 {\n            sym_key[i] = random_256_bits[i];\n            iv[i] = random_256_bits[i + 16];\n        }\n        many_pairs[k] = (sym_key, iv);\n    }\n\n    many_pairs\n}\n\npub fn derive_aes_symmetric_key_and_iv_from_shared_secret<let N: u32>(s_app: Field) -> [([u8; 16], [u8; 16]); N] {\n    let many_random_256_bits: [[u8; 32]; N] = extract_many_close_to_uniformly_random_256_bits_using_poseidon2(s_app);\n\n    derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits(many_random_256_bits)\n}\n\npub struct AES128 {}\n\nimpl MessageEncryption for AES128 {\n\n    /// AES128-CBC encryption for Aztec protocol messages.\n    ///\n    /// ## Overview\n    ///\n    /// The plaintext is an array of up to `MESSAGE_PLAINTEXT_LEN` (12) fields. The output is always exactly\n    /// `MESSAGE_CIPHERTEXT_LEN` (15) fields, regardless of plaintext size. All output fields except the\n    /// ephemeral public key are uniformly random `Field` values to any observer without knowledge of the\n    /// shared secret, making all encrypted messages indistinguishable by size or content.\n    ///\n    /// ## PKCS#7 Padding\n    ///\n    /// AES operates on 16-byte blocks, so the plaintext must be padded to a multiple of 16. PKCS#7 padding always\n    /// adds at least 1 byte (so the receiver can always detect and strip it), which means:\n    /// - 1 B plaintext  -> 15 B padding -> 16 B total\n    /// - 15 B plaintext ->  1 B padding -> 16 B total\n    /// - 16 B plaintext -> 16 B padding -> 32 B total (full extra block)\n    ///\n    /// In general: if the plaintext is already a multiple of 16, a full 16-byte padding block is appended.\n    ///\n    /// ## Encryption Steps\n    ///\n    /// **1. Body encryption.** The plaintext fields are serialized to bytes (32 bytes per field) and AES-128-CBC\n    /// encrypted. Since 32 is a multiple of 16, PKCS#7 always adds a full 16-byte padding block (see above):\n    ///\n    /// ```text\n    /// +---------------------------------------------+\n    /// |                   body ct                    |\n    /// |            PlaintextLen*32 + 16 B            |\n    /// +-------------------------------+--------------+\n    /// | encrypted plaintext fields    | PKCS#7 (16B) |\n    /// | (serialized at 32 B each)     |              |\n    /// +-------------------------------+--------------+\n    /// ```\n    ///\n    /// **2. Header encryption.** The byte length of `body_ct` is stored as a 2-byte big-endian integer. This 2-byte\n    /// header plaintext is then AES-encrypted; PKCS#7 pads the remaining 14 bytes to fill one 16-byte AES block,\n    /// producing a 16-byte header ciphertext:\n    ///\n    /// ```text\n    /// +---------------------------+\n    /// |         header ct         |\n    /// |            16 B           |\n    /// +--------+------------------+\n    /// | body ct| PKCS#7 (14B)     |\n    /// | length |                  |\n    /// | (2 B)  |                  |\n    /// +--------+------------------+\n    /// ```\n    ///\n    /// ## Wire Format\n    ///\n    /// Messages are transmitted as fields, not bytes. A field is ~254 bits and can safely store 31 whole bytes, so\n    /// we need to pack our byte data into 31-byte chunks. This packing drives the wire format.\n    ///\n    /// **Step 1 -- Assemble bytes.** The ciphertexts are laid out in a byte array, padded with zero bytes to a\n    /// multiple of 31 so it divides evenly into fields:\n    ///\n    /// ```text\n    /// +------------+-------------------------+---------+\n    /// | header ct  |        body ct          | byte pad|\n    /// |   16 B     | PlaintextLen*32 + 16 B  | (zeros) |\n    /// +------------+-------------------------+---------+\n    /// |<-------- padded to a multiple of 31 B -------->|\n    /// ```\n    ///\n    /// **Step 2 -- Pack and mask.** The byte array is split into 31-byte chunks, each stored in one field. A\n    /// Poseidon2-derived mask (see `derive_shared_secret_field_mask`) is added to each so that the resulting\n    /// fields appear as uniformly random `Field` values to any observer without knowledge of the shared secret,\n    /// hiding the fact that the underlying ciphertext consists of 128-bit AES blocks.\n    ///\n    /// **Step 3 -- Assemble ciphertext.** The ephemeral public key x-coordinate is prepended and random field padding\n    /// is appended to fill to 15 fields:\n    ///\n    /// ```text\n    /// +----------+-------------------------+-------------------+\n    /// | eph_pk.x |  masked message fields   | random field pad  |\n    /// |          | (packed 31 B per field)  |  (fills to 15)    |\n    /// +----------+-------------------------+-------------------+\n    /// |<---------- MESSAGE_CIPHERTEXT_LEN = 15 fields -------->|\n    /// ```\n    ///\n    /// ## Key Derivation\n    ///\n    /// The raw ECDH shared secret point is first app-siloed into a scalar `s_app` by hashing with the contract\n    /// address (see\n    /// [`compute_app_siloed_shared_secret`](crate::keys::ecdh_shared_secret::compute_app_siloed_shared_secret)).\n    /// Two (key, IV) pairs are then derived from `s_app` via indexed Poseidon2 hashing: one pair for the body\n    /// ciphertext and one for the header ciphertext.\n    fn encrypt<let PlaintextLen: u32>(\n        plaintext: [Field; PlaintextLen],\n        recipient: AztecAddress,\n        contract_address: AztecAddress,\n    ) -> [Field; MESSAGE_CIPHERTEXT_LEN] {\n        std::static_assert(\n            PlaintextLen <= MESSAGE_PLAINTEXT_LEN,\n            \"Plaintext length exceeds MESSAGE_PLAINTEXT_LEN\",\n        );\n\n        // AES 128 operates on bytes, not fields, so we need to convert the fields to bytes. (This process is then\n        // reversed when processing the message in `process_message_ciphertext`)\n        let plaintext_bytes = fields_to_bytes(plaintext);\n\n        // Derive ECDH shared secret with recipient using a fresh ephemeral keypair.\n        let (eph_sk, eph_pk) = generate_positive_ephemeral_key_pair();\n\n        let raw_shared_secret = derive_ecdh_shared_secret(\n            eph_sk,\n            recipient\n                .to_address_point()\n                .unwrap_or_else(|| {\n                    aztecnr_warn_log_format!(\n                        \"Attempted to encrypt message for an invalid recipient ({0})\",\n                    )(\n                        [recipient.to_field()],\n                    );\n\n                    // Safety: if the recipient is an invalid address, then it is not possible to encrypt a message for\n                    // them because we cannot establish a shared secret. This is never expected to occur during normal\n                    // operation. However, it is technically possible for us to receive an invalid address, and we must\n                    // therefore handle it. We could simply fail, but that'd introduce a potential security issue in\n                    // which an attacker forces a contract to encrypt a message for an invalid address, resulting in an\n                    // impossible transaction - this is sometimes called a 'king of the hill' attack. We choose instead\n                    // to not fail and encrypt the plaintext regardless using the shared secret that results from a\n                    // random valid address. The sender is free to choose this address and hence shared secret, but\n                    // this has no security implications as they already know not only the full plaintext but also the\n                    // ephemeral private key anyway.\n                    unsafe {\n                        random_address_point()\n                    }\n                })\n                .inner,\n        );\n\n        let s_app = compute_app_siloed_shared_secret(raw_shared_secret, contract_address);\n\n        // It is safe to derive AES keys from `s_app` using Poseidon2 because `s_app` was derived from an ECDH shared\n        // secret using an AztecAddress (the recipient). See the block comment in\n        // `extract_many_close_to_uniformly_random_256_bits_using_poseidon2` for more info.\n        let pairs = derive_aes_symmetric_key_and_iv_from_shared_secret::<2>(s_app);\n        let (body_sym_key, body_iv) = pairs[0];\n        let (header_sym_key, header_iv) = pairs[1];\n\n        let ciphertext_bytes = aes128_encrypt(plaintext_bytes, body_iv, body_sym_key);\n\n        // Each plaintext field is 32 bytes (a multiple of the 16-byte AES block\n        // size), so PKCS#7 always appends a full 16-byte padding block:\n        //   |ciphertext| = PlaintextLen*32 + 16 = 16 * (1 + PlaintextLen*32 / 16)\n        std::static_assert(\n            ciphertext_bytes.len() == 16 * (1 + (PlaintextLen * 32) / 16),\n            \"unexpected ciphertext length\",\n        );\n\n        // Encrypt a 2-byte header containing the body ciphertext length.\n        let header_plaintext = encode_header(ciphertext_bytes.len());\n\n        // Note: the aes128_encrypt builtin fn automatically appends bytes to the input, according to pkcs#7; hence why\n        // the output `header_ciphertext_bytes` is 16 bytes larger than the input in this case.\n        let header_ciphertext_bytes = aes128_encrypt(header_plaintext, header_iv, header_sym_key);\n        // Verify expected header ciphertext size at compile time.\n        std::static_assert(\n            header_ciphertext_bytes.len() == HEADER_CIPHERTEXT_SIZE_IN_BYTES,\n            \"unexpected ciphertext header length\",\n        );\n\n        // Assemble the message byte array:\n        //  [header_ct (16B)] [body_ct] [padding to mult of 31]\n        let message_bytes_padding_to_mult_31 = get_arr_of_size__message_bytes_padding__from_PT::<PlaintextLen * 32>();\n\n        let mut message_bytes = get_arr_of_size__message_bytes__from_PT::<PlaintextLen * 32>();\n\n        std::static_assert(\n            message_bytes.len() % 31 == 0,\n            \"Unexpected error: message_bytes.len() should be divisible by 31, by construction.\",\n        );\n\n        let mut offset = 0;\n        for i in 0..header_ciphertext_bytes.len() {\n            message_bytes[offset + i] = header_ciphertext_bytes[i];\n        }\n        offset += header_ciphertext_bytes.len();\n\n        for i in 0..ciphertext_bytes.len() {\n            message_bytes[offset + i] = ciphertext_bytes[i];\n        }\n        offset += ciphertext_bytes.len();\n\n        for i in 0..message_bytes_padding_to_mult_31.len() {\n            message_bytes[offset + i] = message_bytes_padding_to_mult_31[i];\n        }\n        offset += message_bytes_padding_to_mult_31.len();\n\n        // Ideally we would be able to have a static assert where we check that the offset would be such that we've\n        // written to the entire log_bytes array, but we cannot since Noir does not treat the offset as a comptime\n        // value (despite the values that it goes through being known at each stage). We instead check that the\n        // computation used to obtain the offset computes the expected value (which we _can_ do in a static check), and\n        // then add a cheap runtime check to also validate that the offset matches this.\n        std::static_assert(\n            header_ciphertext_bytes.len() + ciphertext_bytes.len() + message_bytes_padding_to_mult_31.len()\n                == message_bytes.len(),\n            \"unexpected message length\",\n        );\n        assert(offset == message_bytes.len(), \"unexpected encrypted message length\");\n\n        // Pack message bytes into fields (31 bytes per field) and prepend eph_pk.x.\n        let message_bytes_as_fields = bytes_to_fields(message_bytes);\n\n        let mut ciphertext: [Field; MESSAGE_CIPHERTEXT_LEN] = [0; MESSAGE_CIPHERTEXT_LEN];\n\n        ciphertext[0] = eph_pk.x;\n\n        // Mask each content field with a Poseidon2-derived value, so that they appear as uniformly random `Field`\n        // values\n        let mut offset = 1;\n        for i in 0..message_bytes_as_fields.len() {\n            let mask = derive_shared_secret_field_mask(s_app, i as u32);\n            ciphertext[offset + i] = message_bytes_as_fields[i] + mask;\n        }\n        offset += message_bytes_as_fields.len();\n\n        // Pad with random fields so that padding is indistinguishable from masked data fields.\n        for i in offset..MESSAGE_CIPHERTEXT_LEN {\n            // Safety: we assume that the sender wants for the message to be private - a malicious one could simply\n            // reveal its contents publicly. It is therefore fine to trust the sender to provide random padding.\n            ciphertext[i] = unsafe { random() };\n        }\n\n        ciphertext\n    }\n\n    unconstrained fn decrypt(\n        ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n        recipient: AztecAddress,\n        contract_address: AztecAddress,\n    ) -> Option<BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>> {\n        // Extract the ephemeral public key x-coordinate and masked fields, returning None for empty ciphertext.\n        if ciphertext.len() > 0 {\n            let masked_fields: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS> =\n                array::subbvec(ciphertext, EPH_PK_X_SIZE_IN_FIELDS);\n            Option::some((ciphertext.get(0), masked_fields))\n        } else {\n            Option::none()\n        }\n            .and_then(|(eph_pk_x, masked_fields)| {\n                // With the x-coordinate of the ephemeral public key we can reconstruct the point as we know that the\n                // y-coordinate must be positive. This may fail however, as not all x-coordinates are on the curve. In\n                // that case, we simply return `Option::none`.\n                point_from_x_coord_and_sign(eph_pk_x, true).and_then(|eph_pk| {\n                    let s_app = get_shared_secret(recipient, eph_pk, contract_address);\n\n                    let unmasked_fields = masked_fields.mapi(|i, field| {\n                        let unmasked = unmask_field(s_app, i, field);\n                        // If we failed to unmask the field, we are dealing with the random padding. We'll ignore it\n                        // later, so we can simply set it to 0\n                        unmasked.unwrap_or(0)\n                    });\n                    let ciphertext_without_eph_pk_x = bytes_from_fields(unmasked_fields);\n\n                    // Derive symmetric keys:\n                    let pairs = derive_aes_symmetric_key_and_iv_from_shared_secret::<2>(s_app);\n                    let (body_sym_key, body_iv) = pairs[0];\n                    let (header_sym_key, header_iv) = pairs[1];\n\n                    // Extract the header ciphertext\n                    let header_start = 0;\n                    let header_ciphertext: [u8; HEADER_CIPHERTEXT_SIZE_IN_BYTES] =\n                        array::subarray(ciphertext_without_eph_pk_x.storage(), header_start);\n                    // We need to convert the array to a BoundedVec because the oracle expects a BoundedVec as it's\n                    // designed to work with messages with unknown length at compile time. This would not be necessary\n                    // here as the header ciphertext length is fixed. But we do it anyway to not have to have duplicate\n                    // oracles.\n                    let header_ciphertext_bvec =\n                        BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::from_array(header_ciphertext);\n\n                    try_aes128_decrypt(header_ciphertext_bvec, header_iv, header_sym_key)\n                    // Extract ciphertext length from header (2 bytes, big-endian)\n                    .and_then(|header_plaintext| extract_ciphertext_length(header_plaintext))\n                        .filter(|ciphertext_length| ciphertext_length <= MESSAGE_PLAINTEXT_SIZE_IN_BYTES)\n                        .map(|ciphertext_length| {\n                            // Extract and decrypt main ciphertext\n                            let ciphertext_start = header_start + HEADER_CIPHERTEXT_SIZE_IN_BYTES;\n                            let ciphertext_with_padding: [u8; MESSAGE_PLAINTEXT_SIZE_IN_BYTES] =\n                                array::subarray(ciphertext_without_eph_pk_x.storage(), ciphertext_start);\n                            BoundedVec::from_parts(ciphertext_with_padding, ciphertext_length)\n                        })\n                        // Decrypt main ciphertext and return it\n                        .and_then(|ciphertext| try_aes128_decrypt(ciphertext, body_iv, body_sym_key))\n                        // Convert bytes back to fields (32 bytes per field). Returns None if the actual bytes are\n                        // not valid.\n                        .and_then(|plaintext_bytes| try_fields_from_bytes(plaintext_bytes))\n                })\n            })\n    }\n}\n\n/// Encodes the body ciphertext length into a 2-byte big-endian header.\nfn encode_header(ciphertext_length: u32) -> [u8; 2] {\n    [(ciphertext_length >> 8) as u8, ciphertext_length as u8]\n}\n\n/// Extracts the body ciphertext length from a decrypted header as a 2-byte big-endian integer.\n///\n/// Returns `Option::none()` if the header has fewer than 2 bytes.\nunconstrained fn extract_ciphertext_length<let N: u32>(header: BoundedVec<u8, N>) -> Option<u32> {\n    if header.len() >= 2 {\n        Option::some(((header.get(0) as u32) << 8) | (header.get(1) as u32))\n    } else {\n        Option::none()\n    }\n}\n\n/// 2^248: upper bound for values that fit in 31 bytes\nglobal TWO_POW_248: Field = 2.pow_32(248);\n\n/// Removes the Poseidon2-derived mask from a ciphertext field. Returns the unmasked value if it fits in 31 bytes\n/// (a content field), or `None` if it doesn't (random padding). Unconstrained to prevent accidental use in\n/// constrained context.\nunconstrained fn unmask_field(s_app: Field, index: u32, masked: Field) -> Option<Field> {\n    let unmasked = masked - derive_shared_secret_field_mask(s_app, index);\n    if unmasked.lt(TWO_POW_248) {\n        Option::some(unmasked)\n    } else {\n        Option::none()\n    }\n}\n\n/// Produces a random valid address point, i.e. one that is on the curve. This is equivalent to calling\n/// [`AztecAddress::to_address_point`] on a random valid address.\nunconstrained fn random_address_point() -> AddressPoint {\n    let mut result = std::mem::zeroed();\n\n    loop {\n        // We simply produce random x coordinates until we find one that is on the curve. About half of the x\n        // coordinates fulfill this condition, so this should only take a few iterations at most.\n        let x_coord = random();\n        let point = point_from_x_coord_and_sign(x_coord, true);\n        if point.is_some() {\n            result = AddressPoint { inner: point.unwrap() };\n            break;\n        }\n    }\n\n    result\n}\n\nmod test {\n    use crate::{\n        keys::ecdh_shared_secret::{compute_app_siloed_shared_secret, derive_ecdh_shared_secret},\n        messages::{\n            encoding::{HEADER_CIPHERTEXT_SIZE_IN_BYTES, MESSAGE_PLAINTEXT_LEN, MESSAGE_PLAINTEXT_SIZE_IN_BYTES},\n            encryption::message_encryption::MessageEncryption,\n        },\n        test::helpers::test_environment::TestEnvironment,\n    };\n    use crate::protocol::{address::AztecAddress, traits::FromField};\n    use super::{AES128, encode_header, random_address_point};\n    use std::{embedded_curve_ops::EmbeddedCurveScalar, test::OracleMock};\n\n    #[test]\n    unconstrained fn encrypt_decrypt_deterministic() {\n        let env = TestEnvironment::new();\n\n        // Message decryption requires oracles that are only available during private execution\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let plaintext = [1, 2, 3];\n\n            let recipient = AztecAddress::from_field(\n                0x25afb798ea6d0b8c1618e50fdeafa463059415013d3b7c75d46abf5e242be70c,\n            );\n\n            // Mock random values for deterministic test\n            let eph_sk = 0x1358d15019d4639393d62b97e1588c095957ce74a1c32d6ec7d62fe6705d9538;\n            let _ = OracleMock::mock(\"aztec_utl_getRandomField\").returns(eph_sk).times(1);\n\n            let randomness = 0x0101010101010101010101010101010101010101010101010101010101010101;\n            let _ = OracleMock::mock(\"aztec_utl_getRandomField\").returns(randomness).times(1000000);\n\n            let _ = OracleMock::mock(\"aztec_prv_getNextAppTagAsSender\").returns(42);\n\n            // Encrypt the message\n            let encrypted_message = BoundedVec::from_array(AES128::encrypt(plaintext, recipient, contract_address));\n\n            // Compute the same app-siloed shared secret that the oracle would return\n            let raw_shared_secret = derive_ecdh_shared_secret(\n                EmbeddedCurveScalar::from_field(eph_sk),\n                recipient.to_address_point().unwrap().inner,\n            );\n            let s_app = compute_app_siloed_shared_secret(raw_shared_secret, contract_address);\n\n            let _ = OracleMock::mock(\"aztec_utl_getSharedSecret\").returns(s_app);\n\n            // Decrypt the message\n            let decrypted = AES128::decrypt(encrypted_message, recipient, contract_address).unwrap();\n\n            // The decryption function spits out a BoundedVec because it's designed to work with messages with unknown\n            // length at compile time. For this reason we need to convert the original input to a BoundedVec.\n            let plaintext_bvec = BoundedVec::<Field, MESSAGE_PLAINTEXT_LEN>::from_array(plaintext);\n\n            // Verify decryption matches original plaintext\n            assert_eq(decrypted, plaintext_bvec, \"Decrypted bytes should match original plaintext\");\n\n            // The following is a workaround of \"struct is never constructed\" Noir compilation error (we only ever use\n            // static methods of the struct).\n            let _ = AES128 {};\n        });\n    }\n\n    #[test]\n    unconstrained fn encrypt_decrypt_random() {\n        // Same as `encrypt_decrypt_deterministic`, except we don't mock any of the oracles and rely on\n        // `TestEnvironment` instead.\n        let mut env = TestEnvironment::new();\n\n        let recipient = env.create_light_account();\n\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let plaintext = [1, 2, 3];\n            let ciphertext = AES128::encrypt(plaintext, recipient, contract_address);\n\n            assert_eq(\n                AES128::decrypt(\n                    BoundedVec::from_array(ciphertext),\n                    recipient,\n                    contract_address,\n                )\n                    .unwrap(),\n                BoundedVec::from_array(plaintext),\n            );\n        });\n    }\n\n    #[test]\n    unconstrained fn encrypt_to_invalid_address() {\n        // x = 3 is a non-residue for this curve, resulting in an invalid address\n        let invalid_address = AztecAddress { inner: 3 };\n        let contract_address = AztecAddress { inner: 42 };\n\n        let _ = AES128::encrypt([1, 2, 3, 4], invalid_address, contract_address);\n    }\n\n    // Documents the PKCS#7 padding behavior that `encrypt` relies on (see its static_assert).\n    #[test]\n    fn pkcs7_padding_always_adds_at_least_one_byte() {\n        let key = [0 as u8; 16];\n        let iv = [0 as u8; 16];\n\n        // 1 byte input + 15 bytes padding = 16 bytes\n        assert_eq(std::aes128::aes128_encrypt([0; 1], iv, key).len(), 16);\n\n        // 15 bytes input + 1 byte padding = 16 bytes\n        assert_eq(std::aes128::aes128_encrypt([0; 15], iv, key).len(), 16);\n\n        // 16 bytes input (block-aligned) + full 16-byte padding block = 32 bytes\n        assert_eq(std::aes128::aes128_encrypt([0; 16], iv, key).len(), 32);\n    }\n\n    #[test]\n    unconstrained fn encrypt_decrypt_max_size_plaintext() {\n        let mut env = TestEnvironment::new();\n        let recipient = env.create_light_account();\n\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let mut plaintext = [0; MESSAGE_PLAINTEXT_LEN];\n            for i in 0..MESSAGE_PLAINTEXT_LEN {\n                plaintext[i] = i as Field;\n            }\n            let ciphertext = AES128::encrypt(plaintext, recipient, contract_address);\n\n            assert_eq(\n                AES128::decrypt(\n                    BoundedVec::from_array(ciphertext),\n                    recipient,\n                    contract_address,\n                )\n                    .unwrap(),\n                BoundedVec::from_array(plaintext),\n            );\n        });\n    }\n\n    #[test(should_fail_with = \"Plaintext length exceeds MESSAGE_PLAINTEXT_LEN\")]\n    unconstrained fn encrypt_oversized_plaintext() {\n        let address = AztecAddress { inner: 3 };\n        let contract_address = AztecAddress { inner: 42 };\n        let plaintext: [Field; MESSAGE_PLAINTEXT_LEN + 1] = [0; MESSAGE_PLAINTEXT_LEN + 1];\n        let _ = AES128::encrypt(plaintext, address, contract_address);\n    }\n\n    #[test]\n    unconstrained fn random_address_point_produces_valid_points() {\n        // About half of random addresses are invalid, so testing just a couple gives us high confidence that\n        // `random_address_point` is indeed producing valid addresses.\n        for _ in 0..10 {\n            let random_address = AztecAddress { inner: random_address_point().inner.x };\n            assert(random_address.to_address_point().is_some());\n        }\n    }\n\n    #[test]\n    unconstrained fn decrypt_invalid_ephemeral_public_key() {\n        let mut env = TestEnvironment::new();\n\n        let recipient = env.create_light_account();\n\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let plaintext = [1, 2, 3, 4];\n            let ciphertext = AES128::encrypt(plaintext, recipient, contract_address);\n\n            // The first field of the ciphertext is the x-coordinate of the ephemeral public key. We set it to a known\n            // non-residue (3), causing `decrypt` to fail to produce a decryption shared secret.\n            let mut bad_ciphertext = BoundedVec::from_array(ciphertext);\n            bad_ciphertext.set(0, 3);\n\n            assert(AES128::decrypt(bad_ciphertext, recipient, contract_address).is_none());\n        });\n    }\n\n    #[test]\n    unconstrained fn decrypt_returns_none_on_empty_ciphertext() {\n        let mut env = TestEnvironment::new();\n        let recipient = env.create_light_account();\n\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            assert(AES128::decrypt(BoundedVec::new(), recipient, contract_address).is_none());\n        });\n    }\n\n    // Mocks the header AES decrypt oracle to return an empty result. The TS oracle never throws on invalid\n    // input: it decrypts to garbage bytes or returns empty\n    #[test]\n    unconstrained fn decrypt_returns_none_on_empty_header() {\n        let mut env = TestEnvironment::new();\n        let recipient = env.create_light_account();\n\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let plaintext = [1, 2, 3];\n            let ciphertext = BoundedVec::from_array(AES128::encrypt(plaintext, recipient, contract_address));\n\n            let empty_header = BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::new();\n            let _ = OracleMock::mock(\"aztec_utl_decryptAes128\").returns(Option::some(empty_header)).times(1);\n\n            assert(AES128::decrypt(ciphertext, recipient, contract_address).is_none());\n        });\n    }\n\n    // Mocks the header oracle to return a 2-byte header that decodes to a ciphertext_length one past the maximum\n    // allowed value, verifying the edge case is handled correctly.\n    #[test]\n    unconstrained fn decrypt_returns_none_on_oversized_ciphertext_length() {\n        let mut env = TestEnvironment::new();\n        let recipient = env.create_light_account();\n\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let plaintext = [1, 2, 3];\n            let ciphertext = BoundedVec::from_array(AES128::encrypt(plaintext, recipient, contract_address));\n\n            let bad_header = BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::from_array(encode_header(\n                MESSAGE_PLAINTEXT_SIZE_IN_BYTES + 1,\n            ));\n            let _ = OracleMock::mock(\"aztec_utl_decryptAes128\").returns(Option::some(bad_header)).times(1);\n\n            assert(AES128::decrypt(ciphertext, recipient, contract_address).is_none());\n        });\n    }\n\n}\n"
     },
-    "139": {
+    "137": {
       "function_locations": [
         {
           "name": "encode_private_event_message",
@@ -3455,7 +3403,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/event.nr",
       "source": "use crate::{\n    event::{event_interface::EventInterface, EventSelector},\n    messages::{\n        encoding::{encode_message, MAX_MESSAGE_CONTENT_LEN, MESSAGE_EXPANDED_METADATA_LEN},\n        msg_type::PRIVATE_EVENT_MSG_TYPE_ID,\n    },\n    utils::array,\n};\nuse crate::protocol::traits::{FromField, Serialize, ToField};\n\n/// The number of fields in a private event message content that are not the event's serialized representation (1 field\n/// for randomness).\npub(crate) global PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN: u32 = 1;\npub(crate) global PRIVATE_EVENT_MSG_PLAINTEXT_RANDOMNESS_INDEX: u32 = 0;\n\n/// The maximum length of the packed representation of an event's contents. This is limited by private log size,\n/// encryption overhead and extra fields in the message (e.g. message type id, randomness, etc.).\npub global MAX_EVENT_SERIALIZED_LEN: u32 = MAX_MESSAGE_CONTENT_LEN - PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN;\n\n/// Creates the plaintext for a private event message (i.e. one of type [`PRIVATE_EVENT_MSG_TYPE_ID`]).\n///\n/// This plaintext is meant to be decoded via [`decode_private_event_message`].\npub fn encode_private_event_message<Event>(\n    event: Event,\n    randomness: Field,\n) -> [Field; PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <Event as Serialize>::N + MESSAGE_EXPANDED_METADATA_LEN]\nwhere\n    Event: EventInterface + Serialize,\n{\n    std::static_assert(\n        <Event as Serialize>::N <= MAX_EVENT_SERIALIZED_LEN,\n        \"event's serialized length exceeds the maximum allowed for private events\",\n    );\n\n    // We use `Serialize` because we want for events to be processable by off-chain actors, e.g. block explorers,\n    // wallets and apps, without having to rely on contract invocation. If we used `Packable` we'd need to call utility\n    // functions in order to unpack events, which would introduce a level of complexity we don't currently think is\n    // worth the savings in DA (for public events) and proving time (when encrypting private event messages).\n    let serialized_event = event.serialize();\n\n    // If PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n    // encoding below must be updated as well.\n    std::static_assert(\n        PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 1,\n        \"unexpected value for PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n    );\n\n    let mut msg_plaintext = [0; PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <Event as Serialize>::N];\n    msg_plaintext[PRIVATE_EVENT_MSG_PLAINTEXT_RANDOMNESS_INDEX] = randomness;\n\n    for i in 0..serialized_event.len() {\n        msg_plaintext[PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + i] = serialized_event[i];\n    }\n\n    // The event type id is stored in the message metadata\n    encode_message(\n        PRIVATE_EVENT_MSG_TYPE_ID,\n        Event::get_event_type_id().to_field() as u64,\n        msg_plaintext,\n    )\n}\n\n/// Decodes the plaintext from a private event message (i.e. one of type [`PRIVATE_EVENT_MSG_TYPE_ID`]).\n///\n/// Returns `None` if `msg_content` has too few fields. This plaintext is meant to have originated\n/// from [`encode_private_event_message`].\n///\n/// Note that while [`encode_private_event_message`] returns a fixed-size array, this function takes a [`BoundedVec`]\n/// instead. This is because when decoding we're typically processing runtime-sized plaintexts, more specifically,\n/// those that originate from [`crate::messages::encryption::message_encryption::MessageEncryption::decrypt`].\npub(crate) unconstrained fn decode_private_event_message(\n    msg_metadata: u64,\n    msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) -> Option<(EventSelector, Field, BoundedVec<Field, MAX_EVENT_SERIALIZED_LEN>)> {\n    if msg_content.len() <= PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN {\n        Option::none()\n    } else {\n        let event_type_id = EventSelector::from_field(msg_metadata as Field);\n\n        // If PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n        // destructuring of the private event message encoding below must be updated as well.\n        std::static_assert(\n            PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 1,\n            \"unexpected value for PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n        );\n\n        let randomness = msg_content.get(PRIVATE_EVENT_MSG_PLAINTEXT_RANDOMNESS_INDEX);\n        let serialized_event = array::subbvec(msg_content, PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN);\n\n        Option::some((event_type_id, randomness, serialized_event))\n    }\n}\n\nmod test {\n    use crate::{\n        event::event_interface::EventInterface,\n        messages::{\n            encoding::decode_message,\n            logs::event::{decode_private_event_message, encode_private_event_message},\n            msg_type::PRIVATE_EVENT_MSG_TYPE_ID,\n        },\n    };\n    use crate::protocol::traits::Serialize;\n    use crate::test::mocks::mock_event::MockEvent;\n\n    global VALUE: Field = 7;\n    global RANDOMNESS: Field = 10;\n\n    #[test]\n    unconstrained fn encode_decode() {\n        let event = MockEvent::new(VALUE).build_event();\n\n        let message_plaintext = encode_private_event_message(event, RANDOMNESS);\n\n        let (msg_type_id, msg_metadata, msg_content) =\n            decode_message(BoundedVec::from_array(message_plaintext)).unwrap();\n\n        assert_eq(msg_type_id, PRIVATE_EVENT_MSG_TYPE_ID);\n\n        let (event_type_id, randomness, serialized_event) =\n            decode_private_event_message(msg_metadata, msg_content).unwrap();\n\n        assert_eq(event_type_id, MockEvent::get_event_type_id());\n        assert_eq(randomness, RANDOMNESS);\n        assert_eq(serialized_event, BoundedVec::from_array(event.serialize()));\n    }\n\n    #[test]\n    unconstrained fn decode_empty_content_returns_none() {\n        let empty = BoundedVec::new();\n        assert(decode_private_event_message(0, empty).is_none());\n    }\n\n    #[test]\n    unconstrained fn decode_with_only_reserved_fields_returns_none() {\n        let content = BoundedVec::from_array([0]);\n        assert(decode_private_event_message(0, content).is_none());\n    }\n}\n"
     },
-    "141": {
+    "139": {
       "function_locations": [
         {
           "name": "encode_private_note_message",
@@ -3497,7 +3445,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/note.nr",
       "source": "use crate::{\n    messages::{\n        encoding::{encode_message, MAX_MESSAGE_CONTENT_LEN, MESSAGE_EXPANDED_METADATA_LEN},\n        msg_type::PRIVATE_NOTE_MSG_TYPE_ID,\n    },\n    note::note_interface::NoteType,\n    utils::array,\n};\nuse crate::protocol::{address::AztecAddress, traits::{FromField, Packable, ToField}};\n\n/// The number of fields in a private note message content that are not the note's packed representation.\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN: u32 = 3;\n\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_OWNER_INDEX: u32 = 0;\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX: u32 = 1;\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_RANDOMNESS_INDEX: u32 = 2;\n\n/// The maximum length of the packed representation of a note's contents. This is limited by private log size,\n/// encryption overhead and extra fields in the message (e.g. message type id, storage slot, randomness, etc.).\npub global MAX_NOTE_PACKED_LEN: u32 = MAX_MESSAGE_CONTENT_LEN - PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN;\n\n/// Creates the plaintext for a private note message (i.e. one of type [`PRIVATE_NOTE_MSG_TYPE_ID`]).\n///\n/// This plaintext is meant to be decoded via [`decode_private_note_message`].\npub fn encode_private_note_message<Note>(\n    note: Note,\n    owner: AztecAddress,\n    storage_slot: Field,\n    randomness: Field,\n) -> [Field; PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <Note as Packable>::N + MESSAGE_EXPANDED_METADATA_LEN]\nwhere\n    Note: NoteType + Packable,\n{\n    let packed_note = note.pack();\n\n    // If PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n    // encoding below must be updated as well.\n    std::static_assert(\n        PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 3,\n        \"unexpected value for PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n    );\n\n    let mut msg_content = [0; PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <Note as Packable>::N];\n    msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_OWNER_INDEX] = owner.to_field();\n    msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX] = storage_slot;\n    msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_RANDOMNESS_INDEX] = randomness;\n    for i in 0..packed_note.len() {\n        msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + i] = packed_note[i];\n    }\n\n    // Notes use the note type id for metadata\n    encode_message(PRIVATE_NOTE_MSG_TYPE_ID, Note::get_id() as u64, msg_content)\n}\n\n/// Decodes the plaintext from a private note message (i.e. one of type [`PRIVATE_NOTE_MSG_TYPE_ID`]).\n///\n/// Returns `None` if `msg_content` has too few fields. This plaintext is meant to have originated\n/// from [`encode_private_note_message`].\n///\n/// Note that while [`encode_private_note_message`] returns a fixed-size array, this function takes a [`BoundedVec`]\n/// instead. This is because when decoding we're typically processing runtime-sized plaintexts, more specifically,\n/// those that originate from [`crate::messages::encryption::message_encryption::MessageEncryption::decrypt`].\npub(crate) unconstrained fn decode_private_note_message(\n    msg_metadata: u64,\n    msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) -> Option<(Field, AztecAddress, Field, Field, BoundedVec<Field, MAX_NOTE_PACKED_LEN>)> {\n    if msg_content.len() <= PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN {\n        Option::none()\n    } else {\n        let note_type_id = msg_metadata as Field; // TODO: make note type id not be a full field\n\n        // If PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n        // decoding below must be updated as well.\n        std::static_assert(\n            PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 3,\n            \"unexpected value for PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n        );\n\n        let owner = AztecAddress::from_field(msg_content.get(PRIVATE_NOTE_MSG_PLAINTEXT_OWNER_INDEX));\n        let storage_slot = msg_content.get(PRIVATE_NOTE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX);\n        let randomness = msg_content.get(PRIVATE_NOTE_MSG_PLAINTEXT_RANDOMNESS_INDEX);\n        let packed_note = array::subbvec(msg_content, PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN);\n\n        Option::some((note_type_id, owner, storage_slot, randomness, packed_note))\n    }\n}\n\nmod test {\n    use crate::{\n        messages::{\n            encoding::decode_message,\n            logs::note::{decode_private_note_message, encode_private_note_message, MAX_NOTE_PACKED_LEN},\n            msg_type::PRIVATE_NOTE_MSG_TYPE_ID,\n        },\n        note::note_interface::NoteType,\n    };\n    use crate::protocol::{address::AztecAddress, traits::{FromField, Packable}};\n    use crate::test::mocks::mock_note::MockNote;\n\n    global VALUE: Field = 7;\n    global OWNER: AztecAddress = AztecAddress::from_field(8);\n    global STORAGE_SLOT: Field = 9;\n    global RANDOMNESS: Field = 10;\n\n    #[test]\n    unconstrained fn encode_decode() {\n        let note = MockNote::new(VALUE).build_note();\n\n        let message_plaintext = encode_private_note_message(note, OWNER, STORAGE_SLOT, RANDOMNESS);\n\n        let (msg_type_id, msg_metadata, msg_content) =\n            decode_message(BoundedVec::from_array(message_plaintext)).unwrap();\n\n        assert_eq(msg_type_id, PRIVATE_NOTE_MSG_TYPE_ID);\n\n        let (note_type_id, owner, storage_slot, randomness, packed_note) =\n            decode_private_note_message(msg_metadata, msg_content).unwrap();\n\n        assert_eq(note_type_id, MockNote::get_id());\n        assert_eq(owner, OWNER);\n        assert_eq(storage_slot, STORAGE_SLOT);\n        assert_eq(randomness, RANDOMNESS);\n        assert_eq(packed_note, BoundedVec::from_array(note.pack()));\n    }\n\n    #[derive(Packable)]\n    struct MaxSizeNote {\n        data: [Field; MAX_NOTE_PACKED_LEN],\n    }\n\n    impl NoteType for MaxSizeNote {\n        fn get_id() -> Field {\n            0\n        }\n    }\n\n    #[test]\n    unconstrained fn encode_decode_max_size_note() {\n        let mut data = [0; MAX_NOTE_PACKED_LEN];\n        for i in 0..MAX_NOTE_PACKED_LEN {\n            data[i] = i as Field;\n        }\n        let note = MaxSizeNote { data };\n\n        let encoded = encode_private_note_message(note, OWNER, STORAGE_SLOT, RANDOMNESS);\n        let (msg_type_id, msg_metadata, msg_content) = decode_message(BoundedVec::from_array(encoded)).unwrap();\n\n        assert_eq(msg_type_id, PRIVATE_NOTE_MSG_TYPE_ID);\n\n        let (note_type_id, owner, storage_slot, randomness, packed_note) =\n            decode_private_note_message(msg_metadata, msg_content).unwrap();\n\n        assert_eq(note_type_id, MaxSizeNote::get_id());\n        assert_eq(owner, OWNER);\n        assert_eq(storage_slot, STORAGE_SLOT);\n        assert_eq(randomness, RANDOMNESS);\n        assert_eq(packed_note, BoundedVec::from_array(data));\n    }\n\n    #[derive(Packable)]\n    struct OversizedNote {\n        data: [Field; MAX_NOTE_PACKED_LEN + 1],\n    }\n\n    impl NoteType for OversizedNote {\n        fn get_id() -> Field {\n            0\n        }\n    }\n\n    #[test(should_fail_with = \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\")]\n    fn encode_oversized_note_fails() {\n        let note = OversizedNote { data: [0; MAX_NOTE_PACKED_LEN + 1] };\n        let _ = encode_private_note_message(note, OWNER, STORAGE_SLOT, RANDOMNESS);\n    }\n\n    #[test]\n    unconstrained fn decode_empty_content_returns_none() {\n        let empty = BoundedVec::new();\n        assert(decode_private_note_message(0, empty).is_none());\n    }\n\n    #[test]\n    unconstrained fn decode_with_only_reserved_fields_returns_none() {\n        let content = BoundedVec::from_array([0, 0, 0]);\n        assert(decode_private_note_message(0, content).is_none());\n    }\n}\n"
     },
-    "142": {
+    "140": {
       "function_locations": [
         {
           "name": "encode_partial_note_private_message",
@@ -3523,7 +3471,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/partial_note.nr",
       "source": "use crate::{\n    messages::{\n        encoding::{encode_message, MAX_MESSAGE_CONTENT_LEN, MESSAGE_EXPANDED_METADATA_LEN},\n        msg_type::PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID,\n    },\n    note::note_interface::NoteType,\n    utils::array,\n};\nuse crate::protocol::{address::AztecAddress, traits::{FromField, Packable, ToField}};\n\n/// The number of fields in a private note message content that are not the note's packed representation.\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN: u32 = 3;\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_OWNER_INDEX: u32 = 0;\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RANDOMNESS_INDEX: u32 = 1;\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NOTE_COMPLETION_LOG_TAG_INDEX: u32 = 2;\n\n/// Partial notes have a maximum packed length of their private fields bound by extra content in their private message\n/// (e.g. the storage slot, note completion log tag, etc.).\npub global MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN: u32 =\n    MAX_MESSAGE_CONTENT_LEN - PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN;\n\n/// Creates the plaintext for a partial note private message (i.e. one of type [`PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID`]).\n///\n/// This plaintext is meant to be decoded via [`decode_partial_note_private_message`].\npub fn encode_partial_note_private_message<PartialNotePrivateContent>(\n    partial_note_private_content: PartialNotePrivateContent,\n    owner: AztecAddress,\n    randomness: Field,\n    note_completion_log_tag: Field,\n    ) -> [Field; PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <PartialNotePrivateContent as Packable>::N + MESSAGE_EXPANDED_METADATA_LEN]\nwhere\n    PartialNotePrivateContent: NoteType + Packable,\n{\n    let packed_private_content = partial_note_private_content.pack();\n\n    // If PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN is changed, causing the assertion below to fail, then\n    // the encoding below must be updated as well.\n    std::static_assert(\n        PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 3,\n        \"unexpected value for PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN\",\n    );\n\n    let mut msg_content =\n        [0; PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <PartialNotePrivateContent as Packable>::N];\n    msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_OWNER_INDEX] = owner.to_field();\n    msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RANDOMNESS_INDEX] = randomness;\n    msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NOTE_COMPLETION_LOG_TAG_INDEX] = note_completion_log_tag;\n\n    for i in 0..packed_private_content.len() {\n        msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + i] = packed_private_content[i];\n    }\n\n    encode_message(\n        PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID,\n        // Notes use the note type id for metadata\n        PartialNotePrivateContent::get_id() as u64,\n        msg_content,\n    )\n}\n\n/// Decodes the plaintext from a partial note private message (i.e. one of type\n/// [`PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID`]).\n///\n/// Returns `None` if `msg_content` has too few fields. This plaintext is meant to have originated\n/// from [`encode_partial_note_private_message`].\n///\n/// Note that while [`encode_partial_note_private_message`] returns a fixed-size array, this function takes a\n/// [`BoundedVec`] instead. This is because when decoding we're typically processing runtime-sized plaintexts, more\n/// specifically, those that originate from\n/// [`crate::messages::encryption::message_encryption::MessageEncryption::decrypt`].\npub(crate) unconstrained fn decode_partial_note_private_message(\n    msg_metadata: u64,\n    msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) -> Option<(AztecAddress, Field, Field, Field, BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>)> {\n    if msg_content.len() < PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN {\n        Option::none()\n    } else {\n        let note_type_id: Field = msg_metadata as Field; // TODO: make note type id not be a full field\n\n        // If PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN is changed, causing the assertion below to fail,\n        // then the destructuring of the partial note private message encoding below must be updated as well.\n        std::static_assert(\n            PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 3,\n            \"unexpected value for PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN\",\n        );\n\n        // We currently have three fields that are not the partial note's packed representation, which are the owner,\n        // the randomness, and the note completion log tag.\n        let owner = AztecAddress::from_field(\n            msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_OWNER_INDEX),\n        );\n        let randomness = msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RANDOMNESS_INDEX);\n        let note_completion_log_tag = msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NOTE_COMPLETION_LOG_TAG_INDEX);\n\n        let packed_private_note_content: BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN> = array::subbvec(\n            msg_content,\n            PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN,\n        );\n\n        Option::some(\n            (owner, randomness, note_completion_log_tag, note_type_id, packed_private_note_content),\n        )\n    }\n}\n\nmod test {\n    use crate::{\n        messages::{\n            encoding::decode_message,\n            logs::partial_note::{decode_partial_note_private_message, encode_partial_note_private_message},\n            msg_type::PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID,\n        },\n        note::note_interface::NoteType,\n    };\n    use crate::protocol::{address::AztecAddress, traits::{FromField, Packable}};\n    use crate::test::mocks::mock_note::MockNote;\n\n    global VALUE: Field = 7;\n    global OWNER: AztecAddress = AztecAddress::from_field(8);\n    global RANDOMNESS: Field = 10;\n    global NOTE_COMPLETION_LOG_TAG: Field = 11;\n\n    #[test]\n    unconstrained fn encode_decode() {\n        // Note that here we use MockNote as the private fields of a partial note\n        let note = MockNote::new(VALUE).build_note();\n\n        let message_plaintext = encode_partial_note_private_message(note, OWNER, RANDOMNESS, NOTE_COMPLETION_LOG_TAG);\n\n        let (msg_type_id, msg_metadata, msg_content) =\n            decode_message(BoundedVec::from_array(message_plaintext)).unwrap();\n\n        assert_eq(msg_type_id, PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID);\n\n        let (owner, randomness, note_completion_log_tag, note_type_id, packed_note) =\n            decode_partial_note_private_message(msg_metadata, msg_content).unwrap();\n\n        assert_eq(note_type_id, MockNote::get_id());\n        assert_eq(owner, OWNER);\n        assert_eq(randomness, RANDOMNESS);\n        assert_eq(note_completion_log_tag, NOTE_COMPLETION_LOG_TAG);\n        assert_eq(packed_note, BoundedVec::from_array(note.pack()));\n    }\n\n    #[test]\n    unconstrained fn decode_empty_content_returns_none() {\n        let empty = BoundedVec::new();\n        assert(decode_partial_note_private_message(0, empty).is_none());\n    }\n\n    #[test]\n    unconstrained fn decode_succeeds_with_only_reserved_fields() {\n        let content = BoundedVec::from_array([0, 0, 0]);\n        let (_, _, _, _, packed_note) = decode_partial_note_private_message(0, content).unwrap();\n        assert_eq(packed_note.len(), 0);\n    }\n}\n"
     },
-    "152": {
+    "150": {
       "function_locations": [
         {
           "name": "get_private_logs",
@@ -3553,7 +3501,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/processing/mod.nr",
       "source": "pub(crate) mod event_validation_request;\npub mod offchain;\n\nmod message_context;\npub use message_context::MessageContext;\n\npub(crate) mod note_validation_request;\npub(crate) mod log_retrieval_request;\npub(crate) mod log_retrieval_response;\npub(crate) mod pending_tagged_log;\n\nuse crate::{\n    capsules::CapsuleArray,\n    event::EventSelector,\n    messages::{\n        discovery::partial_notes::DeliveredPendingPartialNote,\n        encoding::MESSAGE_CIPHERTEXT_LEN,\n        logs::{event::MAX_EVENT_SERIALIZED_LEN, note::MAX_NOTE_PACKED_LEN},\n        processing::{\n            log_retrieval_request::LogRetrievalRequest, log_retrieval_response::LogRetrievalResponse,\n            note_validation_request::NoteValidationRequest, pending_tagged_log::PendingTaggedLog,\n        },\n    },\n    oracle,\n};\nuse crate::protocol::{\n    address::AztecAddress,\n    constants::DOM_SEP__NOTE_COMPLETION_LOG_TAG,\n    hash::{compute_log_tag, sha256_to_field},\n    traits::{Deserialize, Serialize},\n};\nuse event_validation_request::EventValidationRequest;\n\n// Base slot for the pending tagged log array to which the fetch_tagged_logs oracle inserts found private logs.\npub(crate) global PENDING_TAGGED_LOG_ARRAY_BASE_SLOT: Field =\n    sha256_to_field(\"AZTEC_NR::PENDING_TAGGED_LOG_ARRAY_BASE_SLOT\".as_bytes());\n\nglobal NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n    \"AZTEC_NR::NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n    \"AZTEC_NR::EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n    \"AZTEC_NR::LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT: Field = sha256_to_field(\n    \"AZTEC_NR::LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\n/// An offchain-delivered message with resolved context, ready for processing during sync.\n#[derive(Serialize, Deserialize)]\npub struct OffchainMessageWithContext {\n    pub message_ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n    pub message_context: MessageContext,\n}\n\n/// Searches for private logs emitted by `contract_address` that might contain messages for the given `scope`.\npub(crate) unconstrained fn get_private_logs(\n    contract_address: AztecAddress,\n    scope: AztecAddress,\n) -> CapsuleArray<PendingTaggedLog> {\n    // We will eventually perform log discovery via tagging here, but for now we simply call the `fetchTaggedLogs`\n    // oracle. This makes PXE synchronize tags, download logs and store the pending tagged logs in a capsule array.\n    oracle::message_processing::fetch_tagged_logs(PENDING_TAGGED_LOG_ARRAY_BASE_SLOT, scope);\n\n    CapsuleArray::at(contract_address, PENDING_TAGGED_LOG_ARRAY_BASE_SLOT, scope)\n}\n\n/// Enqueues a note for validation and storage by PXE.\n///\n/// Once validated, the note becomes retrievable via the `get_notes` oracle. The note will be scoped to\n/// `contract_address`, meaning other contracts will not be able to access it unless authorized.\n///\n/// In order for the note validation and insertion to occur, `validate_and_store_enqueued_notes_and_events` must be\n/// later called. For optimal performance, accumulate as many note validation requests as possible and then validate\n/// them all at the end (which results in PXE minimizing the number of network round-trips).\n///\n/// The `packed_note` is what `getNotes` will later return. PXE indexes notes by `storage_slot`, so this value is\n/// typically used to filter notes that correspond to different state variables. `note_hash` and `nullifier` are the\n/// inner hashes, i.e. the raw hashes returned by `NoteHash::compute_note_hash` and `NoteHash::compute_nullifier`. PXE\n/// will verify that the siloed unique note hash was inserted into the tree at `tx_hash`, and will store the nullifier\n/// to later check for nullification.\n///\n/// `owner` is the address used in note hash and nullifier computation, often requiring knowledge of their nullifier\n/// secret key.\n///\n/// `scope` is the account to which the note message was delivered (i.e. the address the message was encrypted to).\n/// This determines which PXE account can see the note - other accounts will not be able to access it (e.g. other\n/// accounts will not be able to see one another's token balance notes, even in the same PXE) unless authorized. In\n/// most cases `recipient` equals `owner`, but they can differ in scenarios like delegated discovery.\npub unconstrained fn enqueue_note_for_validation(\n    contract_address: AztecAddress,\n    owner: AztecAddress,\n    storage_slot: Field,\n    randomness: Field,\n    note_nonce: Field,\n    packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n    note_hash: Field,\n    nullifier: Field,\n    tx_hash: Field,\n    scope: AztecAddress,\n) {\n    // We store requests in a `CapsuleArray`, which PXE will later read from and deserialize into its version of the\n    // Noir `NoteValidationRequest`\n    CapsuleArray::at(\n        contract_address,\n        NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n        scope,\n    )\n        .push(\n            NoteValidationRequest {\n                contract_address,\n                owner,\n                storage_slot,\n                randomness,\n                note_nonce,\n                packed_note,\n                note_hash,\n                nullifier,\n                tx_hash,\n            },\n        )\n}\n\n/// Enqueues an event for validation and storage by PXE.\n///\n/// This is the primary way for custom message handlers (registered via\n/// [`crate::macros::AztecConfig::custom_message_handler`]) to deliver reassembled events back to PXE after processing\n/// application-specific message formats.\n///\n/// In order for the event validation and insertion to occur, `validate_and_store_enqueued_notes_and_events` must be\n/// later called. For optimal performance, accumulate as many event validation requests as possible and then validate\n/// them all at the end (which results in PXE minimizing the number of network round-trips).\n///\n/// Note that `validate_and_store_enqueued_notes_and_events` is called by Aztec.nr after processing messages, so custom\n/// message processors do not need to be concerned with this.\npub unconstrained fn enqueue_event_for_validation(\n    contract_address: AztecAddress,\n    event_type_id: EventSelector,\n    randomness: Field,\n    serialized_event: BoundedVec<Field, MAX_EVENT_SERIALIZED_LEN>,\n    event_commitment: Field,\n    tx_hash: Field,\n    scope: AztecAddress,\n) {\n    // We store requests in a `CapsuleArray`, which PXE will later read from and deserialize into its version of the\n    // Noir `EventValidationRequest`\n    CapsuleArray::at(\n        contract_address,\n        EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n        scope,\n    )\n        .push(\n            EventValidationRequest {\n                contract_address,\n                event_type_id,\n                randomness,\n                serialized_event,\n                event_commitment,\n                tx_hash,\n            },\n        )\n}\n\n/// Validates and stores all enqueued notes and events.\n///\n/// Processes all requests enqueued via [`enqueue_note_for_validation`] and [`enqueue_event_for_validation`], inserting\n/// them into the note database and event store respectively, making them queryable via `get_notes` oracle and our TS\n/// API (PXE::getPrivateEvents).\n///\n/// This automatically clears both validation request queues, so no further work needs to be done by the caller.\npub unconstrained fn validate_and_store_enqueued_notes_and_events(contract_address: AztecAddress, scope: AztecAddress) {\n    oracle::message_processing::validate_and_store_enqueued_notes_and_events(\n        contract_address,\n        NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n        EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n        MAX_NOTE_PACKED_LEN as Field,\n        MAX_EVENT_SERIALIZED_LEN as Field,\n        scope,\n    );\n}\n\n/// Resolves message contexts for a list of tx hashes stored in a CapsuleArray.\n///\n/// The `message_context_requests_array_base_slot` must point to a CapsuleArray<Field> containing tx hashes.\n/// PXE will store `Option<MessageContextResponse>` values into the responses array at\n/// `message_context_responses_array_base_slot`.\npub unconstrained fn get_message_contexts_by_tx_hash(\n    contract_address: AztecAddress,\n    message_context_requests_array_base_slot: Field,\n    message_context_responses_array_base_slot: Field,\n    scope: AztecAddress,\n) {\n    oracle::message_processing::get_message_contexts_by_tx_hash(\n        contract_address,\n        message_context_requests_array_base_slot,\n        message_context_responses_array_base_slot,\n        scope,\n    );\n}\n\n/// Efficiently queries the node for logs that result in the completion of all `DeliveredPendingPartialNote`s stored in\n/// a `CapsuleArray` by performing all node communication concurrently. Returns a second `CapsuleArray` with Options\n/// for the responses that correspond to the pending partial notes at the same index.\n///\n/// For example, given an array with pending partial notes `[ p1, p2, p3 ]`, where `p1` and `p3` have corresponding\n/// completion logs but `p2` does not, the returned `CapsuleArray` will have contents `[some(p1_log), none(),\n/// some(p3_log)]`.\npub(crate) unconstrained fn get_pending_partial_notes_completion_logs(\n    contract_address: AztecAddress,\n    pending_partial_notes: CapsuleArray<DeliveredPendingPartialNote>,\n    scope: AztecAddress,\n) -> CapsuleArray<Option<LogRetrievalResponse>> {\n    let log_retrieval_requests = CapsuleArray::at(\n        contract_address,\n        LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT,\n        scope,\n    );\n\n    // We create a LogRetrievalRequest for each PendingPartialNote in the CapsuleArray. Because we need the indices in\n    // the request array to match the indices in the partial note array, we can't use CapsuleArray::for_each, as that\n    // function has arbitrary iteration order. Instead, we manually iterate the array from the beginning and push into\n    // the requests array, which we expect to be empty.\n    let mut i = 0;\n    let pending_partial_notes_count = pending_partial_notes.len();\n    while i < pending_partial_notes_count {\n        let pending_partial_note = pending_partial_notes.get(i);\n        // Partial note completion logs are emitted with a domain-separated tag. To find matching logs, we apply the\n        // same domain separation to the stored raw tag.\n        let log_tag = compute_log_tag(\n            pending_partial_note.note_completion_log_tag,\n            DOM_SEP__NOTE_COMPLETION_LOG_TAG,\n        );\n        log_retrieval_requests.push(LogRetrievalRequest { contract_address, unsiloed_tag: log_tag });\n        i += 1;\n    }\n\n    oracle::message_processing::get_logs_by_tag(\n        contract_address,\n        LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT,\n        LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT,\n        scope,\n    );\n\n    CapsuleArray::at(\n        contract_address,\n        LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT,\n        scope,\n    )\n}\n"
     },
-    "154": {
+    "152": {
       "function_locations": [
         {
           "name": "receive",
@@ -3895,7 +3843,7 @@
       "path": "std/field/mod.nr",
       "source": "pub mod bn254;\nuse crate::{runtime::is_unconstrained, static_assert};\nuse bn254::lt as bn254_lt;\n\nimpl Field {\n    /// Asserts that `self` can be represented in `bit_size` bits.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^{bit_size}`.\n    // docs:start:assert_max_bit_size\n    pub fn assert_max_bit_size<let BIT_SIZE: u32>(self) {\n        // docs:end:assert_max_bit_size\n        static_assert(\n            BIT_SIZE < modulus_num_bits() as u32,\n            \"BIT_SIZE must be less than modulus_num_bits\",\n        );\n        __assert_max_bit_size(self, BIT_SIZE);\n    }\n\n    /// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n    /// This array will be zero padded should not all bits be necessary to represent `self`.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n    /// be able to represent the original `Field`.\n    ///\n    /// # Safety\n    /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n    // docs:start:to_le_bits\n    pub fn to_le_bits<let N: u32>(self: Self) -> [u1; N] {\n        // docs:end:to_le_bits\n        let bits = __to_le_bits(self);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_le_bits();\n            assert(bits.len() <= p.len());\n            let mut ok = bits.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bits[N - 1 - i] != p[N - 1 - i]) {\n                        assert(p[N - 1 - i] == 1);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bits\n    }\n\n    /// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n    /// This array will be zero padded should not all bits be necessary to represent `self`.\n    ///\n    /// # Failures\n    /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n    /// be able to represent the original `Field`.\n    ///\n    /// # Safety\n    /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n    // docs:start:to_be_bits\n    pub fn to_be_bits<let N: u32>(self: Self) -> [u1; N] {\n        // docs:end:to_be_bits\n        let bits = __to_be_bits(self);\n\n        if !is_unconstrained() {\n            // Ensure that the decomposition does not overflow the modulus\n            let p = modulus_be_bits();\n            assert(bits.len() <= p.len());\n            let mut ok = bits.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bits[i] != p[i]) {\n                        assert(p[i] == 1);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bits\n    }\n\n    /// Decomposes `self` into its little endian byte decomposition as a `[u8;N]` array\n    /// This array will be zero padded should not all bytes be necessary to represent `self`.\n    ///\n    /// # Failures\n    ///  The length N of the array must be big enough to contain all the bytes of the 'self',\n    ///  and no more than the number of bytes required to represent the field modulus\n    ///\n    /// # Safety\n    /// The result is ensured to be the canonical decomposition of the field element\n    // docs:start:to_le_bytes\n    pub fn to_le_bytes<let N: u32>(self: Self) -> [u8; N] {\n        // docs:end:to_le_bytes\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        // Compute the byte decomposition\n        let bytes = self.to_le_radix(256);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_le_bytes();\n            assert(bytes.len() <= p.len());\n            let mut ok = bytes.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bytes[N - 1 - i] != p[N - 1 - i]) {\n                        assert(bytes[N - 1 - i] < p[N - 1 - i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bytes\n    }\n\n    /// Decomposes `self` into its big endian byte decomposition as a `[u8;N]` array of length required to represent the field modulus\n    /// This array will be zero padded should not all bytes be necessary to represent `self`.\n    ///\n    /// # Failures\n    ///  The length N of the array must be big enough to contain all the bytes of the 'self',\n    ///  and no more than the number of bytes required to represent the field modulus\n    ///\n    /// # Safety\n    /// The result is ensured to be the canonical decomposition of the field element\n    // docs:start:to_be_bytes\n    pub fn to_be_bytes<let N: u32>(self: Self) -> [u8; N] {\n        // docs:end:to_be_bytes\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        // Compute the byte decomposition\n        let bytes = self.to_be_radix(256);\n\n        if !is_unconstrained() {\n            // Ensure that the byte decomposition does not overflow the modulus\n            let p = modulus_be_bytes();\n            assert(bytes.len() <= p.len());\n            let mut ok = bytes.len() != p.len();\n            for i in 0..N {\n                if !ok {\n                    if (bytes[i] != p[i]) {\n                        assert(bytes[i] < p[i]);\n                        ok = true;\n                    }\n                }\n            }\n            assert(ok);\n        }\n        bytes\n    }\n\n    fn to_le_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n        // Brillig does not need an immediate radix\n        if !crate::runtime::is_unconstrained() {\n            static_assert(1 < radix, \"radix must be greater than 1\");\n            static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n            static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n        }\n        __to_le_radix(self, radix)\n    }\n\n    fn to_be_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n        // Brillig does not need an immediate radix\n        if !crate::runtime::is_unconstrained() {\n            static_assert(1 < radix, \"radix must be greater than 1\");\n            static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n            static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n        }\n        __to_be_radix(self, radix)\n    }\n\n    // Returns self to the power of the given exponent value.\n    // Caution: we assume the exponent fits into 32 bits\n    // using a bigger bit size impacts negatively the performance and should be done only if the exponent does not fit in 32 bits\n    pub fn pow_32(self, exponent: Field) -> Field {\n        let mut r: Field = 1;\n        let b: [u1; 32] = exponent.to_le_bits();\n\n        for i in 1..33 {\n            r *= r;\n            r = (b[32 - i] as Field) * (r * self) + (1 - b[32 - i] as Field) * r;\n        }\n        r\n    }\n\n    // Parity of (prime) Field element, i.e. sgn0(x mod p) = 0 if x `elem` {0, ..., p-1} is even, otherwise sgn0(x mod p) = 1.\n    pub fn sgn0(self) -> u1 {\n        self as u1\n    }\n\n    pub fn lt(self, another: Field) -> bool {\n        if crate::compat::is_bn254() {\n            bn254_lt(self, another)\n        } else {\n            lt_fallback(self, another)\n        }\n    }\n\n    /// Convert a little endian byte array to a field element.\n    /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n    pub fn from_le_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n        static_assert(\n            N <= modulus_le_bytes().len(),\n            \"N must be less than or equal to modulus_le_bytes().len()\",\n        );\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bytes[i] as Field) * v;\n            v = v * 256;\n        }\n        result\n    }\n\n    /// Convert a big endian byte array to a field element.\n    /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n    pub fn from_be_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bytes[N - 1 - i] as Field) * v;\n            v = v * 256;\n        }\n        result\n    }\n}\n\n#[builtin(apply_range_constraint)]\nfn __assert_max_bit_size(value: Field, bit_size: u32) {}\n\n// `_radix` must be less than 256\n#[builtin(to_le_radix)]\nfn __to_le_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n// `_radix` must be less than 256\n#[builtin(to_be_radix)]\nfn __to_be_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n/// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n/// This array will be zero padded should not all bits be necessary to represent `self`.\n///\n/// # Failures\n/// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n/// be able to represent the original `Field`.\n///\n/// # Safety\n/// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n/// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n/// wrap around due to overflow when verifying the decomposition.\n#[builtin(to_le_bits)]\nfn __to_le_bits<let N: u32>(value: Field) -> [u1; N] {}\n\n/// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n/// This array will be zero padded should not all bits be necessary to represent `self`.\n///\n/// # Failures\n/// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n/// be able to represent the original `Field`.\n///\n/// # Safety\n/// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n/// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n/// wrap around due to overflow when verifying the decomposition.\n#[builtin(to_be_bits)]\nfn __to_be_bits<let N: u32>(value: Field) -> [u1; N] {}\n\n#[builtin(modulus_num_bits)]\npub comptime fn modulus_num_bits() -> u64 {}\n\n#[builtin(modulus_be_bits)]\npub comptime fn modulus_be_bits() -> [u1] {}\n\n#[builtin(modulus_le_bits)]\npub comptime fn modulus_le_bits() -> [u1] {}\n\n#[builtin(modulus_be_bytes)]\npub comptime fn modulus_be_bytes() -> [u8] {}\n\n#[builtin(modulus_le_bytes)]\npub comptime fn modulus_le_bytes() -> [u8] {}\n\n/// An unconstrained only built in to efficiently compare fields.\n#[builtin(field_less_than)]\nunconstrained fn __field_less_than(x: Field, y: Field) -> bool {}\n\npub(crate) unconstrained fn field_less_than(x: Field, y: Field) -> bool {\n    __field_less_than(x, y)\n}\n\n// Convert a 32 byte array to a field element by modding\npub fn bytes32_to_field(bytes32: [u8; 32]) -> Field {\n    // Convert it to a field element\n    let mut v = 1;\n    let mut high = 0 as Field;\n    let mut low = 0 as Field;\n\n    for i in 0..16 {\n        high = high + (bytes32[15 - i] as Field) * v;\n        low = low + (bytes32[16 + 15 - i] as Field) * v;\n        v = v * 256;\n    }\n    // Abuse that a % p + b % p = (a + b) % p and that low < p\n    low + high * v\n}\n\nfn lt_fallback(x: Field, y: Field) -> bool {\n    if is_unconstrained() {\n        // Safety: unconstrained context\n        unsafe {\n            field_less_than(x, y)\n        }\n    } else {\n        let x_bytes: [u8; 32] = x.to_le_bytes();\n        let y_bytes: [u8; 32] = y.to_le_bytes();\n        let mut x_is_lt = false;\n        let mut done = false;\n        for i in 0..32 {\n            if (!done) {\n                let x_byte = x_bytes[32 - 1 - i] as u8;\n                let y_byte = y_bytes[32 - 1 - i] as u8;\n                let bytes_match = x_byte == y_byte;\n                if !bytes_match {\n                    x_is_lt = x_byte < y_byte;\n                    done = true;\n                }\n            }\n        }\n        x_is_lt\n    }\n}\n\nmod tests {\n    use crate::{panic::panic, runtime, static_assert};\n    use super::{\n        field_less_than, modulus_be_bits, modulus_be_bytes, modulus_le_bits, modulus_le_bytes,\n    };\n\n    #[test]\n    // docs:start:to_be_bits_example\n    fn test_to_be_bits() {\n        let field = 2;\n        let bits: [u1; 8] = field.to_be_bits();\n        assert_eq(bits, [0, 0, 0, 0, 0, 0, 1, 0]);\n    }\n    // docs:end:to_be_bits_example\n\n    #[test]\n    // docs:start:to_le_bits_example\n    fn test_to_le_bits() {\n        let field = 2;\n        let bits: [u1; 8] = field.to_le_bits();\n        assert_eq(bits, [0, 1, 0, 0, 0, 0, 0, 0]);\n    }\n    // docs:end:to_le_bits_example\n\n    #[test]\n    // docs:start:to_be_bytes_example\n    fn test_to_be_bytes() {\n        let field = 2;\n        let bytes: [u8; 8] = field.to_be_bytes();\n        assert_eq(bytes, [0, 0, 0, 0, 0, 0, 0, 2]);\n        assert_eq(Field::from_be_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_be_bytes_example\n\n    #[test]\n    // docs:start:to_le_bytes_example\n    fn test_to_le_bytes() {\n        let field = 2;\n        let bytes: [u8; 8] = field.to_le_bytes();\n        assert_eq(bytes, [2, 0, 0, 0, 0, 0, 0, 0]);\n        assert_eq(Field::from_le_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_le_bytes_example\n\n    #[test]\n    // docs:start:to_be_radix_example\n    fn test_to_be_radix() {\n        // 259, in base 256, big endian, is [1, 3].\n        // i.e. 3 * 256^0 + 1 * 256^1\n        let field = 259;\n\n        // The radix (in this example, 256) must be a power of 2.\n        // The length of the returned byte array can be specified to be\n        // >= the amount of space needed.\n        let bytes: [u8; 8] = field.to_be_radix(256);\n        assert_eq(bytes, [0, 0, 0, 0, 0, 0, 1, 3]);\n        assert_eq(Field::from_be_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_be_radix_example\n\n    #[test]\n    // docs:start:to_le_radix_example\n    fn test_to_le_radix() {\n        // 259, in base 256, little endian, is [3, 1].\n        // i.e. 3 * 256^0 + 1 * 256^1\n        let field = 259;\n\n        // The radix (in this example, 256) must be a power of 2.\n        // The length of the returned byte array can be specified to be\n        // >= the amount of space needed.\n        let bytes: [u8; 8] = field.to_le_radix(256);\n        assert_eq(bytes, [3, 1, 0, 0, 0, 0, 0, 0]);\n        assert_eq(Field::from_le_bytes::<8>(bytes), field);\n    }\n    // docs:end:to_le_radix_example\n\n    #[test(should_fail_with = \"radix must be greater than 1\")]\n    fn test_to_le_radix_1() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 2;\n            let _: [u8; 8] = field.to_le_radix(1);\n        } else {\n            panic(\"radix must be greater than 1\");\n        }\n    }\n\n    // Updated test to account for Brillig restriction that radix must be greater than 2\n    #[test(should_fail_with = \"radix must be greater than 1\")]\n    fn test_to_le_radix_brillig_1() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 1;\n            let _: [u8; 8] = field.to_le_radix(1);\n        } else {\n            panic(\"radix must be greater than 1\");\n        }\n    }\n\n    #[test(should_fail_with = \"radix must be a power of 2\")]\n    fn test_to_le_radix_3() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 2;\n            let _: [u8; 8] = field.to_le_radix(3);\n        } else {\n            panic(\"radix must be a power of 2\");\n        }\n    }\n\n    #[test]\n    fn test_to_le_radix_brillig_3() {\n        // this test should only fail in constrained mode\n        if runtime::is_unconstrained() {\n            let field = 1;\n            let out: [u8; 8] = field.to_le_radix(3);\n            let mut expected = [0; 8];\n            expected[0] = 1;\n            assert(out == expected, \"unexpected result\");\n        }\n    }\n\n    #[test(should_fail_with = \"radix must be less than or equal to 256\")]\n    fn test_to_le_radix_512() {\n        // this test should only fail in constrained mode\n        if !runtime::is_unconstrained() {\n            let field = 2;\n            let _: [u8; 8] = field.to_le_radix(512);\n        } else {\n            panic(\"radix must be less than or equal to 256\")\n        }\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 16 limbs\")]\n    unconstrained fn not_enough_limbs_brillig() {\n        let _: [u8; 16] = 0x100000000000000000000000000000000.to_le_bytes();\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 16 limbs\")]\n    fn not_enough_limbs() {\n        let _: [u8; 16] = 0x100000000000000000000000000000000.to_le_bytes();\n    }\n\n    #[test]\n    unconstrained fn test_field_less_than() {\n        assert(field_less_than(0, 1));\n        assert(field_less_than(0, 0x100));\n        assert(field_less_than(0x100, 0 - 1));\n        assert(!field_less_than(0 - 1, 0));\n    }\n\n    #[test]\n    unconstrained fn test_large_field_values_unconstrained() {\n        let large_field = 0xffffffffffffffff;\n\n        let bits: [u1; 64] = large_field.to_le_bits();\n        assert_eq(bits[0], 1);\n\n        let bytes: [u8; 8] = large_field.to_le_bytes();\n        assert_eq(Field::from_le_bytes::<8>(bytes), large_field);\n\n        let radix_bytes: [u8; 8] = large_field.to_le_radix(256);\n        assert_eq(Field::from_le_bytes::<8>(radix_bytes), large_field);\n    }\n\n    #[test]\n    fn test_large_field_values() {\n        let large_val = 0xffffffffffffffff;\n\n        let bits: [u1; 64] = large_val.to_le_bits();\n        assert_eq(bits[0], 1);\n\n        let bytes: [u8; 8] = large_val.to_le_bytes();\n        assert_eq(Field::from_le_bytes::<8>(bytes), large_val);\n\n        let radix_bytes: [u8; 8] = large_val.to_le_radix(256);\n        assert_eq(Field::from_le_bytes::<8>(radix_bytes), large_val);\n    }\n\n    #[test]\n    fn test_decomposition_edge_cases() {\n        let zero_bits: [u1; 8] = 0.to_le_bits();\n        assert_eq(zero_bits, [0; 8]);\n\n        let zero_bytes: [u8; 8] = 0.to_le_bytes();\n        assert_eq(zero_bytes, [0; 8]);\n\n        let one_bits: [u1; 8] = 1.to_le_bits();\n        let expected: [u1; 8] = [1, 0, 0, 0, 0, 0, 0, 0];\n        assert_eq(one_bits, expected);\n\n        let pow2_bits: [u1; 8] = 4.to_le_bits();\n        let expected: [u1; 8] = [0, 0, 1, 0, 0, 0, 0, 0];\n        assert_eq(pow2_bits, expected);\n    }\n\n    #[test]\n    fn test_pow_32() {\n        assert_eq(2.pow_32(3), 8);\n        assert_eq(3.pow_32(2), 9);\n        assert_eq(5.pow_32(0), 1);\n        assert_eq(7.pow_32(1), 7);\n\n        assert_eq(2.pow_32(10), 1024);\n\n        assert_eq(0.pow_32(5), 0);\n        assert_eq(0.pow_32(0), 1);\n\n        assert_eq(1.pow_32(100), 1);\n    }\n\n    #[test]\n    fn test_sgn0() {\n        assert_eq(0.sgn0(), 0);\n        assert_eq(2.sgn0(), 0);\n        assert_eq(4.sgn0(), 0);\n        assert_eq(100.sgn0(), 0);\n\n        assert_eq(1.sgn0(), 1);\n        assert_eq(3.sgn0(), 1);\n        assert_eq(5.sgn0(), 1);\n        assert_eq(101.sgn0(), 1);\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 8 limbs\")]\n    fn test_bit_decomposition_overflow() {\n        // 8 bits can't represent large field values\n        let large_val = 0x1000000000000000;\n        let _: [u1; 8] = large_val.to_le_bits();\n    }\n\n    #[test(should_fail_with = \"Field failed to decompose into specified 4 limbs\")]\n    fn test_byte_decomposition_overflow() {\n        // 4 bytes can't represent large field values\n        let large_val = 0x1000000000000000;\n        let _: [u8; 4] = large_val.to_le_bytes();\n    }\n\n    #[test]\n    fn test_to_from_be_bytes_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this byte produces the expected 32 BE bytes for (modulus - 1)\n            let mut p_minus_1_bytes: [u8; 32] = modulus_be_bytes().as_array();\n            assert(p_minus_1_bytes[32 - 1] > 0);\n            p_minus_1_bytes[32 - 1] -= 1;\n\n            let p_minus_1 = Field::from_be_bytes::<32>(p_minus_1_bytes);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 32 BE bytes produces the same bytes\n            let p_minus_1_converted_bytes: [u8; 32] = p_minus_1.to_be_bytes();\n            assert_eq(p_minus_1_converted_bytes, p_minus_1_bytes);\n\n            // checking that incrementing this byte produces 32 BE bytes for (modulus + 1)\n            let mut p_plus_1_bytes: [u8; 32] = modulus_be_bytes().as_array();\n            assert(p_plus_1_bytes[32 - 1] < 255);\n            p_plus_1_bytes[32 - 1] += 1;\n\n            let p_plus_1 = Field::from_be_bytes::<32>(p_plus_1_bytes);\n            assert_eq(p_plus_1, 1);\n\n            // checking that converting p_plus_1 to 32 BE bytes produces the same\n            // byte set to 1 as p_plus_1_bytes and otherwise zeroes\n            let mut p_plus_1_converted_bytes: [u8; 32] = p_plus_1.to_be_bytes();\n            assert_eq(p_plus_1_converted_bytes[32 - 1], 1);\n            p_plus_1_converted_bytes[32 - 1] = 0;\n            assert_eq(p_plus_1_converted_bytes, [0; 32]);\n\n            // checking that Field::from_be_bytes::<32> on the Field modulus produces 0\n            assert_eq(modulus_be_bytes().len(), 32);\n            let p = Field::from_be_bytes::<32>(modulus_be_bytes().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 32 BE bytes produces 32 zeroes\n            let p_bytes: [u8; 32] = 0.to_be_bytes();\n            assert_eq(p_bytes, [0; 32]);\n        }\n    }\n\n    #[test]\n    fn test_to_from_le_bytes_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this byte produces the expected 32 LE bytes for (modulus - 1)\n            let mut p_minus_1_bytes: [u8; 32] = modulus_le_bytes().as_array();\n            assert(p_minus_1_bytes[0] > 0);\n            p_minus_1_bytes[0] -= 1;\n\n            let p_minus_1 = Field::from_le_bytes::<32>(p_minus_1_bytes);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 32 BE bytes produces the same bytes\n            let p_minus_1_converted_bytes: [u8; 32] = p_minus_1.to_le_bytes();\n            assert_eq(p_minus_1_converted_bytes, p_minus_1_bytes);\n\n            // checking that incrementing this byte produces 32 LE bytes for (modulus + 1)\n            let mut p_plus_1_bytes: [u8; 32] = modulus_le_bytes().as_array();\n            assert(p_plus_1_bytes[0] < 255);\n            p_plus_1_bytes[0] += 1;\n\n            let p_plus_1 = Field::from_le_bytes::<32>(p_plus_1_bytes);\n            assert_eq(p_plus_1, 1);\n\n            // checking that converting p_plus_1 to 32 LE bytes produces the same\n            // byte set to 1 as p_plus_1_bytes and otherwise zeroes\n            let mut p_plus_1_converted_bytes: [u8; 32] = p_plus_1.to_le_bytes();\n            assert_eq(p_plus_1_converted_bytes[0], 1);\n            p_plus_1_converted_bytes[0] = 0;\n            assert_eq(p_plus_1_converted_bytes, [0; 32]);\n\n            // checking that Field::from_le_bytes::<32> on the Field modulus produces 0\n            assert_eq(modulus_le_bytes().len(), 32);\n            let p = Field::from_le_bytes::<32>(modulus_le_bytes().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 32 LE bytes produces 32 zeroes\n            let p_bytes: [u8; 32] = 0.to_le_bytes();\n            assert_eq(p_bytes, [0; 32]);\n        }\n    }\n\n    /// Convert a little endian bit array to a field element.\n    /// If the provided bit array overflows the field modulus then the Field will silently wrap around.\n    fn from_le_bits<let N: u32>(bits: [u1; N]) -> Field {\n        static_assert(\n            N <= modulus_le_bits().len(),\n            \"N must be less than or equal to modulus_le_bits().len()\",\n        );\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bits[i] as Field) * v;\n            v = v * 2;\n        }\n        result\n    }\n\n    /// Convert a big endian bit array to a field element.\n    /// If the provided bit array overflows the field modulus then the Field will silently wrap around.\n    fn from_be_bits<let N: u32>(bits: [u1; N]) -> Field {\n        let mut v = 1;\n        let mut result = 0;\n\n        for i in 0..N {\n            result += (bits[N - 1 - i] as Field) * v;\n            v = v * 2;\n        }\n        result\n    }\n\n    #[test]\n    fn test_to_from_be_bits_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this bit produces the expected 254 BE bits for (modulus - 1)\n            let mut p_minus_1_bits: [u1; 254] = modulus_be_bits().as_array();\n            assert(p_minus_1_bits[254 - 1] > 0);\n            p_minus_1_bits[254 - 1] -= 1;\n\n            let p_minus_1 = from_be_bits::<254>(p_minus_1_bits);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 254 BE bits produces the same bits\n            let p_minus_1_converted_bits: [u1; 254] = p_minus_1.to_be_bits();\n            assert_eq(p_minus_1_converted_bits, p_minus_1_bits);\n\n            // checking that incrementing this bit produces 254 BE bits for (modulus + 4)\n            let mut p_plus_4_bits: [u1; 254] = modulus_be_bits().as_array();\n            assert(p_plus_4_bits[254 - 3] < 1);\n            p_plus_4_bits[254 - 3] += 1;\n\n            let p_plus_4 = from_be_bits::<254>(p_plus_4_bits);\n            assert_eq(p_plus_4, 4);\n\n            // checking that converting p_plus_4 to 254 BE bits produces the same\n            // bit set to 1 as p_plus_4_bits and otherwise zeroes\n            let mut p_plus_4_converted_bits: [u1; 254] = p_plus_4.to_be_bits();\n            assert_eq(p_plus_4_converted_bits[254 - 3], 1);\n            p_plus_4_converted_bits[254 - 3] = 0;\n            assert_eq(p_plus_4_converted_bits, [0; 254]);\n\n            // checking that Field::from_be_bits::<254> on the Field modulus produces 0\n            assert_eq(modulus_be_bits().len(), 254);\n            let p = from_be_bits::<254>(modulus_be_bits().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 254 BE bytes produces 254 zeroes\n            let p_bits: [u1; 254] = 0.to_be_bits();\n            assert_eq(p_bits, [0; 254]);\n        }\n    }\n\n    #[test]\n    fn test_to_from_le_bits_bn254_edge_cases() {\n        if crate::compat::is_bn254() {\n            // checking that decrementing this bit produces the expected 254 LE bits for (modulus - 1)\n            let mut p_minus_1_bits: [u1; 254] = modulus_le_bits().as_array();\n            assert(p_minus_1_bits[0] > 0);\n            p_minus_1_bits[0] -= 1;\n\n            let p_minus_1 = from_le_bits::<254>(p_minus_1_bits);\n            assert_eq(p_minus_1 + 1, 0);\n\n            // checking that converting (modulus - 1) from and then to 254 BE bits produces the same bits\n            let p_minus_1_converted_bits: [u1; 254] = p_minus_1.to_le_bits();\n            assert_eq(p_minus_1_converted_bits, p_minus_1_bits);\n\n            // checking that incrementing this bit produces 254 LE bits for (modulus + 4)\n            let mut p_plus_4_bits: [u1; 254] = modulus_le_bits().as_array();\n            assert(p_plus_4_bits[2] < 1);\n            p_plus_4_bits[2] += 1;\n\n            let p_plus_4 = from_le_bits::<254>(p_plus_4_bits);\n            assert_eq(p_plus_4, 4);\n\n            // checking that converting p_plus_4 to 254 LE bits produces the same\n            // bit set to 1 as p_plus_4_bits and otherwise zeroes\n            let mut p_plus_4_converted_bits: [u1; 254] = p_plus_4.to_le_bits();\n            assert_eq(p_plus_4_converted_bits[2], 1);\n            p_plus_4_converted_bits[2] = 0;\n            assert_eq(p_plus_4_converted_bits, [0; 254]);\n\n            // checking that Field::from_le_bits::<254> on the Field modulus produces 0\n            assert_eq(modulus_le_bits().len(), 254);\n            let p = from_le_bits::<254>(modulus_le_bits().as_array());\n            assert_eq(p, 0);\n\n            // checking that converting 0 to 254 LE bytes produces 254 zeroes\n            let p_bits: [u1; 254] = 0.to_le_bits();\n            assert_eq(p_bits, [0; 254]);\n        }\n    }\n}\n"
     },
-    "172": {
+    "170": {
       "function_locations": [
         {
           "name": "aes128_decrypt_oracle",
@@ -3917,7 +3865,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/aes128_decrypt.nr",
       "source": "#[oracle(aztec_utl_decryptAes128)]\nunconstrained fn aes128_decrypt_oracle<let N: u32>(\n    ciphertext: BoundedVec<u8, N>,\n    iv: [u8; 16],\n    sym_key: [u8; 16],\n) -> Option<BoundedVec<u8, N>> {}\n\n/// Attempts to decrypt a ciphertext using AES128.\n///\n/// Returns `Option::some(plaintext)` on success, or `Option::none()` if decryption fails (e.g. due to malformed\n/// ciphertext or invalid PKCS#7 padding). Note that decryption with the wrong key will almost always return `None`\n/// because the decrypted garbage data will have invalid PKCS#7 padding.\n///\n/// Note that we accept ciphertext as a BoundedVec, not as an array. This is because this function is typically used\n/// when processing logs and at that point we don't have comptime information about the length of the ciphertext as\n/// the log is not specific to any individual note.\n// TODO(F-498): review naming consistency\npub unconstrained fn try_aes128_decrypt<let N: u32>(\n    ciphertext: BoundedVec<u8, N>,\n    iv: [u8; 16],\n    sym_key: [u8; 16],\n) -> Option<BoundedVec<u8, N>> {\n    aes128_decrypt_oracle(ciphertext, iv, sym_key)\n}\n\nmod test {\n    use crate::{\n        keys::ecdh_shared_secret::compute_app_siloed_shared_secret,\n        messages::encryption::aes128::derive_aes_symmetric_key_and_iv_from_shared_secret,\n        utils::{array::subarray::subarray, point::point_from_x_coord},\n    };\n    use crate::protocol::address::AztecAddress;\n    use crate::test::helpers::test_environment::TestEnvironment;\n    use super::try_aes128_decrypt;\n    use std::aes128::aes128_encrypt;\n\n    global CONTRACT_ADDRESS: AztecAddress = AztecAddress { inner: 42 };\n    global TEST_PLAINTEXT_LENGTH: u32 = 10;\n    global TEST_CIPHERTEXT_LENGTH: u32 = 16;\n    global TEST_PADDING_LENGTH: u32 = TEST_CIPHERTEXT_LENGTH - TEST_PLAINTEXT_LENGTH;\n\n    #[test]\n    unconstrained fn aes_encrypt_then_decrypt() {\n        let env = TestEnvironment::new();\n\n        env.utility_context(|_| {\n            let shared_secret_point = point_from_x_coord(1).unwrap();\n            let s_app = compute_app_siloed_shared_secret(shared_secret_point, CONTRACT_ADDRESS);\n\n            let (sym_key, iv) = derive_aes_symmetric_key_and_iv_from_shared_secret::<1>(s_app)[0];\n\n            let plaintext: [u8; TEST_PLAINTEXT_LENGTH] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];\n\n            let ciphertext: [u8; TEST_CIPHERTEXT_LENGTH] = aes128_encrypt(plaintext, iv, sym_key);\n\n            let ciphertext_bvec = BoundedVec::<u8, TEST_CIPHERTEXT_LENGTH>::from_array(ciphertext);\n\n            let received_plaintext = try_aes128_decrypt(ciphertext_bvec, iv, sym_key).unwrap();\n            assert_eq(received_plaintext.len(), TEST_PLAINTEXT_LENGTH);\n            assert_eq(received_plaintext.max_len(), TEST_CIPHERTEXT_LENGTH);\n            assert_eq(subarray::<_, _, TEST_PLAINTEXT_LENGTH>(received_plaintext.storage(), 0), plaintext);\n            assert_eq(\n                subarray::<_, _, TEST_PADDING_LENGTH>(received_plaintext.storage(), TEST_PLAINTEXT_LENGTH),\n                [0 as u8; TEST_PADDING_LENGTH],\n            );\n        })\n    }\n\n    #[test]\n    unconstrained fn aes_encrypt_then_decrypt_with_bad_sym_key_is_caught() {\n        let env = TestEnvironment::new();\n\n        env.utility_context(|_| {\n            // Decrypting with the wrong key results in garbage data with invalid PKCS#7 padding,\n            // so the oracle returns None.\n            let shared_secret_point = point_from_x_coord(1).unwrap();\n            let s_app = compute_app_siloed_shared_secret(shared_secret_point, CONTRACT_ADDRESS);\n\n            let (sym_key, iv) = derive_aes_symmetric_key_and_iv_from_shared_secret::<1>(s_app)[0];\n\n            let plaintext: [u8; TEST_PLAINTEXT_LENGTH] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];\n            let ciphertext: [u8; TEST_CIPHERTEXT_LENGTH] = aes128_encrypt(plaintext, iv, sym_key);\n\n            let mut bad_sym_key = sym_key;\n            bad_sym_key[0] = 0;\n\n            let ciphertext_bvec = BoundedVec::<u8, TEST_CIPHERTEXT_LENGTH>::from_array(ciphertext);\n            // Decryption with wrong key returns None because the garbage output has invalid PKCS#7 padding.\n            let result = try_aes128_decrypt(ciphertext_bvec, iv, bad_sym_key);\n            assert(result.is_none(), \"decryption with bad key should return None\");\n        });\n    }\n}\n"
     },
-    "174": {
+    "172": {
       "function_locations": [
         {
           "name": "address",
@@ -4155,7 +4103,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/avm.nr",
       "source": "//! AVM oracles.\n//!\n//! There are only available during public execution. Calling any of them from a private or utility function will\n//! result in runtime errors.\n\nuse crate::protocol::address::{AztecAddress, EthAddress};\n\npub unconstrained fn address() -> AztecAddress {\n    address_opcode()\n}\npub unconstrained fn sender() -> AztecAddress {\n    sender_opcode()\n}\npub unconstrained fn transaction_fee() -> Field {\n    transaction_fee_opcode()\n}\npub unconstrained fn chain_id() -> Field {\n    chain_id_opcode()\n}\npub unconstrained fn version() -> Field {\n    version_opcode()\n}\npub unconstrained fn block_number() -> u32 {\n    block_number_opcode()\n}\npub unconstrained fn timestamp() -> u64 {\n    timestamp_opcode()\n}\npub unconstrained fn min_fee_per_l2_gas() -> u128 {\n    min_fee_per_l2_gas_opcode()\n}\npub unconstrained fn min_fee_per_da_gas() -> u128 {\n    min_fee_per_da_gas_opcode()\n}\npub unconstrained fn l2_gas_left() -> u32 {\n    l2_gas_left_opcode()\n}\npub unconstrained fn da_gas_left() -> u32 {\n    da_gas_left_opcode()\n}\npub unconstrained fn is_static_call() -> u1 {\n    is_static_call_opcode()\n}\npub unconstrained fn note_hash_exists(note_hash: Field, leaf_index: u64) -> u1 {\n    note_hash_exists_opcode(note_hash, leaf_index)\n}\npub unconstrained fn emit_note_hash(note_hash: Field) {\n    emit_note_hash_opcode(note_hash)\n}\npub unconstrained fn nullifier_exists(siloed_nullifier: Field) -> u1 {\n    nullifier_exists_opcode(siloed_nullifier)\n}\npub unconstrained fn emit_nullifier(nullifier: Field) {\n    emit_nullifier_opcode(nullifier)\n}\npub unconstrained fn emit_public_log(message: [Field]) {\n    emit_public_log_opcode(message)\n}\npub unconstrained fn l1_to_l2_msg_exists(msg_hash: Field, msg_leaf_index: u64) -> u1 {\n    l1_to_l2_msg_exists_opcode(msg_hash, msg_leaf_index)\n}\npub unconstrained fn send_l2_to_l1_msg(recipient: EthAddress, content: Field) {\n    send_l2_to_l1_msg_opcode(recipient, content)\n}\n\npub unconstrained fn call<let N: u32>(\n    l2_gas_allocation: u32,\n    da_gas_allocation: u32,\n    address: AztecAddress,\n    args: [Field; N],\n) {\n    call_opcode(l2_gas_allocation, da_gas_allocation, address, N, args)\n}\n\npub unconstrained fn call_static<let N: u32>(\n    l2_gas_allocation: u32,\n    da_gas_allocation: u32,\n    address: AztecAddress,\n    args: [Field; N],\n) {\n    call_static_opcode(l2_gas_allocation, da_gas_allocation, address, N, args)\n}\n\npub unconstrained fn calldata_copy<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {\n    calldata_copy_opcode(cdoffset, copy_size)\n}\n\n/// `success_copy` is placed immediately after the CALL opcode to get the success value\npub unconstrained fn success_copy() -> bool {\n    success_copy_opcode()\n}\n\npub unconstrained fn returndata_size() -> u32 {\n    returndata_size_opcode()\n}\n\npub unconstrained fn returndata_copy(rdoffset: u32, copy_size: u32) -> [Field] {\n    returndata_copy_opcode(rdoffset, copy_size)\n}\n\n/// The additional prefix is to avoid clashing with the `return` Noir keyword.\npub unconstrained fn avm_return(returndata: [Field]) {\n    return_opcode(returndata)\n}\n\n/// This opcode reverts using the exact data given. In general it should only be used to do rethrows, where the revert\n/// data is the same as the original revert data. For normal reverts, use Noir's `assert` which, on top of reverting,\n/// will also add an error selector to the revert data.\npub unconstrained fn revert(revertdata: [Field]) {\n    revert_opcode(revertdata)\n}\n\npub unconstrained fn storage_read(storage_slot: Field, contract_address: Field) -> Field {\n    storage_read_opcode(storage_slot, contract_address)\n}\n\npub unconstrained fn storage_write(storage_slot: Field, value: Field) {\n    storage_write_opcode(storage_slot, value);\n}\n\n#[oracle(aztec_avm_address)]\nunconstrained fn address_opcode() -> AztecAddress {}\n\n#[oracle(aztec_avm_sender)]\nunconstrained fn sender_opcode() -> AztecAddress {}\n\n#[oracle(aztec_avm_transactionFee)]\nunconstrained fn transaction_fee_opcode() -> Field {}\n\n#[oracle(aztec_avm_chainId)]\nunconstrained fn chain_id_opcode() -> Field {}\n\n#[oracle(aztec_avm_version)]\nunconstrained fn version_opcode() -> Field {}\n\n#[oracle(aztec_avm_blockNumber)]\nunconstrained fn block_number_opcode() -> u32 {}\n\n#[oracle(aztec_avm_timestamp)]\nunconstrained fn timestamp_opcode() -> u64 {}\n\n#[oracle(aztec_avm_minFeePerL2Gas)]\nunconstrained fn min_fee_per_l2_gas_opcode() -> u128 {}\n\n#[oracle(aztec_avm_minFeePerDaGas)]\nunconstrained fn min_fee_per_da_gas_opcode() -> u128 {}\n\n#[oracle(aztec_avm_l2GasLeft)]\nunconstrained fn l2_gas_left_opcode() -> u32 {}\n\n#[oracle(aztec_avm_daGasLeft)]\nunconstrained fn da_gas_left_opcode() -> u32 {}\n\n#[oracle(aztec_avm_isStaticCall)]\nunconstrained fn is_static_call_opcode() -> u1 {}\n\n#[oracle(aztec_avm_noteHashExists)]\nunconstrained fn note_hash_exists_opcode(note_hash: Field, leaf_index: u64) -> u1 {}\n\n#[oracle(aztec_avm_emitNoteHash)]\nunconstrained fn emit_note_hash_opcode(note_hash: Field) {}\n\n#[oracle(aztec_avm_nullifierExists)]\nunconstrained fn nullifier_exists_opcode(siloed_nullifier: Field) -> u1 {}\n\n#[oracle(aztec_avm_emitNullifier)]\nunconstrained fn emit_nullifier_opcode(nullifier: Field) {}\n\n#[oracle(aztec_avm_emitPublicLog)]\nunconstrained fn emit_public_log_opcode(message: [Field]) {}\n\n#[oracle(aztec_avm_l1ToL2MsgExists)]\nunconstrained fn l1_to_l2_msg_exists_opcode(msg_hash: Field, msg_leaf_index: u64) -> u1 {}\n\n#[oracle(aztec_avm_sendL2ToL1Msg)]\nunconstrained fn send_l2_to_l1_msg_opcode(recipient: EthAddress, content: Field) {}\n\n#[oracle(aztec_avm_calldataCopy)]\nunconstrained fn calldata_copy_opcode<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {}\n\n#[oracle(aztec_avm_returndataSize)]\nunconstrained fn returndata_size_opcode() -> u32 {}\n\n#[oracle(aztec_avm_returndataCopy)]\nunconstrained fn returndata_copy_opcode(rdoffset: u32, copy_size: u32) -> [Field] {}\n\n#[oracle(aztec_avm_return)]\nunconstrained fn return_opcode(returndata: [Field]) {}\n\n#[oracle(aztec_avm_revert)]\nunconstrained fn revert_opcode(revertdata: [Field]) {}\n\n// While the length parameter might seem unnecessary given that we have N we keep it around because at the AVM bytecode\n// level, we want to support non-comptime-known lengths for such opcodes, even if Noir code will not generally take\n// that route.\n#[oracle(aztec_avm_call)]\nunconstrained fn call_opcode<let N: u32>(\n    l2_gas_allocation: u32,\n    da_gas_allocation: u32,\n    address: AztecAddress,\n    length: u32,\n    args: [Field; N],\n) {}\n\n// While the length parameter might seem unnecessary given that we have N we keep it around because at the AVM bytecode\n// level, we want to support non-comptime-known lengths for such opcodes, even if Noir code will not generally take\n// that route.\n#[oracle(aztec_avm_staticCall)]\nunconstrained fn call_static_opcode<let N: u32>(\n    l2_gas_allocation: u32,\n    da_gas_allocation: u32,\n    address: AztecAddress,\n    length: u32,\n    args: [Field; N],\n) {}\n\n#[oracle(aztec_avm_successCopy)]\nunconstrained fn success_copy_opcode() -> bool {}\n\n#[oracle(aztec_avm_storageRead)]\nunconstrained fn storage_read_opcode(storage_slot: Field, contract_address: Field) -> Field {}\n\n#[oracle(aztec_avm_storageWrite)]\nunconstrained fn storage_write_opcode(storage_slot: Field, value: Field) {}\n"
     },
-    "176": {
+    "174": {
       "function_locations": [
         {
           "name": "call_private_function_oracle",
@@ -4169,7 +4117,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/call_private_function.nr",
       "source": "use crate::protocol::{abis::function_selector::FunctionSelector, address::AztecAddress, utils::reader::Reader};\n\n#[oracle(aztec_prv_callPrivateFunction)]\nunconstrained fn call_private_function_oracle(\n    _contract_address: AztecAddress,\n    _function_selector: FunctionSelector,\n    _args_hash: Field,\n    _start_side_effect_counter: u32,\n    _is_static_call: bool,\n) -> [Field; 2] {}\n\npub unconstrained fn call_private_function_internal(\n    contract_address: AztecAddress,\n    function_selector: FunctionSelector,\n    args_hash: Field,\n    start_side_effect_counter: u32,\n    is_static_call: bool,\n) -> (u32, Field) {\n    let fields = call_private_function_oracle(\n        contract_address,\n        function_selector,\n        args_hash,\n        start_side_effect_counter,\n        is_static_call,\n    );\n\n    let mut reader = Reader::new(fields);\n    let end_side_effect_counter = reader.read_u32();\n    let returns_hash = reader.read();\n\n    (end_side_effect_counter, returns_hash)\n}\n"
     },
-    "177": {
+    "175": {
       "function_locations": [
         {
           "name": "store",
@@ -4263,7 +4211,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/capsules.nr",
       "source": "use crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Stores arbitrary information in a per-contract non-volatile database, which can later be retrieved with `load`. If\n/// data was already stored at this slot, it is overwritten.\n// TODO(F-498): review naming consistency\npub unconstrained fn store<T>(contract_address: AztecAddress, slot: Field, value: T, scope: AztecAddress)\nwhere\n    T: Serialize,\n{\n    let serialized = value.serialize();\n    set_capsule_oracle(contract_address, slot, serialized, scope);\n}\n\n/// Returns data previously stored via `storeCapsule` in the per-contract non-volatile database. Returns\n/// Option::none() if nothing was stored at the given slot.\n// TODO(F-498): review naming consistency\npub unconstrained fn load<T>(contract_address: AztecAddress, slot: Field, scope: AztecAddress) -> Option<T>\nwhere\n    T: Deserialize,\n{\n    let serialized_option = get_capsule_oracle(contract_address, slot, <T as Deserialize>::N, scope);\n    serialized_option.map(|arr| Deserialize::deserialize(arr))\n}\n\n/// Deletes data in the per-contract non-volatile database. Does nothing if no data was present.\npub unconstrained fn delete(contract_address: AztecAddress, slot: Field, scope: AztecAddress) {\n    delete_oracle(contract_address, slot, scope);\n}\n\n/// Copies a number of contiguous entries in the per-contract non-volatile database. This allows for efficient data\n/// structures by avoiding repeated calls to `loadCapsule` and `storeCapsule`. Supports overlapping source and\n/// destination regions (which will result in the overlapped source values being overwritten). All copied slots must\n/// exist in the database (i.e. have been stored and not deleted)\npub unconstrained fn copy(\n    contract_address: AztecAddress,\n    src_slot: Field,\n    dst_slot: Field,\n    num_entries: u32,\n    scope: AztecAddress,\n) {\n    copy_oracle(contract_address, src_slot, dst_slot, num_entries, scope);\n}\n\n#[oracle(aztec_utl_setCapsule)]\nunconstrained fn set_capsule_oracle<let N: u32>(\n    contract_address: AztecAddress,\n    slot: Field,\n    values: [Field; N],\n    scope: AztecAddress,\n) {}\n\n/// We need to pass in `array_len` (the value of N) as a parameter to tell the oracle how many fields the response must\n/// have.\n///\n/// Note that the oracle returns an Option<[Field; N]> because we cannot return an Option<T> directly. That would\n/// require for the oracle resolver to know the shape of T (e.g. if T were a struct of 3 u32 values then the expected\n/// response shape would be 3 single items, whereas it were a struct containing `u32, [Field;10], u32` then the\n/// expected shape would be single, array, single.). Instead, we return the serialization and deserialize in Noir.\n#[oracle(aztec_utl_getCapsule)]\nunconstrained fn get_capsule_oracle<let N: u32>(\n    contract_address: AztecAddress,\n    slot: Field,\n    array_len: u32,\n    scope: AztecAddress,\n) -> Option<[Field; N]> {}\n\n#[oracle(aztec_utl_deleteCapsule)]\nunconstrained fn delete_oracle(contract_address: AztecAddress, slot: Field, scope: AztecAddress) {}\n\n#[oracle(aztec_utl_copyCapsule)]\nunconstrained fn copy_oracle(\n    contract_address: AztecAddress,\n    src_slot: Field,\n    dst_slot: Field,\n    num_entries: u32,\n    scope: AztecAddress,\n) {}\n\nmod test {\n    // These tests are sort of redundant since we already test the oracle implementation directly in TypeScript, but\n    // they are cheap regardless and help ensure both that the TXE implementation works accordingly and that the Noir\n    // oracles are hooked up correctly.\n\n    use crate::{\n        oracle::capsules::{copy, delete, load, store},\n        test::{helpers::test_environment::TestEnvironment, mocks::MockStruct},\n    };\n    use crate::protocol::{address::AztecAddress, traits::{FromField, ToField}};\n\n    global SLOT: Field = 1;\n\n    unconstrained fn setup() -> (TestEnvironment, AztecAddress) {\n        let mut env = TestEnvironment::new();\n        let scope = env.create_light_account();\n        (env, scope)\n    }\n\n    #[test]\n    unconstrained fn stores_and_loads() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let value = MockStruct::new(5, 6);\n            store(contract_address, SLOT, value, scope);\n\n            assert_eq(load(contract_address, SLOT, scope).unwrap(), value);\n        });\n    }\n\n    #[test]\n    unconstrained fn store_overwrites() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let value = MockStruct::new(5, 6);\n            store(contract_address, SLOT, value, scope);\n\n            let new_value = MockStruct::new(7, 8);\n            store(contract_address, SLOT, new_value, scope);\n\n            assert_eq(load(contract_address, SLOT, scope).unwrap(), new_value);\n        });\n    }\n\n    #[test]\n    unconstrained fn loads_empty_slot() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let loaded_value: Option<MockStruct> = load(contract_address, SLOT, scope);\n            assert_eq(loaded_value, Option::none());\n        });\n    }\n\n    #[test]\n    unconstrained fn deletes_stored_value() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let value = MockStruct::new(5, 6);\n            store(contract_address, SLOT, value, scope);\n            delete(contract_address, SLOT, scope);\n\n            let loaded_value: Option<MockStruct> = load(contract_address, SLOT, scope);\n            assert_eq(loaded_value, Option::none());\n        });\n    }\n\n    #[test]\n    unconstrained fn deletes_empty_slot() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            delete(contract_address, SLOT, scope);\n            let loaded_value: Option<MockStruct> = load(contract_address, SLOT, scope);\n            assert_eq(loaded_value, Option::none());\n        });\n    }\n\n    #[test]\n    unconstrained fn copies_non_overlapping_values() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let src = 5;\n\n            let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n            store(contract_address, src, values[0], scope);\n            store(contract_address, src + 1, values[1], scope);\n            store(contract_address, src + 2, values[2], scope);\n\n            let dst = 10;\n            copy(contract_address, src, dst, 3, scope);\n\n            assert_eq(load(contract_address, dst, scope).unwrap(), values[0]);\n            assert_eq(load(contract_address, dst + 1, scope).unwrap(), values[1]);\n            assert_eq(load(contract_address, dst + 2, scope).unwrap(), values[2]);\n        });\n    }\n\n    #[test]\n    unconstrained fn copies_overlapping_values_with_src_ahead() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let src = 1;\n\n            let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n            store(contract_address, src, values[0], scope);\n            store(contract_address, src + 1, values[1], scope);\n            store(contract_address, src + 2, values[2], scope);\n\n            let dst = 2;\n            copy(contract_address, src, dst, 3, scope);\n\n            assert_eq(load(contract_address, dst, scope).unwrap(), values[0]);\n            assert_eq(load(contract_address, dst + 1, scope).unwrap(), values[1]);\n            assert_eq(load(contract_address, dst + 2, scope).unwrap(), values[2]);\n\n            // src[1] and src[2] should have been overwritten since they are also dst[0] and dst[1]\n            assert_eq(load(contract_address, src, scope).unwrap(), values[0]); // src[0] (unchanged)\n            assert_eq(load(contract_address, src + 1, scope).unwrap(), values[0]); // dst[0]\n            assert_eq(load(contract_address, src + 2, scope).unwrap(), values[1]); // dst[1]\n        });\n    }\n\n    #[test]\n    unconstrained fn copies_overlapping_values_with_dst_ahead() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            let src = 2;\n\n            let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n            store(contract_address, src, values[0], scope);\n            store(contract_address, src + 1, values[1], scope);\n            store(contract_address, src + 2, values[2], scope);\n\n            let dst = 1;\n            copy(contract_address, src, dst, 3, scope);\n\n            assert_eq(load(contract_address, dst, scope).unwrap(), values[0]);\n            assert_eq(load(contract_address, dst + 1, scope).unwrap(), values[1]);\n            assert_eq(load(contract_address, dst + 2, scope).unwrap(), values[2]);\n\n            // src[0] and src[1] should have been overwritten since they are also dst[1] and dst[2]\n            assert_eq(load(contract_address, src, scope).unwrap(), values[1]); // dst[1]\n            assert_eq(load(contract_address, src + 1, scope).unwrap(), values[2]); // dst[2]\n            assert_eq(load(contract_address, src + 2, scope).unwrap(), values[2]); // src[2] (unchanged)\n        });\n    }\n\n    #[test(should_fail_with = \"copy empty slot\")]\n    unconstrained fn cannot_copy_empty_values() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n\n            copy(contract_address, SLOT, SLOT, 1, scope);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_store_other_contract() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            let value = MockStruct::new(5, 6);\n            store(other_contract_address, SLOT, value, scope);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_load_other_contract() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            let _: Option<MockStruct> = load(other_contract_address, SLOT, scope);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_delete_other_contract() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            delete(other_contract_address, SLOT, scope);\n        });\n    }\n\n    #[test(should_fail_with = \"not allowed to access\")]\n    unconstrained fn cannot_copy_other_contract() {\n        let (env, scope) = setup();\n        env.private_context(|context| {\n            let contract_address = context.this_address();\n            let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n            copy(other_contract_address, SLOT, SLOT, 0, scope);\n        });\n    }\n}\n"
     },
-    "178": {
+    "176": {
       "function_locations": [
         {
           "name": "set_contract_sync_cache_invalid_oracle",
@@ -4277,7 +4225,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/contract_sync.nr",
       "source": "use crate::protocol::address::AztecAddress;\n\n#[oracle(aztec_utl_setContractSyncCacheInvalid)]\nunconstrained fn set_contract_sync_cache_invalid_oracle<let N: u32>(\n    contract_address: AztecAddress,\n    scopes: BoundedVec<AztecAddress, N>,\n) {}\n\n/// Forces the PXE to re-sync the given contract for a set of scopes on the next query.\n///\n/// Call this after writing data (e.g. offchain messages) that the contract's `sync_state` function needs to discover.\n/// Without invalidation, the sync cache would skip re-running `sync_state` until the next block.\npub unconstrained fn set_contract_sync_cache_invalid<let N: u32>(\n    contract_address: AztecAddress,\n    scopes: BoundedVec<AztecAddress, N>,\n) {\n    set_contract_sync_cache_invalid_oracle(contract_address, scopes);\n}\n"
     },
-    "179": {
+    "177": {
       "function_locations": [
         {
           "name": "get_utility_context_oracle",
@@ -4291,6 +4239,32 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution.nr",
       "source": "use crate::context::UtilityContext;\n\n#[oracle(aztec_utl_getUtilityContext)]\nunconstrained fn get_utility_context_oracle() -> UtilityContext {}\n\n/// Returns a utility context built from the global variables of anchor block and the contract address of the function\n/// being executed.\npub unconstrained fn get_utility_context() -> UtilityContext {\n    get_utility_context_oracle()\n}\n"
     },
+    "178": {
+      "function_locations": [
+        {
+          "name": "store",
+          "start": 192
+        },
+        {
+          "name": "set_hash_preimage_oracle_wrapper",
+          "start": 583
+        },
+        {
+          "name": "load",
+          "start": 739
+        },
+        {
+          "name": "set_hash_preimage_oracle",
+          "start": 905
+        },
+        {
+          "name": "get_hash_preimage_oracle",
+          "start": 1028
+        }
+      ],
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution_cache.nr",
+      "source": "/// Stores values represented as slice in execution cache to be later obtained by its hash.\n// TODO(F-498): review naming consistency\npub fn store<let N: u32>(values: [Field; N], hash: Field) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n    // call. When loading the values, however, the caller must check that the values are indeed the preimage.\n    unsafe { set_hash_preimage_oracle_wrapper(values, hash) };\n}\n\nunconstrained fn set_hash_preimage_oracle_wrapper<let N: u32>(values: [Field; N], hash: Field) {\n    set_hash_preimage_oracle(values, hash);\n}\n\n// TODO(F-498): review naming consistency\npub unconstrained fn load<let N: u32>(hash: Field) -> [Field; N] {\n    get_hash_preimage_oracle(hash)\n}\n\n#[oracle(aztec_prv_setHashPreimage)]\nunconstrained fn set_hash_preimage_oracle<let N: u32>(_values: [Field; N], _hash: Field) {}\n\n#[oracle(aztec_prv_getHashPreimage)]\nunconstrained fn get_hash_preimage_oracle<let N: u32>(_hash: Field) -> [Field; N] {}\n"
+    },
     "18": {
       "function_locations": [
         {
@@ -4453,33 +4427,7 @@
       "path": "std/hash/mod.nr",
       "source": "// Exposed only for usage in `std::meta`\npub(crate) mod poseidon2;\n\nuse crate::default::Default;\nuse crate::embedded_curve_ops::{\n    EmbeddedCurvePoint, EmbeddedCurveScalar, multi_scalar_mul, multi_scalar_mul_array_return,\n};\nuse crate::meta::derive_via;\nuse crate::static_assert;\n\n/// The size of the state accepted by the backend in `poseidon2_permutation`.\nglobal POSEIDON2_CONFIG_STATE_SIZE: u32 = poseidon2_config_state_size();\n\n#[foreign(sha256_compression)]\n// docs:start:sha256_compression\npub fn sha256_compression(input: [u32; 16], state: [u32; 8]) -> [u32; 8] {}\n// docs:end:sha256_compression\n\n#[foreign(keccakf1600)]\n// docs:start:keccakf1600\npub fn keccakf1600(input: [u64; 25]) -> [u64; 25] {}\n// docs:end:keccakf1600\n\npub mod keccak {\n    #[deprecated(\"This function has been moved to std::hash::keccakf1600\")]\n    pub fn keccakf1600(input: [u64; 25]) -> [u64; 25] {\n        super::keccakf1600(input)\n    }\n}\n\n#[foreign(blake2s)]\n// docs:start:blake2s\npub fn blake2s<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake2s\n{}\n\n// docs:start:blake3\npub fn blake3<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake3\n{\n    if crate::runtime::is_unconstrained() {\n        // Temporary measure while Barretenberg is main proving system.\n        // Please open an issue if you're working on another proving system and running into problems due to this.\n        crate::static_assert(\n            N <= 1024,\n            \"Barretenberg cannot prove blake3 hashes with inputs larger than 1024 bytes\",\n        );\n    }\n    __blake3(input)\n}\n\n#[foreign(blake3)]\nfn __blake3<let N: u32>(input: [u8; N]) -> [u8; 32] {}\n\n// docs:start:pedersen_commitment\npub fn pedersen_commitment<let N: u32>(input: [Field; N]) -> EmbeddedCurvePoint {\n    // docs:end:pedersen_commitment\n    pedersen_commitment_with_separator(input, 0)\n}\n\n#[inline_always]\npub fn pedersen_commitment_with_separator<let N: u32>(\n    input: [Field; N],\n    separator: u32,\n) -> EmbeddedCurvePoint {\n    let mut points = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N];\n    for i in 0..N {\n        // we use the unsafe version because the multi_scalar_mul will constrain the scalars.\n        points[i] = from_field_unsafe(input[i]);\n    }\n    let generators = derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n    multi_scalar_mul(generators, points)\n}\n\n// docs:start:pedersen_hash\npub fn pedersen_hash<let N: u32>(input: [Field; N]) -> Field\n// docs:end:pedersen_hash\n{\n    pedersen_hash_with_separator(input, 0)\n}\n\n#[no_predicates]\npub fn pedersen_hash_with_separator<let N: u32>(input: [Field; N], separator: u32) -> Field {\n    let mut scalars: [EmbeddedCurveScalar; N + 1] = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N + 1];\n    let mut generators: [EmbeddedCurvePoint; N + 1] =\n        [EmbeddedCurvePoint::point_at_infinity(); N + 1];\n    crate::assert_constant(separator);\n    let domain_generators: [EmbeddedCurvePoint; N] =\n        derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n\n    for i in 0..N {\n        scalars[i] = from_field_unsafe(input[i]);\n        generators[i] = domain_generators[i];\n    }\n    scalars[N] = EmbeddedCurveScalar { lo: N as Field, hi: 0 as Field };\n\n    let length_generator: [EmbeddedCurvePoint; 1] =\n        derive_generators(\"pedersen_hash_length\".as_bytes(), 0);\n    generators[N] = length_generator[0];\n    multi_scalar_mul_array_return(generators, scalars)[0].x\n}\n\n#[field(bn254)]\n#[inline_always]\npub fn derive_generators<let N: u32, let M: u32>(\n    domain_separator_bytes: [u8; M],\n    starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {\n    crate::assert_constant(domain_separator_bytes);\n    crate::assert_constant(starting_index);\n    __derive_generators(domain_separator_bytes, starting_index)\n}\n\n#[builtin(derive_pedersen_generators)]\n#[field(bn254)]\nfn __derive_generators<let N: u32, let M: u32>(\n    domain_separator_bytes: [u8; M],\n    starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {}\n\n#[field(bn254)]\n// Decompose the input 'bn254 scalar' into two 128 bits limbs.\n// It is called 'unsafe' because it does not assert the limbs are 128 bits\n// Assuming the limbs are 128 bits:\n// Assert the decomposition does not overflow the field size.\nfn from_field_unsafe(scalar: Field) -> EmbeddedCurveScalar {\n    // Safety: xlo and xhi decomposition is checked below\n    let (xlo, xhi) = unsafe { crate::field::bn254::decompose_hint(scalar) };\n    // Check that the decomposition is correct\n    assert_eq(scalar, xlo + crate::field::bn254::TWO_POW_128 * xhi);\n    // Check that the decomposition does not overflow the field size\n    let (a, b) = if xhi == crate::field::bn254::PHI {\n        (xlo, crate::field::bn254::PLO)\n    } else {\n        (xhi, crate::field::bn254::PHI)\n    };\n    crate::field::bn254::assert_lt(a, b);\n\n    EmbeddedCurveScalar { lo: xlo, hi: xhi }\n}\n\npub fn poseidon2_permutation<let N: u32>(input: [Field; N], state_len: u32) -> [Field; N] {\n    assert_eq(input.len(), state_len);\n\n    static_assert(\n        N == POSEIDON2_CONFIG_STATE_SIZE,\n        f\"the input length must equal the state size in the Poseidon2 config; expected {POSEIDON2_CONFIG_STATE_SIZE}, got {N}\",\n    );\n    poseidon2_permutation_internal(input)\n}\n\n#[foreign(poseidon2_permutation)]\nfn poseidon2_permutation_internal<let N: u32>(input: [Field; N]) -> [Field; N] {}\n\n#[foreign(poseidon2_config_state_size)]\ncomptime fn poseidon2_config_state_size() -> u32 {}\n\n// Generic hashing support.\n// Partially ported and impacted by rust.\n\n// Hash trait shall be implemented per type.\n#[derive_via(derive_hash)]\npub trait Hash {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher;\n}\n\n// docs:start:derive_hash\ncomptime fn derive_hash(s: TypeDefinition) -> Quoted {\n    let name = quote { $crate::hash::Hash };\n    let signature = quote { fn hash<H>(_self: Self, _state: &mut H) where H: $crate::hash::Hasher };\n    let for_each_field = |name| quote { _self.$name.hash(_state); };\n    crate::meta::make_trait_impl(\n        s,\n        name,\n        signature,\n        for_each_field,\n        quote {},\n        |fields| fields,\n    )\n}\n// docs:end:derive_hash\n\n// Hasher trait shall be implemented by algorithms to provide hash-agnostic means.\n// TODO: consider making the types generic here ([u8], [Field], etc.)\npub trait Hasher {\n    fn finish(self) -> Field;\n\n    /// Returns the hash value without consuming the hasher.\n    /// Override this for more efficient implementations that avoid copying.\n    /// TODO: deprecate finish() and replace it\n    fn finish_ref(&self) -> Field {\n        (*self).finish()\n    }\n\n    fn write(&mut self, input: Field);\n}\n\n// BuildHasher is a factory trait, responsible for production of specific Hasher.\npub trait BuildHasher {\n    type H: Hasher;\n\n    fn build_hasher(self) -> H;\n}\n\npub struct BuildHasherDefault<H>;\n\nimpl<H> BuildHasher for BuildHasherDefault<H>\nwhere\n    H: Hasher + Default,\n{\n    type H = H;\n\n    fn build_hasher(_self: Self) -> H {\n        H::default()\n    }\n}\n\nimpl<H> Default for BuildHasherDefault<H>\nwhere\n    H: Hasher + Default,\n{\n    fn default() -> Self {\n        BuildHasherDefault {}\n    }\n}\n\nimpl Hash for Field {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self);\n    }\n}\n\nimpl Hash for u1 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as Field);\n    }\n}\n\nimpl Hash for u8 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as Field);\n    }\n}\n\nimpl Hash for u16 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as Field);\n    }\n}\n\nimpl Hash for u32 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as Field);\n    }\n}\n\nimpl Hash for u64 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as Field);\n    }\n}\n\nimpl Hash for u128 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as Field);\n    }\n}\n\nimpl Hash for i8 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as u8 as Field);\n    }\n}\n\nimpl Hash for i16 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as u16 as Field);\n    }\n}\n\nimpl Hash for i32 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as u32 as Field);\n    }\n}\n\nimpl Hash for i64 {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as u64 as Field);\n    }\n}\n\nimpl Hash for bool {\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        H::write(state, self as Field);\n    }\n}\n\nimpl Hash for () {\n    fn hash<H>(_self: Self, _state: &mut H)\n    where\n        H: Hasher,\n    {}\n}\n\nimpl<T, let N: u32> Hash for [T; N]\nwhere\n    T: Hash,\n{\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        for elem in self {\n            elem.hash(state);\n        }\n    }\n}\n\nimpl<T> Hash for [T]\nwhere\n    T: Hash,\n{\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        self.len().hash(state);\n        for elem in self {\n            elem.hash(state);\n        }\n    }\n}\n\nimpl<A, B> Hash for (A, B)\nwhere\n    A: Hash,\n    B: Hash,\n{\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        self.0.hash(state);\n        self.1.hash(state);\n    }\n}\n\nimpl<A, B, C> Hash for (A, B, C)\nwhere\n    A: Hash,\n    B: Hash,\n    C: Hash,\n{\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        self.0.hash(state);\n        self.1.hash(state);\n        self.2.hash(state);\n    }\n}\n\nimpl<A, B, C, D> Hash for (A, B, C, D)\nwhere\n    A: Hash,\n    B: Hash,\n    C: Hash,\n    D: Hash,\n{\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        self.0.hash(state);\n        self.1.hash(state);\n        self.2.hash(state);\n        self.3.hash(state);\n    }\n}\n\nimpl<A, B, C, D, E> Hash for (A, B, C, D, E)\nwhere\n    A: Hash,\n    B: Hash,\n    C: Hash,\n    D: Hash,\n    E: Hash,\n{\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        self.0.hash(state);\n        self.1.hash(state);\n        self.2.hash(state);\n        self.3.hash(state);\n        self.4.hash(state);\n    }\n}\n\n// Some test vectors for Pedersen hash and Pedersen Commitment.\n// They have been generated using the same functions so the tests are for now useless\n// but they will be useful when we switch to Noir implementation.\n#[test]\nfn assert_pedersen() {\n    assert_eq(\n        pedersen_hash_with_separator([1], 1),\n        0x1b3f4b1a83092a13d8d1a59f7acb62aba15e7002f4440f2275edb99ebbc2305f,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1], 1),\n        EmbeddedCurvePoint {\n            x: 0x054aa86a73cb8a34525e5bbed6e43ba1198e860f5f3950268f71df4591bde402,\n            y: 0x209dcfbf2cfb57f9f6046f44d71ac6faf87254afc7407c04eb621a6287cac126,\n            is_infinite: false,\n        },\n    );\n\n    assert_eq(\n        pedersen_hash_with_separator([1, 2], 2),\n        0x26691c129448e9ace0c66d11f0a16d9014a9e8498ee78f4d69f0083168188255,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2], 2),\n        EmbeddedCurvePoint {\n            x: 0x2e2b3b191e49541fe468ec6877721d445dcaffe41728df0a0eafeb15e87b0753,\n            y: 0x2ff4482400ad3a6228be17a2af33e2bcdf41be04795f9782bd96efe7e24f8778,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3], 3),\n        0x0bc694b7a1f8d10d2d8987d07433f26bd616a2d351bc79a3c540d85b6206dbe4,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3], 3),\n        EmbeddedCurvePoint {\n            x: 0x1fee4e8cf8d2f527caa2684236b07c4b1bad7342c01b0f75e9a877a71827dc85,\n            y: 0x2f9fedb9a090697ab69bf04c8bc15f7385b3e4b68c849c1536e5ae15ff138fd1,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3, 4], 4),\n        0xdae10fb32a8408521803905981a2b300d6a35e40e798743e9322b223a5eddc,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3, 4], 4),\n        EmbeddedCurvePoint {\n            x: 0x07ae3e202811e1fca39c2d81eabe6f79183978e6f12be0d3b8eda095b79bdbc9,\n            y: 0x0afc6f892593db6fbba60f2da558517e279e0ae04f95758587760ba193145014,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3, 4, 5], 5),\n        0xfc375b062c4f4f0150f7100dfb8d9b72a6d28582dd9512390b0497cdad9c22,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3, 4, 5], 5),\n        EmbeddedCurvePoint {\n            x: 0x1754b12bd475a6984a1094b5109eeca9838f4f81ac89c5f0a41dbce53189bb29,\n            y: 0x2da030e3cfcdc7ddad80eaf2599df6692cae0717d4e9f7bfbee8d073d5d278f7,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3, 4, 5, 6], 6),\n        0x1696ed13dc2730062a98ac9d8f9de0661bb98829c7582f699d0273b18c86a572,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6], 6),\n        EmbeddedCurvePoint {\n            x: 0x190f6c0e97ad83e1e28da22a98aae156da083c5a4100e929b77e750d3106a697,\n            y: 0x1f4b60f34ef91221a0b49756fa0705da93311a61af73d37a0c458877706616fb,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7], 7),\n        0x128c0ff144fc66b6cb60eeac8a38e23da52992fc427b92397a7dffd71c45ede3,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7], 7),\n        EmbeddedCurvePoint {\n            x: 0x015441e9d29491b06563fac16fc76abf7a9534c715421d0de85d20dbe2965939,\n            y: 0x1d2575b0276f4e9087e6e07c2cb75aa1baafad127af4be5918ef8a2ef2fea8fc,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8], 8),\n        0x2f960e117482044dfc99d12fece2ef6862fba9242be4846c7c9a3e854325a55c,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8], 8),\n        EmbeddedCurvePoint {\n            x: 0x1657737676968887fceb6dd516382ea13b3a2c557f509811cd86d5d1199bc443,\n            y: 0x1f39f0cb569040105fa1e2f156521e8b8e08261e635a2b210bdc94e8d6d65f77,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9], 9),\n        0x0c96db0790602dcb166cc4699e2d306c479a76926b81c2cb2aaa92d249ec7be7,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9], 9),\n        EmbeddedCurvePoint {\n            x: 0x0a3ceae42d14914a432aa60ec7fded4af7dad7dd4acdbf2908452675ec67e06d,\n            y: 0xfc19761eaaf621ad4aec9a8b2e84a4eceffdba78f60f8b9391b0bd9345a2f2,\n            is_infinite: false,\n        },\n    );\n    assert_eq(\n        pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 10),\n        0x2cd37505871bc460a62ea1e63c7fe51149df5d0801302cf1cbc48beb8dff7e94,\n    );\n    assert_eq(\n        pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 10),\n        EmbeddedCurvePoint {\n            x: 0x2fb3f8b3d41ddde007c8c3c62550f9a9380ee546fcc639ffbb3fd30c8d8de30c,\n            y: 0x300783be23c446b11a4c0fabf6c91af148937cea15fcf5fb054abf7f752ee245,\n            is_infinite: false,\n        },\n    );\n}\n"
     },
-    "180": {
-      "function_locations": [
-        {
-          "name": "store",
-          "start": 192
-        },
-        {
-          "name": "set_hash_preimage_oracle_wrapper",
-          "start": 583
-        },
-        {
-          "name": "load",
-          "start": 739
-        },
-        {
-          "name": "set_hash_preimage_oracle",
-          "start": 905
-        },
-        {
-          "name": "get_hash_preimage_oracle",
-          "start": 1028
-        }
-      ],
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution_cache.nr",
-      "source": "/// Stores values represented as slice in execution cache to be later obtained by its hash.\n// TODO(F-498): review naming consistency\npub fn store<let N: u32>(values: [Field; N], hash: Field) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n    // call. When loading the values, however, the caller must check that the values are indeed the preimage.\n    unsafe { set_hash_preimage_oracle_wrapper(values, hash) };\n}\n\nunconstrained fn set_hash_preimage_oracle_wrapper<let N: u32>(values: [Field; N], hash: Field) {\n    set_hash_preimage_oracle(values, hash);\n}\n\n// TODO(F-498): review naming consistency\npub unconstrained fn load<let N: u32>(hash: Field) -> [Field; N] {\n    get_hash_preimage_oracle(hash)\n}\n\n#[oracle(aztec_prv_setHashPreimage)]\nunconstrained fn set_hash_preimage_oracle<let N: u32>(_values: [Field; N], _hash: Field) {}\n\n#[oracle(aztec_prv_getHashPreimage)]\nunconstrained fn get_hash_preimage_oracle<let N: u32>(_hash: Field) -> [Field; N] {}\n"
-    },
-    "189": {
+    "187": {
       "function_locations": [
         {
           "name": "fetch_tagged_logs",
@@ -4517,7 +4465,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/message_processing.nr",
       "source": "use crate::protocol::address::AztecAddress;\n\n/// Finds new private logs that may have been sent to all registered accounts in PXE in the current contract and makes\n/// them available for later processing in Noir by storing them in a capsule array.\n// TODO(F-498): review naming consistency\npub unconstrained fn fetch_tagged_logs(pending_tagged_log_array_base_slot: Field, scope: AztecAddress) {\n    get_pending_tagged_logs_oracle(pending_tagged_log_array_base_slot, scope);\n}\n\n#[oracle(aztec_utl_getPendingTaggedLogs)]\nunconstrained fn get_pending_tagged_logs_oracle(pending_tagged_log_array_base_slot: Field, scope: AztecAddress) {}\n\n// This must be a single oracle and not one for notes and one for events because the entire point is to validate all\n// notes and events in one go, minimizing node round-trips.\npub(crate) unconstrained fn validate_and_store_enqueued_notes_and_events(\n    contract_address: AztecAddress,\n    note_validation_requests_array_base_slot: Field,\n    event_validation_requests_array_base_slot: Field,\n    max_note_packed_len: Field,\n    max_event_serialized_len: Field,\n    scope: AztecAddress,\n) {\n    validate_and_store_enqueued_notes_and_events_oracle(\n        contract_address,\n        note_validation_requests_array_base_slot,\n        event_validation_requests_array_base_slot,\n        max_note_packed_len,\n        max_event_serialized_len,\n        scope,\n    );\n}\n\n#[oracle(aztec_utl_validateAndStoreEnqueuedNotesAndEvents)]\nunconstrained fn validate_and_store_enqueued_notes_and_events_oracle(\n    contract_address: AztecAddress,\n    note_validation_requests_array_base_slot: Field,\n    event_validation_requests_array_base_slot: Field,\n    max_note_packed_len: Field,\n    max_event_serialized_len: Field,\n    scope: AztecAddress,\n) {}\n\npub(crate) unconstrained fn get_logs_by_tag(\n    contract_address: AztecAddress,\n    log_retrieval_requests_array_base_slot: Field,\n    log_retrieval_responses_array_base_slot: Field,\n    scope: AztecAddress,\n) {\n    get_logs_by_tag_oracle(\n        contract_address,\n        log_retrieval_requests_array_base_slot,\n        log_retrieval_responses_array_base_slot,\n        scope,\n    );\n}\n\n#[oracle(aztec_utl_getLogsByTag)]\nunconstrained fn get_logs_by_tag_oracle(\n    contract_address: AztecAddress,\n    log_retrieval_requests_array_base_slot: Field,\n    log_retrieval_responses_array_base_slot: Field,\n    scope: AztecAddress,\n) {}\n\npub(crate) unconstrained fn get_message_contexts_by_tx_hash(\n    contract_address: AztecAddress,\n    message_context_requests_array_base_slot: Field,\n    message_context_responses_array_base_slot: Field,\n    scope: AztecAddress,\n) {\n    get_message_contexts_by_tx_hash_oracle(\n        contract_address,\n        message_context_requests_array_base_slot,\n        message_context_responses_array_base_slot,\n        scope,\n    );\n}\n\n#[oracle(aztec_utl_getMessageContextsByTxHash)]\nunconstrained fn get_message_contexts_by_tx_hash_oracle(\n    contract_address: AztecAddress,\n    message_context_requests_array_base_slot: Field,\n    message_context_responses_array_base_slot: Field,\n    scope: AztecAddress,\n) {}\n"
     },
-    "192": {
+    "190": {
       "function_locations": [
         {
           "name": "notify_created_nullifier",
@@ -4547,7 +4495,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/nullifiers.nr",
       "source": "//! Nullifier creation, existence checks, etc.\n\nuse crate::protocol::address::aztec_address::AztecAddress;\n\n/// Notifies the simulator that a nullifier has been created, so that its correct status (pending or settled) can be\n/// determined when reading nullifiers in subsequent private function calls. The first non-revertible nullifier emitted\n/// is also used to compute note nonces.\npub fn notify_created_nullifier(inner_nullifier: Field) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n    // call.\n    unsafe { notify_created_nullifier_oracle(inner_nullifier) };\n}\n\n#[oracle(aztec_prv_notifyCreatedNullifier)]\nunconstrained fn notify_created_nullifier_oracle(_inner_nullifier: Field) {}\n\n/// Returns `true` if the nullifier has been emitted in the same transaction, i.e. if [`notify_created_nullifier`] has\n/// been\n/// called for this inner nullifier from the contract with the specified address.\n///\n/// Note that despite sharing pending transaction information with the app, this is not a privacy leak: anyone in the\n/// network can always determine in which transaction a inner nullifier was emitted by a given contract by simply\n/// inspecting transaction effects. What _would_ constitute a leak would be to share the list of inner pending\n/// nullifiers, as that would reveal their preimages.\npub unconstrained fn is_nullifier_pending(inner_nullifier: Field, contract_address: AztecAddress) -> bool {\n    is_nullifier_pending_oracle(inner_nullifier, contract_address)\n}\n\n#[oracle(aztec_prv_isNullifierPending)]\nunconstrained fn is_nullifier_pending_oracle(_inner_nullifier: Field, _contract_address: AztecAddress) -> bool {}\n\n/// Returns `true` if the nullifier exists. Note that a `true` value can be constrained by proving existence of the\n/// nullifier, but a `false` value should not be relied upon since other transactions may emit this nullifier before\n/// the current transaction is included in a block. While this might seem of little use at first, certain design\n/// patterns benefit from this abstraction (see e.g. `PrivateMutable`).\n// TODO(F-498): review naming consistency\npub unconstrained fn check_nullifier_exists(inner_nullifier: Field) -> bool {\n    does_nullifier_exist_oracle(inner_nullifier)\n}\n\n#[oracle(aztec_utl_doesNullifierExist)]\nunconstrained fn does_nullifier_exist_oracle(_inner_nullifier: Field) -> bool {}\n"
     },
-    "193": {
+    "191": {
       "function_locations": [
         {
           "name": "emit_offchain_effect",
@@ -4561,7 +4509,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/offchain_effect.nr",
       "source": "use crate::protocol::traits::Serialize;\n\n/// Emits data that will be delivered to PXE unaltered. This data can be interpreted freely by a downstream consumer\n/// (such as a wallet).\n///\n/// # Arguments\n///\n/// * `data` - The data to emit.\npub unconstrained fn emit_offchain_effect<T>(data: T)\nwhere\n    T: Serialize,\n{\n    emit_offchain_effect_oracle(data.serialize());\n}\n\n#[oracle(aztec_utl_emitOffchainEffect)]\nunconstrained fn emit_offchain_effect_oracle<let N: u32>(data: [Field; N]) {}\n"
     },
-    "194": {
+    "192": {
       "function_locations": [
         {
           "name": "assert_valid_public_call_data",
@@ -4579,7 +4527,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/public_call.nr",
       "source": "/// Validates public calldata by checking that the preimage exists and the cumulative size is within limits.\n///\n/// The check is unconstrained and the only purpose of it is to fail early in case of calldata overflow or a bug in\n/// calldata hashing.\npub(crate) fn assert_valid_public_call_data(calldata_hash: Field) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects (validating the calldata).\n    // It is therefore always safe to call.\n    unsafe {\n        assert_valid_public_call_data_oracle_wrapper(calldata_hash)\n    }\n}\n\nunconstrained fn assert_valid_public_call_data_oracle_wrapper(calldata_hash: Field) {\n    assert_valid_public_call_data_oracle(calldata_hash)\n}\n\n#[oracle(aztec_prv_assertValidPublicCalldata)]\nunconstrained fn assert_valid_public_call_data_oracle(_calldata_hash: Field) {}\n"
     },
-    "196": {
+    "194": {
       "function_locations": [
         {
           "name": "get_shared_secret_oracle",
@@ -4593,7 +4541,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/shared_secret.nr",
       "source": "use crate::protocol::address::aztec_address::AztecAddress;\nuse crate::protocol::point::Point;\n\n#[oracle(aztec_utl_getSharedSecret)]\nunconstrained fn get_shared_secret_oracle(\n    address: AztecAddress,\n    ephPk: Point,\n    contract_address: AztecAddress,\n) -> Field {}\n\n/// Returns an app-siloed shared secret between `address` and someone who knows the secret key behind an ephemeral\n/// public key `ephPk`.\n///\n/// The returned value is a Field `s_app`, computed as:\n///\n/// ```text\n/// S     = address_secret * ephPk          (raw ECDH point)\n/// s_app = h(DOM_SEP, S.x, S.y, contract)  (app-siloed scalar)\n/// ```\n///\n/// where `contract` is the address of the calling contract. The oracle host validates this matches its execution\n/// context.\n///\n/// Without app-siloing, a malicious contract could call this oracle with public information (address, ephPk) and\n/// obtain the same raw secret as the legitimate contract, enabling cross-contract decryption. By including the\n/// contract address in the hash, each contract receives a different `s_app`, preventing this attack.\n///\n/// Callers derive indexed subkeys from `s_app` via\n/// [`derive_shared_secret_subkey`](crate::keys::ecdh_shared_secret::derive_shared_secret_subkey).\npub unconstrained fn get_shared_secret(address: AztecAddress, ephPk: Point, contract_address: AztecAddress) -> Field {\n    get_shared_secret_oracle(address, ephPk, contract_address)\n}\n"
     },
-    "197": {
+    "195": {
       "function_locations": [
         {
           "name": "get_from_public_storage_oracle",
@@ -4611,7 +4559,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/storage.nr",
       "source": "use crate::protocol::{abis::block_header::BlockHeader, address::AztecAddress, traits::{Hash, Packable, ToField}};\n\n#[oracle(aztec_utl_getFromPublicStorage)]\nunconstrained fn get_from_public_storage_oracle<let N: u32>(\n    block_hash: Field,\n    address: Field,\n    storage_slot: Field,\n    length: u32,\n) -> [Field; N] {}\n\n// TODO(F-498): review naming consistency\npub unconstrained fn raw_storage_read<let N: u32>(\n    block_hash_to_read_from: Field,\n    address: AztecAddress,\n    storage_slot: Field,\n) -> [Field; N] {\n    get_from_public_storage_oracle(block_hash_to_read_from, address.to_field(), storage_slot, N)\n}\n\n// TODO(F-498): review naming consistency\npub unconstrained fn storage_read<T>(header_to_read_from: BlockHeader, address: AztecAddress, storage_slot: Field) -> T\nwhere\n    T: Packable,\n{\n    let block_hash_to_read_from = header_to_read_from.hash();\n    T::unpack(\n        raw_storage_read(block_hash_to_read_from, address, storage_slot),\n    )\n}\n"
     },
-    "198": {
+    "196": {
       "function_locations": [
         {
           "name": "notify_revertible_phase_start",
@@ -4637,7 +4585,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/tx_phase.nr",
       "source": "/// Notifies PXE of the side effect counter at which the revertible phase begins.\n///\n/// PXE uses it to classify notes and nullifiers as revertible or non-revertible in its note cache. This information is\n/// then fed to kernels as hints.\npub(crate) fn notify_revertible_phase_start(counter: u32) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n    // call.\n    unsafe { notify_revertible_phase_start_oracle_wrapper(counter) };\n}\n\n/// Returns whether a side effect counter falls in the revertible phase of the transaction.\npub(crate) unconstrained fn is_execution_in_revertible_phase(current_counter: u32) -> bool {\n    is_execution_in_revertible_phase_oracle(current_counter)\n}\n\nunconstrained fn notify_revertible_phase_start_oracle_wrapper(counter: u32) {\n    notify_revertible_phase_start_oracle(counter);\n}\n\n#[oracle(aztec_prv_notifyRevertiblePhaseStart)]\nunconstrained fn notify_revertible_phase_start_oracle(_counter: u32) {}\n\n#[oracle(aztec_prv_isExecutionInRevertiblePhase)]\nunconstrained fn is_execution_in_revertible_phase_oracle(current_counter: u32) -> bool {}\n"
     },
-    "199": {
+    "197": {
       "function_locations": [
         {
           "name": "assert_compatible_oracle_version",
@@ -4663,7 +4611,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/version.nr",
       "source": "/// The ORACLE_VERSION constant is used to check that the oracle interface is in sync between PXE and Aztec.nr. We need\n/// to version the oracle interface to ensure that developers get a reasonable error message if they use incompatible\n/// versions of Aztec.nr and PXE. The TypeScript counterpart is in `oracle_version.ts`.\n///\n/// @dev Whenever a contract function or Noir test is run, the `aztec_utl_assertCompatibleOracleVersion` oracle is\n/// called and if the oracle version is incompatible an error is thrown.\npub global ORACLE_VERSION: Field = 22;\n\n/// Asserts that the version of the oracle is compatible with the version expected by the contract.\npub fn assert_compatible_oracle_version() {\n    // Safety: This oracle call returns nothing: we only call it to check Aztec.nr and Oracle interface versions are\n    // compatible. It is therefore always safe to call.\n    unsafe {\n        assert_compatible_oracle_version_wrapper();\n    }\n}\n\nunconstrained fn assert_compatible_oracle_version_wrapper() {\n    assert_compatible_oracle_version_oracle(ORACLE_VERSION);\n}\n\n#[oracle(aztec_utl_assertCompatibleOracleVersion)]\nunconstrained fn assert_compatible_oracle_version_oracle(version: Field) {}\n\nmod test {\n    use super::{assert_compatible_oracle_version_oracle, ORACLE_VERSION};\n\n    #[test]\n    unconstrained fn compatible_oracle_version() {\n        assert_compatible_oracle_version_oracle(ORACLE_VERSION);\n    }\n\n    #[test(should_fail_with = \"Incompatible aztec cli version:\")]\n    unconstrained fn incompatible_oracle_version() {\n        let arbitrary_incorrect_version = 318183437;\n        assert_compatible_oracle_version_oracle(arbitrary_incorrect_version);\n    }\n}\n"
     },
-    "203": {
+    "201": {
       "function_locations": [
         {
           "name": "<impl StateVariable<1, Context> for Map<K, V, Context>>::new",
@@ -4681,7 +4629,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/state_vars/map.nr",
       "source": "use crate::protocol::{storage::map::derive_storage_slot_in_map, traits::ToField};\nuse crate::state_vars::StateVariable;\n\n/// A key-value container for state variables.\n///\n/// A key-value storage container that maps keys to state variables, similar to Solidity mappings.\n///\n/// `Map` enables you to associate keys (like addresses or other identifiers) with state variables in your Aztec smart\n/// contract. This is conceptually similar to Solidity's `mapping(K => V)` syntax, where you can store and retrieve\n/// values by their associated keys.\n///\n/// You can declare a state variable contained within a Map in your contract's\n/// [`storage`](crate::macros::storage::storage) struct.\n///\n/// For example, you might use `Map<AztecAddress, PublicMutable<FieldNote, Context>, Context>` to track token balances\n/// for different users, similar to how you'd use `mapping(address => uint256)` in Solidity.\n///\n/// > Aside: the verbose `Context` in the declaration is a consequence of > leveraging Noir's regular syntax for\n/// generics to ensure that certain > state variable methods can only be called in some contexts (private, > public,\n/// utility).\n///\n/// The methods of Map are:\n/// - `at` (access state variable for a given key) (see the method's own doc comments for more info).\n///\n/// ## Generic Parameters\n/// - `K`: The key type (must implement `ToField` trait for hashing)\n/// - `V`: The value type:\n/// - any Aztec state variable (variable that implements the StateVariable trait):\n/// - `PublicMutable`\n/// - `PublicImmutable`\n/// - `DelayedPublicMutable`\n/// - `Map`\n/// - `Context`: The execution context (handles private/public function contexts)\n///\n/// ## Usage Maps are typically declared in your contract's [`storage`](crate::macros::storage::storage) struct and accessed using the `at(key)` method to get the state variable for a specific key. The resulting state variable can then be read from or written to using its own methods.\n///\n/// Note that maps cannot be used with owned state variables (variables that implement the OwnedStateVariable trait) -\n/// those need to be wrapped in an `Owned` state variable instead.\n///\n/// ## Advanced Internally, `Map` uses a single base storage slot to represent the mapping itself, similar to Solidity's approach. Individual key-value pairs are stored at derived storage slots computed by hashing the base storage slot with the key using Poseidon2. This ensures:\n/// - No storage slot collisions between different keys\n/// - Uniform distribution of storage slots across the storage space\n/// - Compatibility with Aztec's storage tree structure\n/// - Gas-efficient storage access patterns similar to Solidity mappings\n///\n/// The storage slot derivation uses `derive_storage_slot_in_map(base_slot, key)` which computes\n/// `poseidon2_hash([base_slot, key.to_field()])`, ensuring cryptographically secure slot separation.\n///\n/// docs:start:map\npub struct Map<K, V, Context> {\n    pub context: Context,\n    storage_slot: Field,\n}\n\n// Map reserves a single storage slot regardless of what it stores because nothing is stored at said slot: it is only\n// used to derive the storage slots of nested state variables, which is expected to never result in collisions or slots\n// being close to one another due to these being hashes. This mirrors the strategy adopted by Solidity mappings.\nimpl<K, V, Context> StateVariable<1, Context> for Map<K, V, Context> {\n    fn new(context: Context, storage_slot: Field) -> Self {\n        assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n        Map { context, storage_slot }\n    }\n\n    fn get_storage_slot(self) -> Field {\n        self.storage_slot\n    }\n}\n\nimpl<K, V, Context> Map<K, V, Context> {\n    /// Returns the state variable associated with the given key.\n    ///\n    /// This is equivalent to accessing `mapping[`key`]` in Solidity. It returns the state variable instance for the\n    /// specified key, which can then be used to read or write the value at that key.\n    ///\n    /// Unlike Solidity mappings which return the value directly, this returns the state variable wrapper (like\n    /// PublicMutable, nested Map etc.) that you then call methods on to interact with the actual value.\n    ///\n    /// # Arguments\n    ///\n    /// * `key` - The key to look up in the map. Must implement the ToField trait (which most basic Noir & Aztec types\n    /// do).\n    ///\n    /// # Returns\n    ///\n    /// * `V` - The state variable instance for this key. You can then call methods like `.read()`, `.write()`,\n    /// `.get_note()`, etc. on this depending on the specific state variable type.\n    ///\n    /// # Example\n    ///\n    /// ```noir\n    /// // Get a user's balance (assuming PrivateMutable<FieldNote>)\n    /// let user_balance = self.storage.balances.at(user_address);\n    /// let current_note = user_balance.get_note();\n    ///\n    /// // Update the balance\n    /// user_balance.replace(new_note);\n    /// ```\n    ///\n    pub fn at<let N: u32>(self, key: K) -> V\n    where\n        K: ToField,\n        V: StateVariable<N, Context>,\n    {\n        V::new(\n            self.context,\n            derive_storage_slot_in_map(self.storage_slot, key),\n        )\n    }\n}\n"
     },
-    "216": {
+    "214": {
       "function_locations": [
         {
           "name": "<impl StateVariable<M, Context> for PublicMutable<T, Context>>::new",
@@ -4707,7 +4655,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/state_vars/public_mutable.nr",
       "source": "use crate::context::{PublicContext, UtilityContext};\nuse crate::protocol::traits::Packable;\nuse crate::state_vars::StateVariable;\n\nmod test;\n\n/// Mutable public values.\n///\n/// This is one of the most basic public state variables. It is equivalent to a non-`immutable` non-`constant` Solidity\n/// state variable.\n///\n/// It represents a public value of type `T` that can be written to repeatedly over the lifetime of the contract,\n/// allowing the last value that was written to be read.\n///\n/// ## Access Patterns\n///\n/// A value stored in a `PublicMutable` can be read and written from public contract functions.\n///\n/// It is not possible to read or write a `PublicMutable` from private contract functions. A common pattern is to have\n/// these functions [enqueue a public self\n/// calls](crate::contract_self::ContractSelfPrivate::enqueue) in which the\n/// required operation is performed.\n///\n/// For an immutable variant which can be read from private functions, see\n/// [`PublicImmutable`](crate::state_vars::PublicImmutable).\n///\n/// For a mutable (with restrictions) variant which can be read from private functions see\n/// [`DelayedPublicMutable`](crate::state_vars::DelayedPublicMutable).\n///\n/// ## Privacy\n///\n/// `PublicMutable` provides zero privacy. All write and read operations are public: the entire network can see these\n/// accesses and the data involved.\n///\n/// ## Use Cases\n///\n/// This is suitable for any kind of global state that needs to be accessible by everyone. For example, a token may\n/// have a public total supply, or a voting contract may have public vote tallies.\n///\n/// Note that contracts having public values does not necessarily mean the actions that update these values must\n/// themselves be wholly public. For example, the token could allow for private minting and burning, and casting a vote\n/// could be kept private: these private functions would enqueue a public function that writes to the `PublicMutable`.\n///\n/// Similarly, private functions can enqueue a public call in which the `PublicMutable` is checked to meet some\n/// condition. For example, a private action might be executable only if the vote count has exceeded some threshold, in\n/// which case the private function would enqueue a public function that reads from the `PublicMutable`.\n///\n/// Such patterns preserve the privacy of the account that executed the action, as well as details related to the\n/// private execution itself, but they _do_ reveal that the transaction interacted with the `PublicMutable` value (and\n/// hence that the contract was called), as all accesses to it are public. The\n/// [`only_self`](crate::macros::functions::only_self) attribute is very useful when implementing this.\n///\n/// ## Examples\n///\n/// Declaring a `PublicMutable` in the contract's [`storage`](crate::macros::storage::storage) struct requires\n/// specifying the type `T` that is stored in the variable:\n///\n/// ```noir\n/// #[storage]\n/// struct Storage<C> {\n///     total_supply: PublicMutable<u128, C>,\n///     public_balances: Map<AztecAddress, PublicMutable<u128, C>, C>,\n///\n///     vote_tallies: Map<ElectionId, PublicMutable<u128, C>, C>,\n/// }\n/// ```\n///\n/// ## Requirements\n///\n/// The type `T` stored in the `PublicMutable` must implement the [`Packable`](crate::protocol::traits::Packable)\n/// trait.\n///\n/// ## Implementation Details\n///\n/// Values are packed and stored directly in the public storage tree, with no overhead. A `PublicMutable` therefore\n/// takes up as many storage slots as the packing length of the stored type `T`.\n///\n/// Private reads are not possible because private functions do not have access to the current network state, only the\n/// _past_ state at the anchor block. They _can_ perform historical reads of `PublicMutable` values at past times, but\n/// they have no way to guarantee that the value has not changed since then.\n/// [`PublicImmutable`](crate::state_vars::PublicImmutable) and\n/// [`DelayedPublicMutable`](crate::state_vars::DelayedPublicMutable) are examples of public state variables that _can_\n/// be read privately by restricting mutation.\npub struct PublicMutable<T, Context> {\n    context: Context,\n    storage_slot: Field,\n}\n\nimpl<T, Context, let M: u32> StateVariable<M, Context> for PublicMutable<T, Context>\nwhere\n    T: Packable<N = M>,\n{\n    fn new(context: Context, storage_slot: Field) -> Self {\n        assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n        PublicMutable { context, storage_slot }\n    }\n\n    fn get_storage_slot(self) -> Field {\n        self.storage_slot\n    }\n}\n\nimpl<T> PublicMutable<T, PublicContext> {\n    /// Returns the current value.\n    ///\n    /// If [`write`](PublicMutable::write) has never been called, then this returns the default empty public storage\n    /// value, which is all zeroes - equivalent to `let t = T::unpack(std::mem::zeroed());`.\n    ///\n    /// It is not possible to detect if a `PublicMutable` has ever been initialized or not other than by testing for\n    /// the zero sentinel value. For a more robust solution, store an `Option<T>` in the `PublicMutable`.\n    ///\n    /// ## Examples\n    ///\n    /// A public getter that returns the current value:\n    /// ```noir\n    /// #[external(\"public\")]\n    /// fn get_total_supply() -> u128 {\n    ///     self.storage.total_supply.read()\n    /// }\n    /// ```\n    ///\n    /// An [`only_self`](crate::macros::functions::only_self) helper that asserts a condition a private function\n    /// requires:\n    /// ```noir\n    /// #[external(\"private\")]\n    /// fn execute_proposal(election_id: ElectionId) {\n    ///     self.enqueue_self._assert_vote_passed(election_id);\n    ///\n    ///     // execute the proposal - this remains private\n    /// }\n    ///\n    /// #[external(\"public\")]\n    /// #[only_self]\n    /// fn _assert_vote_passed(election_id: ElectionId) {\n    ///     assert(self.storage.vote_tallies.at(election_id).read() >= VOTE_PASSED_THRESHOLD);\n    /// }\n    /// ```\n    ///\n    /// ## Cost\n    ///\n    /// The `SLOAD` AVM opcode is invoked a number of times equal to `T`'s packed length.\n    pub fn read(self) -> T\n    where\n        T: Packable,\n    {\n        self.context.storage_read(self.storage_slot)\n    }\n\n    /// Stores a new value.\n    ///\n    /// The old value is overridden and cannot be recovered. The new value can be immediately retrieved by\n    /// [`read`](PublicMutable::read).\n    ///\n    /// ## Examples\n    ///\n    /// A public setter that updates the current value:\n    /// ```noir\n    /// #[external(\"public\")]\n    /// fn mint_tokens(recipient: AztecAddress, amount: u128) {\n    ///     let current_recipient_balance = self.storage.public_balances.at(recipient).read();\n    ///     self.storage.public_balances.at(recipient).write(current_recipient_balance + amount);\n    ///\n    ///     let current_supply = self.storage.total_supply.read();\n    ///     self.storage.total_supply.write(current_supply + amount);\n    /// }\n    /// ```\n    ///\n    /// An [`only_self`](crate::macros::functions::only_self) helper that updates public state triggered by a private\n    /// function:\n    /// ```noir\n    /// #[external(\"private\")]\n    /// fn vote_for_proposal(election_id: ElectionId, votes: u128) {\n    ///     // validate the sender can cast this many votes - this remains private\n    ///\n    ///     self.enqueue_self._tally_vote(election_id, votes);\n    /// }\n    ///\n    /// #[external(\"public\")]\n    /// #[only_self]\n    /// fn _tally_vote(election_id: ElectionId, votes: u128) {\n    ///     let current = self.storage.vote_tallies.at(election_id).read();\n    ///     self.storage.vote_tallies.at(election_id).write(current + votes);\n    /// }\n    /// ```\n    ///\n    /// ## Cost\n    ///\n    /// The `SSTORE` AVM opcode is invoked a number of times equal to `T`'s packed length.\n    pub fn write(self, value: T)\n    where\n        T: Packable,\n    {\n        self.context.storage_write(self.storage_slot, value);\n    }\n}\n\nimpl<T> PublicMutable<T, UtilityContext> {\n    /// Returns the value at the anchor block.\n    ///\n    /// If [`write`](PublicMutable::write) has never been called, then this returns the default empty public storage\n    /// value, which is all zeroes - equivalent to `let t = T::unpack(std::mem::zeroed());`.\n    ///\n    /// It is not possible to detect if a `PublicMutable` has ever been initialized or not other than by testing for\n    /// the zero sentinel value. For a more robust solution, store an `Option<T>` in the `PublicMutable`.\n    ///\n    /// ## Examples\n    ///\n    /// ```noir\n    /// #[external(\"utility\")]\n    /// fn get_total_supply() -> u128 {\n    ///     self.storage.total_supply.read()\n    /// }\n    /// ```\n    pub unconstrained fn read(self) -> T\n    where\n        T: Packable,\n    {\n        self.context.storage_read(self.storage_slot)\n    }\n}\n"
     },
-    "245": {
+    "243": {
       "function_locations": [
         {
           "name": "append",
@@ -4729,7 +4677,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/append.nr",
       "source": "/// Appends the elements of the second `BoundedVec` to the end of the first one. The resulting `BoundedVec` can have\n/// any arbitrary maximum length, but it must be large enough to fit all of the elements of both the first and second\n/// vectors.\npub fn append<T, let ALen: u32, let BLen: u32, let DstLen: u32>(\n    a: BoundedVec<T, ALen>,\n    b: BoundedVec<T, BLen>,\n) -> BoundedVec<T, DstLen> {\n    let mut dst = BoundedVec::new();\n\n    dst.extend_from_bounded_vec(a);\n    dst.extend_from_bounded_vec(b);\n\n    dst\n}\n\nmod test {\n    use super::append;\n\n    #[test]\n    unconstrained fn append_empty_vecs() {\n        let a: BoundedVec<_, 3> = BoundedVec::new();\n        let b: BoundedVec<_, 14> = BoundedVec::new();\n\n        let result: BoundedVec<Field, 5> = append(a, b);\n\n        assert_eq(result.len(), 0);\n        assert_eq(result.storage(), std::mem::zeroed());\n    }\n\n    #[test]\n    unconstrained fn append_non_empty_vecs() {\n        let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n        let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n        let result: BoundedVec<Field, 8> = append(a, b);\n\n        assert_eq(result.len(), 6);\n        assert_eq(result.storage(), [1, 2, 3, 4, 5, 6, std::mem::zeroed(), std::mem::zeroed()]);\n    }\n\n    #[test(should_fail_with = \"out of bounds\")]\n    unconstrained fn append_non_empty_vecs_insufficient_max_len() {\n        let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n        let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n        let _: BoundedVec<Field, 5> = append(a, b);\n    }\n}\n"
     },
-    "248": {
+    "246": {
       "function_locations": [
         {
           "name": "subarray",
@@ -4759,7 +4707,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subarray.nr",
       "source": "/// Returns `DstLen` elements from a source array, starting at `offset`. `DstLen` must not be larger than the number of\n/// elements past `offset`.\n///\n/// Examples:\n/// ```\n/// let foo: [Field; 2] = subarray([1, 2, 3, 4, 5], 2);\n/// assert_eq(foo, [3, 4]);\n///\n/// let bar: [Field; 5] = subarray([1, 2, 3, 4, 5], 2); // fails - we can't return 5 elements since only 3 remain\n/// ```\npub fn subarray<T, let SrcLen: u32, let DstLen: u32>(src: [T; SrcLen], offset: u32) -> [T; DstLen] {\n    assert(offset + DstLen <= SrcLen, \"DstLen too large for offset\");\n\n    let mut dst: [T; DstLen] = std::mem::zeroed();\n    for i in 0..DstLen {\n        dst[i] = src[i + offset];\n    }\n\n    dst\n}\n\nmod test {\n    use super::subarray;\n\n    #[test]\n    unconstrained fn subarray_into_empty() {\n        // In all of these cases we're setting DstLen to be 0, so we always get back an empty array.\n        assert_eq(subarray::<Field, _, _>([], 0), []);\n        assert_eq(subarray([1, 2, 3, 4, 5], 0), []);\n        assert_eq(subarray([1, 2, 3, 4, 5], 2), []);\n    }\n\n    #[test]\n    unconstrained fn subarray_complete() {\n        assert_eq(subarray::<Field, _, _>([], 0), []);\n        assert_eq(subarray([1, 2, 3, 4, 5], 0), [1, 2, 3, 4, 5]);\n    }\n\n    #[test]\n    unconstrained fn subarray_different_end_sizes() {\n        // We implicitly select how many values to read in the size of the return array\n        assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4, 5]);\n        assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4]);\n        assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3]);\n        assert_eq(subarray([1, 2, 3, 4, 5], 1), [2]);\n    }\n\n    #[test(should_fail_with = \"DstLen too large for offset\")]\n    unconstrained fn subarray_offset_too_large() {\n        // With an offset of 1 we can only request up to 4 elements\n        let _: [_; 5] = subarray([1, 2, 3, 4, 5], 1);\n    }\n\n    #[test(should_fail)]\n    unconstrained fn subarray_bad_return_value() {\n        assert_eq(subarray([1, 2, 3, 4, 5], 1), [3, 3, 4, 5]);\n    }\n}\n"
     },
-    "249": {
+    "247": {
       "function_locations": [
         {
           "name": "subbvec",
@@ -4801,7 +4749,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subbvec.nr",
       "source": "use crate::utils::array;\n\n/// Returns `DstMaxLen` elements from a source BoundedVec, starting at `offset`. `offset` must not be larger than the\n/// original length, and `DstLen` must not be larger than the total number of elements past `offset` (including the\n/// zeroed elements past `len()`).\n///\n/// Only elements at the beginning of the vector can be removed: it is not possible to also remove elements at the end\n/// of the vector by passing a value for `DstLen` that is smaller than `len() - offset`.\n///\n/// Examples:\n/// ```\n/// let foo = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n/// assert_eq(subbvec(foo, 2), BoundedVec::<_, 8>::from_array([3, 4, 5]));\n///\n/// let bar: BoundedVec<_, 1> = subbvec(foo, 2); // fails - we can't return just 1 element since 3 remain\n/// let baz: BoundedVec<_, 10> = subbvec(foo, 3); // fails - we can't return 10 elements since only 7 remain\n/// ```\npub fn subbvec<T, let SrcMaxLen: u32, let DstMaxLen: u32>(\n    bvec: BoundedVec<T, SrcMaxLen>,\n    offset: u32,\n) -> BoundedVec<T, DstMaxLen> {\n    // from_parts_unchecked does not verify that the elements past len are zeroed, but that is not an issue in our case\n    // because we're constructing the new storage array as a subarray of the original one (which should have zeroed\n    // storage past len), guaranteeing correctness. This is because `subarray` does not allow extending arrays past\n    // their original length.\n    BoundedVec::from_parts_unchecked(array::subarray(bvec.storage(), offset), bvec.len() - offset)\n}\n\nmod test {\n    use super::subbvec;\n\n    #[test]\n    unconstrained fn subbvec_empty() {\n        let bvec = BoundedVec::<Field, 0>::from_array([]);\n        assert_eq(subbvec(bvec, 0), bvec);\n    }\n\n    #[test]\n    unconstrained fn subbvec_complete() {\n        let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n        assert_eq(subbvec(bvec, 0), bvec);\n\n        let smaller_capacity = BoundedVec::<_, 5>::from_array([1, 2, 3, 4, 5]);\n        assert_eq(subbvec(bvec, 0), smaller_capacity);\n    }\n\n    #[test]\n    unconstrained fn subbvec_partial() {\n        let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n        assert_eq(subbvec(bvec, 2), BoundedVec::<_, 8>::from_array([3, 4, 5]));\n        assert_eq(subbvec(bvec, 2), BoundedVec::<_, 3>::from_array([3, 4, 5]));\n    }\n\n    #[test]\n    unconstrained fn subbvec_into_empty() {\n        let bvec: BoundedVec<_, 10> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n        assert_eq(subbvec(bvec, 5), BoundedVec::<_, 5>::from_array([]));\n    }\n\n    #[test(should_fail)]\n    unconstrained fn subbvec_offset_past_len() {\n        let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n        let _: BoundedVec<_, 1> = subbvec(bvec, 6);\n    }\n\n    #[test(should_fail)]\n    unconstrained fn subbvec_insufficient_dst_len() {\n        let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n        // We're not providing enough space to hold all of the items inside the original BoundedVec. subbvec can cause\n        // for the capacity to reduce, but not the length (other than by len - offset).\n        let _: BoundedVec<_, 1> = subbvec(bvec, 2);\n    }\n\n    #[test(should_fail_with = \"DstLen too large for offset\")]\n    unconstrained fn subbvec_dst_len_causes_enlarge() {\n        let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n        // subbvec does not support capacity increases\n        let _: BoundedVec<_, 11> = subbvec(bvec, 0);\n    }\n\n    #[test(should_fail_with = \"DstLen too large for offset\")]\n    unconstrained fn subbvec_dst_len_too_large_for_offset() {\n        let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n        // This effectively requests a capacity increase, since there'd be just one element plus the 5 empty slots,\n        // which is less than 7.\n        let _: BoundedVec<_, 7> = subbvec(bvec, 4);\n    }\n}\n"
     },
-    "252": {
+    "250": {
       "function_locations": [
         {
           "name": "bytes_to_fields",
@@ -4823,7 +4771,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/bytes_to_fields.nr",
       "source": "use std::static_assert;\n\n// These functions are used to facilitate the conversion of log ciphertext between byte and field representations.\n//\n// `bytes_to_fields` uses fixed-size arrays since encryption contexts have compile-time size information.\n// `bytes_from_fields` uses BoundedVec for flexibility in unconstrained contexts where sizes are dynamic.\n//\n// Together they provide bidirectional conversion between bytes and fields when processing encrypted logs.\n\n/// Converts the input bytes into an array of fields. A Field is ~254 bits meaning that each field can store 31 whole\n/// bytes. Use `bytes_from_fields` to obtain the original bytes array.\n///\n/// The input bytes are chunked into chunks of 31 bytes. Each 31-byte chunk is viewed as big-endian, and is converted\n/// into a Field. For example, [1, 10, 3, ..., 0] (31 bytes) is encoded as [1 * 256^30 + 10 * 256^29 + 3 * 256^28 + ...\n/// + 0] Note: N must be a multiple of 31 bytes\npub fn bytes_to_fields<let N: u32>(bytes: [u8; N]) -> [Field; N / 31] {\n    // Assert that N is a multiple of 31\n    static_assert(N % 31 == 0, \"N must be a multiple of 31\");\n\n    let mut fields = [0; N / 31];\n\n    // Since N is a multiple of 31, we can simply process all chunks fully\n    for i in 0..N / 31 {\n        let mut field = 0;\n        for j in 0..31 {\n            // Shift the existing value left by 8 bits and add the new byte\n            field = field * 256 + bytes[i * 31 + j] as Field;\n        }\n        fields[i] = field;\n    }\n\n    fields\n}\n\n/// Converts an input BoundedVec of fields into a BoundedVec of bytes in big-endian order. Arbitrary Field arrays are\n/// not allowed: this is assumed to be an array obtained via `bytes_to_fields`, i.e. one that actually represents\n/// bytes. To convert a Field array into bytes, use `fields_to_bytes`.\n///\n/// Each input field must contain at most 31 bytes (this is constrained to be so). Each field is converted into 31\n/// big-endian bytes, and the resulting 31-byte chunks are concatenated back together in the order of the original\n/// fields.\npub fn bytes_from_fields<let N: u32>(fields: BoundedVec<Field, N>) -> BoundedVec<u8, N * 31> {\n    let mut bytes = BoundedVec::new();\n\n    for i in 0..fields.len() {\n        let field = fields.get(i);\n\n        // We expect that the field contains at most 31 bytes of information.\n        field.assert_max_bit_size::<248>();\n\n        // Now we can safely convert the field to 31 bytes.\n        let field_as_bytes: [u8; 31] = field.to_be_bytes();\n\n        for j in 0..31 {\n            bytes.push(field_as_bytes[j]);\n        }\n    }\n\n    bytes\n}\n\nmod tests {\n    use crate::utils::array::subarray;\n    use super::{bytes_from_fields, bytes_to_fields};\n\n    #[test]\n    unconstrained fn random_bytes_to_fields_and_back(input: [u8; 93]) {\n        let fields = bytes_to_fields(input);\n\n        // At this point in production, the log flies through the system and we get a BoundedVec on the other end. So\n        // we need to convert the field array to a BoundedVec to be able to feed it to the `bytes_from_fields`\n        // function.\n        let fields_as_bounded_vec = BoundedVec::<_, 6>::from_array(fields);\n\n        let bytes_back = bytes_from_fields(fields_as_bounded_vec);\n\n        // Compare the original input with the round-tripped result\n        assert_eq(bytes_back.len(), input.len());\n        assert_eq(subarray(bytes_back.storage(), 0), input);\n    }\n\n    #[test(should_fail_with = \"N must be a multiple of 31\")]\n    unconstrained fn bytes_to_fields_input_length_not_multiple_of_31() {\n        // Try to convert 32 bytes (not a multiple of 31) to fields\n        let _fields = bytes_to_fields([0; 32]);\n    }\n\n}\n"
     },
-    "253": {
+    "251": {
       "function_locations": [
         {
           "name": "fields_to_bytes",
@@ -4873,7 +4821,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/fields_to_bytes.nr",
       "source": "// These functions are used to facilitate the conversion of log plaintext represented as fields into bytes and back.\n//\n// `fields_to_bytes` uses fixed-size arrays since encryption contexts have compile-time size information.\n// `fields_from_bytes` uses BoundedVec for flexibility in unconstrained contexts where sizes are dynamic.\n//\n// Together they provide bidirectional conversion between fields and bytes.\n\n/// Converts an input array of fields into a single array of bytes. Use `fields_from_bytes` to obtain the original\n/// field array. Each field is converted to a 32-byte big-endian array.\n///\n/// For example, if you have a field array [123, 456], it will be converted to a 64-byte array:\n/// [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,123,  // First field (32 bytes)\n/// 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,200]  // Second field (32 bytes)\n///\n/// Since a field is ~254 bits, you'll end up with a subtle 2-bit \"gap\" at the big end, every 32 bytes. Be careful that\n/// such a gap doesn't leak information! This could happen if you for example expected the output to be\n/// indistinguishable from random bytes.\npub fn fields_to_bytes<let N: u32>(fields: [Field; N]) -> [u8; 32 * N] {\n    let mut bytes = [0; 32 * N];\n\n    for i in 0..N {\n        let field_as_bytes: [u8; 32] = fields[i].to_be_bytes();\n\n        for j in 0..32 {\n            bytes[i * 32 + j] = field_as_bytes[j];\n        }\n    }\n\n    bytes\n}\n\n/// Converts an input BoundedVec of bytes into a BoundedVec of fields. Arbitrary byte arrays are not allowed: this is\n/// assumed to be an array obtained via `fields_to_bytes`, i.e. one that actually represents fields. To convert a byte\n/// array into Fields, use `bytes_to_fields`.\n///\n/// The input bytes are chunked into chunks of 32 bytes. Each 32-byte chunk is viewed as big-endian, and is converted\n/// into a Field. For example, [1, 10, 3, ..., 0] (32 bytes) is encoded as [1 * 256^31 + 10 * 256^30 + 3 * 256^29 + ...\n/// + 0] Note 1: N must be a multiple of 32 bytes Note 2: The max value check code was taken from\n/// std::field::to_be_bytes function.\npub fn fields_from_bytes<let N: u32>(bytes: BoundedVec<u8, N>) -> BoundedVec<Field, N / 32> {\n    // Assert that input length is a multiple of 32\n    assert(bytes.len() % 32 == 0, \"Input length must be a multiple of 32\");\n\n    try_fields_from_bytes(bytes).expect(f\"Value does not fit in field\")\n}\n\n/// Converts a single 32-byte big-endian chunk (starting at `offset`) into a Field, returning\n/// `Option::none()` if the chunk's value is >= the field modulus.\nfn try_field_from_be_bytes<let N: u32>(bytes: BoundedVec<u8, N>, offset: u32) -> Option<Field> {\n    let p = std::field::modulus_be_bytes();\n    let mut field = 0;\n    // Field arithmetic silently wraps values >= the modulus, so we compare each 32-byte chunk against\n    // the modulus byte-by-byte (big-endian, most significant first). The first byte that differs\n    // determines the result: if our byte is smaller we're valid, if larger we've overflowed.\n    // cmp tracks the result: 0 = equal so far, 1 = less than modulus, 2 = exceeds modulus.\n    let mut cmp: u8 = 0;\n    for j in 0..32 {\n        let byte = bytes.get(offset + j);\n        field = field * 256 + byte as Field;\n\n        if cmp == 0 {\n            if byte < p[j] {\n                cmp = 1;\n            } else if byte > p[j] {\n                cmp = 2;\n            }\n        }\n    }\n    if cmp == 1 {\n        Option::some(field)\n    } else {\n        Option::none()\n    }\n}\n\n/// Non-panicking version of `fields_from_bytes`. Returns `Option::none()` if the input\n/// length is not a multiple of 32 or if any 32-byte chunk exceeds the field modulus.\npub(crate) fn try_fields_from_bytes<let N: u32>(bytes: BoundedVec<u8, N>) -> Option<BoundedVec<Field, N / 32>> {\n    if bytes.len() % 32 == 0 {\n        let mut fields = BoundedVec::new();\n        let num_chunks = bytes.len() / 32;\n        for i in 0..num_chunks {\n            let field = try_field_from_be_bytes(bytes, i * 32);\n            if field.is_some() {\n                fields.push(field.unwrap());\n            }\n        }\n        if fields.len() as u32 == num_chunks {\n            Option::some(fields)\n        } else {\n            Option::none()\n        }\n    } else {\n        Option::none()\n    }\n}\n\nmod tests {\n    use crate::utils::array::subarray;\n    use super::{fields_from_bytes, fields_to_bytes, try_fields_from_bytes};\n\n    #[test]\n    unconstrained fn random_fields_to_bytes_and_back(input: [Field; 3]) {\n        // Convert to bytes\n        let bytes = fields_to_bytes(input);\n\n        // At this point in production, the log flies through the system and we get a BoundedVec on the other end. So\n        // we need to convert the field array to a BoundedVec to be able to feed it to the `fields_from_bytes`\n        // function. 113 is an arbitrary max length that is larger than the input length of 96.\n        let bytes_as_bounded_vec = BoundedVec::<_, 113>::from_array(bytes);\n\n        // Convert back to fields\n        let fields_back = fields_from_bytes(bytes_as_bounded_vec);\n\n        // Compare the original input with the round-tripped result\n        assert_eq(fields_back.len(), input.len());\n        assert_eq(subarray(fields_back.storage(), 0), input);\n    }\n\n    #[test(should_fail_with = \"Input length must be a multiple of 32\")]\n    unconstrained fn to_fields_assert() {\n        // 143 is an arbitrary max length that is larger than 33\n        let input = BoundedVec::<_, 143>::from_array([\n            1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,\n            30, 31, 32, 33,\n        ]);\n\n        // This should fail since 33 is not a multiple of 32\n        let _fields = fields_from_bytes(input);\n    }\n\n    #[test]\n    unconstrained fn fields_from_bytes_max_value() {\n        let max_field_as_bytes: [u8; 32] = (-1).to_be_bytes();\n        let input = BoundedVec::<_, 32>::from_array(max_field_as_bytes);\n\n        let fields = fields_from_bytes(input);\n\n        // The result should be a largest value storable in a field (-1 since we are modulo-ing)\n        assert_eq(fields.get(0), -1);\n    }\n\n    // In this test we verify that overflow check works by taking the max allowed value, bumping a random byte and then\n    // feeding it to `fields_from_bytes` as input.\n    #[test(should_fail_with = \"Value does not fit in field\")]\n    unconstrained fn fields_from_bytes_overflow(random_value: u8) {\n        let index_of_byte_to_bump = random_value % 32;\n\n        // Obtain the byte representation of the maximum field value\n        let max_field_value_as_bytes: [u8; 32] = (-1).to_be_bytes();\n\n        let byte_to_bump = max_field_value_as_bytes[index_of_byte_to_bump as u32];\n\n        // Skip test execution if the selected byte is already at maximum value (255). This is acceptable since we are\n        // using fuzz testing to generate many test cases.\n        if byte_to_bump != 255 {\n            let mut input = BoundedVec::<_, 32>::from_array(max_field_value_as_bytes);\n\n            // Increment the selected byte to exceed the field's maximum value\n            input.set(index_of_byte_to_bump as u32, byte_to_bump + 1);\n\n            // Attempt the conversion, which should fail due to the value exceeding the field's capacity\n            let _fields = fields_from_bytes(input);\n        }\n    }\n\n    #[test]\n    unconstrained fn try_fields_from_bytes_returns_none_on_unaligned_length() {\n        let input = BoundedVec::<_, 64>::from_parts([0 as u8; 64], 33);\n        assert(try_fields_from_bytes(input).is_none());\n    }\n\n    #[test]\n    unconstrained fn try_fields_from_bytes_returns_none_on_field_modulus() {\n        // The field modulus itself is not a valid field value (it wraps to 0).\n        let p: [u8; 32] = std::field::modulus_be_bytes().as_array();\n        let input = BoundedVec::<u8, 32>::from_array(p);\n        assert(try_fields_from_bytes(input).is_none());\n    }\n\n    #[test]\n    unconstrained fn try_fields_from_bytes_round_trips(input: [Field; 3]) {\n        let bytes = BoundedVec::<_, 113>::from_array(fields_to_bytes(input));\n        let fields = try_fields_from_bytes(bytes).unwrap();\n\n        assert_eq(fields.len(), input.len());\n        assert_eq(subarray(fields.storage(), 0), input);\n    }\n}\n"
     },
-    "256": {
+    "254": {
       "function_locations": [
         {
           "name": "get_sign_of_point",
@@ -4923,7 +4871,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/point.nr",
       "source": "use crate::protocol::{point::Point, utils::field::sqrt};\n\n// I am storing the modulus minus 1 divided by 2 here because full modulus would throw \"String literal too large\" error\n// Full modulus is 21888242871839275222246405745257275088548364400416034343698204186575808495617\nglobal BN254_FR_MODULUS_DIV_2: Field = 10944121435919637611123202872628637544274182200208017171849102093287904247808;\n\n/// Returns: true if p.y <= MOD_DIV_2, else false.\npub fn get_sign_of_point(p: Point) -> bool {\n    // We store only a \"sign\" of the y coordinate because the rest can be derived from the x coordinate. To get the\n    // sign we check if the y coordinate is less or equal than the field's modulus minus 1 divided by 2. Ideally we'd\n    // do `y <= MOD_DIV_2`, but there's no `lte` function, so instead we do `!(y > MOD_DIV_2)`, which is equivalent,\n    // and then rewrite that as `!(MOD_DIV_2 < y)`, since we also have no `gt` function.\n    !BN254_FR_MODULUS_DIV_2.lt(p.y)\n}\n\n/// Returns a `Point` in the Grumpkin curve given its x coordinate.\n///\n/// Because not all values in the field are valid x coordinates of points in the curve (i.e. there is no corresponding\n/// y value in the field that satisfies the curve equation), it may not be possible to reconstruct a `Point`.\n/// `Option::none()` is returned in such cases.\npub fn point_from_x_coord(x: Field) -> Option<Point> {\n    // y ^ 2 = x ^ 3 - 17\n    let rhs = x * x * x - 17;\n    sqrt(rhs).map(|y| Point { x, y, is_infinite: false })\n}\n\n/// Returns a `Point` in the Grumpkin curve given its x coordinate and sign for the y coordinate.\n///\n/// Because not all values in the field are valid x coordinates of points in the curve (i.e. there is no corresponding\n/// y value in the field that satisfies the curve equation), it may not be possible to reconstruct a `Point`.\n/// `Option::none()` is returned in such cases.\n///\n/// @param x - The x coordinate of the point @param sign - The \"sign\" of the y coordinate - determines whether y <=\n/// (Fr.MODULUS - 1) / 2\npub fn point_from_x_coord_and_sign(x: Field, sign: bool) -> Option<Point> {\n    // y ^ 2 = x ^ 3 - 17\n    let rhs = x * x * x - 17;\n\n    sqrt(rhs).map(|y| {\n        // If there is a square root, we need to ensure it has the correct \"sign\"\n        let y_is_positive = !BN254_FR_MODULUS_DIV_2.lt(y);\n        let final_y = if y_is_positive == sign { y } else { -y };\n        Point { x, y: final_y, is_infinite: false }\n    })\n}\n\nmod test {\n    use crate::protocol::point::Point;\n    use crate::utils::point::{\n        BN254_FR_MODULUS_DIV_2, get_sign_of_point, point_from_x_coord, point_from_x_coord_and_sign,\n    };\n\n    #[test]\n    unconstrained fn test_point_from_x_coord_and_sign() {\n        // Test positive y coordinate\n        let x = 0x1af41f5de96446dc3776a1eb2d98bb956b7acd9979a67854bec6fa7c2973bd73;\n        let sign = true;\n        let p = point_from_x_coord_and_sign(x, sign).unwrap();\n\n        assert_eq(p.x, x);\n        assert_eq(p.y, 0x07fc22c7f2c7057571f137fe46ea9c95114282bc95d37d71ec4bfb88de457d4a);\n        assert_eq(p.is_infinite, false);\n\n        // Test negative y coordinate\n        let x2 = 0x247371652e55dd74c9af8dbe9fb44931ba29a9229994384bd7077796c14ee2b5;\n        let sign2 = false;\n        let p2 = point_from_x_coord_and_sign(x2, sign2).unwrap();\n\n        assert_eq(p2.x, x2);\n        assert_eq(p2.y, 0x26441aec112e1ae4cee374f42556932001507ad46e255ffb27369c7e3766e5c0);\n        assert_eq(p2.is_infinite, false);\n    }\n\n    #[test]\n    unconstrained fn test_point_from_x_coord_valid() {\n        // x = 8 is a known quadratic residue - should give a valid point\n        let result = point_from_x_coord(Field::from(8));\n        assert(result.is_some());\n\n        let point = result.unwrap();\n        assert_eq(point.x, Field::from(8));\n        // Check curve equation y^2 = x^3 - 17\n        assert_eq(point.y * point.y, point.x * point.x * point.x - 17);\n    }\n\n    #[test]\n    unconstrained fn test_point_from_x_coord_invalid() {\n        // x = 3 is a non-residue for this curve - should give None\n        let x = Field::from(3);\n        let maybe_point = point_from_x_coord(x);\n        assert(maybe_point.is_none());\n    }\n\n    #[test]\n    unconstrained fn test_both_roots_satisfy_curve() {\n        // Derive a point from x = 8 (known to be valid from test_point_from_x_coord_valid)\n        let x: Field = 8;\n        let point = point_from_x_coord(x).unwrap();\n\n        // Check y satisfies curve equation\n        assert_eq(point.y * point.y, x * x * x - 17);\n\n        // Check -y also satisfies curve equation\n        let neg_y = 0 - point.y;\n        assert_eq(neg_y * neg_y, x * x * x - 17);\n\n        // Verify they are different (unless y = 0)\n        assert(point.y != neg_y);\n    }\n\n    #[test]\n    unconstrained fn test_point_from_x_coord_and_sign_invalid() {\n        // x = 3 has no valid point on the curve (from test_point_from_x_coord_invalid)\n        let x = Field::from(3);\n        let result_positive = point_from_x_coord_and_sign(x, true);\n        let result_negative = point_from_x_coord_and_sign(x, false);\n\n        assert(result_positive.is_none());\n        assert(result_negative.is_none());\n    }\n\n    #[test]\n    unconstrained fn test_get_sign_of_point() {\n        // Derive a point from x = 8, then test both possible y values\n        let point = point_from_x_coord(8).unwrap();\n        let neg_point = Point { x: point.x, y: 0 - point.y, is_infinite: false };\n\n        // One should be \"positive\" (y <= MOD_DIV_2) and one \"negative\"\n        let sign1 = get_sign_of_point(point);\n        let sign2 = get_sign_of_point(neg_point);\n        assert(sign1 != sign2);\n\n        // y = 0 should return true (0 <= MOD_DIV_2)\n        let zero_y_point = Point { x: 0, y: 0, is_infinite: false };\n        assert(get_sign_of_point(zero_y_point) == true);\n\n        // y = MOD_DIV_2 should return true (exactly at boundary)\n        let boundary_point = Point { x: 0, y: BN254_FR_MODULUS_DIV_2, is_infinite: false };\n        assert(get_sign_of_point(boundary_point) == true);\n\n        // y = MOD_DIV_2 + 1 should return false (just over boundary)\n        let over_boundary_point = Point { x: 0, y: BN254_FR_MODULUS_DIV_2 + 1, is_infinite: false };\n        assert(get_sign_of_point(over_boundary_point) == false);\n    }\n\n    #[test]\n    unconstrained fn test_point_from_x_coord_zero() {\n        // x = 0: y^2 = 0^3 - 17 = -17, which is not a quadratic residue in BN254 scalar field\n        let result = point_from_x_coord(0);\n        assert(result.is_none());\n    }\n\n    #[test]\n    unconstrained fn test_bn254_fr_modulus_div_2() {\n        // Verify that BN254_FR_MODULUS_DIV_2 == (p - 1) / 2 This means: 2 * BN254_FR_MODULUS_DIV_2 + 1 == p == 0 (in\n        // the field)\n        assert_eq(2 * BN254_FR_MODULUS_DIV_2 + 1, 0);\n    }\n\n}\n"
     },
-    "266": {
+    "264": {
       "function_locations": [
         {
           "name": "Poseidon2::hash",
@@ -4965,7 +4913,7 @@
       "path": "/home/aztec-dev/nargo/github.com/noir-lang/poseidon/v0.2.6/src/poseidon2.nr",
       "source": "use std::default::Default;\nuse std::hash::Hasher;\n\nglobal RATE: u32 = 3;\n\npub struct Poseidon2 {\n    cache: [Field; 3],\n    state: [Field; 4],\n    cache_size: u32,\n    squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2 {\n    #[no_predicates]\n    pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n        Poseidon2::hash_internal(input, message_size)\n    }\n\n    pub(crate) fn new(iv: Field) -> Poseidon2 {\n        let mut result =\n            Poseidon2 { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n        result.state[RATE] = iv;\n        result\n    }\n\n    fn perform_duplex(&mut self) {\n        // add the cache into sponge state\n        self.state[0] += self.cache[0];\n        self.state[1] += self.cache[1];\n        self.state[2] += self.cache[2];\n        self.state = crate::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) -> Field {\n        let two_pow_64 = 18446744073709551616;\n        let iv: Field = (in_len as Field) * two_pow_64;\n        let mut state = [0; 4];\n        state[RATE] = iv;\n\n        if std::runtime::is_unconstrained() {\n            for i in 0..(in_len / RATE) {\n                state[0] += input[i * RATE];\n                state[1] += input[i * RATE + 1];\n                state[2] += input[i * RATE + 2];\n                state = crate::poseidon2_permutation(state, 4);\n            }\n\n            // handle remaining elements after last full RATE-sized chunk\n            let num_extra_fields = in_len % RATE;\n            if num_extra_fields != 0 {\n                let remainder_start = in_len - num_extra_fields;\n                state[0] += input[remainder_start];\n                if num_extra_fields > 1 {\n                    state[1] += input[remainder_start + 1];\n                }\n            }\n        } else {\n            let mut states: [[Field; 4]; N / RATE + 1] = [[0; 4]; N / RATE + 1];\n            states[0] = state;\n\n            // process all full RATE-sized chunks, storing state after each permutation\n            for chunk_idx in 0..(N / RATE) {\n                for i in 0..RATE {\n                    state[i] += input[chunk_idx * RATE + i];\n                }\n                state = crate::poseidon2_permutation(state, 4);\n                states[chunk_idx + 1] = state;\n            }\n\n            // get state at the last full block before in_len\n            let first_partially_filled_chunk = in_len / RATE;\n            state = states[first_partially_filled_chunk];\n\n            // handle remaining elements after last full RATE-sized chunk\n            let remainder_start = (in_len / RATE) * RATE;\n            for j in 0..RATE {\n                let idx = remainder_start + j;\n                if idx < in_len {\n                    state[j] += input[idx];\n                }\n            }\n        }\n\n        // always run final permutation unless we just completed a full chunk\n        // still need to permute once if in_len is 0\n        if (in_len == 0) | (in_len % RATE != 0) {\n            state = crate::poseidon2_permutation(state, 4);\n        };\n\n        state[0]\n    }\n}\n\npub struct Poseidon2Hasher {\n    _state: [Field],\n}\n\nimpl Hasher for Poseidon2Hasher {\n    fn finish(self) -> Field {\n        let iv: Field = (self._state.len() as Field) * 18446744073709551616; // iv = (self._state.len() << 64)\n        let mut sponge = Poseidon2::new(iv);\n        for i in 0..self._state.len() {\n            sponge.absorb(self._state[i]);\n        }\n        sponge.squeeze()\n    }\n\n    fn write(&mut self, input: Field) {\n        self._state = self._state.push_back(input);\n    }\n}\n\nimpl Default for Poseidon2Hasher {\n    fn default() -> Self {\n        Poseidon2Hasher { _state: &[] }\n    }\n}\n"
     },
-    "277": {
+    "275": {
       "function_locations": [
         {
           "name": "BlockHeader::chain_id",
@@ -5059,97 +5007,97 @@
         },
         {
           "name": "[T; N]::sort",
-          "start": 6777
+          "start": 6778
         },
         {
           "name": "[T; N]::sort_via",
-          "start": 7792
+          "start": 7794
         },
         {
           "name": "[u8; N]::as_str_unchecked",
-          "start": 8820
+          "start": 8823
         },
         {
           "name": "<impl From<str<N>> for [u8; N]>::from",
-          "start": 8947
+          "start": 8950
         },
         {
           "name": "test::map_empty",
-          "start": 9021
+          "start": 9024
         },
         {
           "name": "test::sort_u32",
-          "start": 10131
+          "start": 10134
         },
         {
           "name": "test::test_sort",
-          "start": 10186
+          "start": 10189
         },
         {
           "name": "test::test_sort_100_values",
-          "start": 10417
+          "start": 10420
         },
         {
           "name": "test::test_sort_100_values_comptime",
-          "start": 11585
+          "start": 11588
         },
         {
           "name": "test::test_sort_via",
-          "start": 11730
+          "start": 11733
         },
         {
           "name": "test::test_sort_via_100_values",
-          "start": 11977
+          "start": 11980
         },
         {
           "name": "test::mapi_empty",
-          "start": 13138
+          "start": 13141
         },
         {
           "name": "test::for_each_empty",
-          "start": 13233
+          "start": 13236
         },
         {
           "name": "test::for_eachi_empty",
-          "start": 13371
+          "start": 13374
         },
         {
           "name": "test::map_example",
-          "start": 13510
+          "start": 13513
         },
         {
           "name": "test::mapi_example",
-          "start": 13647
+          "start": 13650
         },
         {
           "name": "test::for_each_example",
-          "start": 13796
+          "start": 13799
         },
         {
           "name": "test::for_eachi_example",
-          "start": 14136
+          "start": 14139
         },
         {
           "name": "test::concat",
-          "start": 14347
+          "start": 14350
         },
         {
           "name": "test::concat_zero_length_with_something",
-          "start": 14606
+          "start": 14609
         },
         {
           "name": "test::concat_something_with_zero_length",
-          "start": 14809
+          "start": 14812
         },
         {
           "name": "test::concat_zero_lengths",
-          "start": 14998
+          "start": 15001
         }
       ],
       "path": "std/array/mod.nr",
-      "source": "use crate::cmp::{Eq, Ord};\nuse crate::convert::From;\nuse crate::runtime::is_unconstrained;\n\nmod check_shuffle;\nmod quicksort;\n\nimpl<T, let N: u32> [T; N] {\n    /// Returns the length of this array.\n    ///\n    /// ```noir\n    /// fn len(self) -> Field\n    /// ```\n    ///\n    /// example\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let array = [42, 42];\n    ///     assert(array.len() == 2);\n    /// }\n    /// ```\n    #[builtin(array_len)]\n    pub fn len(self) -> u32 {}\n\n    /// Returns this array as a vector.\n    ///\n    /// ```noir\n    /// let array = [1, 2];\n    /// let vector = array.as_vector();\n    /// assert_eq(vector, [1, 2].as_vector());\n    /// ```\n    #[builtin(as_vector)]\n    pub fn as_vector(self) -> [T] {}\n\n    /// Returns this array as a vector.\n    /// This method is deprecated in favor of `as_vector`.\n    ///\n    /// ```noir\n    /// let array = [1, 2];\n    /// let vector = array.as_slice();\n    /// assert_eq(vector, [1, 2].as_vector());\n    /// ```\n    #[builtin(as_vector)]\n    #[deprecated(\"This method has been renamed to `as_vector`\")]\n    pub fn as_slice(self) -> [T] {}\n\n    /// Applies a function to each element of this array, returning a new array containing the mapped elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let b = a.map(|a| a * 2);\n    /// assert_eq(b, [2, 4, 6]);\n    /// ```\n    pub fn map<U, Env>(&self, f: fn[Env](T) -> U) -> [U; N] {\n        let uninitialized = crate::mem::zeroed();\n        let mut ret = [uninitialized; N];\n\n        for i in 0..self.len() {\n            ret[i] = f(self[i]);\n        }\n\n        ret\n    }\n\n    /// Applies a function to each element of this array along with its index,\n    /// returning a new array containing the mapped elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let b = a.mapi(|i, a| i + a * 2);\n    /// assert_eq(b, [2, 5, 8]);\n    /// ```\n    pub fn mapi<U, Env>(&self, f: fn[Env](u32, T) -> U) -> [U; N] {\n        let uninitialized = crate::mem::zeroed();\n        let mut ret = [uninitialized; N];\n\n        for i in 0..self.len() {\n            ret[i] = f(i, self[i]);\n        }\n\n        ret\n    }\n\n    /// Applies a function to each element of this array.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let mut b = [0; 3];\n    /// let mut i = 0;\n    /// a.for_each(|x| {\n    ///     b[i] = x;\n    ///     i += 1;\n    /// });\n    /// assert_eq(a, b);\n    /// ```\n    pub fn for_each<Env>(&self, f: fn[Env](T) -> ()) {\n        for i in 0..self.len() {\n            f(self[i]);\n        }\n    }\n\n    /// Applies a function to each element of this array along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let mut b = [0; 3];\n    /// a.for_eachi(|i, x| {\n    ///     b[i] = x;\n    /// });\n    /// assert_eq(a, b);\n    /// ```\n    pub fn for_eachi<Env>(&self, f: fn[Env](u32, T) -> ()) {\n        for i in 0..self.len() {\n            f(i, self[i]);\n        }\n    }\n\n    /// Applies a function to each element of the array, returning the final accumulated value. The first\n    /// parameter is the initial value.\n    ///\n    /// This is a left fold, so the given function will be applied to the accumulator and first element of\n    /// the array, then the second, and so on. For a given call the expected result would be equivalent to:\n    ///\n    /// ```rust\n    /// let a1 = [1];\n    /// let a2 = [1, 2];\n    /// let a3 = [1, 2, 3];\n    ///\n    /// let f = |a, b| a - b;\n    /// a1.fold(10, f); //=> f(10, 1)\n    /// a2.fold(10, f); //=> f(f(10, 1), 2)\n    /// a3.fold(10, f); //=> f(f(f(10, 1), 2), 3)\n    ///\n    /// assert_eq(a3.fold(10, f), 10 - 1 - 2 - 3);\n    /// ```\n    pub fn fold<U, Env>(&self, mut accumulator: U, f: fn[Env](U, T) -> U) -> U {\n        for elem in self {\n            accumulator = f(accumulator, elem);\n        }\n        accumulator\n    }\n\n    /// Same as fold, but uses the first element as the starting element.\n    ///\n    /// Requires the input array to be non-empty.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [1, 2, 3, 4];\n    ///     let reduced = arr.reduce(|a, b| a + b);\n    ///     assert(reduced == 10);\n    /// }\n    /// ```\n    pub fn reduce<Env>(&self, f: fn[Env](T, T) -> T) -> T {\n        let mut accumulator = self[0];\n        for i in 1..self.len() {\n            accumulator = f(accumulator, self[i]);\n        }\n        accumulator\n    }\n\n    /// Returns true if all the elements in this array satisfy the given predicate.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [2, 2, 2, 2, 2];\n    ///     let all = arr.all(|a| a == 2);\n    ///     assert(all);\n    /// }\n    /// ```\n    pub fn all<Env>(&self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = true;\n        for elem in self {\n            ret &= predicate(elem);\n        }\n        ret\n    }\n\n    /// Returns true if any of the elements in this array satisfy the given predicate.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [2, 2, 2, 2, 5];\n    ///     let any = arr.any(|a| a == 5);\n    ///     assert(any);\n    /// }\n    /// ```\n    pub fn any<Env>(&self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = false;\n        for elem in self {\n            ret |= predicate(elem);\n        }\n        ret\n    }\n\n    /// Concatenates this array with another array.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr1 = [1, 2, 3, 4];\n    ///     let arr2 = [6, 7, 8, 9, 10, 11];\n    ///     let concatenated_arr = arr1.concat(arr2);\n    ///     assert(concatenated_arr == [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n    /// }\n    /// ```\n    pub fn concat<let M: u32>(&self, array2: [T; M]) -> [T; N + M] {\n        let mut result = [crate::mem::zeroed(); N + M];\n        for i in 0..N {\n            result[i] = self[i];\n        }\n        for i in 0..M {\n            result[i + N] = array2[i];\n        }\n        result\n    }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n    T: Ord + Eq,\n{\n    /// Returns a new sorted array. The original array remains untouched. Notice that this function will\n    /// only work for arrays of fields or integers, not for any arbitrary type. This is because the sorting\n    /// logic it uses internally is optimized specifically for these values. If you need a sort function to\n    /// sort any type, you should use the [`Self::sort_via`] function.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let arr = [42, 32];\n    ///     let sorted = arr.sort();\n    ///     assert(sorted == [32, 42]);\n    /// }\n    /// ```\n    pub fn sort(self) -> Self {\n        self.sort_via(|a, b| a <= b)\n    }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n    T: Eq,\n{\n    /// Returns a new sorted array by sorting it with a custom comparison function.\n    /// The original array remains untouched.\n    /// The ordering function must return true if the first argument should be sorted to be before the second argument or is equal to the second argument.\n    ///\n    /// Using this method with an operator like `<` that does not return `true` for equal values will result in an assertion failure for arrays with equal elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let arr = [42, 32]\n    ///     let sorted_ascending = arr.sort_via(|a, b| a <= b);\n    ///     assert(sorted_ascending == [32, 42]); // verifies\n    ///\n    ///     let sorted_descending = arr.sort_via(|a, b| a >= b);\n    ///     assert(sorted_descending == [32, 42]); // does not verify\n    /// }\n    /// ```\n    pub fn sort_via<Env>(self, ordering: fn[Env](T, T) -> bool) -> Self {\n        // Safety: `sorted` array is checked to be:\n        // a. a permutation of `input`'s elements\n        // b. satisfying the predicate `ordering`\n        let sorted = unsafe { quicksort::quicksort(self, ordering) };\n\n        if !is_unconstrained() {\n            for i in 0..N - 1 {\n                assert(\n                    ordering(sorted[i], sorted[i + 1]),\n                    \"Array has not been sorted correctly according to `ordering`.\",\n                );\n            }\n            check_shuffle::check_shuffle(self, sorted);\n        }\n        sorted\n    }\n}\n\nimpl<let N: u32> [u8; N] {\n    /// Converts a byte array of type `[u8; N]` to a string. Note that this performs no UTF-8 validation -\n    /// the given array is interpreted as-is as a string.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let hi = [104, 105].as_str_unchecked();\n    ///     assert_eq(hi, \"hi\");\n    /// }\n    /// ```\n    #[builtin(array_as_str_unchecked)]\n    pub fn as_str_unchecked(self) -> str<N> {}\n}\n\nimpl<let N: u32> From<str<N>> for [u8; N] {\n    /// Returns an array of the string bytes.\n    fn from(s: str<N>) -> Self {\n        s.as_bytes()\n    }\n}\n\nmod test {\n    #[test]\n    fn map_empty() {\n        assert_eq([].map(|x| x + 1), []);\n    }\n\n    global arr_with_100_values: [u32; 100] = [\n        42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2, 54,\n        89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41, 19, 98,\n        53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21, 43, 86, 35,\n        21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15, 127, 81, 30, 8,\n        125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n    ];\n    global expected_with_100_values: [u32; 100] = [\n        0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30, 32,\n        32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58, 61, 62,\n        62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82, 84, 84, 86,\n        86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114, 114, 116, 118,\n        119, 120, 121, 123, 123, 123, 125, 126, 127,\n    ];\n    fn sort_u32(a: u32, b: u32) -> bool {\n        a <= b\n    }\n\n    #[test]\n    fn test_sort() {\n        let arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n        let sorted = arr.sort();\n\n        let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn test_sort_100_values() {\n        let arr: [u32; 100] = [\n            42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n            54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n            19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n            43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n            127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n        ];\n\n        let sorted = arr.sort();\n\n        let expected: [u32; 100] = [\n            0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n            32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n            61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n            84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n            114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n        ];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn test_sort_100_values_comptime() {\n        let sorted = arr_with_100_values.sort();\n        assert(sorted == expected_with_100_values);\n    }\n\n    #[test]\n    fn test_sort_via() {\n        let arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n        let sorted = arr.sort_via(sort_u32);\n\n        let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn test_sort_via_100_values() {\n        let arr: [u32; 100] = [\n            42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n            54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n            19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n            43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n            127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n        ];\n\n        let sorted = arr.sort_via(sort_u32);\n\n        let expected: [u32; 100] = [\n            0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n            32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n            61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n            84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n            114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n        ];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn mapi_empty() {\n        assert_eq([].mapi(|i, x| i * x + 1), []);\n    }\n\n    #[test]\n    fn for_each_empty() {\n        let empty_array: [Field; 0] = [];\n        empty_array.for_each(|_x| assert(false));\n    }\n\n    #[test]\n    fn for_eachi_empty() {\n        let empty_array: [Field; 0] = [];\n        empty_array.for_eachi(|_i, _x| assert(false));\n    }\n\n    #[test]\n    fn map_example() {\n        let a = [1, 2, 3];\n        let b = a.map(|a| a * 2);\n        assert_eq(b, [2, 4, 6]);\n    }\n\n    #[test]\n    fn mapi_example() {\n        let a = [1, 2, 3];\n        let b = a.mapi(|i, a| i + a * 2);\n        assert_eq(b, [2, 5, 8]);\n    }\n\n    #[test]\n    fn for_each_example() {\n        let a = [1, 2, 3];\n        let mut b = [0, 0, 0];\n        let b_ref = &mut b;\n        let mut i = 0;\n        let i_ref = &mut i;\n        a.for_each(|x| {\n            b_ref[*i_ref] = x * 2;\n            *i_ref += 1;\n        });\n        assert_eq(b, [2, 4, 6]);\n        assert_eq(i, 3);\n    }\n\n    #[test]\n    fn for_eachi_example() {\n        let a = [1, 2, 3];\n        let mut b = [0, 0, 0];\n        let b_ref = &mut b;\n        a.for_eachi(|i, a| { b_ref[i] = i + a * 2; });\n        assert_eq(b, [2, 5, 8]);\n    }\n\n    #[test]\n    fn concat() {\n        let arr1 = [1, 2, 3, 4];\n        let arr2 = [6, 7, 8, 9, 10, 11];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n    }\n\n    #[test]\n    fn concat_zero_length_with_something() {\n        let arr1 = [];\n        let arr2 = [1];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, [1]);\n    }\n\n    #[test]\n    fn concat_something_with_zero_length() {\n        let arr1 = [1];\n        let arr2 = [];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, [1]);\n    }\n\n    #[test]\n    fn concat_zero_lengths() {\n        let arr1: [Field; 0] = [];\n        let arr2: [Field; 0] = [];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, []);\n    }\n}\n"
+      "source": "use crate::cmp::{Eq, Ord};\nuse crate::convert::From;\nuse crate::runtime::is_unconstrained;\n\nmod check_shuffle;\nmod quicksort;\n\nimpl<T, let N: u32> [T; N] {\n    /// Returns the length of this array.\n    ///\n    /// ```noir\n    /// fn len(self) -> Field\n    /// ```\n    ///\n    /// example\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let array = [42, 42];\n    ///     assert(array.len() == 2);\n    /// }\n    /// ```\n    #[builtin(array_len)]\n    pub fn len(self) -> u32 {}\n\n    /// Returns this array as a vector.\n    ///\n    /// ```noir\n    /// let array = [1, 2];\n    /// let vector = array.as_vector();\n    /// assert_eq(vector, [1, 2].as_vector());\n    /// ```\n    #[builtin(as_vector)]\n    pub fn as_vector(self) -> [T] {}\n\n    /// Returns this array as a vector.\n    /// This method is deprecated in favor of `as_vector`.\n    ///\n    /// ```noir\n    /// let array = [1, 2];\n    /// let vector = array.as_slice();\n    /// assert_eq(vector, [1, 2].as_vector());\n    /// ```\n    #[builtin(as_vector)]\n    #[deprecated(\"This method has been renamed to `as_vector`\")]\n    pub fn as_slice(self) -> [T] {}\n\n    /// Applies a function to each element of this array, returning a new array containing the mapped elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let b = a.map(|a| a * 2);\n    /// assert_eq(b, [2, 4, 6]);\n    /// ```\n    pub fn map<U, Env>(&self, f: fn[Env](T) -> U) -> [U; N] {\n        let uninitialized = crate::mem::zeroed();\n        let mut ret = [uninitialized; N];\n\n        for i in 0..self.len() {\n            ret[i] = f(self[i]);\n        }\n\n        ret\n    }\n\n    /// Applies a function to each element of this array along with its index,\n    /// returning a new array containing the mapped elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let b = a.mapi(|i, a| i + a * 2);\n    /// assert_eq(b, [2, 5, 8]);\n    /// ```\n    pub fn mapi<U, Env>(&self, f: fn[Env](u32, T) -> U) -> [U; N] {\n        let uninitialized = crate::mem::zeroed();\n        let mut ret = [uninitialized; N];\n\n        for i in 0..self.len() {\n            ret[i] = f(i, self[i]);\n        }\n\n        ret\n    }\n\n    /// Applies a function to each element of this array.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let mut b = [0; 3];\n    /// let mut i = 0;\n    /// a.for_each(|x| {\n    ///     b[i] = x;\n    ///     i += 1;\n    /// });\n    /// assert_eq(a, b);\n    /// ```\n    pub fn for_each<Env>(&self, f: fn[Env](T) -> ()) {\n        for i in 0..self.len() {\n            f(self[i]);\n        }\n    }\n\n    /// Applies a function to each element of this array along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// let a = [1, 2, 3];\n    /// let mut b = [0; 3];\n    /// a.for_eachi(|i, x| {\n    ///     b[i] = x;\n    /// });\n    /// assert_eq(a, b);\n    /// ```\n    pub fn for_eachi<Env>(&self, f: fn[Env](u32, T) -> ()) {\n        for i in 0..self.len() {\n            f(i, self[i]);\n        }\n    }\n\n    /// Applies a function to each element of the array, returning the final accumulated value. The first\n    /// parameter is the initial value.\n    ///\n    /// This is a left fold, so the given function will be applied to the accumulator and first element of\n    /// the array, then the second, and so on. For a given call the expected result would be equivalent to:\n    ///\n    /// ```rust\n    /// let a1 = [1];\n    /// let a2 = [1, 2];\n    /// let a3 = [1, 2, 3];\n    ///\n    /// let f = |a, b| a - b;\n    /// a1.fold(10, f); //=> f(10, 1)\n    /// a2.fold(10, f); //=> f(f(10, 1), 2)\n    /// a3.fold(10, f); //=> f(f(f(10, 1), 2), 3)\n    ///\n    /// assert_eq(a3.fold(10, f), 10 - 1 - 2 - 3);\n    /// ```\n    pub fn fold<U, Env>(&self, mut accumulator: U, f: fn[Env](U, T) -> U) -> U {\n        for elem in self {\n            accumulator = f(accumulator, elem);\n        }\n        accumulator\n    }\n\n    /// Same as fold, but uses the first element as the starting element.\n    ///\n    /// Requires the input array to be non-empty.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [1, 2, 3, 4];\n    ///     let reduced = arr.reduce(|a, b| a + b);\n    ///     assert(reduced == 10);\n    /// }\n    /// ```\n    pub fn reduce<Env>(&self, f: fn[Env](T, T) -> T) -> T {\n        let mut accumulator = self[0];\n        for i in 1..self.len() {\n            accumulator = f(accumulator, self[i]);\n        }\n        accumulator\n    }\n\n    /// Returns true if all the elements in this array satisfy the given predicate.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [2, 2, 2, 2, 2];\n    ///     let all = arr.all(|a| a == 2);\n    ///     assert(all);\n    /// }\n    /// ```\n    pub fn all<Env>(&self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = true;\n        for elem in self {\n            ret &= predicate(elem);\n        }\n        ret\n    }\n\n    /// Returns true if any of the elements in this array satisfy the given predicate.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr = [2, 2, 2, 2, 5];\n    ///     let any = arr.any(|a| a == 5);\n    ///     assert(any);\n    /// }\n    /// ```\n    pub fn any<Env>(&self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = false;\n        for elem in self {\n            ret |= predicate(elem);\n        }\n        ret\n    }\n\n    /// Concatenates this array with another array.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn main() {\n    ///     let arr1 = [1, 2, 3, 4];\n    ///     let arr2 = [6, 7, 8, 9, 10, 11];\n    ///     let concatenated_arr = arr1.concat(arr2);\n    ///     assert(concatenated_arr == [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n    /// }\n    /// ```\n    pub fn concat<let M: u32>(&self, array2: [T; M]) -> [T; N + M] {\n        let mut result = [crate::mem::zeroed(); N + M];\n        for i in 0..N {\n            result[i] = self[i];\n        }\n        for i in 0..M {\n            result[i + N] = array2[i];\n        }\n        result\n    }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n    T: Ord + Eq,\n{\n    /// Returns a new sorted array. The original array remains untouched. Notice that this function will\n    /// only work for arrays of fields or integers, not for any arbitrary type. This is because the sorting\n    /// logic it uses internally is optimized specifically for these values. If you need a sort function to\n    /// sort any type, you should use the [`Self::sort_via`] function.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let arr = [42, 32];\n    ///     let sorted = arr.sort();\n    ///     assert(sorted == [32, 42]);\n    /// }\n    /// ```\n    pub fn sort(&self) -> Self {\n        self.sort_via(|a, b| a <= b)\n    }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n    T: Eq,\n{\n    /// Returns a new sorted array by sorting it with a custom comparison function.\n    /// The original array remains untouched.\n    /// The ordering function must return true if the first argument should be sorted to be before the second argument or is equal to the second argument.\n    ///\n    /// Using this method with an operator like `<` that does not return `true` for equal values will result in an assertion failure for arrays with equal elements.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let arr = [42, 32]\n    ///     let sorted_ascending = arr.sort_via(|a, b| a <= b);\n    ///     assert(sorted_ascending == [32, 42]); // verifies\n    ///\n    ///     let sorted_descending = arr.sort_via(|a, b| a >= b);\n    ///     assert(sorted_descending == [32, 42]); // does not verify\n    /// }\n    /// ```\n    pub fn sort_via<Env>(&self, ordering: fn[Env](T, T) -> bool) -> Self {\n        // Safety: `sorted` array is checked to be:\n        // a. a permutation of `input`'s elements\n        // b. satisfying the predicate `ordering`\n        let sorted = unsafe { quicksort::quicksort(self, ordering) };\n\n        if !is_unconstrained() {\n            for i in 0..N - 1 {\n                assert(\n                    ordering(sorted[i], sorted[i + 1]),\n                    \"Array has not been sorted correctly according to `ordering`.\",\n                );\n            }\n            check_shuffle::check_shuffle(self, &sorted);\n        }\n        sorted\n    }\n}\n\nimpl<let N: u32> [u8; N] {\n    /// Converts a byte array of type `[u8; N]` to a string. Note that this performs no UTF-8 validation -\n    /// the given array is interpreted as-is as a string.\n    ///\n    /// Example:\n    ///\n    /// ```rust\n    /// fn main() {\n    ///     let hi = [104, 105].as_str_unchecked();\n    ///     assert_eq(hi, \"hi\");\n    /// }\n    /// ```\n    #[builtin(array_as_str_unchecked)]\n    pub fn as_str_unchecked(self) -> str<N> {}\n}\n\nimpl<let N: u32> From<str<N>> for [u8; N] {\n    /// Returns an array of the string bytes.\n    fn from(s: str<N>) -> Self {\n        s.as_bytes()\n    }\n}\n\nmod test {\n    #[test]\n    fn map_empty() {\n        assert_eq([].map(|x| x + 1), []);\n    }\n\n    global arr_with_100_values: [u32; 100] = [\n        42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2, 54,\n        89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41, 19, 98,\n        53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21, 43, 86, 35,\n        21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15, 127, 81, 30, 8,\n        125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n    ];\n    global expected_with_100_values: [u32; 100] = [\n        0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30, 32,\n        32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58, 61, 62,\n        62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82, 84, 84, 86,\n        86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114, 114, 116, 118,\n        119, 120, 121, 123, 123, 123, 125, 126, 127,\n    ];\n    fn sort_u32(a: u32, b: u32) -> bool {\n        a <= b\n    }\n\n    #[test]\n    fn test_sort() {\n        let arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n        let sorted = arr.sort();\n\n        let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn test_sort_100_values() {\n        let arr: [u32; 100] = [\n            42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n            54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n            19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n            43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n            127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n        ];\n\n        let sorted = arr.sort();\n\n        let expected: [u32; 100] = [\n            0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n            32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n            61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n            84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n            114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n        ];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn test_sort_100_values_comptime() {\n        let sorted = arr_with_100_values.sort();\n        assert(sorted == expected_with_100_values);\n    }\n\n    #[test]\n    fn test_sort_via() {\n        let arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n        let sorted = arr.sort_via(sort_u32);\n\n        let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn test_sort_via_100_values() {\n        let arr: [u32; 100] = [\n            42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n            54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n            19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n            43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n            127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n        ];\n\n        let sorted = arr.sort_via(sort_u32);\n\n        let expected: [u32; 100] = [\n            0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n            32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n            61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n            84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n            114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n        ];\n        assert(sorted == expected);\n    }\n\n    #[test]\n    fn mapi_empty() {\n        assert_eq([].mapi(|i, x| i * x + 1), []);\n    }\n\n    #[test]\n    fn for_each_empty() {\n        let empty_array: [Field; 0] = [];\n        empty_array.for_each(|_x| assert(false));\n    }\n\n    #[test]\n    fn for_eachi_empty() {\n        let empty_array: [Field; 0] = [];\n        empty_array.for_eachi(|_i, _x| assert(false));\n    }\n\n    #[test]\n    fn map_example() {\n        let a = [1, 2, 3];\n        let b = a.map(|a| a * 2);\n        assert_eq(b, [2, 4, 6]);\n    }\n\n    #[test]\n    fn mapi_example() {\n        let a = [1, 2, 3];\n        let b = a.mapi(|i, a| i + a * 2);\n        assert_eq(b, [2, 5, 8]);\n    }\n\n    #[test]\n    fn for_each_example() {\n        let a = [1, 2, 3];\n        let mut b = [0, 0, 0];\n        let b_ref = &mut b;\n        let mut i = 0;\n        let i_ref = &mut i;\n        a.for_each(|x| {\n            b_ref[*i_ref] = x * 2;\n            *i_ref += 1;\n        });\n        assert_eq(b, [2, 4, 6]);\n        assert_eq(i, 3);\n    }\n\n    #[test]\n    fn for_eachi_example() {\n        let a = [1, 2, 3];\n        let mut b = [0, 0, 0];\n        let b_ref = &mut b;\n        a.for_eachi(|i, a| { b_ref[i] = i + a * 2; });\n        assert_eq(b, [2, 5, 8]);\n    }\n\n    #[test]\n    fn concat() {\n        let arr1 = [1, 2, 3, 4];\n        let arr2 = [6, 7, 8, 9, 10, 11];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n    }\n\n    #[test]\n    fn concat_zero_length_with_something() {\n        let arr1 = [];\n        let arr2 = [1];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, [1]);\n    }\n\n    #[test]\n    fn concat_something_with_zero_length() {\n        let arr1 = [1];\n        let arr2 = [];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, [1]);\n    }\n\n    #[test]\n    fn concat_zero_lengths() {\n        let arr1: [Field; 0] = [];\n        let arr2: [Field; 0] = [];\n        let concatenated_arr = arr1.concat(arr2);\n        assert_eq(concatenated_arr, []);\n    }\n}\n"
     },
-    "355": {
+    "353": {
       "function_locations": [
         {
           "name": "sha256_to_field",
@@ -5271,7 +5219,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
       "source": "mod poseidon2_chunks;\n\nuse crate::{\n    abis::{\n        contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n        function_selector::FunctionSelector, nullifier::Nullifier, private_log::PrivateLog,\n        transaction::tx_request::TxRequest,\n    },\n    address::{AztecAddress, EthAddress},\n    constants::{\n        CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, DOM_SEP__NOTE_HASH_NONCE,\n        DOM_SEP__PRIVATE_LOG_FIRST_FIELD, DOM_SEP__SILOED_NOTE_HASH, DOM_SEP__SILOED_NULLIFIER,\n        DOM_SEP__UNIQUE_NOTE_HASH, FUNCTION_TREE_HEIGHT, NULL_MSG_SENDER_CONTRACT_ADDRESS,\n        TWO_POW_64,\n    },\n    merkle_tree::root_from_sibling_path,\n    messaging::l2_to_l1_message::L2ToL1Message,\n    poseidon2::Poseidon2Sponge,\n    side_effect::{Counted, Scoped},\n    traits::{FromField, Hash, ToField},\n    utils::field::{field_from_bytes, field_from_bytes_32_trunc},\n};\n\npub use poseidon2_chunks::poseidon2_absorb_in_chunks_existing_sponge;\nuse poseidon2_chunks::poseidon2_absorb_in_chunks;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\n// TODO: refactor these into their own files: sha256, poseidon2, some protocol-specific hash computations, some merkle computations.\n\npub fn sha256_to_field<let N: u32>(bytes_to_hash: [u8; N]) -> Field {\n    let sha256_hashed = sha256::digest(bytes_to_hash);\n    let hash_in_a_field = field_from_bytes_32_trunc(sha256_hashed);\n\n    hash_in_a_field\n}\n\npub fn private_functions_root_from_siblings(\n    selector: FunctionSelector,\n    vk_hash: Field,\n    function_leaf_index: Field,\n    function_leaf_sibling_path: [Field; FUNCTION_TREE_HEIGHT],\n) -> Field {\n    let function_leaf_preimage = ContractClassFunctionLeafPreimage { selector, vk_hash };\n    let function_leaf = function_leaf_preimage.hash();\n    root_from_sibling_path(\n        function_leaf,\n        function_leaf_index,\n        function_leaf_sibling_path,\n    )\n}\n\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 compute_siloed_note_hash(contract_address: AztecAddress, note_hash: Field) -> Field {\n    poseidon2_hash_with_separator(\n        [contract_address.to_field(), note_hash],\n        DOM_SEP__SILOED_NOTE_HASH,\n    )\n}\n\n/// Computes unique, siloed note hashes from siloed note hashes.\n///\n/// The protocol injects uniqueness into every note_hash, so that every single note_hash in the\n/// tree is unique. This prevents faerie gold attacks, where a malicious sender could create\n/// two identical note_hashes for a recipient (meaning only one would be nullifiable in future).\n///\n/// Most privacy protocols will inject the note's leaf_index (its position in the Note Hashes Tree)\n/// into the note, but this requires the creator of a note to wait until their tx is included in\n/// a block to know the note's final note hash (the unique, siloed note hash), because inserting\n/// leaves into trees is the job of a block producer.\n///\n/// We took a different approach so that the creator of a note will know each note's unique, siloed\n/// note hash before broadcasting their tx to the network.\n/// (There was also a historical requirement relating to \"chained transactions\" -- a feature that\n/// Aztec Connect had to enable notes to be spent from distinct txs earlier in the same block,\n/// and hence before an archive block root had been established for that block -- but that feature\n/// was abandoned for the Aztec Network for having too many bad tradeoffs).\n///\n/// (\n///   Edit: it is no longer true that all final note_hashes will be known by the creator of a tx\n///   before they send it to the network. If a tx makes public function calls, then _revertible_\n///   note_hashes that are created in private will not be made unique in private by the Reset circuit,\n///   but will instead be made unique by the AVM, because the `note_index_in_tx` will not be known\n///   until the AVM has executed the public functions of the tx. (See an explanation in\n///   reset_output_composer.nr for why).\n///   For some such txs, the `note_index_in_tx` might still be predictable through simulation, but\n///   for txs whose public functions create a varying number of non-revertible notes (determined at\n///   runtime), the `note_index_in_tx` will not be deterministically derivable before submitting the\n///   tx to the network.\n/// )\n///\n/// We use the `first_nullifier` of a tx as a seed of uniqueness. We have a guarantee that there will\n/// always be at least one nullifier per tx, because the init circuit will create one if one isn't\n/// created naturally by any functions of the tx. (Search \"protocol_nullifier\").\n/// We combine the `first_nullifier` with the note's index (its position within this tx's new\n/// note_hashes array) (`note_index_in_tx`) to get a truly unique value to inject into a note, which\n/// we call a `note_nonce`.\npub fn compute_unique_note_hash(note_nonce: Field, siloed_note_hash: Field) -> Field {\n    let inputs = [note_nonce, siloed_note_hash];\n    poseidon2_hash_with_separator(inputs, DOM_SEP__UNIQUE_NOTE_HASH)\n}\n\npub fn compute_note_hash_nonce(first_nullifier_in_tx: Field, note_index_in_tx: u32) -> Field {\n    // Hashing the first nullifier with note index in tx is guaranteed to be unique (because all nullifiers are also\n    // unique).\n    poseidon2_hash_with_separator(\n        [first_nullifier_in_tx, note_index_in_tx as Field],\n        DOM_SEP__NOTE_HASH_NONCE,\n    )\n}\n\npub fn compute_note_nonce_and_unique_note_hash(\n    siloed_note_hash: Field,\n    first_nullifier: Field,\n    note_index_in_tx: u32,\n) -> Field {\n    let note_nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n    compute_unique_note_hash(note_nonce, siloed_note_hash)\n}\n\npub fn compute_siloed_nullifier(contract_address: AztecAddress, nullifier: Field) -> Field {\n    poseidon2_hash_with_separator(\n        [contract_address.to_field(), nullifier],\n        DOM_SEP__SILOED_NULLIFIER,\n    )\n}\n\npub fn create_protocol_nullifier(tx_request: TxRequest) -> Scoped<Counted<Nullifier>> {\n    // The protocol nullifier is ascribed a special side-effect counter of 1. No other side-effect\n    // can have counter 1 (see `validate_as_first_call` for that assertion).\n    Nullifier { value: tx_request.hash(), note_hash: 0 }.count(1).scope(\n        NULL_MSG_SENDER_CONTRACT_ADDRESS,\n    )\n}\n\npub fn compute_log_tag(raw_tag: Field, dom_sep: u32) -> Field {\n    poseidon2_hash_with_separator([raw_tag], dom_sep)\n}\n\npub fn compute_siloed_private_log_first_field(\n    contract_address: AztecAddress,\n    field: Field,\n) -> Field {\n    poseidon2_hash_with_separator(\n        [contract_address.to_field(), field],\n        DOM_SEP__PRIVATE_LOG_FIRST_FIELD,\n    )\n}\n\npub fn compute_siloed_private_log(contract_address: AztecAddress, log: PrivateLog) -> PrivateLog {\n    let mut fields = log.fields;\n    fields[0] = compute_siloed_private_log_first_field(contract_address, fields[0]);\n    PrivateLog::new(fields, log.length)\n}\n\npub fn compute_contract_class_log_hash(log: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS]) -> Field {\n    poseidon2_hash(log)\n}\n\npub fn compute_app_siloed_secret_key(\n    master_secret_key: EmbeddedCurveScalar,\n    app_address: AztecAddress,\n    key_type_domain_separator: Field,\n) -> Field {\n    poseidon2_hash_with_separator(\n        [master_secret_key.hi, master_secret_key.lo, app_address.to_field()],\n        key_type_domain_separator,\n    )\n}\n\npub fn compute_l2_to_l1_message_hash(\n    message: Scoped<L2ToL1Message>,\n    rollup_version_id: Field,\n    chain_id: Field,\n) -> Field {\n    let contract_address_bytes: [u8; 32] = message.contract_address.to_field().to_be_bytes();\n    let recipient_bytes: [u8; 20] = message.inner.recipient.to_be_bytes();\n    let content_bytes: [u8; 32] = message.inner.content.to_be_bytes();\n    let rollup_version_id_bytes: [u8; 32] = rollup_version_id.to_be_bytes();\n    let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n\n    let mut bytes: [u8; 148] = std::mem::zeroed();\n    for i in 0..32 {\n        bytes[i] = contract_address_bytes[i];\n        bytes[i + 32] = rollup_version_id_bytes[i];\n        // 64 - 84 are for recipient.\n        bytes[i + 84] = chain_id_bytes[i];\n        bytes[i + 116] = content_bytes[i];\n    }\n\n    for i in 0..20 {\n        bytes[64 + i] = recipient_bytes[i];\n    }\n\n    sha256_to_field(bytes)\n}\n\n// TODO: consider a variant that enables domain separation with a u32 (we seem to have standardised u32s for domain separators)\n/// Computes sha256 hash of 2 input fields.\n///\n/// @returns A truncated field (i.e., the first byte is always 0).\npub fn accumulate_sha256(v0: Field, v1: Field) -> Field {\n    // Concatenate two fields into 32 x 2 = 64 bytes\n    let v0_as_bytes: [u8; 32] = v0.to_be_bytes();\n    let v1_as_bytes: [u8; 32] = v1.to_be_bytes();\n    let hash_input_flattened = v0_as_bytes.concat(v1_as_bytes);\n\n    sha256_to_field(hash_input_flattened)\n}\n\npub fn poseidon2_hash<let N: u32>(inputs: [Field; N]) -> Field {\n    poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n    T: ToField,\n{\n    let inputs_with_separator = [separator.to_field()].concat(inputs);\n    poseidon2_hash(inputs_with_separator)\n}\n\n/// Computes a Poseidon2 hash over a dynamic-length subarray of the given input.\n/// Only the first `in_len` fields of `input` are absorbed; any remaining fields are ignored.\n/// The caller is responsible for ensuring that the input is padded with zeros if required.\n#[no_predicates]\npub fn poseidon2_hash_subarray<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n    let mut sponge = poseidon2_absorb_in_chunks(input, in_len);\n    sponge.squeeze()\n}\n\n// This function is  unconstrained because it is intended to be used in unconstrained context only as\n// in constrained contexts it would be too inefficient.\npub unconstrained fn poseidon2_hash_with_separator_bounded_vec<let N: u32, T>(\n    inputs: BoundedVec<Field, N>,\n    separator: T,\n) -> Field\nwhere\n    T: ToField,\n{\n    let in_len = inputs.len() + 1;\n    let iv: Field = (in_len as Field) * TWO_POW_64;\n    let mut sponge = Poseidon2Sponge::new(iv);\n    sponge.absorb(separator.to_field());\n\n    for i in 0..inputs.len() {\n        sponge.absorb(inputs.get(i));\n    }\n\n    sponge.squeeze()\n}\n\n#[no_predicates]\npub fn poseidon2_hash_bytes<let N: u32>(inputs: [u8; N]) -> Field {\n    let mut fields = [0; (N + 30) / 31];\n    let mut field_index = 0;\n    let mut current_field = [0; 31];\n    for i in 0..inputs.len() {\n        let index = i % 31;\n        current_field[index] = inputs[i];\n        if index == 30 {\n            fields[field_index] = field_from_bytes(current_field, false);\n            current_field = [0; 31];\n            field_index += 1;\n        }\n    }\n    if field_index != fields.len() {\n        fields[field_index] = field_from_bytes(current_field, false);\n    }\n    poseidon2_hash(fields)\n}\n\n#[test]\nfn subarray_hash_matches_fixed() {\n    let values_to_hash = [3; 17];\n    let padded = values_to_hash.concat([0; 11]);\n    let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n    // Hash the entire values_to_hash.\n    let fixed_len_hash = poseidon::poseidon2::Poseidon2::hash(values_to_hash, values_to_hash.len());\n\n    assert_eq(subarray_hash, fixed_len_hash);\n}\n\n#[test]\nfn subarray_hash_matches_variable() {\n    let values_to_hash = [3; 17];\n    let padded = values_to_hash.concat([0; 11]);\n    let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n    // Hash up to values_to_hash.len() fields of the padded array.\n    let variable_len_hash = poseidon::poseidon2::Poseidon2::hash(padded, values_to_hash.len());\n\n    assert_eq(subarray_hash, variable_len_hash);\n}\n\n#[test]\nfn smoke_sha256_to_field() {\n    let full_buffer = [\n        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n        25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n        48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70,\n        71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93,\n        94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112,\n        113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130,\n        131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148,\n        149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159,\n    ];\n    let result = sha256_to_field(full_buffer);\n\n    assert(result == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184c7);\n\n    // to show correctness of the current ver (truncate one byte) vs old ver (mod full bytes):\n    let result_bytes = sha256::digest(full_buffer);\n    let truncated_field = crate::utils::field::field_from_bytes_32_trunc(result_bytes);\n    assert(truncated_field == result);\n    let mod_res = result + (result_bytes[31] as Field);\n    assert(mod_res == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184e0);\n}\n\n#[test]\nfn unique_siloed_note_hash_matches_typescript() {\n    let inner_note_hash = 1;\n    let contract_address = AztecAddress::from_field(2);\n    let first_nullifier = 3;\n    let note_index_in_tx = 4;\n\n    let siloed_note_hash = compute_siloed_note_hash(contract_address, inner_note_hash);\n    let siloed_note_hash_from_ts =\n        0x1986a4bea3eddb1fff917d629a13e10f63f514f401bdd61838c6b475db949169;\n    assert_eq(siloed_note_hash, siloed_note_hash_from_ts);\n\n    let nonce: Field = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n    let note_hash_nonce_from_ts =\n        0x28e7799791bf066a57bb51fdd0fbcaf3f0926414314c7db515ea343f44f5d58b;\n    assert_eq(nonce, note_hash_nonce_from_ts);\n\n    let unique_siloed_note_hash_from_nonce = compute_unique_note_hash(nonce, siloed_note_hash);\n    let unique_siloed_note_hash = compute_note_nonce_and_unique_note_hash(\n        siloed_note_hash,\n        first_nullifier,\n        note_index_in_tx,\n    );\n    assert_eq(unique_siloed_note_hash_from_nonce, unique_siloed_note_hash);\n\n    let unique_siloed_note_hash_from_ts =\n        0x29949aef207b715303b24639737c17fbfeb375c1d965ecfa85c7e4f0febb7d16;\n    assert_eq(unique_siloed_note_hash, unique_siloed_note_hash_from_ts);\n}\n\n#[test]\nfn siloed_nullifier_matches_typescript() {\n    let contract_address = AztecAddress::from_field(123);\n    let nullifier = 456;\n\n    let res = compute_siloed_nullifier(contract_address, nullifier);\n\n    let siloed_nullifier_from_ts =\n        0x169b50336c1f29afdb8a03d955a81e485f5ac7d5f0b8065673d1e407e5877813;\n\n    assert_eq(res, siloed_nullifier_from_ts);\n}\n\n#[test]\nfn siloed_private_log_first_field_matches_typescript() {\n    let contract_address = AztecAddress::from_field(123);\n    let field = 456;\n    let res = compute_siloed_private_log_first_field(contract_address, field);\n\n    let siloed_private_log_first_field_from_ts =\n        0x29480984f7b9257fded523d50addbcfc8d1d33adcf2db73ef3390a8fd5cdffaa;\n\n    assert_eq(res, siloed_private_log_first_field_from_ts);\n}\n\n#[test]\nfn empty_l2_to_l1_message_hash_matches_typescript() {\n    // All zeroes\n    let res = compute_l2_to_l1_message_hash(\n        L2ToL1Message { recipient: EthAddress::zero(), content: 0 }.scope(AztecAddress::from_field(\n            0,\n        )),\n        0,\n        0,\n    );\n\n    let empty_l2_to_l1_msg_hash_from_ts =\n        0x003b18c58c739716e76429634a61375c45b3b5cd470c22ab6d3e14cee23dd992;\n\n    assert_eq(res, empty_l2_to_l1_msg_hash_from_ts);\n}\n\n#[test]\nfn l2_to_l1_message_hash_matches_typescript() {\n    let message = L2ToL1Message { recipient: EthAddress::from_field(1), content: 2 }.scope(\n        AztecAddress::from_field(3),\n    );\n    let version = 4;\n    let chainId = 5;\n\n    let hash = compute_l2_to_l1_message_hash(message, version, chainId);\n\n    // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n    let l2_to_l1_message_hash_from_ts =\n        0x0081edf209e087ad31b3fd24263698723d57190bd1d6e9fe056fc0c0a68ee661;\n\n    assert_eq(hash, l2_to_l1_message_hash_from_ts);\n}\n\n#[test]\nunconstrained fn poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version() {\n    let inputs = BoundedVec::<Field, 4>::from_array([1, 2, 3]);\n    let separator = 42;\n\n    // Hash using bounded vec version\n    let bounded_result = poseidon2_hash_with_separator_bounded_vec(inputs, separator);\n\n    // Hash using regular version\n    let regular_result = poseidon2_hash_with_separator([1, 2, 3], separator);\n\n    // Results should match\n    assert_eq(bounded_result, regular_result);\n}\n"
     },
-    "357": {
+    "355": {
       "function_locations": [
         {
           "name": "fatal_log",
@@ -5345,7 +5293,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/logging.nr",
       "source": "// Log levels matching the JS logger:\n\n// global SILENT_LOG_LEVEL: u8 = 0;\nglobal FATAL_LOG_LEVEL: u8 = 1;\nglobal ERROR_LOG_LEVEL: u8 = 2;\nglobal WARN_LOG_LEVEL: u8 = 3;\nglobal INFO_LOG_LEVEL: u8 = 4;\nglobal VERBOSE_LOG_LEVEL: u8 = 5;\nglobal DEBUG_LOG_LEVEL: u8 = 6;\nglobal TRACE_LOG_LEVEL: u8 = 7;\n\n// --- Per-level log functions (no format args) ---\n\npub fn fatal_log<let N: u32>(msg: str<N>) {\n    fatal_log_format(msg, []);\n}\n\npub fn error_log<let N: u32>(msg: str<N>) {\n    error_log_format(msg, []);\n}\n\npub fn warn_log<let N: u32>(msg: str<N>) {\n    warn_log_format(msg, []);\n}\n\npub fn info_log<let N: u32>(msg: str<N>) {\n    info_log_format(msg, []);\n}\n\npub fn verbose_log<let N: u32>(msg: str<N>) {\n    verbose_log_format(msg, []);\n}\n\npub fn debug_log<let N: u32>(msg: str<N>) {\n    debug_log_format(msg, []);\n}\n\npub fn trace_log<let N: u32>(msg: str<N>) {\n    trace_log_format(msg, []);\n}\n\n// --- Per-level log functions (with format args) ---\n\npub fn fatal_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(FATAL_LOG_LEVEL, msg, args);\n}\n\npub fn error_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(ERROR_LOG_LEVEL, msg, args);\n}\n\npub fn warn_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(WARN_LOG_LEVEL, msg, args);\n}\n\npub fn info_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(INFO_LOG_LEVEL, msg, args);\n}\n\npub fn verbose_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(VERBOSE_LOG_LEVEL, msg, args);\n}\n\npub fn debug_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(DEBUG_LOG_LEVEL, msg, args);\n}\n\npub fn trace_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n    log_format(TRACE_LOG_LEVEL, msg, args);\n}\n\nfn log_format<let M: u32, let N: u32>(log_level: u8, msg: str<M>, args: [Field; N]) {\n    // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n    // to call.\n    unsafe { log_oracle_wrapper(log_level, msg, args) };\n}\n\nunconstrained fn log_oracle_wrapper<let M: u32, let N: u32>(\n    log_level: u8,\n    msg: str<M>,\n    args: [Field; N],\n) {\n    log_oracle(log_level, msg, N, args);\n}\n\n// While the length parameter might seem unnecessary given that we have N, we keep it around because at the AVM\n// bytecode level we want to support non-comptime-known lengths for such opcodes, even if Noir code will not generally\n// take that route. The AVM transpiler maps this oracle to the DEBUGLOG opcode, which reads the fields size from memory.\n#[oracle(aztec_utl_log)]\nunconstrained fn log_oracle<let M: u32, let N: u32>(\n    log_level: u8,\n    msg: str<M>,\n    length: u32,\n    args: [Field; N],\n) {}\n"
     },
-    "376": {
+    "374": {
       "function_locations": [
         {
           "name": "Poseidon2Sponge::hash",
@@ -5375,7 +5323,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/poseidon2.nr",
       "source": "use crate::constants::TWO_POW_64;\nuse crate::traits::{Deserialize, Serialize};\nuse std::meta::derive;\n// NB: This is a clone of noir/noir-repo/noir_stdlib/src/hash/poseidon2.nr\n// It exists as we sometimes need to perform custom absorption, but the stdlib version\n// has a private absorb() method (it's also designed to just be a hasher)\n// Can be removed when standalone noir poseidon lib exists: See noir#6679\n// TODO: Poseidon is stand-alone now\n\nglobal RATE: u32 = 3;\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct Poseidon2Sponge {\n    pub cache: [Field; 3],\n    pub state: [Field; 4],\n    pub cache_size: u32,\n    pub squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2Sponge {\n    #[no_predicates]\n    pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n        Poseidon2Sponge::hash_internal(input, message_size, message_size != N)\n    }\n\n    pub(crate) fn new(iv: Field) -> Poseidon2Sponge {\n        let mut result =\n            Poseidon2Sponge { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n        result.state[RATE] = iv;\n        result\n    }\n\n    fn perform_duplex(&mut self) {\n        // add the cache into sponge state\n        for i in 0..RATE {\n            // We effectively zero-pad the cache by only adding to the state\n            // cache that is less than the specified `cache_size`\n            if i < self.cache_size {\n                self.state[i] += self.cache[i];\n            }\n        }\n        self.state = std::hash::poseidon2_permutation(self.state, 4);\n    }\n\n    pub fn absorb(&mut self, input: Field) {\n        assert(!self.squeeze_mode);\n        if self.cache_size == RATE {\n            // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n            self.perform_duplex();\n            self.cache[0] = input;\n            self.cache_size = 1;\n        } else {\n            // If we're absorbing, and the cache is not full, add the input into the cache\n            self.cache[self.cache_size] = input;\n            self.cache_size += 1;\n        }\n    }\n\n    pub fn squeeze(&mut self) -> Field {\n        assert(!self.squeeze_mode);\n        // If we're in absorb mode, apply sponge permutation to compress the cache.\n        self.perform_duplex();\n        self.squeeze_mode = true;\n\n        // Pop one item off the top of the permutation and return it.\n        self.state[0]\n    }\n\n    fn hash_internal<let N: u32>(\n        input: [Field; N],\n        in_len: u32,\n        is_variable_length: bool,\n    ) -> Field {\n        let iv: Field = (in_len as Field) * TWO_POW_64;\n        let mut sponge = Poseidon2Sponge::new(iv);\n        for i in 0..input.len() {\n            if i < in_len {\n                sponge.absorb(input[i]);\n            }\n        }\n\n        sponge.squeeze()\n    }\n}\n"
     },
-    "388": {
+    "386": {
       "function_locations": [
         {
           "name": "derive_storage_slot_in_map",
@@ -5389,7 +5337,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/storage/map.nr",
       "source": "use crate::{\n    constants::DOM_SEP__PUBLIC_STORAGE_MAP_SLOT, hash::poseidon2_hash_with_separator,\n    traits::ToField,\n};\n\n// TODO: Move this to src/public_data/storage/map.nr\npub fn derive_storage_slot_in_map<K>(storage_slot: Field, key: K) -> Field\nwhere\n    K: ToField,\n{\n    poseidon2_hash_with_separator(\n        [storage_slot, key.to_field()],\n        DOM_SEP__PUBLIC_STORAGE_MAP_SLOT,\n    )\n}\n\nmod test {\n    use crate::{address::AztecAddress, storage::map::derive_storage_slot_in_map, traits::FromField};\n\n    #[test]\n    fn test_derive_storage_slot_in_map_matches_typescript() {\n        let map_slot = 0x132258fb6962c4387ba659d9556521102d227549a386d39f0b22d1890d59c2b5;\n        let key = AztecAddress::from_field(\n            0x302dbc2f9b50a73283d5fb2f35bc01eae8935615817a0b4219a057b2ba8a5a3f,\n        );\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 =\n            0x2d225f361108379adc2da91378b9702675c5546b57e78bafc1e74ec7fec55967;\n\n        assert_eq(slot, slot_from_typescript);\n    }\n}\n"
     },
-    "395": {
+    "393": {
       "function_locations": [
         {
           "name": "<impl ToField for Field>::to_field",
@@ -5431,7 +5379,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/traits/to_field.nr",
       "source": "use crate::utils::field::field_from_bytes;\n\npub trait ToField {\n    fn to_field(self) -> Field;\n}\n\nimpl ToField for Field {\n    #[inline_always]\n    fn to_field(self) -> Field {\n        self\n    }\n}\n\nimpl ToField for bool {\n    #[inline_always]\n    fn to_field(self) -> Field {\n        self as Field\n    }\n}\nimpl ToField for u1 {\n    #[inline_always]\n    fn to_field(self) -> Field {\n        self as Field\n    }\n}\nimpl ToField for u8 {\n    #[inline_always]\n    fn to_field(self) -> Field {\n        self as Field\n    }\n}\nimpl ToField for u16 {\n    fn to_field(self) -> Field {\n        self as Field\n    }\n}\nimpl ToField for u32 {\n    #[inline_always]\n    fn to_field(self) -> Field {\n        self as Field\n    }\n}\nimpl ToField for u64 {\n    #[inline_always]\n    fn to_field(self) -> Field {\n        self as Field\n    }\n}\nimpl ToField for u128 {\n    #[inline_always]\n    fn to_field(self) -> Field {\n        self as Field\n    }\n}\nimpl<let N: u32> ToField for str<N> {\n    #[inline_always]\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"
     },
-    "396": {
+    "394": {
       "function_locations": [
         {
           "name": "<impl Packable for bool>::pack",
@@ -5553,7 +5501,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/type_packing.nr",
       "source": "use crate::traits::Packable;\n\nglobal BOOL_PACKED_LEN: u32 = 1;\nglobal U8_PACKED_LEN: u32 = 1;\nglobal U16_PACKED_LEN: u32 = 1;\nglobal U32_PACKED_LEN: u32 = 1;\nglobal U64_PACKED_LEN: u32 = 1;\nglobal U128_PACKED_LEN: u32 = 1;\nglobal FIELD_PACKED_LEN: u32 = 1;\nglobal I8_PACKED_LEN: u32 = 1;\nglobal I16_PACKED_LEN: u32 = 1;\nglobal I32_PACKED_LEN: u32 = 1;\nglobal I64_PACKED_LEN: u32 = 1;\n\nimpl Packable for bool {\n    let N: u32 = BOOL_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> bool {\n        (fields[0] as u1) != 0\n    }\n}\n\nimpl Packable for u8 {\n    let N: u32 = U8_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u8\n    }\n}\n\nimpl Packable for u16 {\n    let N: u32 = U16_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u16\n    }\n}\n\nimpl Packable for u32 {\n    let N: u32 = U32_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u32\n    }\n}\n\nimpl Packable for u64 {\n    let N: u32 = U64_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u64\n    }\n}\n\nimpl Packable for u128 {\n    let N: u32 = U128_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u128\n    }\n}\n\nimpl Packable for Field {\n    let N: u32 = FIELD_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0]\n    }\n}\n\nimpl Packable for i8 {\n    let N: u32 = I8_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as u8 as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u8 as i8\n    }\n}\n\nimpl Packable for i16 {\n    let N: u32 = I16_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as u16 as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u16 as i16\n    }\n}\n\nimpl Packable for i32 {\n    let N: u32 = I32_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as u32 as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u32 as i32\n    }\n}\n\nimpl Packable for i64 {\n    let N: u32 = I64_PACKED_LEN;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        [self as u64 as Field]\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        fields[0] as u64 as i64\n    }\n}\n\nimpl<T, let M: u32> Packable for [T; M]\nwhere\n    T: Packable,\n{\n    let N: u32 = M * <T as Packable>::N;\n\n    #[inline_always]\n    fn pack(self) -> [Field; Self::N] {\n        let mut result: [Field; Self::N] = std::mem::zeroed();\n        for i in 0..M {\n            let serialized = self[i].pack();\n            for j in 0..<T as Packable>::N {\n                result[i * <T as Packable>::N + j] = serialized[j];\n            }\n        }\n        result\n    }\n\n    #[inline_always]\n    fn unpack(fields: [Field; Self::N]) -> Self {\n        let mut reader = crate::utils::reader::Reader::new(fields);\n        let result: [T; M] = std::mem::zeroed();\n        reader.read_struct_array::<T, <T as Packable>::N, M>(Packable::unpack, result)\n    }\n}\n\n#[test]\nfn test_u16_packing() {\n    let a: u16 = 10;\n    assert_eq(a, u16::unpack(a.pack()));\n}\n\n#[test]\nfn test_i8_packing() {\n    let a: i8 = -10;\n    assert_eq(a, i8::unpack(a.pack()));\n}\n\n#[test]\nfn test_i16_packing() {\n    let a: i16 = -10;\n    assert_eq(a, i16::unpack(a.pack()));\n}\n\n#[test]\nfn test_i32_packing() {\n    let a: i32 = -10;\n    assert_eq(a, i32::unpack(a.pack()));\n}\n\n#[test]\nfn test_i64_packing() {\n    let a: i64 = -10;\n    assert_eq(a, i64::unpack(a.pack()));\n}\n"
     },
-    "403": {
+    "401": {
       "function_locations": [
         {
           "name": "field_from_bytes",
@@ -5563,123 +5511,111 @@
           "name": "field_from_bytes_32_trunc",
           "start": 553
         },
-        {
-          "name": "full_field_less_than",
-          "start": 1218
-        },
-        {
-          "name": "full_field_greater_than",
-          "start": 1302
-        },
         {
           "name": "min",
-          "start": 1365
+          "start": 1054
         },
         {
           "name": "pow",
-          "start": 2210
+          "start": 1899
         },
         {
           "name": "sqrt",
-          "start": 2542
+          "start": 2231
         },
         {
           "name": "is_square",
-          "start": 3224
+          "start": 2913
         },
         {
           "name": "tonelli_shanks_sqrt",
-          "start": 3652
+          "start": 3341
         },
         {
           "name": "__sqrt",
-          "start": 4260
+          "start": 3949
         },
         {
           "name": "validate_sqrt_hint",
-          "start": 5104
+          "start": 4793
         },
         {
           "name": "validate_not_sqrt_hint",
-          "start": 5241
+          "start": 4930
         },
         {
           "name": "bytes_field_test",
-          "start": 6879
+          "start": 6568
         },
         {
           "name": "max_field_test",
-          "start": 7862
+          "start": 7551
         },
         {
           "name": "sqrt_valid_test",
-          "start": 8486
+          "start": 8175
         },
         {
           "name": "sqrt_invalid_test",
-          "start": 8688
+          "start": 8377
         },
         {
           "name": "sqrt_zero_test",
-          "start": 8857
+          "start": 8546
         },
         {
           "name": "sqrt_one_test",
-          "start": 8994
+          "start": 8683
         },
         {
           "name": "field_from_bytes_empty_test",
-          "start": 9163
+          "start": 8852
         },
         {
           "name": "field_from_bytes_little_endian_test",
-          "start": 9416
+          "start": 9105
         },
         {
           "name": "pow_test",
-          "start": 9801
+          "start": 9490
         },
         {
           "name": "min_test",
-          "start": 10024
-        },
-        {
-          "name": "full_field_comparison_test",
-          "start": 10201
+          "start": 9713
         },
         {
           "name": "sqrt_has_two_roots_test",
-          "start": 10515
+          "start": 9887
         },
         {
           "name": "sqrt_negative_one_test",
-          "start": 11188
+          "start": 10560
         },
         {
           "name": "validate_sqrt_hint_valid_test",
-          "start": 11394
+          "start": 10766
         },
         {
           "name": "validate_sqrt_hint_invalid_test",
-          "start": 11825
+          "start": 11197
         },
         {
           "name": "validate_not_sqrt_hint_valid_test",
-          "start": 11957
+          "start": 11329
         },
         {
           "name": "validate_not_sqrt_hint_zero_test",
-          "start": 12237
+          "start": 11609
         },
         {
           "name": "validate_not_sqrt_hint_wrong_hint_test",
-          "start": 12454
+          "start": 11826
         }
       ],
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/field.nr",
-      "source": "pub fn field_from_bytes<let N: u32>(bytes: [u8; N], big_endian: bool) -> Field {\n    assert(bytes.len() < 32, \"field_from_bytes: N must be less than 32\");\n    let mut as_field = 0;\n    let mut offset = 1;\n    for i in 0..N {\n        let mut index = i;\n        if big_endian {\n            index = N - i - 1;\n        }\n        as_field += (bytes[index] as Field) * offset;\n        offset *= 256;\n    }\n\n    as_field\n}\n\n// Convert a 32 byte array to a field element by truncating the final byte\npub fn field_from_bytes_32_trunc(bytes32: [u8; 32]) -> Field {\n    // Convert it to a field element\n    let mut v = 1;\n    let mut high = 0 as Field;\n    let mut low = 0 as Field;\n\n    for i in 0..15 {\n        // covers bytes 16..30 (31 is truncated and ignored)\n        low = low + (bytes32[15 + 15 - i] as Field) * v;\n        v = v * 256;\n        // covers bytes 0..14\n        high = high + (bytes32[14 - i] as Field) * v;\n    }\n    // covers byte 15\n    low = low + (bytes32[15] as Field) * v;\n\n    low + high * v\n}\n\n// TODO to radix returns u8, so we cannot use bigger radixes. It'd be ideal to use a radix of the maximum range-constrained integer noir supports\npub fn full_field_less_than(lhs: Field, rhs: Field) -> bool {\n    lhs.lt(rhs)\n}\n\npub fn full_field_greater_than(lhs: Field, rhs: Field) -> bool {\n    rhs.lt(lhs)\n}\n\npub fn min(f1: Field, f2: Field) -> Field {\n    if f1.lt(f2) {\n        f1\n    } else {\n        f2\n    }\n}\n\n// TODO: write doc-comments and tests for these magic constants.\n\nglobal KNOWN_NON_RESIDUE: Field = 5; // This is a non-residue in Noir's native Field.\nglobal C1: u32 = 28;\nglobal C3: Field = 40770029410420498293352137776570907027550720424234931066070132305055;\nglobal C5: Field = 19103219067921713944291392827692070036145651957329286315305642004821462161904;\n\n// @dev: only use this for _huge_ exponents y, when writing a constrained function.\n// If you're only exponentiating by a small value, first consider writing-out the multiplications by hand.\n// Only after you've measured the gates of that approach, consider using the native Field::pow_32 function.\n// Only if your exponent is larger than 32 bits, resort to using this function.\npub fn pow(x: Field, y: Field) -> Field {\n    let mut r = 1 as Field;\n    let b: [u1; 254] = y.to_le_bits();\n\n    for i in 0..254 {\n        r *= r;\n        r *= (b[254 - 1 - i] as Field) * x + (1 - b[254 - 1 - i] as Field);\n    }\n\n    r\n}\n\n/// Returns Option::some(sqrt) if there is a square root, and Option::none() if there isn't.\npub fn sqrt(x: Field) -> Option<Field> {\n    // Safety: if the hint returns the square root of x, then we simply square it\n    // check the result equals x. If x is not square, we return a value that\n    // enables us to prove that fact (see the `else` clause below).\n    let (is_sq, maybe_sqrt) = unsafe { __sqrt(x) };\n\n    if is_sq {\n        let sqrt = maybe_sqrt;\n        validate_sqrt_hint(x, sqrt);\n        Option::some(sqrt)\n    } else {\n        let not_sqrt_hint = maybe_sqrt;\n        validate_not_sqrt_hint(x, not_sqrt_hint);\n        Option::none()\n    }\n}\n\n// Boolean indicating whether Field element is a square, i.e. whether there exists a y in Field s.t. x = y*y.\nunconstrained fn is_square(x: Field) -> bool {\n    let v = pow(x, -1 / 2);\n    v * (v - 1) == 0\n}\n\n// Tonelli-Shanks algorithm for computing the square root of a Field element.\n// Requires C1 = max{c: 2^c divides (p-1)}, where p is the order of Field\n// as well as C3 = (C2 - 1)/2, where C2 = (p-1)/(2^c1),\n// and C5 = ZETA^C2, where ZETA is a non-square element of Field.\n// These are pre-computed above as globals.\nunconstrained fn tonelli_shanks_sqrt(x: Field) -> Field {\n    let mut z = pow(x, C3);\n    let mut t = z * z * x;\n    z *= x;\n    let mut b = t;\n    let mut c = C5;\n\n    for i in 0..(C1 - 1) {\n        for _j in 1..(C1 - i - 1) {\n            b *= b;\n        }\n\n        z *= if b == 1 { 1 } else { c };\n\n        c *= c;\n\n        t *= if b == 1 { 1 } else { c };\n\n        b = t;\n    }\n\n    z\n}\n\n// NB: this doesn't return an option, because in the case of there _not_ being a square root, we still want to return a field element that allows us to then assert in the _constrained_ sqrt function that there is no sqrt.\nunconstrained fn __sqrt(x: Field) -> (bool, Field) {\n    let is_sq = is_square(x);\n    if is_sq {\n        let sqrt = tonelli_shanks_sqrt(x);\n        (true, sqrt)\n    } else {\n        // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n        // Facts:\n        // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n        // - If x is a square, LS(x) = 1\n        // - If x is not a square, LS(x) = -1\n        // - If x = 0, LS(x) = 0.\n        //\n        // Hence:\n        // sq * sq = sq // 1 * 1 = 1\n        // non-sq * non-sq = sq // -1 * -1 = 1\n        // sq * non-sq = non-sq // -1 * 1 = -1\n        //\n        // See: https://en.wikipedia.org/wiki/Legendre_symbol\n        let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n        let not_sqrt = tonelli_shanks_sqrt(demo_x_not_square);\n        (false, not_sqrt)\n    }\n}\n\nfn validate_sqrt_hint(x: Field, hint: Field) {\n    assert(hint * hint == x, f\"The claimed_sqrt {hint} is not the sqrt of x {x}\");\n}\n\nfn validate_not_sqrt_hint(x: Field, hint: Field) {\n    // We need this assertion, because x = 0 would pass the other assertions in this\n    // function, and we don't want people to be able to prove that 0 is not square!\n    assert(x != 0, \"0 has a square root; you cannot claim it is not square\");\n    // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n    //\n    // Facts:\n    // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n    // - If x is a square, LS(x) = 1\n    // - If x is not a square, LS(x) = -1\n    // - If x = 0, LS(x) = 0.\n    //\n    // Hence:\n    // 1. sq * sq = sq // 1 * 1 = 1\n    // 2. non-sq * non-sq = sq // -1 * -1 = 1\n    // 3. sq * non-sq = non-sq // -1 * 1 = -1\n    //\n    // See: https://en.wikipedia.org/wiki/Legendre_symbol\n    //\n    // We want to demonstrate that this below multiplication falls under bullet-point (2):\n    let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n    // I.e. we want to demonstrate that `demo_x_not_square` has Legendre symbol 1\n    // (i.e. that it is a square), so we prove that it is square below.\n    // Why do we want to prove that it has LS 1?\n    // Well, since it was computed with a known-non-residue, its squareness implies we're\n    // in case 2 (something multiplied by a known-non-residue yielding a result which\n    // has a LS of 1), which implies that x must be a non-square. The unconstrained\n    // function gave us the sqrt of demo_x_not_square, so all we need to do is\n    // assert its squareness:\n    assert(\n        hint * hint == demo_x_not_square,\n        f\"The hint {hint} does not demonstrate that {x} is not a square\",\n    );\n}\n\n#[test]\nunconstrained fn bytes_field_test() {\n    // Tests correctness of field_from_bytes_32_trunc against existing methods\n    // Bytes representing 0x543e0a6642ffeb8039296861765a53407bba62bd1c97ca43374de950bbe0a7\n    let inputs = [\n        84, 62, 10, 102, 66, 255, 235, 128, 57, 41, 104, 97, 118, 90, 83, 64, 123, 186, 98, 189, 28,\n        151, 202, 67, 55, 77, 233, 80, 187, 224, 167,\n    ];\n    let field = field_from_bytes(inputs, true);\n    let return_bytes: [u8; 31] = field.to_be_bytes();\n    assert_eq(inputs, return_bytes);\n    // 32 bytes - we remove the final byte, and check it matches the field\n    let inputs2 = [\n        84, 62, 10, 102, 66, 255, 235, 128, 57, 41, 104, 97, 118, 90, 83, 64, 123, 186, 98, 189, 28,\n        151, 202, 67, 55, 77, 233, 80, 187, 224, 167, 158,\n    ];\n    let field2 = field_from_bytes_32_trunc(inputs2);\n    let return_bytes2: [u8; 31] = field2.to_be_bytes();\n\n    assert_eq(return_bytes2, return_bytes);\n    assert_eq(field2, field);\n}\n\n#[test]\nunconstrained fn max_field_test() {\n    // Tests the hardcoded value in constants.nr vs underlying modulus\n    // NB: We can't use 0-1 in constants.nr as it will be transpiled incorrectly to ts and sol constants files\n    let max_value = crate::constants::MAX_FIELD_VALUE;\n    assert_eq(max_value, 0 - 1);\n    // modulus == 0 is tested elsewhere, so below is more of a sanity check\n    let max_bytes: [u8; 32] = max_value.to_be_bytes();\n    let mod_bytes = std::field::modulus_be_bytes();\n    for i in 0..31 {\n        assert_eq(max_bytes[i], mod_bytes[i]);\n    }\n    assert_eq(max_bytes[31], mod_bytes[31] - 1);\n}\n\n#[test]\nunconstrained fn sqrt_valid_test() {\n    let x = 16; // examples: 16, 9, 25, 81\n    let result = sqrt(x);\n    assert(result.is_some());\n    assert_eq(result.unwrap() * result.unwrap(), x);\n}\n\n#[test]\nunconstrained fn sqrt_invalid_test() {\n    let x = KNOWN_NON_RESIDUE; // has no square root in the field\n    let result = sqrt(x);\n    assert(result.is_none());\n}\n\n#[test]\nunconstrained fn sqrt_zero_test() {\n    let result = sqrt(0);\n    assert(result.is_some());\n    assert_eq(result.unwrap(), 0);\n}\n\n#[test]\nunconstrained fn sqrt_one_test() {\n    let result = sqrt(1);\n    assert(result.is_some());\n    assert_eq(result.unwrap() * result.unwrap(), 1);\n}\n\n#[test]\nunconstrained fn field_from_bytes_empty_test() {\n    let empty: [u8; 0] = [];\n    let result = field_from_bytes(empty, true);\n    assert_eq(result, 0);\n\n    let result_le = field_from_bytes(empty, false);\n    assert_eq(result_le, 0);\n}\n\n#[test]\nunconstrained fn field_from_bytes_little_endian_test() {\n    // Test little-endian conversion: [0x01, 0x02] should be 0x0201 = 513\n    let bytes = [0x01, 0x02];\n    let result_le = field_from_bytes(bytes, false);\n    assert_eq(result_le, 0x0201);\n\n    // Compare with big-endian: [0x01, 0x02] should be 0x0102 = 258\n    let result_be = field_from_bytes(bytes, true);\n    assert_eq(result_be, 0x0102);\n}\n\n#[test]\nunconstrained fn pow_test() {\n    assert_eq(pow(2, 0), 1);\n    assert_eq(pow(2, 1), 2);\n    assert_eq(pow(2, 10), 1024);\n    assert_eq(pow(3, 5), 243);\n    assert_eq(pow(0, 5), 0);\n    assert_eq(pow(1, 100), 1);\n}\n\n#[test]\nunconstrained fn min_test() {\n    assert_eq(min(5, 10), 5);\n    assert_eq(min(10, 5), 5);\n    assert_eq(min(7, 7), 7);\n    assert_eq(min(0, 1), 0);\n}\n\n#[test]\nunconstrained fn full_field_comparison_test() {\n    assert(full_field_less_than(5, 10));\n    assert(!full_field_less_than(10, 5));\n    assert(!full_field_less_than(5, 5));\n\n    assert(full_field_greater_than(10, 5));\n    assert(!full_field_greater_than(5, 10));\n    assert(!full_field_greater_than(5, 5));\n}\n\n#[test]\nunconstrained fn sqrt_has_two_roots_test() {\n    // Every square has two roots: r and -r (i.e., p - r)\n    // sqrt(16) can return 4 or -4\n    let x = 16;\n    let result = sqrt(x).unwrap();\n    assert(result * result == x);\n    // The other root is -result\n    let other_root = 0 - result;\n    assert(other_root * other_root == x);\n    // Verify they are different (unless x = 0)\n    assert(result != other_root);\n\n    // Same for 9: roots are 3 and -3\n    let y = 9;\n    let result_y = sqrt(y).unwrap();\n    assert(result_y * result_y == y);\n    let other_root_y = 0 - result_y;\n    assert(other_root_y * other_root_y == y);\n    assert(result_y != other_root_y);\n}\n\n#[test]\nunconstrained fn sqrt_negative_one_test() {\n    let x = 0 - 1;\n    let result = sqrt(x);\n    assert(result.unwrap() == 0x30644e72e131a029048b6e193fd841045cea24f6fd736bec231204708f703636);\n}\n\n#[test]\nunconstrained fn validate_sqrt_hint_valid_test() {\n    // 4 is a valid sqrt of 16\n    validate_sqrt_hint(16, 4);\n    // -4 is also a valid sqrt of 16\n    validate_sqrt_hint(16, 0 - 4);\n    // 0 is a valid sqrt of 0\n    validate_sqrt_hint(0, 0);\n    // 1 is a valid sqrt of 1\n    validate_sqrt_hint(1, 1);\n    // -1 is also a valid sqrt of 1\n    validate_sqrt_hint(1, 0 - 1);\n}\n\n#[test(should_fail_with = \"is not the sqrt of x\")]\nunconstrained fn validate_sqrt_hint_invalid_test() {\n    // 5 is not a valid sqrt of 16\n    validate_sqrt_hint(16, 5);\n}\n\n#[test]\nunconstrained fn validate_not_sqrt_hint_valid_test() {\n    // 5 (KNOWN_NON_RESIDUE) is not a square.\n    let x = KNOWN_NON_RESIDUE;\n    let hint = tonelli_shanks_sqrt(x * KNOWN_NON_RESIDUE);\n    validate_not_sqrt_hint(x, hint);\n}\n\n#[test(should_fail_with = \"0 has a square root\")]\nunconstrained fn validate_not_sqrt_hint_zero_test() {\n    // 0 has a square root, so we cannot claim it is not square\n    validate_not_sqrt_hint(0, 0);\n}\n\n#[test(should_fail_with = \"does not demonstrate that\")]\nunconstrained fn validate_not_sqrt_hint_wrong_hint_test() {\n    // Provide a wrong hint for a non-square\n    let x = KNOWN_NON_RESIDUE;\n    validate_not_sqrt_hint(x, 123);\n}\n"
+      "source": "pub fn field_from_bytes<let N: u32>(bytes: [u8; N], big_endian: bool) -> Field {\n    assert(bytes.len() < 32, \"field_from_bytes: N must be less than 32\");\n    let mut as_field = 0;\n    let mut offset = 1;\n    for i in 0..N {\n        let mut index = i;\n        if big_endian {\n            index = N - i - 1;\n        }\n        as_field += (bytes[index] as Field) * offset;\n        offset *= 256;\n    }\n\n    as_field\n}\n\n// Convert a 32 byte array to a field element by truncating the final byte\npub fn field_from_bytes_32_trunc(bytes32: [u8; 32]) -> Field {\n    // Convert it to a field element\n    let mut v = 1;\n    let mut high = 0 as Field;\n    let mut low = 0 as Field;\n\n    for i in 0..15 {\n        // covers bytes 16..30 (31 is truncated and ignored)\n        low = low + (bytes32[15 + 15 - i] as Field) * v;\n        v = v * 256;\n        // covers bytes 0..14\n        high = high + (bytes32[14 - i] as Field) * v;\n    }\n    // covers byte 15\n    low = low + (bytes32[15] as Field) * v;\n\n    low + high * v\n}\n\npub fn min(f1: Field, f2: Field) -> Field {\n    if f1.lt(f2) {\n        f1\n    } else {\n        f2\n    }\n}\n\n// TODO: write doc-comments and tests for these magic constants.\n\nglobal KNOWN_NON_RESIDUE: Field = 5; // This is a non-residue in Noir's native Field.\nglobal C1: u32 = 28;\nglobal C3: Field = 40770029410420498293352137776570907027550720424234931066070132305055;\nglobal C5: Field = 19103219067921713944291392827692070036145651957329286315305642004821462161904;\n\n// @dev: only use this for _huge_ exponents y, when writing a constrained function.\n// If you're only exponentiating by a small value, first consider writing-out the multiplications by hand.\n// Only after you've measured the gates of that approach, consider using the native Field::pow_32 function.\n// Only if your exponent is larger than 32 bits, resort to using this function.\npub fn pow(x: Field, y: Field) -> Field {\n    let mut r = 1 as Field;\n    let b: [u1; 254] = y.to_le_bits();\n\n    for i in 0..254 {\n        r *= r;\n        r *= (b[254 - 1 - i] as Field) * x + (1 - b[254 - 1 - i] as Field);\n    }\n\n    r\n}\n\n/// Returns Option::some(sqrt) if there is a square root, and Option::none() if there isn't.\npub fn sqrt(x: Field) -> Option<Field> {\n    // Safety: if the hint returns the square root of x, then we simply square it\n    // check the result equals x. If x is not square, we return a value that\n    // enables us to prove that fact (see the `else` clause below).\n    let (is_sq, maybe_sqrt) = unsafe { __sqrt(x) };\n\n    if is_sq {\n        let sqrt = maybe_sqrt;\n        validate_sqrt_hint(x, sqrt);\n        Option::some(sqrt)\n    } else {\n        let not_sqrt_hint = maybe_sqrt;\n        validate_not_sqrt_hint(x, not_sqrt_hint);\n        Option::none()\n    }\n}\n\n// Boolean indicating whether Field element is a square, i.e. whether there exists a y in Field s.t. x = y*y.\nunconstrained fn is_square(x: Field) -> bool {\n    let v = pow(x, -1 / 2);\n    v * (v - 1) == 0\n}\n\n// Tonelli-Shanks algorithm for computing the square root of a Field element.\n// Requires C1 = max{c: 2^c divides (p-1)}, where p is the order of Field\n// as well as C3 = (C2 - 1)/2, where C2 = (p-1)/(2^c1),\n// and C5 = ZETA^C2, where ZETA is a non-square element of Field.\n// These are pre-computed above as globals.\nunconstrained fn tonelli_shanks_sqrt(x: Field) -> Field {\n    let mut z = pow(x, C3);\n    let mut t = z * z * x;\n    z *= x;\n    let mut b = t;\n    let mut c = C5;\n\n    for i in 0..(C1 - 1) {\n        for _j in 1..(C1 - i - 1) {\n            b *= b;\n        }\n\n        z *= if b == 1 { 1 } else { c };\n\n        c *= c;\n\n        t *= if b == 1 { 1 } else { c };\n\n        b = t;\n    }\n\n    z\n}\n\n// NB: this doesn't return an option, because in the case of there _not_ being a square root, we still want to return a field element that allows us to then assert in the _constrained_ sqrt function that there is no sqrt.\nunconstrained fn __sqrt(x: Field) -> (bool, Field) {\n    let is_sq = is_square(x);\n    if is_sq {\n        let sqrt = tonelli_shanks_sqrt(x);\n        (true, sqrt)\n    } else {\n        // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n        // Facts:\n        // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n        // - If x is a square, LS(x) = 1\n        // - If x is not a square, LS(x) = -1\n        // - If x = 0, LS(x) = 0.\n        //\n        // Hence:\n        // sq * sq = sq // 1 * 1 = 1\n        // non-sq * non-sq = sq // -1 * -1 = 1\n        // sq * non-sq = non-sq // -1 * 1 = -1\n        //\n        // See: https://en.wikipedia.org/wiki/Legendre_symbol\n        let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n        let not_sqrt = tonelli_shanks_sqrt(demo_x_not_square);\n        (false, not_sqrt)\n    }\n}\n\nfn validate_sqrt_hint(x: Field, hint: Field) {\n    assert(hint * hint == x, f\"The claimed_sqrt {hint} is not the sqrt of x {x}\");\n}\n\nfn validate_not_sqrt_hint(x: Field, hint: Field) {\n    // We need this assertion, because x = 0 would pass the other assertions in this\n    // function, and we don't want people to be able to prove that 0 is not square!\n    assert(x != 0, \"0 has a square root; you cannot claim it is not square\");\n    // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n    //\n    // Facts:\n    // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n    // - If x is a square, LS(x) = 1\n    // - If x is not a square, LS(x) = -1\n    // - If x = 0, LS(x) = 0.\n    //\n    // Hence:\n    // 1. sq * sq = sq // 1 * 1 = 1\n    // 2. non-sq * non-sq = sq // -1 * -1 = 1\n    // 3. sq * non-sq = non-sq // -1 * 1 = -1\n    //\n    // See: https://en.wikipedia.org/wiki/Legendre_symbol\n    //\n    // We want to demonstrate that this below multiplication falls under bullet-point (2):\n    let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n    // I.e. we want to demonstrate that `demo_x_not_square` has Legendre symbol 1\n    // (i.e. that it is a square), so we prove that it is square below.\n    // Why do we want to prove that it has LS 1?\n    // Well, since it was computed with a known-non-residue, its squareness implies we're\n    // in case 2 (something multiplied by a known-non-residue yielding a result which\n    // has a LS of 1), which implies that x must be a non-square. The unconstrained\n    // function gave us the sqrt of demo_x_not_square, so all we need to do is\n    // assert its squareness:\n    assert(\n        hint * hint == demo_x_not_square,\n        f\"The hint {hint} does not demonstrate that {x} is not a square\",\n    );\n}\n\n#[test]\nunconstrained fn bytes_field_test() {\n    // Tests correctness of field_from_bytes_32_trunc against existing methods\n    // Bytes representing 0x543e0a6642ffeb8039296861765a53407bba62bd1c97ca43374de950bbe0a7\n    let inputs = [\n        84, 62, 10, 102, 66, 255, 235, 128, 57, 41, 104, 97, 118, 90, 83, 64, 123, 186, 98, 189, 28,\n        151, 202, 67, 55, 77, 233, 80, 187, 224, 167,\n    ];\n    let field = field_from_bytes(inputs, true);\n    let return_bytes: [u8; 31] = field.to_be_bytes();\n    assert_eq(inputs, return_bytes);\n    // 32 bytes - we remove the final byte, and check it matches the field\n    let inputs2 = [\n        84, 62, 10, 102, 66, 255, 235, 128, 57, 41, 104, 97, 118, 90, 83, 64, 123, 186, 98, 189, 28,\n        151, 202, 67, 55, 77, 233, 80, 187, 224, 167, 158,\n    ];\n    let field2 = field_from_bytes_32_trunc(inputs2);\n    let return_bytes2: [u8; 31] = field2.to_be_bytes();\n\n    assert_eq(return_bytes2, return_bytes);\n    assert_eq(field2, field);\n}\n\n#[test]\nunconstrained fn max_field_test() {\n    // Tests the hardcoded value in constants.nr vs underlying modulus\n    // NB: We can't use 0-1 in constants.nr as it will be transpiled incorrectly to ts and sol constants files\n    let max_value = crate::constants::MAX_FIELD_VALUE;\n    assert_eq(max_value, 0 - 1);\n    // modulus == 0 is tested elsewhere, so below is more of a sanity check\n    let max_bytes: [u8; 32] = max_value.to_be_bytes();\n    let mod_bytes = std::field::modulus_be_bytes();\n    for i in 0..31 {\n        assert_eq(max_bytes[i], mod_bytes[i]);\n    }\n    assert_eq(max_bytes[31], mod_bytes[31] - 1);\n}\n\n#[test]\nunconstrained fn sqrt_valid_test() {\n    let x = 16; // examples: 16, 9, 25, 81\n    let result = sqrt(x);\n    assert(result.is_some());\n    assert_eq(result.unwrap() * result.unwrap(), x);\n}\n\n#[test]\nunconstrained fn sqrt_invalid_test() {\n    let x = KNOWN_NON_RESIDUE; // has no square root in the field\n    let result = sqrt(x);\n    assert(result.is_none());\n}\n\n#[test]\nunconstrained fn sqrt_zero_test() {\n    let result = sqrt(0);\n    assert(result.is_some());\n    assert_eq(result.unwrap(), 0);\n}\n\n#[test]\nunconstrained fn sqrt_one_test() {\n    let result = sqrt(1);\n    assert(result.is_some());\n    assert_eq(result.unwrap() * result.unwrap(), 1);\n}\n\n#[test]\nunconstrained fn field_from_bytes_empty_test() {\n    let empty: [u8; 0] = [];\n    let result = field_from_bytes(empty, true);\n    assert_eq(result, 0);\n\n    let result_le = field_from_bytes(empty, false);\n    assert_eq(result_le, 0);\n}\n\n#[test]\nunconstrained fn field_from_bytes_little_endian_test() {\n    // Test little-endian conversion: [0x01, 0x02] should be 0x0201 = 513\n    let bytes = [0x01, 0x02];\n    let result_le = field_from_bytes(bytes, false);\n    assert_eq(result_le, 0x0201);\n\n    // Compare with big-endian: [0x01, 0x02] should be 0x0102 = 258\n    let result_be = field_from_bytes(bytes, true);\n    assert_eq(result_be, 0x0102);\n}\n\n#[test]\nunconstrained fn pow_test() {\n    assert_eq(pow(2, 0), 1);\n    assert_eq(pow(2, 1), 2);\n    assert_eq(pow(2, 10), 1024);\n    assert_eq(pow(3, 5), 243);\n    assert_eq(pow(0, 5), 0);\n    assert_eq(pow(1, 100), 1);\n}\n\n#[test]\nunconstrained fn min_test() {\n    assert_eq(min(5, 10), 5);\n    assert_eq(min(10, 5), 5);\n    assert_eq(min(7, 7), 7);\n    assert_eq(min(0, 1), 0);\n}\n\n#[test]\nunconstrained fn sqrt_has_two_roots_test() {\n    // Every square has two roots: r and -r (i.e., p - r)\n    // sqrt(16) can return 4 or -4\n    let x = 16;\n    let result = sqrt(x).unwrap();\n    assert(result * result == x);\n    // The other root is -result\n    let other_root = 0 - result;\n    assert(other_root * other_root == x);\n    // Verify they are different (unless x = 0)\n    assert(result != other_root);\n\n    // Same for 9: roots are 3 and -3\n    let y = 9;\n    let result_y = sqrt(y).unwrap();\n    assert(result_y * result_y == y);\n    let other_root_y = 0 - result_y;\n    assert(other_root_y * other_root_y == y);\n    assert(result_y != other_root_y);\n}\n\n#[test]\nunconstrained fn sqrt_negative_one_test() {\n    let x = 0 - 1;\n    let result = sqrt(x);\n    assert(result.unwrap() == 0x30644e72e131a029048b6e193fd841045cea24f6fd736bec231204708f703636);\n}\n\n#[test]\nunconstrained fn validate_sqrt_hint_valid_test() {\n    // 4 is a valid sqrt of 16\n    validate_sqrt_hint(16, 4);\n    // -4 is also a valid sqrt of 16\n    validate_sqrt_hint(16, 0 - 4);\n    // 0 is a valid sqrt of 0\n    validate_sqrt_hint(0, 0);\n    // 1 is a valid sqrt of 1\n    validate_sqrt_hint(1, 1);\n    // -1 is also a valid sqrt of 1\n    validate_sqrt_hint(1, 0 - 1);\n}\n\n#[test(should_fail_with = \"is not the sqrt of x\")]\nunconstrained fn validate_sqrt_hint_invalid_test() {\n    // 5 is not a valid sqrt of 16\n    validate_sqrt_hint(16, 5);\n}\n\n#[test]\nunconstrained fn validate_not_sqrt_hint_valid_test() {\n    // 5 (KNOWN_NON_RESIDUE) is not a square.\n    let x = KNOWN_NON_RESIDUE;\n    let hint = tonelli_shanks_sqrt(x * KNOWN_NON_RESIDUE);\n    validate_not_sqrt_hint(x, hint);\n}\n\n#[test(should_fail_with = \"0 has a square root\")]\nunconstrained fn validate_not_sqrt_hint_zero_test() {\n    // 0 has a square root, so we cannot claim it is not square\n    validate_not_sqrt_hint(0, 0);\n}\n\n#[test(should_fail_with = \"does not demonstrate that\")]\nunconstrained fn validate_not_sqrt_hint_wrong_hint_test() {\n    // Provide a wrong hint for a non-square\n    let x = KNOWN_NON_RESIDUE;\n    validate_not_sqrt_hint(x, 123);\n}\n"
     },
-    "409": {
+    "407": {
       "function_locations": [
         {
           "name": "Reader<N>::new",
@@ -5729,6 +5665,32 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/reader.nr",
       "source": "pub struct Reader<let N: u32> {\n    data: [Field; N],\n    offset: u32,\n}\n\nimpl<let N: u32> Reader<N> {\n    pub fn new(data: [Field; N]) -> Self {\n        Self { data, offset: 0 }\n    }\n\n    pub fn read(&mut self) -> Field {\n        let result = self.data[self.offset];\n        self.offset += 1;\n        result\n    }\n\n    pub fn read_u32(&mut self) -> u32 {\n        self.read() as u32\n    }\n\n    pub fn read_u64(&mut self) -> u64 {\n        self.read() as u64\n    }\n\n    pub fn read_bool(&mut self) -> bool {\n        self.read() != 0\n    }\n\n    pub fn read_array<let K: u32>(&mut self) -> [Field; K] {\n        let mut result = [0; K];\n        for i in 0..K {\n            result[i] = self.data[self.offset + i];\n        }\n        self.offset += K;\n        result\n    }\n\n    pub fn read_struct<T, let K: u32>(&mut self, deserialise: fn([Field; K]) -> T) -> T {\n        let result = deserialise(self.read_array());\n        result\n    }\n\n    pub fn read_struct_array<T, let K: u32, let C: u32>(\n        &mut self,\n        deserialise: fn([Field; K]) -> T,\n        mut result: [T; C],\n    ) -> [T; C] {\n        for i in 0..C {\n            result[i] = self.read_struct(deserialise);\n        }\n        result\n    }\n\n    pub fn peek_offset(&mut self, offset: u32) -> Field {\n        self.data[self.offset + offset]\n    }\n\n    pub fn advance_offset(&mut self, offset: u32) {\n        self.offset += offset;\n    }\n\n    pub fn finish(self) {\n        assert_eq(self.offset, self.data.len(), \"Reader did not read all data\");\n    }\n}\n"
     },
+    "408": {
+      "function_locations": [
+        {
+          "name": "derive_serialize",
+          "start": 3042
+        },
+        {
+          "name": "derive_deserialize",
+          "start": 7256
+        },
+        {
+          "name": "get_params_len_quote",
+          "start": 10978
+        },
+        {
+          "name": "get_generics_declarations",
+          "start": 11437
+        },
+        {
+          "name": "get_where_trait_clause",
+          "start": 12519
+        }
+      ],
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/serialization.nr",
+      "source": "use crate::{reader::Reader, writer::Writer};\n\n// docs:start:serialize\n/// Trait for serializing Noir types into arrays of Fields.\n///\n/// An implementation of the Serialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait (and Deserialize) are\n/// typically used to communicate between Noir and TypeScript (via oracles and function arguments).\n///\n/// # On Following Noir's Intrinsic Serialization\n/// When calling a Noir function from TypeScript (TS), first the function arguments are serialized into an array\n/// of fields. This array is then included in the initial witness. Noir's intrinsic serialization is then used\n/// to deserialize the arguments from the witness. When the same Noir function is called from Noir this Serialize trait\n/// is used instead of the serialization in TS. For this reason we need to have a match between TS serialization,\n/// Noir's intrinsic serialization and the implementation of this trait. If there is a mismatch, the function calls\n/// fail with an arguments hash mismatch error message.\n///\n/// # Associated Constants\n/// * `N` - The length of the output Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let N: u32> Serialize for str<N> {\n///     let N: u32 = N;\n///\n///     fn serialize(self) -> [Field; Self::N] {\n///         let mut writer: Writer<Self::N> = Writer::new();\n///         self.stream_serialize(&mut writer);\n///         writer.finish()\n///     }\n///\n///     fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n///         let bytes = self.as_bytes();\n///         for i in 0..bytes.len() {\n///             writer.write(bytes[i] as Field);\n///         }\n///     }\n/// }\n/// ```\n#[derive_via(derive_serialize)]\npub trait Serialize {\n    let N: u32;\n\n    fn serialize(self) -> [Field; Self::N];\n\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>);\n}\n\n/// Generates a `Serialize` trait implementation for a struct type.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A quoted code block containing the trait implementation\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Log<N> {\n///     fields: [Field; N],\n///     length: u32\n/// }\n/// ```\n///\n/// This function generates code equivalent to:\n/// ```\n/// impl<let N: u32> Serialize for Log<N> {\n///     let N: u32 = <[Field; N] as Serialize>::N + <u32 as Serialize>::N;\n///\n///     fn serialize(self) -> [Field; Self::N] {\n///         let mut writer: Writer<Self::N> = Writer::new();\n///         self.stream_serialize(&mut writer);\n///         writer.finish()\n///     }\n///\n///     #[inline_always]\n///     fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n///         Serialize::stream_serialize(self.fields, writer);\n///         Serialize::stream_serialize(self.length, writer);\n///     }\n/// }\n/// ```\npub comptime fn derive_serialize(s: TypeDefinition) -> Quoted {\n    let typ = s.as_type();\n    let nested_struct = typ.as_data_type().unwrap();\n\n    // We care only about the name and type so we drop the last item of the tuple\n    let params = nested_struct.0.fields(nested_struct.1).map(|(name, typ, _)| (name, typ));\n\n    // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n    // for the `Serialize` trait.\n    let generics_declarations = get_generics_declarations(s);\n    let where_serialize_clause = get_where_trait_clause(s, quote {Serialize});\n\n    let params_len_quote = get_params_len_quote(params);\n\n    let function_body = params\n        .map(|(name, _typ): (Quoted, Type)| {\n            quote {\n                $crate::serialization::Serialize::stream_serialize(self.$name, writer);\n            }\n        })\n        .join(quote {});\n\n    quote {\n        impl$generics_declarations $crate::serialization::Serialize for $typ\n            $where_serialize_clause\n        {\n            let N: u32 = $params_len_quote;\n\n\n            fn serialize(self) -> [Field; Self::N] {\n                let mut writer: $crate::writer::Writer<Self::N> = $crate::writer::Writer::new();\n                $crate::serialization::Serialize::stream_serialize(self, &mut writer);\n                writer.finish()\n            }\n\n\n            #[inline_always]\n             fn stream_serialize<let K: u32>(self, writer: &mut $crate::writer::Writer<K>) {\n                $function_body\n            }\n        }\n    }\n}\n\n// docs:start:deserialize\n/// Trait for deserializing Noir types from arrays of Fields.\n///\n/// An implementation of the Deserialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait is typically used when\n/// deserializing return values from function calls in Noir. Since the same function could be called from TypeScript\n/// (TS), in which case the TS deserialization would get used, we need to have a match between the 2.\n///\n/// # Associated Constants\n/// * `N` - The length of the input Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let M: u32> Deserialize for str<M> {\n///     let N: u32 = M;\n///\n///     fn deserialize(fields: [Field; Self::N]) -> Self {\n///         let mut reader = Reader::new(fields);\n///         let result = Self::stream_deserialize(&mut reader);\n///         reader.finish();\n///         result\n///     }\n///\n///     fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n///         let mut bytes = [0 as u8; M];\n///         for i in 0..M {\n///             bytes[i] = reader.read() as u8;\n///         }\n///         str::<M>::from(bytes)\n///     }\n/// }\n/// ```\n#[derive_via(derive_deserialize)]\npub trait Deserialize {\n    let N: u32;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self;\n\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self;\n}\n\n/// Generates a `Deserialize` trait implementation for a given struct `s`.\n///\n/// # Arguments\n/// * `s` - The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A `Quoted` block containing the generated trait implementation\n///\n/// # Requirements\n/// Each struct member type must implement the `Deserialize` trait (it gets used in the generated code).\n///\n/// # Example\n/// For a struct like:\n/// ```\n/// struct MyStruct {\n///     x: AztecAddress,\n///     y: Field,\n/// }\n/// ```\n///\n/// This generates:\n/// ```\n/// impl Deserialize for MyStruct {\n///     let N: u32 = <AztecAddress as Deserialize>::N + <Field as Deserialize>::N;\n///\n///     fn deserialize(fields: [Field; Self::N]) -> Self {\n///         let mut reader = Reader::new(fields);\n///         let result = Self::stream_deserialize(&mut reader);\n///         reader.finish();\n///         result\n///     }\n///\n///     #[inline_always]\n///     fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n///         let x = <AztecAddress as Deserialize>::stream_deserialize(reader);\n///         let y = <Field as Deserialize>::stream_deserialize(reader);\n///         Self { x, y }\n///     }\n/// }\n/// ```\npub comptime fn derive_deserialize(s: TypeDefinition) -> Quoted {\n    let typ = s.as_type();\n    let nested_struct = typ.as_data_type().unwrap();\n    let params = nested_struct.0.fields(nested_struct.1);\n\n    // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n    // for the `Deserialize` trait.\n    let generics_declarations = get_generics_declarations(s);\n    let where_deserialize_clause = get_where_trait_clause(s, quote {Deserialize});\n\n    // The following will give us:\n    // <type_of_struct_member_1 as Deserialize>::N + <type_of_struct_member_2 as Deserialize>::N + ...\n    // (or 0 if the struct has no members)\n    let right_hand_side_of_definition_of_n = if params.len() > 0 {\n        params\n            .map(|(_, param_type, _): (Quoted, Type, Quoted)| {\n                quote {\n            <$param_type as $crate::serialization::Deserialize>::N\n        }\n            })\n            .join(quote {+})\n    } else {\n        quote {0}\n    };\n\n    // For structs containing a single member, we can enhance performance by directly deserializing the input array,\n    // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n    // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n    // expected to be optimized away.\n    let function_body = if params.len() > 1 {\n        // This generates deserialization code for each struct member and concatenates them together.\n        let deserialization_of_struct_members = params\n            .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n                quote {\n                    let $param_name = <$param_type as Deserialize>::stream_deserialize(reader);\n                }\n            })\n            .join(quote {});\n\n        // We join the struct member names with a comma to be used in the `Self { ... }` syntax\n        // This will give us e.g. `a, b, c` for a struct with three fields named `a`, `b`, and `c`.\n        let struct_members = params\n            .map(|(param_name, _, _): (Quoted, Type, Quoted)| quote { $param_name })\n            .join(quote {,});\n\n        quote {\n            $deserialization_of_struct_members\n\n            Self { $struct_members }\n        }\n    } else if params.len() == 1 {\n        let param_name = params[0].0;\n        quote {\n            Self { $param_name: $crate::serialization::Deserialize::stream_deserialize(reader) }\n        }\n    } else {\n        quote {\n            Self {}\n        }\n    };\n\n    quote {\n        impl$generics_declarations $crate::serialization::Deserialize for $typ\n            $where_deserialize_clause\n        {\n            let N: u32 = $right_hand_side_of_definition_of_n;\n\n            fn deserialize(fields: [Field; Self::N]) -> Self {\n                let mut reader = $crate::reader::Reader::new(fields);\n                let result = Self::stream_deserialize(&mut reader);\n                reader.finish();\n                result\n            }\n\n            #[inline_always]\n            fn stream_deserialize<let K: u32>(reader: &mut $crate::reader::Reader<K>) -> Self {\n                $function_body\n            }\n        }\n    }\n}\n\n/// Generates a quoted expression that computes the total serialized length of function parameters.\n///\n/// # Parameters\n/// * `params` - An array of tuples where each tuple contains a quoted parameter name and its Type. The type needs\n///              to implement the Serialize trait.\n///\n/// # Returns\n/// A quoted expression that evaluates to:\n/// * `0` if there are no parameters\n/// * `(<type1 as Serialize>::N + <type2 as Serialize>::N + ...)` for one or more parameters\ncomptime fn get_params_len_quote(params: [(Quoted, Type)]) -> Quoted {\n    if params.len() == 0 {\n        quote { 0 }\n    } else {\n        let params_quote_without_parentheses = params\n            .map(|(_, param_type): (Quoted, Type)| {\n                quote {\n                    <$param_type as $crate::serialization::Serialize>::N\n                }\n            })\n            .join(quote {+});\n        quote { ($params_quote_without_parentheses) }\n    }\n}\n\ncomptime fn get_generics_declarations(s: TypeDefinition) -> Quoted {\n    let generics = s.generics();\n\n    if generics.len() > 0 {\n        let generics_declarations_items = generics\n            .map(|(name, maybe_integer_typ)| {\n                // The second item in the generics tuple is an Option of an integer type that is Some only if\n                // the generic is numeric.\n                if maybe_integer_typ.is_some() {\n                    // The generic is numeric, so we return a quote defined as e.g. \"let N: u32\"\n                    let integer_type = maybe_integer_typ.unwrap();\n                    quote {let $name: $integer_type}\n                } else {\n                    // The generic is not numeric, so we return a quote containing the name of the generic (e.g. \"T\")\n                    quote {$name}\n                }\n            })\n            .join(quote {,});\n        quote {<$generics_declarations_items>}\n    } else {\n        // The struct doesn't have any generics defined, so we just return an empty quote.\n        quote {}\n    }\n}\n\ncomptime fn get_where_trait_clause(s: TypeDefinition, trait_name: Quoted) -> Quoted {\n    let generics = s.generics();\n\n    // The second item in the generics tuple is an Option of an integer type that is Some only if the generic is\n    // numeric.\n    let non_numeric_generics =\n        generics.filter(|(_, maybe_integer_typ)| maybe_integer_typ.is_none());\n\n    if non_numeric_generics.len() > 0 {\n        let non_numeric_generics_declarations =\n            non_numeric_generics.map(|(name, _)| quote {$name: $trait_name}).join(quote {,});\n        quote {where $non_numeric_generics_declarations}\n    } else {\n        // There are no non-numeric generics, so we return an empty quote.\n        quote {}\n    }\n}\n"
+    },
     "41": {
       "function_locations": [
         {
@@ -5828,32 +5790,6 @@
       "source": "use crate::cmp::{Eq, Ord, Ordering};\nuse crate::default::Default;\nuse crate::hash::{Hash, Hasher};\n\n/// Represents a value of type T or its absence.\n/// Use `Option::some(value)` to construct a value or `Option::none()` to record the absence of one.\npub struct Option<T> {\n    _is_some: bool,\n    _value: T,\n}\n\nimpl<T> Option<T> {\n    /// Constructs a None value\n    pub fn none() -> Self {\n        Self { _is_some: false, _value: crate::mem::zeroed() }\n    }\n\n    /// Constructs a Some wrapper around the given value\n    pub fn some(_value: T) -> Self {\n        Self { _is_some: true, _value }\n    }\n\n    /// True if this Option is None\n    pub fn is_none(&self) -> bool {\n        !self._is_some\n    }\n\n    /// True if this Option is Some\n    pub fn is_some(&self) -> bool {\n        self._is_some\n    }\n\n    /// Asserts `self.is_some()` and returns the wrapped value.\n    pub fn unwrap(self) -> T {\n        assert(self._is_some);\n        self._value\n    }\n\n    /// Returns the inner value without asserting `self.is_some()`\n    /// Note that if `self` is `None`, there is no guarantee what value will be returned,\n    /// only that it will be of type `T`.\n    pub fn unwrap_unchecked(self) -> T {\n        self._value\n    }\n\n    /// Returns the wrapped value if `self.is_some()`. Otherwise, returns the given default value.\n    pub fn unwrap_or(self, default: T) -> T {\n        if self._is_some {\n            self._value\n        } else {\n            default\n        }\n    }\n\n    /// Returns the wrapped value if `self.is_some()`. Otherwise, calls the given function to return\n    /// a default value.\n    pub fn unwrap_or_else<Env>(self, default: fn[Env]() -> T) -> T {\n        if self._is_some {\n            self._value\n        } else {\n            default()\n        }\n    }\n\n    /// Asserts `self.is_some()` with a provided custom message and returns the contained `Some` value\n    pub fn expect<let N: u32, MessageTypes>(self, message: fmtstr<N, MessageTypes>) -> T {\n        assert(self.is_some(), message);\n        self._value\n    }\n\n    /// If self is `Some(x)`, this returns `Some(f(x))`. Otherwise, this returns `None`.\n    pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> Option<U> {\n        if self._is_some {\n            Option::some(f(self._value))\n        } else {\n            Option::none()\n        }\n    }\n\n    /// If self is `Some(x)`, this returns `f(x)`. Otherwise, this returns the given default value.\n    pub fn map_or<U, Env>(self, default: U, f: fn[Env](T) -> U) -> U {\n        if self._is_some {\n            f(self._value)\n        } else {\n            default\n        }\n    }\n\n    /// If self is `Some(x)`, this returns `f(x)`. Otherwise, this returns `default()`.\n    pub fn map_or_else<U, Env1, Env2>(self, default: fn[Env1]() -> U, f: fn[Env2](T) -> U) -> U {\n        if self._is_some {\n            f(self._value)\n        } else {\n            default()\n        }\n    }\n\n    /// Returns None if self is None. Otherwise, this returns `other`.\n    pub fn and(self, other: Self) -> Self {\n        if self.is_none() {\n            Option::none()\n        } else {\n            other\n        }\n    }\n\n    /// If self is None, this returns None. Otherwise, this calls the given function\n    /// with the Some value contained within self, and returns the result of that call.\n    ///\n    /// In some languages this function is called `flat_map` or `bind`.\n    pub fn and_then<U, Env>(self, f: fn[Env](T) -> Option<U>) -> Option<U> {\n        if self._is_some {\n            f(self._value)\n        } else {\n            Option::none()\n        }\n    }\n\n    /// If self is Some, return self. Otherwise, return `other`.\n    pub fn or(self, other: Self) -> Self {\n        if self._is_some {\n            self\n        } else {\n            other\n        }\n    }\n\n    /// If self is Some, return self. Otherwise, return `default()`.\n    pub fn or_else<Env>(self, default: fn[Env]() -> Self) -> Self {\n        if self._is_some {\n            self\n        } else {\n            default()\n        }\n    }\n\n    // If only one of the two Options is Some, return that option.\n    // Otherwise, if both options are Some or both are None, None is returned.\n    pub fn xor(self, other: Self) -> Self {\n        if self._is_some {\n            if other._is_some {\n                Option::none()\n            } else {\n                self\n            }\n        } else if other._is_some {\n            other\n        } else {\n            Option::none()\n        }\n    }\n\n    /// Returns `Some(x)` if self is `Some(x)` and `predicate(x)` is true.\n    /// Otherwise, this returns `None`\n    pub fn filter<Env>(self, predicate: fn[Env](T) -> bool) -> Self {\n        if self._is_some {\n            if predicate(self._value) {\n                self\n            } else {\n                Option::none()\n            }\n        } else {\n            Option::none()\n        }\n    }\n\n    /// Flattens an Option<Option<T>> into a Option<T>.\n    /// This returns None if the outer Option is None. Otherwise, this returns the inner Option.\n    pub fn flatten(option: Option<Option<T>>) -> Option<T> {\n        if option._is_some {\n            option._value\n        } else {\n            Option::none()\n        }\n    }\n}\n\nimpl<T> Default for Option<T> {\n    fn default() -> Self {\n        Option::none()\n    }\n}\n\nimpl<T> Eq for Option<T>\nwhere\n    T: Eq,\n{\n    fn eq(self, other: Self) -> bool {\n        if self._is_some == other._is_some {\n            if self._is_some {\n                self._value == other._value\n            } else {\n                true\n            }\n        } else {\n            false\n        }\n    }\n}\n\nimpl<T> Hash for Option<T>\nwhere\n    T: Hash,\n{\n    fn hash<H>(self, state: &mut H)\n    where\n        H: Hasher,\n    {\n        self._is_some.hash(state);\n        if self._is_some {\n            self._value.hash(state);\n        }\n    }\n}\n\n// For this impl we're declaring Option::none < Option::some\nimpl<T> Ord for Option<T>\nwhere\n    T: Ord,\n{\n    fn cmp(self, other: Self) -> Ordering {\n        if self._is_some {\n            if other._is_some {\n                self._value.cmp(other._value)\n            } else {\n                Ordering::greater()\n            }\n        } else if other._is_some {\n            Ordering::less()\n        } else {\n            Ordering::equal()\n        }\n    }\n}\n"
     },
     "410": {
-      "function_locations": [
-        {
-          "name": "derive_serialize",
-          "start": 3042
-        },
-        {
-          "name": "derive_deserialize",
-          "start": 7256
-        },
-        {
-          "name": "get_params_len_quote",
-          "start": 10978
-        },
-        {
-          "name": "get_generics_declarations",
-          "start": 11437
-        },
-        {
-          "name": "get_where_trait_clause",
-          "start": 12519
-        }
-      ],
-      "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/serialization.nr",
-      "source": "use crate::{reader::Reader, writer::Writer};\n\n// docs:start:serialize\n/// Trait for serializing Noir types into arrays of Fields.\n///\n/// An implementation of the Serialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait (and Deserialize) are\n/// typically used to communicate between Noir and TypeScript (via oracles and function arguments).\n///\n/// # On Following Noir's Intrinsic Serialization\n/// When calling a Noir function from TypeScript (TS), first the function arguments are serialized into an array\n/// of fields. This array is then included in the initial witness. Noir's intrinsic serialization is then used\n/// to deserialize the arguments from the witness. When the same Noir function is called from Noir this Serialize trait\n/// is used instead of the serialization in TS. For this reason we need to have a match between TS serialization,\n/// Noir's intrinsic serialization and the implementation of this trait. If there is a mismatch, the function calls\n/// fail with an arguments hash mismatch error message.\n///\n/// # Associated Constants\n/// * `N` - The length of the output Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let N: u32> Serialize for str<N> {\n///     let N: u32 = N;\n///\n///     fn serialize(self) -> [Field; Self::N] {\n///         let mut writer: Writer<Self::N> = Writer::new();\n///         self.stream_serialize(&mut writer);\n///         writer.finish()\n///     }\n///\n///     fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n///         let bytes = self.as_bytes();\n///         for i in 0..bytes.len() {\n///             writer.write(bytes[i] as Field);\n///         }\n///     }\n/// }\n/// ```\n#[derive_via(derive_serialize)]\npub trait Serialize {\n    let N: u32;\n\n    fn serialize(self) -> [Field; Self::N];\n\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>);\n}\n\n/// Generates a `Serialize` trait implementation for a struct type.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A quoted code block containing the trait implementation\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Log<N> {\n///     fields: [Field; N],\n///     length: u32\n/// }\n/// ```\n///\n/// This function generates code equivalent to:\n/// ```\n/// impl<let N: u32> Serialize for Log<N> {\n///     let N: u32 = <[Field; N] as Serialize>::N + <u32 as Serialize>::N;\n///\n///     fn serialize(self) -> [Field; Self::N] {\n///         let mut writer: Writer<Self::N> = Writer::new();\n///         self.stream_serialize(&mut writer);\n///         writer.finish()\n///     }\n///\n///     #[inline_always]\n///     fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n///         Serialize::stream_serialize(self.fields, writer);\n///         Serialize::stream_serialize(self.length, writer);\n///     }\n/// }\n/// ```\npub comptime fn derive_serialize(s: TypeDefinition) -> Quoted {\n    let typ = s.as_type();\n    let nested_struct = typ.as_data_type().unwrap();\n\n    // We care only about the name and type so we drop the last item of the tuple\n    let params = nested_struct.0.fields(nested_struct.1).map(|(name, typ, _)| (name, typ));\n\n    // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n    // for the `Serialize` trait.\n    let generics_declarations = get_generics_declarations(s);\n    let where_serialize_clause = get_where_trait_clause(s, quote {Serialize});\n\n    let params_len_quote = get_params_len_quote(params);\n\n    let function_body = params\n        .map(|(name, _typ): (Quoted, Type)| {\n            quote {\n                $crate::serialization::Serialize::stream_serialize(self.$name, writer);\n            }\n        })\n        .join(quote {});\n\n    quote {\n        impl$generics_declarations $crate::serialization::Serialize for $typ\n            $where_serialize_clause\n        {\n            let N: u32 = $params_len_quote;\n\n\n            fn serialize(self) -> [Field; Self::N] {\n                let mut writer: $crate::writer::Writer<Self::N> = $crate::writer::Writer::new();\n                $crate::serialization::Serialize::stream_serialize(self, &mut writer);\n                writer.finish()\n            }\n\n\n            #[inline_always]\n             fn stream_serialize<let K: u32>(self, writer: &mut $crate::writer::Writer<K>) {\n                $function_body\n            }\n        }\n    }\n}\n\n// docs:start:deserialize\n/// Trait for deserializing Noir types from arrays of Fields.\n///\n/// An implementation of the Deserialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait is typically used when\n/// deserializing return values from function calls in Noir. Since the same function could be called from TypeScript\n/// (TS), in which case the TS deserialization would get used, we need to have a match between the 2.\n///\n/// # Associated Constants\n/// * `N` - The length of the input Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let M: u32> Deserialize for str<M> {\n///     let N: u32 = M;\n///\n///     fn deserialize(fields: [Field; Self::N]) -> Self {\n///         let mut reader = Reader::new(fields);\n///         let result = Self::stream_deserialize(&mut reader);\n///         reader.finish();\n///         result\n///     }\n///\n///     fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n///         let mut bytes = [0 as u8; M];\n///         for i in 0..M {\n///             bytes[i] = reader.read() as u8;\n///         }\n///         str::<M>::from(bytes)\n///     }\n/// }\n/// ```\n#[derive_via(derive_deserialize)]\npub trait Deserialize {\n    let N: u32;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self;\n\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self;\n}\n\n/// Generates a `Deserialize` trait implementation for a given struct `s`.\n///\n/// # Arguments\n/// * `s` - The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A `Quoted` block containing the generated trait implementation\n///\n/// # Requirements\n/// Each struct member type must implement the `Deserialize` trait (it gets used in the generated code).\n///\n/// # Example\n/// For a struct like:\n/// ```\n/// struct MyStruct {\n///     x: AztecAddress,\n///     y: Field,\n/// }\n/// ```\n///\n/// This generates:\n/// ```\n/// impl Deserialize for MyStruct {\n///     let N: u32 = <AztecAddress as Deserialize>::N + <Field as Deserialize>::N;\n///\n///     fn deserialize(fields: [Field; Self::N]) -> Self {\n///         let mut reader = Reader::new(fields);\n///         let result = Self::stream_deserialize(&mut reader);\n///         reader.finish();\n///         result\n///     }\n///\n///     #[inline_always]\n///     fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n///         let x = <AztecAddress as Deserialize>::stream_deserialize(reader);\n///         let y = <Field as Deserialize>::stream_deserialize(reader);\n///         Self { x, y }\n///     }\n/// }\n/// ```\npub comptime fn derive_deserialize(s: TypeDefinition) -> Quoted {\n    let typ = s.as_type();\n    let nested_struct = typ.as_data_type().unwrap();\n    let params = nested_struct.0.fields(nested_struct.1);\n\n    // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n    // for the `Deserialize` trait.\n    let generics_declarations = get_generics_declarations(s);\n    let where_deserialize_clause = get_where_trait_clause(s, quote {Deserialize});\n\n    // The following will give us:\n    // <type_of_struct_member_1 as Deserialize>::N + <type_of_struct_member_2 as Deserialize>::N + ...\n    // (or 0 if the struct has no members)\n    let right_hand_side_of_definition_of_n = if params.len() > 0 {\n        params\n            .map(|(_, param_type, _): (Quoted, Type, Quoted)| {\n                quote {\n            <$param_type as $crate::serialization::Deserialize>::N\n        }\n            })\n            .join(quote {+})\n    } else {\n        quote {0}\n    };\n\n    // For structs containing a single member, we can enhance performance by directly deserializing the input array,\n    // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n    // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n    // expected to be optimized away.\n    let function_body = if params.len() > 1 {\n        // This generates deserialization code for each struct member and concatenates them together.\n        let deserialization_of_struct_members = params\n            .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n                quote {\n                    let $param_name = <$param_type as Deserialize>::stream_deserialize(reader);\n                }\n            })\n            .join(quote {});\n\n        // We join the struct member names with a comma to be used in the `Self { ... }` syntax\n        // This will give us e.g. `a, b, c` for a struct with three fields named `a`, `b`, and `c`.\n        let struct_members = params\n            .map(|(param_name, _, _): (Quoted, Type, Quoted)| quote { $param_name })\n            .join(quote {,});\n\n        quote {\n            $deserialization_of_struct_members\n\n            Self { $struct_members }\n        }\n    } else if params.len() == 1 {\n        let param_name = params[0].0;\n        quote {\n            Self { $param_name: $crate::serialization::Deserialize::stream_deserialize(reader) }\n        }\n    } else {\n        quote {\n            Self {}\n        }\n    };\n\n    quote {\n        impl$generics_declarations $crate::serialization::Deserialize for $typ\n            $where_deserialize_clause\n        {\n            let N: u32 = $right_hand_side_of_definition_of_n;\n\n            fn deserialize(fields: [Field; Self::N]) -> Self {\n                let mut reader = $crate::reader::Reader::new(fields);\n                let result = Self::stream_deserialize(&mut reader);\n                reader.finish();\n                result\n            }\n\n            #[inline_always]\n            fn stream_deserialize<let K: u32>(reader: &mut $crate::reader::Reader<K>) -> Self {\n                $function_body\n            }\n        }\n    }\n}\n\n/// Generates a quoted expression that computes the total serialized length of function parameters.\n///\n/// # Parameters\n/// * `params` - An array of tuples where each tuple contains a quoted parameter name and its Type. The type needs\n///              to implement the Serialize trait.\n///\n/// # Returns\n/// A quoted expression that evaluates to:\n/// * `0` if there are no parameters\n/// * `(<type1 as Serialize>::N + <type2 as Serialize>::N + ...)` for one or more parameters\ncomptime fn get_params_len_quote(params: [(Quoted, Type)]) -> Quoted {\n    if params.len() == 0 {\n        quote { 0 }\n    } else {\n        let params_quote_without_parentheses = params\n            .map(|(_, param_type): (Quoted, Type)| {\n                quote {\n                    <$param_type as $crate::serialization::Serialize>::N\n                }\n            })\n            .join(quote {+});\n        quote { ($params_quote_without_parentheses) }\n    }\n}\n\ncomptime fn get_generics_declarations(s: TypeDefinition) -> Quoted {\n    let generics = s.generics();\n\n    if generics.len() > 0 {\n        let generics_declarations_items = generics\n            .map(|(name, maybe_integer_typ)| {\n                // The second item in the generics tuple is an Option of an integer type that is Some only if\n                // the generic is numeric.\n                if maybe_integer_typ.is_some() {\n                    // The generic is numeric, so we return a quote defined as e.g. \"let N: u32\"\n                    let integer_type = maybe_integer_typ.unwrap();\n                    quote {let $name: $integer_type}\n                } else {\n                    // The generic is not numeric, so we return a quote containing the name of the generic (e.g. \"T\")\n                    quote {$name}\n                }\n            })\n            .join(quote {,});\n        quote {<$generics_declarations_items>}\n    } else {\n        // The struct doesn't have any generics defined, so we just return an empty quote.\n        quote {}\n    }\n}\n\ncomptime fn get_where_trait_clause(s: TypeDefinition, trait_name: Quoted) -> Quoted {\n    let generics = s.generics();\n\n    // The second item in the generics tuple is an Option of an integer type that is Some only if the generic is\n    // numeric.\n    let non_numeric_generics =\n        generics.filter(|(_, maybe_integer_typ)| maybe_integer_typ.is_none());\n\n    if non_numeric_generics.len() > 0 {\n        let non_numeric_generics_declarations =\n            non_numeric_generics.map(|(name, _)| quote {$name: $trait_name}).join(quote {,});\n        quote {where $non_numeric_generics_declarations}\n    } else {\n        // There are no non-numeric generics, so we return an empty quote.\n        quote {}\n    }\n}\n"
-    },
-    "412": {
       "function_locations": [
         {
           "name": "<impl Serialize for bool>::serialize",
@@ -6183,7 +6119,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/type_impls.nr",
       "source": "use crate::{reader::Reader, serialization::{Deserialize, Serialize}, writer::Writer};\nuse std::embedded_curve_ops::EmbeddedCurvePoint;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\nglobal U1_SERIALIZED_LEN: u32 = 1;\nglobal BOOL_SERIALIZED_LEN: u32 = 1;\nglobal U8_SERIALIZED_LEN: u32 = 1;\nglobal U16_SERIALIZED_LEN: u32 = 1;\nglobal U32_SERIALIZED_LEN: u32 = 1;\nglobal U64_SERIALIZED_LEN: u32 = 1;\nglobal U128_SERIALIZED_LEN: u32 = 1;\nglobal FIELD_SERIALIZED_LEN: u32 = 1;\nglobal I8_SERIALIZED_LEN: u32 = 1;\nglobal I16_SERIALIZED_LEN: u32 = 1;\nglobal I32_SERIALIZED_LEN: u32 = 1;\nglobal I64_SERIALIZED_LEN: u32 = 1;\n\nimpl Serialize for bool {\n    let N: u32 = BOOL_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for bool {\n    let N: u32 = BOOL_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> bool {\n        reader.read() != 0\n    }\n}\n\nimpl Serialize for u1 {\n    let N: u32 = U1_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u1 {\n    let N: u32 = U1_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u1\n    }\n}\n\nimpl Serialize for u8 {\n    let N: u32 = U8_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u8 {\n    let N: u32 = U8_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u8\n    }\n}\n\nimpl Serialize for u16 {\n    let N: u32 = U16_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u16 {\n    let N: u32 = U16_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u16\n    }\n}\n\nimpl Serialize for u32 {\n    let N: u32 = U32_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u32 {\n    let N: u32 = U32_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u32\n    }\n}\n\nimpl Serialize for u64 {\n    let N: u32 = U64_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u64 {\n    let N: u32 = U64_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u64\n    }\n}\n\nimpl Serialize for u128 {\n    let N: u32 = U128_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as Field);\n    }\n}\n\nimpl Deserialize for u128 {\n    let N: u32 = U128_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u128\n    }\n}\n\nimpl Serialize for Field {\n    let N: u32 = FIELD_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self);\n    }\n}\n\nimpl Deserialize for Field {\n    let N: u32 = FIELD_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read()\n    }\n}\n\nimpl Serialize for i8 {\n    let N: u32 = I8_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as u8 as Field);\n    }\n}\n\nimpl Deserialize for i8 {\n    let N: u32 = I8_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u8 as i8\n    }\n}\n\nimpl Serialize for i16 {\n    let N: u32 = I16_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as u16 as Field);\n    }\n}\n\nimpl Deserialize for i16 {\n    let N: u32 = I16_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u16 as i16\n    }\n}\n\nimpl Serialize for i32 {\n    let N: u32 = I32_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as u32 as Field);\n    }\n}\n\nimpl Deserialize for i32 {\n    let N: u32 = I32_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u32 as i32\n    }\n}\n\nimpl Serialize for i64 {\n    let N: u32 = I64_SERIALIZED_LEN;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self as u64 as Field);\n    }\n}\n\nimpl Deserialize for i64 {\n    let N: u32 = I64_SERIALIZED_LEN;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        reader.read() as u64 as i64\n    }\n}\n\nimpl<T, let M: u32> Serialize for [T; M]\nwhere\n    T: Serialize,\n{\n    let N: u32 = <T as Serialize>::N * M;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        for i in 0..M {\n            self[i].stream_serialize(writer);\n        }\n    }\n}\n\nimpl<T, let M: u32> Deserialize for [T; M]\nwhere\n    T: Deserialize,\n{\n    let N: u32 = <T as Deserialize>::N * M;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        let mut result: [T; M] = std::mem::zeroed();\n        for i in 0..M {\n            result[i] = T::stream_deserialize(reader);\n        }\n        result\n    }\n}\n\nimpl<T> Serialize for Option<T>\nwhere\n    T: Serialize,\n{\n    let N: u32 = <T as Serialize>::N + 1;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write_bool(self.is_some());\n        if self.is_some() {\n            self.unwrap_unchecked().stream_serialize(writer);\n        } else {\n            writer.advance_offset(<T as Serialize>::N);\n        }\n    }\n}\n\nimpl<T> Deserialize for Option<T>\nwhere\n    T: Deserialize,\n{\n    let N: u32 = <T as Deserialize>::N + 1;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        if reader.read_bool() {\n            Option::some(<T as Deserialize>::stream_deserialize(reader))\n        } else {\n            reader.advance_offset(<T as Deserialize>::N);\n            Option::none()\n        }\n    }\n}\n\nglobal SCALAR_SIZE: u32 = 2;\n\nimpl Serialize for EmbeddedCurveScalar {\n\n    let N: u32 = SCALAR_SIZE;\n\n    fn serialize(self) -> [Field; SCALAR_SIZE] {\n        [self.lo, self.hi]\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self.lo);\n        writer.write(self.hi);\n    }\n}\n\nimpl Deserialize for EmbeddedCurveScalar {\n    let N: u32 = SCALAR_SIZE;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        Self { lo: fields[0], hi: fields[1] }\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        Self { lo: reader.read(), hi: reader.read() }\n    }\n}\n\nglobal POINT_SIZE: u32 = 3;\n\nimpl Serialize for EmbeddedCurvePoint {\n    let N: u32 = POINT_SIZE;\n\n    fn serialize(self) -> [Field; Self::N] {\n        [self.x, self.y, self.is_infinite as Field]\n    }\n\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        writer.write(self.x);\n        writer.write(self.y);\n        writer.write(self.is_infinite as Field);\n    }\n}\n\nimpl Deserialize for EmbeddedCurvePoint {\n    let N: u32 = POINT_SIZE;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        Self { x: fields[0], y: fields[1], is_infinite: fields[2] != 0 }\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        Self { x: reader.read(), y: reader.read(), is_infinite: reader.read_bool() }\n    }\n}\n\nimpl<let M: u32> Deserialize for str<M> {\n    let N: u32 = M;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        let u8_arr = <[u8; Self::N] as Deserialize>::stream_deserialize(reader);\n        str::<Self::N>::from(u8_arr)\n    }\n}\n\nimpl<let M: u32> Serialize for str<M> {\n    let N: u32 = M;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        self.as_bytes().stream_serialize(writer);\n    }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Deserialize for BoundedVec<T, M>\nwhere\n    T: Deserialize,\n{\n    let N: u32 = <T as Deserialize>::N * M + 1;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        let mut new_bounded_vec: BoundedVec<T, M> = BoundedVec::new();\n        let payload_len = Self::N - 1;\n\n        // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n        // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n        let len = reader.peek_offset(payload_len) as u32;\n\n        for i in 0..M {\n            if i < len {\n                new_bounded_vec.push(<T as Deserialize>::stream_deserialize(reader));\n            }\n        }\n\n        // +1 for the length of the BoundedVec\n        reader.advance_offset((M - len) * <T as Deserialize>::N + 1);\n\n        new_bounded_vec\n    }\n}\n\n// This may cause issues if used as program input, because noir disallows empty arrays for program input.\n// I think this is okay because I don't foresee a unit type being used as input. But leaving this comment as a hint\n// if someone does run into this in the future.\nimpl Deserialize for () {\n    let N: u32 = 0;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(_reader: &mut Reader<K>) -> Self {\n        ()\n    }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Serialize for BoundedVec<T, M>\nwhere\n    T: Serialize,\n{\n    let N: u32 = <T as Serialize>::N * M + 1; // +1 for the length of the BoundedVec\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: Writer<Self::N> = Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        self.storage().stream_serialize(writer);\n        // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n        // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n        writer.write_u32(self.len() as u32);\n    }\n}\n\n// Create a slice of the given length with each element made from `f(i)` where `i` is the current index\ncomptime fn make_slice<Env, T>(length: u32, f: fn[Env](u32) -> T) -> [T] {\n    let mut slice = @[];\n    for i in 0..length {\n        slice = slice.push_back(f(i));\n    }\n    slice\n}\n\n// Implements Serialize and Deserialize for an arbitrary tuple type\ncomptime fn impl_serialize_for_tuple(_m: Module, length: u32) -> Quoted {\n    // `T0`, `T1`, `T2`\n    let type_names = make_slice(length, |i| f\"T{i}\".quoted_contents());\n\n    // `result0`, `result1`, `result2`\n    let result_names = make_slice(length, |i| f\"result{i}\".quoted_contents());\n\n    // `T0, T1, T2`\n    let field_generics = type_names.join(quote [,]);\n\n    // `<T0 as Serialize>::N + <T1 as Serialize>::N + <T2 as Serialize>::N`\n    let full_size_serialize = type_names\n        .map(|type_name| quote {\n        <$type_name as Serialize>::N\n    })\n        .join(quote [+]);\n\n    // `<T0 as Deserialize>::N + <T1 as Deserialize>::N + <T2 as Deserialize>::N`\n    let full_size_deserialize = type_names\n        .map(|type_name| quote {\n        <$type_name as Deserialize>::N\n    })\n        .join(quote [+]);\n\n    // `T0: Serialize, T1: Serialize, T2: Serialize,`\n    let serialize_constraints = type_names\n        .map(|field_name| quote {\n        $field_name: Serialize,\n    })\n        .join(quote []);\n\n    // `T0: Deserialize, T1: Deserialize, T2: Deserialize,`\n    let deserialize_constraints = type_names\n        .map(|field_name| quote {\n        $field_name: Deserialize,\n    })\n        .join(quote []);\n\n    // Statements to serialize each field\n    let serialized_fields = type_names\n        .mapi(|i, _type_name| quote {\n            $crate::serialization::Serialize::stream_serialize(self.$i, writer);\n    })\n        .join(quote []);\n\n    // Statements to deserialize each field\n    let deserialized_fields = type_names\n        .mapi(|i, type_name| {\n            let result_name = result_names[i];\n            quote {\n            let $result_name = <$type_name as $crate::serialization::Deserialize>::stream_deserialize(reader);\n        }\n        })\n        .join(quote []);\n    let deserialize_results = result_names.join(quote [,]);\n\n    quote {\n        impl<$field_generics> Serialize for ($field_generics) where $serialize_constraints {\n            let N: u32 = $full_size_serialize;\n\n            fn serialize(self) -> [Field; Self::N] {\n                let mut writer: $crate::writer::Writer<Self::N> = $crate::writer::Writer::new();\n                self.stream_serialize(&mut writer);\n                writer.finish()\n            }\n\n            #[inline_always]\n            fn stream_serialize<let K: u32>(self, writer: &mut $crate::writer::Writer<K>) {\n\n                $serialized_fields\n            }\n        }\n\n        impl<$field_generics> Deserialize for ($field_generics) where $deserialize_constraints {\n            let N: u32 = $full_size_deserialize;\n\n            fn deserialize(fields: [Field; Self::N]) -> Self {\n                let mut reader = $crate::reader::Reader::new(fields);\n                let result = Self::stream_deserialize(&mut reader);\n                reader.finish();\n                result\n            }\n    \n            #[inline_always]\n            fn stream_deserialize<let K: u32>(reader: &mut $crate::reader::Reader<K>) -> Self {\n                $deserialized_fields\n                ($deserialize_results)\n            }\n        }\n    }\n}\n\n// Keeping these manual impls. They are more efficient since they do not\n// require copying sub-arrays from any serialized arrays.\nimpl<T1> Serialize for (T1,)\nwhere\n    T1: Serialize,\n{\n    let N: u32 = <T1 as Serialize>::N;\n\n    fn serialize(self) -> [Field; Self::N] {\n        let mut writer: crate::writer::Writer<Self::N> = crate::writer::Writer::new();\n        self.stream_serialize(&mut writer);\n        writer.finish()\n    }\n\n    #[inline_always]\n    fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n        self.0.stream_serialize(writer);\n    }\n}\n\nimpl<T1> Deserialize for (T1,)\nwhere\n    T1: Deserialize,\n{\n    let N: u32 = <T1 as Deserialize>::N;\n\n    fn deserialize(fields: [Field; Self::N]) -> Self {\n        let mut reader = crate::reader::Reader::new(fields);\n        let result = Self::stream_deserialize(&mut reader);\n        reader.finish();\n        result\n    }\n\n    #[inline_always]\n    fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n        (<T1 as Deserialize>::stream_deserialize(reader),)\n    }\n}\n\n#[impl_serialize_for_tuple(2)]\n#[impl_serialize_for_tuple(3)]\n#[impl_serialize_for_tuple(4)]\n#[impl_serialize_for_tuple(5)]\n#[impl_serialize_for_tuple(6)]\nmod impls {\n    use crate::serialization::{Deserialize, Serialize};\n}\n\n#[test]\nunconstrained fn bounded_vec_serialization() {\n    // Test empty BoundedVec\n    let empty_vec: BoundedVec<Field, 3> = BoundedVec::from_array([]);\n    let serialized = empty_vec.serialize();\n    let deserialized = BoundedVec::<Field, 3>::deserialize(serialized);\n    assert_eq(empty_vec, deserialized);\n    assert_eq(deserialized.len(), 0);\n\n    // Test partially filled BoundedVec\n    let partial_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2]]);\n    let serialized = partial_vec.serialize();\n    let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n    assert_eq(partial_vec, deserialized);\n    assert_eq(deserialized.len(), 1);\n    assert_eq(deserialized.get(0), [1, 2]);\n\n    // Test full BoundedVec\n    let full_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2], [3, 4], [5, 6]]);\n    let serialized = full_vec.serialize();\n    let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n    assert_eq(full_vec, deserialized);\n    assert_eq(deserialized.len(), 3);\n    assert_eq(deserialized.get(0), [1, 2]);\n    assert_eq(deserialized.get(1), [3, 4]);\n    assert_eq(deserialized.get(2), [5, 6]);\n}\n"
     },
-    "413": {
+    "411": {
       "function_locations": [
         {
           "name": "Writer<N>::new",
@@ -6727,491 +6663,515 @@
         },
         {
           "name": "BoundedVec<T, MaxLen>::from_array",
-          "start": 11594
+          "start": 13074
         },
         {
           "name": "BoundedVec<T, MaxLen>::pop",
-          "start": 12337
+          "start": 13817
         },
         {
           "name": "BoundedVec<T, MaxLen>::any",
-          "start": 12960
+          "start": 14440
         },
         {
           "name": "BoundedVec<T, MaxLen>::map",
-          "start": 13876
+          "start": 15356
         },
         {
           "name": "BoundedVec<T, MaxLen>::mapi",
-          "start": 14811
+          "start": 16356
         },
         {
           "name": "BoundedVec<T, MaxLen>::for_each",
-          "start": 15704
+          "start": 17314
         },
         {
           "name": "BoundedVec<T, MaxLen>::for_eachi",
-          "start": 16509
+          "start": 18119
         },
         {
           "name": "BoundedVec<T, MaxLen>::from_parts",
-          "start": 17508
+          "start": 19118
         },
         {
           "name": "BoundedVec<T, MaxLen>::from_parts_unchecked",
-          "start": 19157
+          "start": 20767
         },
         {
           "name": "<impl Eq for BoundedVec<T, MaxLen>>::eq",
-          "start": 19369
+          "start": 20979
         },
         {
           "name": "<impl From<[T; Len]> for BoundedVec<T, MaxLen>>::from",
-          "start": 19940
+          "start": 21550
         },
         {
           "name": "bounded_vec_tests::get::panics_when_reading_elements_past_end_of_vec",
-          "start": 20223
+          "start": 21833
         },
         {
           "name": "bounded_vec_tests::get::panics_when_reading_beyond_length",
-          "start": 20458
+          "start": 22068
         },
         {
           "name": "bounded_vec_tests::get::get_works_within_bounds",
-          "start": 20633
+          "start": 22243
         },
         {
           "name": "bounded_vec_tests::get::get_unchecked_works",
-          "start": 20892
+          "start": 22502
         },
         {
           "name": "bounded_vec_tests::get::get_unchecked_works_past_len",
-          "start": 21136
+          "start": 22746
         },
         {
           "name": "bounded_vec_tests::set::set_updates_values_properly",
-          "start": 21409
+          "start": 23019
         },
         {
           "name": "bounded_vec_tests::set::panics_when_writing_elements_past_end_of_vec",
-          "start": 22047
+          "start": 23657
         },
         {
           "name": "bounded_vec_tests::set::panics_when_setting_beyond_length",
-          "start": 22282
+          "start": 23892
         },
         {
           "name": "bounded_vec_tests::set::set_unchecked_operations",
-          "start": 22457
+          "start": 24067
         },
         {
           "name": "bounded_vec_tests::set::set_unchecked_operations_past_len",
-          "start": 22789
+          "start": 24399
         },
         {
           "name": "bounded_vec_tests::set::set_preserves_other_elements",
-          "start": 23053
+          "start": 24663
         },
         {
           "name": "bounded_vec_tests::any::returns_false_if_predicate_not_satisfied",
-          "start": 23521
+          "start": 25131
         },
         {
           "name": "bounded_vec_tests::any::returns_true_if_predicate_satisfied",
-          "start": 23775
+          "start": 25385
         },
         {
           "name": "bounded_vec_tests::any::returns_false_on_empty_boundedvec",
-          "start": 24024
+          "start": 25634
         },
         {
           "name": "bounded_vec_tests::any::any_with_complex_predicates",
-          "start": 24235
+          "start": 25845
         },
         {
           "name": "bounded_vec_tests::any::any_with_partial_vector",
-          "start": 24598
+          "start": 26208
         },
         {
           "name": "bounded_vec_tests::map::applies_function_correctly",
-          "start": 24985
+          "start": 26595
         },
         {
           "name": "bounded_vec_tests::map::applies_function_that_changes_return_type",
-          "start": 25407
+          "start": 27017
         },
         {
           "name": "bounded_vec_tests::map::does_not_apply_function_past_len",
-          "start": 25755
+          "start": 27365
         },
         {
           "name": "bounded_vec_tests::map::map_with_conditional_logic",
-          "start": 26128
+          "start": 27738
         },
         {
           "name": "bounded_vec_tests::map::map_preserves_length",
-          "start": 26452
+          "start": 28062
         },
         {
           "name": "bounded_vec_tests::map::map_on_empty_vector",
-          "start": 26744
+          "start": 28354
         },
         {
           "name": "bounded_vec_tests::mapi::applies_function_correctly",
-          "start": 27118
+          "start": 28728
         },
         {
           "name": "bounded_vec_tests::mapi::applies_function_that_changes_return_type",
-          "start": 27551
+          "start": 29161
         },
         {
           "name": "bounded_vec_tests::mapi::does_not_apply_function_past_len",
-          "start": 27908
+          "start": 29518
         },
         {
           "name": "bounded_vec_tests::mapi::mapi_with_index_branching_logic",
-          "start": 28290
+          "start": 29900
         },
         {
           "name": "bounded_vec_tests::for_each::for_each_map",
-          "start": 28849
+          "start": 30459
         },
         {
           "name": "bounded_vec_tests::for_each::smoke_test",
-          "start": 29079
+          "start": 30689
         },
         {
           "name": "bounded_vec_tests::for_each::applies_function_correctly",
-          "start": 29487
+          "start": 31097
         },
         {
           "name": "bounded_vec_tests::for_each::applies_function_that_changes_return_type",
-          "start": 29821
+          "start": 31431
         },
         {
           "name": "bounded_vec_tests::for_each::does_not_apply_function_past_len",
-          "start": 30179
+          "start": 31789
         },
         {
           "name": "bounded_vec_tests::for_each::for_each_on_empty_vector",
-          "start": 30560
+          "start": 32170
         },
         {
           "name": "bounded_vec_tests::for_each::for_each_with_side_effects",
-          "start": 30846
+          "start": 32456
         },
         {
           "name": "bounded_vec_tests::for_eachi::for_eachi_mapi",
-          "start": 31403
+          "start": 33013
         },
         {
           "name": "bounded_vec_tests::for_eachi::smoke_test",
-          "start": 31640
+          "start": 33250
         },
         {
           "name": "bounded_vec_tests::for_eachi::applies_function_correctly",
-          "start": 32096
+          "start": 33706
         },
         {
           "name": "bounded_vec_tests::for_eachi::applies_function_that_changes_return_type",
-          "start": 32440
+          "start": 34050
         },
         {
           "name": "bounded_vec_tests::for_eachi::does_not_apply_function_past_len",
-          "start": 32808
+          "start": 34418
         },
         {
           "name": "bounded_vec_tests::for_eachi::for_eachi_on_empty_vector",
-          "start": 33195
+          "start": 34805
         },
         {
           "name": "bounded_vec_tests::for_eachi::for_eachi_with_index_tracking",
-          "start": 33488
+          "start": 35098
         },
         {
           "name": "bounded_vec_tests::from_array::empty",
-          "start": 33965
+          "start": 35575
         },
         {
           "name": "bounded_vec_tests::from_array::equal_len",
-          "start": 34275
+          "start": 35885
         },
         {
           "name": "bounded_vec_tests::from_array::max_len_greater_then_array_len",
-          "start": 34592
+          "start": 36202
         },
         {
           "name": "bounded_vec_tests::from_array::max_len_lower_then_array_len",
-          "start": 35063
+          "start": 36673
         },
         {
           "name": "bounded_vec_tests::from_array::from_array_preserves_order",
-          "start": 35206
+          "start": 36816
         },
         {
           "name": "bounded_vec_tests::from_array::from_array_with_different_types",
-          "start": 35495
+          "start": 37105
         },
         {
           "name": "bounded_vec_tests::trait_from::simple",
-          "start": 35932
+          "start": 37542
         },
         {
           "name": "bounded_vec_tests::trait_eq::empty_equality",
-          "start": 36370
+          "start": 37980
         },
         {
           "name": "bounded_vec_tests::trait_eq::inequality",
-          "start": 36619
+          "start": 38229
         },
         {
           "name": "bounded_vec_tests::from_parts::from_parts",
-          "start": 37028
+          "start": 38638
         },
         {
           "name": "bounded_vec_tests::from_parts::from_parts_unchecked",
-          "start": 37618
+          "start": 39228
         },
         {
           "name": "bounded_vec_tests::push_pop::push_and_pop_operations",
-          "start": 38400
+          "start": 40010
         },
         {
           "name": "bounded_vec_tests::push_pop::push_to_full_vector",
-          "start": 39026
+          "start": 40636
         },
         {
           "name": "bounded_vec_tests::push_pop::pop_from_empty_vector",
-          "start": 39300
+          "start": 40910
         },
         {
           "name": "bounded_vec_tests::push_pop::push_pop_cycle",
-          "start": 39469
+          "start": 41079
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_array",
-          "start": 40115
+          "start": 41725
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_vector",
-          "start": 40461
+          "start": 42071
         },
         {
           "name": "bounded_vec_tests::extend::extend_from_bounded_vec",
-          "start": 40825
+          "start": 42435
+        },
+        {
+          "name": "bounded_vec_tests::extend::extend_from_bounded_vec_limit",
+          "start": 43056
+        },
+        {
+          "name": "bounded_vec_tests::extend::extend_from_bounded_vec_full_and_empty",
+          "start": 43570
+        },
+        {
+          "name": "bounded_vec_tests::extend::extend_from_bounded_vec_zero_len",
+          "start": 44074
+        },
+        {
+          "name": "bounded_vec_tests::extend::extend_from_bounded_vec_last_zeroed",
+          "start": 44368
+        },
+        {
+          "name": "bounded_vec_tests::extend::extend_from_bounded_vec_empty_self",
+          "start": 44793
+        },
+        {
+          "name": "bounded_vec_tests::extend::extend_from_bounded_vec_equal_capacity",
+          "start": 45360
         },
         {
           "name": "bounded_vec_tests::extend::extend_array_beyond_max_len",
-          "start": 41365
+          "start": 45947
         },
         {
           "name": "bounded_vec_tests::extend::extend_vector_beyond_max_len",
-          "start": 41643
+          "start": 46225
         },
         {
           "name": "bounded_vec_tests::extend::extend_bounded_vec_beyond_max_len",
-          "start": 41946
+          "start": 46528
         },
         {
           "name": "bounded_vec_tests::extend::extend_with_empty_collections",
-          "start": 42232
+          "start": 46814
         },
         {
           "name": "bounded_vec_tests::storage::storage_consistency",
-          "start": 42832
+          "start": 47414
         },
         {
           "name": "bounded_vec_tests::storage::storage_after_pop",
-          "start": 43334
+          "start": 47916
         },
         {
           "name": "bounded_vec_tests::storage::vector_immutable",
-          "start": 43652
+          "start": 48234
         }
       ],
       "path": "std/collections/bounded_vec.nr",
-      "source": "use crate::{cmp::Eq, convert::From, runtime::is_unconstrained, static_assert};\n\n/// A `BoundedVec<T, MaxLen>` is a growable storage similar to a built-in vector except that it\n/// is bounded with a maximum possible length. `BoundedVec` is also not\n/// subject to the same restrictions vectors are (notably, nested vectors are disallowed).\n///\n/// Since a BoundedVec is backed by a normal array under the hood, growing the BoundedVec by\n/// pushing an additional element is also more efficient - the length only needs to be increased\n/// by one.\n///\n/// For these reasons `BoundedVec<T, N>` should generally be preferred over vectors when there\n/// is a reasonable maximum bound that can be placed on the vector.\n///\n/// Example:\n///\n/// ```noir\n/// let mut vector: BoundedVec<Field, 10> = BoundedVec::new();\n/// for i in 0..5 {\n///     vector.push(i);\n/// }\n/// assert(vector.len() == 5);\n/// assert(vector.max_len() == 10);\n/// ```\npub struct BoundedVec<T, let MaxLen: u32> {\n    storage: [T; MaxLen],\n    len: u32,\n}\n\nimpl<T, let MaxLen: u32> BoundedVec<T, MaxLen> {\n    /// Creates a new, empty vector of length zero.\n    ///\n    /// Since this container is backed by an array internally, it still needs an initial value\n    /// to give each element. To resolve this, each element is zeroed internally. This value\n    /// is guaranteed to be inaccessible unless `get_unchecked` is used.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let empty_vector: BoundedVec<Field, 10> = BoundedVec::new();\n    /// assert(empty_vector.len() == 0);\n    /// ```\n    ///\n    /// Note that whenever calling `new` the maximum length of the vector should always be specified\n    /// via a type signature:\n    ///\n    /// ```noir\n    /// fn good() -> BoundedVec<Field, 10> {\n    ///     // Ok! MaxLen is specified with a type annotation\n    ///     let v1: BoundedVec<Field, 3> = BoundedVec::new();\n    ///     let v2 = BoundedVec::new();\n    ///\n    ///     // Ok! MaxLen is known from the type of `good`'s return value\n    ///     v2\n    /// }\n    ///\n    /// fn bad() {\n    ///     // Error: Type annotation needed\n    ///     // The compiler can't infer `MaxLen` from the following code:\n    ///     let mut v3 = BoundedVec::new();\n    ///     v3.push(5);\n    /// }\n    /// ```\n    ///\n    /// This defaulting of `MaxLen` (and numeric generics in general) to zero may change in future noir versions\n    /// but for now make sure to use type annotations when using bounded vectors. Otherwise, you will receive a\n    /// constraint failure at runtime when the vec is pushed to.\n    pub fn new() -> Self {\n        let zeroed = crate::mem::zeroed();\n        BoundedVec { storage: [zeroed; MaxLen], len: 0 }\n    }\n\n    /// Retrieves an element from the vector at the given index, starting from zero.\n    ///\n    /// If the given index is equal to or greater than the length of the vector, this\n    /// will issue a constraint failure.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n    ///     let first = v.get(0);\n    ///     let last = v.get(v.len() - 1);\n    ///     assert(first != last);\n    /// }\n    /// ```\n    pub fn get(&self, index: u32) -> T {\n        assert(index < self.len, \"Attempted to read past end of BoundedVec\");\n        self.get_unchecked(index)\n    }\n\n    /// Retrieves an element from the vector at the given index, starting from zero, without\n    /// performing a bounds check.\n    ///\n    /// Since this function does not perform a bounds check on length before accessing the element,\n    /// it is unsafe! Use at your own risk!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn sum_of_first_three<let N: u32>(v: BoundedVec<u32, N>) -> u32 {\n    ///     // Always ensure the length is larger than the largest\n    ///     // index passed to get_unchecked\n    ///     assert(v.len() > 2);\n    ///     let first = v.get_unchecked(0);\n    ///     let second = v.get_unchecked(1);\n    ///     let third = v.get_unchecked(2);\n    ///     first + second + third\n    /// }\n    /// ```\n    pub fn get_unchecked(&self, index: u32) -> T {\n        self.storage[index]\n    }\n\n    /// Writes an element to the vector at the given index, starting from zero.\n    ///\n    /// If the given index is equal to or greater than the length of the vector, this will issue a constraint failure.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n    ///     let first = v.get(0);\n    ///     assert(first != 42);\n    ///     v.set(0, 42);\n    ///     let new_first = v.get(0);\n    ///     assert(new_first == 42);\n    /// }\n    /// ```\n    pub fn set(&mut self, index: u32, value: T) {\n        assert(index < self.len, \"Attempted to write past end of BoundedVec\");\n        self.set_unchecked(index, value)\n    }\n\n    /// Writes an element to the vector at the given index, starting from zero, without performing a bounds check.\n    ///\n    /// Since this function does not perform a bounds check on length before accessing the element, it is unsafe! Use at your own risk!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn set_unchecked_example() {\n    ///     let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n    ///     vec.extend_from_array([1, 2]);\n    ///\n    ///     // Here we're safely writing within the valid range of `vec`\n    ///     // `vec` now has the value [42, 2]\n    ///     vec.set_unchecked(0, 42);\n    ///\n    ///     // We can then safely read this value back out of `vec`.\n    ///     // Notice that we use the checked version of `get` which would prevent reading unsafe values.\n    ///     assert_eq(vec.get(0), 42);\n    ///\n    ///     // We've now written past the end of `vec`.\n    ///     // As this index is still within the maximum potential length of `v`,\n    ///     // it won't cause a constraint failure.\n    ///     vec.set_unchecked(2, 42);\n    ///     println(vec);\n    ///\n    ///     // This will write past the end of the maximum potential length of `vec`,\n    ///     // it will then trigger a constraint failure.\n    ///     vec.set_unchecked(5, 42);\n    ///     println(vec);\n    /// }\n    /// ```\n    pub fn set_unchecked(&mut self, index: u32, value: T) {\n        self.storage[index] = value;\n    }\n\n    /// Pushes an element to the end of the vector. This increases the length\n    /// of the vector by one.\n    ///\n    /// Panics if the new length of the vector will be greater than the max length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n    ///\n    /// v.push(1);\n    /// v.push(2);\n    ///\n    /// // Panics with failed assertion \"push out of bounds\"\n    /// v.push(3);\n    /// ```\n    pub fn push(&mut self, elem: T) {\n        assert(self.len < MaxLen, \"push out of bounds\");\n\n        self.storage[self.len] = elem;\n        self.len += 1;\n    }\n\n    /// Returns the current length of this vector\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 4> = BoundedVec::new();\n    /// assert(v.len() == 0);\n    ///\n    /// v.push(100);\n    /// assert(v.len() == 1);\n    ///\n    /// v.push(200);\n    /// v.push(300);\n    /// v.push(400);\n    /// assert(v.len() == 4);\n    ///\n    /// let _ = v.pop();\n    /// let _ = v.pop();\n    /// assert(v.len() == 2);\n    /// ```\n    pub fn len(&self) -> u32 {\n        self.len\n    }\n\n    /// Returns the maximum length of this vector. This is always\n    /// equal to the `MaxLen` parameter this vector was initialized with.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n    ///\n    /// assert(v.max_len() == 5);\n    /// v.push(10);\n    /// assert(v.max_len() == 5);\n    /// ```\n    pub fn max_len(_self: &BoundedVec<T, MaxLen>) -> u32 {\n        MaxLen\n    }\n\n    /// Returns the internal array within this vector.\n    ///\n    /// Since arrays in Noir are immutable, mutating the returned storage array will not mutate\n    /// the storage held internally by this vector.\n    ///\n    /// Note that uninitialized elements may be zeroed out!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n    ///\n    /// assert(v.storage() == [0, 0, 0, 0, 0]);\n    ///\n    /// v.push(57);\n    /// assert(v.storage() == [57, 0, 0, 0, 0]);\n    /// ```\n    pub fn storage(&self) -> [T; MaxLen] {\n        self.storage\n    }\n\n    /// Pushes each element from the given array to this vector.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n    /// vec.extend_from_array([2, 4]);\n    ///\n    /// assert(vec.len == 2);\n    /// assert(vec.get(0) == 2);\n    /// assert(vec.get(1) == 4);\n    /// ```\n    pub fn extend_from_array<let Len: u32>(&mut self, array: [T; Len]) {\n        let new_len = self.len + array.len();\n        assert(new_len <= MaxLen, \"extend_from_array out of bounds\");\n        for i in 0..array.len() {\n            self.storage[self.len + i] = array[i];\n        }\n        self.len = new_len;\n    }\n\n    /// Pushes each element from the given vector to this vector.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n    /// vec.extend_from_vector([2, 4].as_vector());\n    ///\n    /// assert(vec.len == 2);\n    /// assert(vec.get(0) == 2);\n    /// assert(vec.get(1) == 4);\n    /// ```\n    pub fn extend_from_vector(&mut self, vector: [T]) {\n        let new_len = self.len + vector.len();\n        assert(new_len <= MaxLen, \"extend_from_vector out of bounds\");\n        for i in 0..vector.len() {\n            self.storage[self.len + i] = vector[i];\n        }\n        self.len = new_len;\n    }\n\n    /// Pushes each element from the other vector to this vector. The length of\n    /// the other vector is left unchanged.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// ```noir\n    /// let mut v1: BoundedVec<Field, 5> = BoundedVec::new();\n    /// let mut v2: BoundedVec<Field, 7> = BoundedVec::new();\n    ///\n    /// v2.extend_from_array([1, 2, 3]);\n    /// v1.extend_from_bounded_vec(v2);\n    ///\n    /// assert(v1.storage() == [1, 2, 3, 0, 0]);\n    /// assert(v2.storage() == [1, 2, 3, 0, 0, 0, 0]);\n    /// ```\n    pub fn extend_from_bounded_vec<let Len: u32>(&mut self, vec: BoundedVec<T, Len>) {\n        let append_len = vec.len();\n        let new_len = self.len + append_len;\n        assert(new_len <= MaxLen, \"extend_from_bounded_vec out of bounds\");\n\n        if is_unconstrained() {\n            for i in 0..append_len {\n                self.storage[self.len + i] = vec.get_unchecked(i);\n            }\n        } else {\n            for i in 0..Len {\n                if i < append_len {\n                    self.storage[self.len + i] = vec.get_unchecked(i);\n                }\n            }\n        }\n        self.len = new_len;\n    }\n\n    /// Creates a new vector, populating it with values derived from an array input.\n    /// The maximum length of the vector is determined based on the type signature.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array([1, 2, 3])\n    /// ```\n    pub fn from_array<let Len: u32>(array: [T; Len]) -> Self {\n        static_assert(Len <= MaxLen, \"from array out of bounds\");\n        let mut vec: BoundedVec<T, MaxLen> = BoundedVec::new();\n        vec.extend_from_array(array);\n        vec\n    }\n\n    /// Pops the element at the end of the vector. This will decrease the length\n    /// of the vector by one.\n    ///\n    /// Panics if the vector is empty.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n    /// v.push(1);\n    /// v.push(2);\n    ///\n    /// let two = v.pop();\n    /// let one = v.pop();\n    ///\n    /// assert(two == 2);\n    /// assert(one == 1);\n    ///\n    /// // error: cannot pop from an empty vector\n    /// let _ = v.pop();\n    /// ```\n    pub fn pop(&mut self) -> T {\n        assert(self.len > 0, \"cannot pop from an empty vector\");\n        self.len -= 1;\n\n        let elem = self.storage[self.len];\n        self.storage[self.len] = crate::mem::zeroed();\n        elem\n    }\n\n    /// Returns true if the given predicate returns true for any element\n    /// in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<u32, 3> = BoundedVec::new();\n    /// v.extend_from_array([2, 4, 6]);\n    ///\n    /// let all_even = !v.any(|elem: u32| elem % 2 != 0);\n    /// assert(all_even);\n    /// ```\n    pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = false;\n        if is_unconstrained() {\n            for i in 0..self.len {\n                ret |= predicate(self.storage[i]);\n            }\n        } else {\n            let mut exceeded_len = false;\n            for i in 0..MaxLen {\n                exceeded_len |= i == self.len;\n                if !exceeded_len {\n                    ret |= predicate(self.storage[i]);\n                }\n            }\n        }\n        ret\n    }\n\n    /// Creates a new vector of equal size by calling a closure on each element in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let result = vec.map(|value| value * 2);\n    ///\n    /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn map<U, Env>(&self, f: fn[Env](T) -> U) -> BoundedVec<U, MaxLen> {\n        let mut ret = BoundedVec::new();\n        ret.len = self.len();\n\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                ret.storage[i] = f(self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    ret.storage[i] = f(self.get_unchecked(i));\n                }\n            }\n        }\n\n        ret\n    }\n\n    /// Creates a new vector of equal size by calling a closure on each element\n    /// in this vector, along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let result = vec.mapi(|i, value| i + value * 2);\n    ///\n    /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn mapi<U, Env>(&self, f: fn[Env](u32, T) -> U) -> BoundedVec<U, MaxLen> {\n        let mut ret = BoundedVec::new();\n        ret.len = self.len();\n\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                ret.storage[i] = f(i, self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    ret.storage[i] = f(i, self.get_unchecked(i));\n                }\n            }\n        }\n\n        ret\n    }\n\n    /// Calls a closure on each element in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let mut result = BoundedVec::<u32, 4>::new();\n    /// vec.for_each(|value| result.push(value * 2));\n    ///\n    /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn for_each<Env>(&self, f: fn[Env](T) -> ()) {\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                f(self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    f(self.get_unchecked(i));\n                }\n            }\n        }\n    }\n\n    /// Calls a closure on each element in this vector, along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let mut result = BoundedVec::<u32, 4>::new();\n    /// vec.for_eachi(|i, value| result.push(i + value * 2));\n    ///\n    /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn for_eachi<Env>(&self, f: fn[Env](u32, T) -> ()) {\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                f(i, self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    f(i, self.get_unchecked(i));\n                }\n            }\n        }\n    }\n\n    /// Creates a new BoundedVec from the given array and length.\n    /// The given length must be less than or equal to the length of the array.\n    ///\n    /// This function will zero out any elements at or past index `len` of `array`.\n    /// This incurs an extra runtime cost of O(MaxLen). If you are sure your array is\n    /// zeroed after that index, you can use [`from_parts_unchecked`][Self::from_parts_unchecked] to remove the extra loop.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n    /// assert_eq(vec.len(), 3);\n    /// ```\n    pub fn from_parts(mut array: [T; MaxLen], len: u32) -> Self {\n        assert(len <= MaxLen);\n        let zeroed = crate::mem::zeroed();\n\n        if is_unconstrained() {\n            for i in len..MaxLen {\n                array[i] = zeroed;\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i >= len {\n                    array[i] = zeroed;\n                }\n            }\n        }\n\n        BoundedVec { storage: array, len }\n    }\n\n    /// Creates a new BoundedVec from the given array and length.\n    /// The given length must be less than or equal to the length of the array.\n    ///\n    /// This function is unsafe because it expects all elements past the `len` index\n    /// of `array` to be zeroed, but does not check for this internally. Use `from_parts`\n    /// for a safe version of this function which does zero out any indices past the\n    /// given length. Invalidating this assumption can notably cause `BoundedVec::eq`\n    /// to give incorrect results since it will check even elements past `len`.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n    /// assert_eq(vec.len(), 3);\n    ///\n    /// // invalid use!\n    /// let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n    /// let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n    ///\n    /// // both vecs have length 3 so we'd expect them to be equal, but this\n    /// // fails because elements past the length are still checked in eq\n    /// assert_eq(vec1, vec2); // fails\n    /// ```\n    pub fn from_parts_unchecked(array: [T; MaxLen], len: u32) -> Self {\n        assert(len <= MaxLen);\n        BoundedVec { storage: array, len }\n    }\n}\n\nimpl<T, let MaxLen: u32> Eq for BoundedVec<T, MaxLen>\nwhere\n    T: Eq,\n{\n    fn eq(self, other: BoundedVec<T, MaxLen>) -> bool {\n        // TODO: https://github.com/noir-lang/noir/issues/4837\n        //\n        // We make the assumption that the user has used the proper interface for working with `BoundedVec`s\n        // rather than directly manipulating the internal fields as this can result in an inconsistent internal state.\n        if self.len == other.len {\n            self.storage == other.storage\n        } else {\n            false\n        }\n    }\n}\n\nimpl<T, let MaxLen: u32, let Len: u32> From<[T; Len]> for BoundedVec<T, MaxLen> {\n    fn from(array: [T; Len]) -> BoundedVec<T, MaxLen> {\n        BoundedVec::from_array(array)\n    }\n}\n\nmod bounded_vec_tests {\n\n    mod get {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn panics_when_reading_elements_past_end_of_vec() {\n            let vec: BoundedVec<Field, 5> = BoundedVec::new();\n\n            let _ = vec.get(0);\n        }\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn panics_when_reading_beyond_length() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            let _ = vec.get(3);\n        }\n\n        #[test]\n        fn get_works_within_bounds() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(2), 3);\n            assert_eq(vec.get(4), 5);\n        }\n\n        #[test]\n        fn get_unchecked_works() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            assert_eq(vec.get_unchecked(0), 1);\n            assert_eq(vec.get_unchecked(2), 3);\n        }\n\n        #[test]\n        fn get_unchecked_works_past_len() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            assert_eq(vec.get_unchecked(4), 0);\n        }\n    }\n\n    mod set {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn set_updates_values_properly() {\n            let mut vec = BoundedVec::from_array([0, 0, 0, 0, 0]);\n\n            vec.set(0, 42);\n            assert_eq(vec.storage, [42, 0, 0, 0, 0]);\n\n            vec.set(1, 43);\n            assert_eq(vec.storage, [42, 43, 0, 0, 0]);\n\n            vec.set(2, 44);\n            assert_eq(vec.storage, [42, 43, 44, 0, 0]);\n\n            vec.set(1, 10);\n            assert_eq(vec.storage, [42, 10, 44, 0, 0]);\n\n            vec.set(0, 0);\n            assert_eq(vec.storage, [0, 10, 44, 0, 0]);\n        }\n\n        #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n        fn panics_when_writing_elements_past_end_of_vec() {\n            let mut vec: BoundedVec<Field, 5> = BoundedVec::new();\n            vec.set(0, 42);\n        }\n\n        #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n        fn panics_when_setting_beyond_length() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            vec.set(3, 4);\n        }\n\n        #[test]\n        fn set_unchecked_operations() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            vec.set_unchecked(0, 10);\n            assert_eq(vec.get(0), 10);\n        }\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn set_unchecked_operations_past_len() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            vec.set_unchecked(3, 40);\n            assert_eq(vec.get(3), 40);\n        }\n\n        #[test]\n        fn set_preserves_other_elements() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n            vec.set(2, 30);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 30);\n            assert_eq(vec.get(3), 4);\n            assert_eq(vec.get(4), 5);\n        }\n    }\n\n    mod any {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn returns_false_if_predicate_not_satisfied() {\n            let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, false, false]);\n            let result = vec.any(|value| value);\n\n            assert(!result);\n        }\n\n        #[test]\n        fn returns_true_if_predicate_satisfied() {\n            let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, true, true]);\n            let result = vec.any(|value| value);\n\n            assert(result);\n        }\n\n        #[test]\n        fn returns_false_on_empty_boundedvec() {\n            let vec: BoundedVec<bool, 0> = BoundedVec::new();\n            let result = vec.any(|value| value);\n\n            assert(!result);\n        }\n\n        #[test]\n        fn any_with_complex_predicates() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n            assert(vec.any(|x| x > 3));\n            assert(!vec.any(|x| x > 10));\n            assert(vec.any(|x| x % 2 == 0)); // has a even number\n            assert(vec.any(|x| x == 3)); // has a specific value\n        }\n\n        #[test]\n        fn any_with_partial_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            assert(vec.any(|x| x == 1));\n            assert(vec.any(|x| x == 2));\n            assert(!vec.any(|x| x == 3));\n        }\n    }\n\n    mod map {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn applies_function_correctly() {\n            // docs:start:bounded-vec-map-example\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|value| value * 2);\n            // docs:end:bounded-vec-map-example\n            let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|value| (value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = vec.map(|value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn map_with_conditional_logic() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n            let result = vec.map(|x| if x % 2 == 0 { x * 2 } else { x });\n            let expected = BoundedVec::from_array([1, 4, 3, 8]);\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn map_preserves_length() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|x| x * 2);\n\n            assert_eq(result.len(), vec.len());\n            assert_eq(result.max_len(), vec.max_len());\n        }\n\n        #[test]\n        fn map_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let result = vec.map(|x| x * 2);\n            assert_eq(result, vec);\n            assert_eq(result.len(), 0);\n            assert_eq(result.max_len(), 5);\n        }\n    }\n\n    mod mapi {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn applies_function_correctly() {\n            // docs:start:bounded-vec-mapi-example\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.mapi(|i, value| i + value * 2);\n            // docs:end:bounded-vec-mapi-example\n            let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.mapi(|i, value| (i + value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = vec.mapi(|_, value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn mapi_with_index_branching_logic() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n            let result = vec.mapi(|i, x| if i % 2 == 0 { x * 2 } else { x });\n            let expected = BoundedVec::from_array([2, 2, 6, 4]);\n            assert_eq(result, expected);\n        }\n    }\n\n    mod for_each {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        // map in terms of for_each\n        fn for_each_map<T, U, Env, let MaxLen: u32>(\n            input: BoundedVec<T, MaxLen>,\n            f: fn[Env](T) -> U,\n        ) -> BoundedVec<U, MaxLen> {\n            let mut output = BoundedVec::<U, MaxLen>::new();\n            let output_ref = &mut output;\n            input.for_each(|x| output_ref.push(f(x)));\n            output\n        }\n\n        #[test]\n        fn smoke_test() {\n            let mut acc = 0;\n            let acc_ref = &mut acc;\n            // docs:start:bounded-vec-for-each-example\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            vec.for_each(|value| { *acc_ref += value; });\n            // docs:end:bounded-vec-for-each-example\n            assert_eq(acc, 6);\n        }\n\n        #[test]\n        fn applies_function_correctly() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_each_map(vec, |value| value * 2);\n            let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_each_map(vec, |value| (value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = for_each_map(vec, |value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn for_each_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut count = 0;\n            let count_ref = &mut count;\n            vec.for_each(|_| { *count_ref += 1; });\n            assert_eq(count, 0);\n        }\n\n        #[test]\n        fn for_each_with_side_effects() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            let mut seen = BoundedVec::<u32, 3>::new();\n            let seen_ref = &mut seen;\n            vec.for_each(|x| seen_ref.push(x));\n            assert_eq(seen, vec);\n        }\n    }\n\n    mod for_eachi {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        // mapi in terms of for_eachi\n        fn for_eachi_mapi<T, U, Env, let MaxLen: u32>(\n            input: BoundedVec<T, MaxLen>,\n            f: fn[Env](u32, T) -> U,\n        ) -> BoundedVec<U, MaxLen> {\n            let mut output = BoundedVec::<U, MaxLen>::new();\n            let output_ref = &mut output;\n            input.for_eachi(|i, x| output_ref.push(f(i, x)));\n            output\n        }\n\n        #[test]\n        fn smoke_test() {\n            let mut acc = 0;\n            let acc_ref = &mut acc;\n            // docs:start:bounded-vec-for-eachi-example\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            vec.for_eachi(|i, value| { *acc_ref += i * value; });\n            // docs:end:bounded-vec-for-eachi-example\n\n            // 0 * 1 + 1 * 2 + 2 * 3\n            assert_eq(acc, 8);\n        }\n\n        #[test]\n        fn applies_function_correctly() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_eachi_mapi(vec, |i, value| i + value * 2);\n            let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_eachi_mapi(vec, |i, value| (i + value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = for_eachi_mapi(vec, |_, value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn for_eachi_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut count = 0;\n            let count_ref = &mut count;\n            vec.for_eachi(|_, _| { *count_ref += 1; });\n            assert_eq(count, 0);\n        }\n\n        #[test]\n        fn for_eachi_with_index_tracking() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([10, 20, 30]);\n            let mut indices = BoundedVec::<u32, 3>::new();\n            let indices_ref = &mut indices;\n            vec.for_eachi(|i, _| indices_ref.push(i));\n\n            let expected = BoundedVec::from_array([0, 1, 2]);\n            assert_eq(indices, expected);\n        }\n\n    }\n\n    mod from_array {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn empty() {\n            let empty_array: [Field; 0] = [];\n            let bounded_vec = BoundedVec::from_array([]);\n\n            assert_eq(bounded_vec.max_len(), 0);\n            assert_eq(bounded_vec.len(), 0);\n            assert_eq(bounded_vec.storage(), empty_array);\n        }\n\n        #[test]\n        fn equal_len() {\n            let array = [1, 2, 3];\n            let bounded_vec = BoundedVec::from_array(array);\n\n            assert_eq(bounded_vec.max_len(), 3);\n            assert_eq(bounded_vec.len(), 3);\n            assert_eq(bounded_vec.storage(), array);\n        }\n\n        #[test]\n        fn max_len_greater_then_array_len() {\n            let array = [1, 2, 3];\n            let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array(array);\n\n            assert_eq(bounded_vec.max_len(), 10);\n            assert_eq(bounded_vec.len(), 3);\n            assert_eq(bounded_vec.get(0), 1);\n            assert_eq(bounded_vec.get(1), 2);\n            assert_eq(bounded_vec.get(2), 3);\n        }\n\n        #[test(should_fail_with = \"from array out of bounds\")]\n        fn max_len_lower_then_array_len() {\n            let _: BoundedVec<Field, 2> = BoundedVec::from_array([0; 3]);\n        }\n\n        #[test]\n        fn from_array_preserves_order() {\n            let array = [5, 3, 1, 4, 2];\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array(array);\n            for i in 0..array.len() {\n                assert_eq(vec.get(i), array[i]);\n            }\n        }\n\n        #[test]\n        fn from_array_with_different_types() {\n            let bool_array = [true, false, true];\n            let bool_vec: BoundedVec<bool, 3> = BoundedVec::from_array(bool_array);\n            assert_eq(bool_vec.len(), 3);\n            assert_eq(bool_vec.get(0), true);\n            assert_eq(bool_vec.get(1), false);\n        }\n    }\n\n    mod trait_from {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::convert::From;\n\n        #[test]\n        fn simple() {\n            let array = [1, 2];\n            let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from(array);\n\n            assert_eq(bounded_vec.max_len(), 10);\n            assert_eq(bounded_vec.len(), 2);\n            assert_eq(bounded_vec.get(0), 1);\n            assert_eq(bounded_vec.get(1), 2);\n        }\n    }\n\n    mod trait_eq {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn empty_equality() {\n            let bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n            let bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n\n            assert_eq(bounded_vec1, bounded_vec2);\n        }\n\n        #[test]\n        fn inequality() {\n            let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n            let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n            bounded_vec1.push(1);\n            bounded_vec2.push(2);\n\n            assert(bounded_vec1 != bounded_vec2);\n        }\n    }\n\n    mod from_parts {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn from_parts() {\n            // docs:start:from-parts\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n            assert_eq(vec.len(), 3);\n\n            // Any elements past the given length are zeroed out, so these\n            // two BoundedVecs will be completely equal\n            let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 1], 3);\n            let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 2], 3);\n            assert_eq(vec1, vec2);\n            // docs:end:from-parts\n        }\n\n        #[test]\n        fn from_parts_unchecked() {\n            // docs:start:from-parts-unchecked\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n            assert_eq(vec.len(), 3);\n\n            // invalid use!\n            let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n            let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n\n            // both vecs have length 3 so we'd expect them to be equal, but this\n            // fails because elements past the length are still checked in eq\n            assert(vec1 != vec2);\n            // docs:end:from-parts-unchecked\n        }\n    }\n\n    mod push_pop {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn push_and_pop_operations() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n            assert_eq(vec.len(), 0);\n\n            vec.push(1);\n            assert_eq(vec.len(), 1);\n            assert_eq(vec.get(0), 1);\n\n            vec.push(2);\n            assert_eq(vec.len(), 2);\n            assert_eq(vec.get(1), 2);\n\n            let popped = vec.pop();\n            assert_eq(popped, 2);\n            assert_eq(vec.len(), 1);\n\n            let popped2 = vec.pop();\n            assert_eq(popped2, 1);\n            assert_eq(vec.len(), 0);\n        }\n\n        #[test(should_fail_with = \"push out of bounds\")]\n        fn push_to_full_vector() {\n            let mut vec: BoundedVec<u32, 2> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n            vec.push(3); // should panic\n        }\n\n        #[test(should_fail_with = \"cannot pop from an empty vector\")]\n        fn pop_from_empty_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let _ = vec.pop(); // should panic\n        }\n\n        #[test]\n        fn push_pop_cycle() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n\n            // push to full\n            vec.push(1);\n            vec.push(2);\n            vec.push(3);\n            assert_eq(vec.len(), 3);\n\n            // pop all\n            assert_eq(vec.pop(), 3);\n            assert_eq(vec.pop(), 2);\n            assert_eq(vec.pop(), 1);\n            assert_eq(vec.len(), 0);\n\n            // push again\n            vec.push(4);\n            assert_eq(vec.len(), 1);\n            assert_eq(vec.get(0), 4);\n        }\n    }\n\n    mod extend {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn extend_from_array() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_array([2, 3]);\n\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_vector([2, 3].as_vector());\n\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec() {\n            let mut vec1: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 3> = BoundedVec::new();\n\n            vec1.push(1);\n            vec2.push(2);\n            vec2.push(3);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n        }\n\n        #[test(should_fail_with = \"extend_from_array out of bounds\")]\n        fn extend_array_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_array([2, 3, 4]); // should panic\n        }\n\n        #[test(should_fail_with = \"extend_from_vector out of bounds\")]\n        fn extend_vector_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_vector([2, 3, 4].as_vector()); // S]should panic\n        }\n\n        #[test(should_fail_with = \"extend_from_bounded_vec out of bounds\")]\n        fn extend_bounded_vec_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            let other: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            vec.extend_from_bounded_vec(other); // should panic\n        }\n\n        #[test]\n        fn extend_with_empty_collections() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let original_len = vec.len();\n\n            vec.extend_from_array([]);\n            assert_eq(vec.len(), original_len);\n\n            vec.extend_from_vector([].as_vector());\n            assert_eq(vec.len(), original_len);\n\n            let empty: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.extend_from_bounded_vec(empty);\n            assert_eq(vec.len(), original_len);\n        }\n    }\n\n    mod storage {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn storage_consistency() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n            // test initial storage state\n            assert_eq(vec.storage(), [0, 0, 0, 0, 0]);\n\n            vec.push(1);\n            vec.push(2);\n\n            // test storage after modifications\n            assert_eq(vec.storage(), [1, 2, 0, 0, 0]);\n\n            // storage doesn't change length\n            assert_eq(vec.len(), 2);\n            assert_eq(vec.max_len(), 5);\n        }\n\n        #[test]\n        fn storage_after_pop() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n\n            let _ = vec.pop();\n            // after pop, the last element should be zeroed\n            assert_eq(vec.storage(), [1, 2, 0]);\n            assert_eq(vec.len(), 2);\n        }\n\n        #[test]\n        fn vector_immutable() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            let storage = vec.storage();\n\n            assert_eq(storage, [1, 2, 3]);\n\n            // Verify that the original vector is unchanged\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n    }\n}\n"
+      "source": "use crate::{cmp::Eq, convert::From, runtime::is_unconstrained, static_assert};\n\n/// A `BoundedVec<T, MaxLen>` is a growable storage similar to a built-in vector except that it\n/// is bounded with a maximum possible length. `BoundedVec` is also not\n/// subject to the same restrictions vectors are (notably, nested vectors are disallowed).\n///\n/// Since a BoundedVec is backed by a normal array under the hood, growing the BoundedVec by\n/// pushing an additional element is also more efficient - the length only needs to be increased\n/// by one.\n///\n/// For these reasons `BoundedVec<T, N>` should generally be preferred over vectors when there\n/// is a reasonable maximum bound that can be placed on the vector.\n///\n/// Example:\n///\n/// ```noir\n/// let mut vector: BoundedVec<Field, 10> = BoundedVec::new();\n/// for i in 0..5 {\n///     vector.push(i);\n/// }\n/// assert(vector.len() == 5);\n/// assert(vector.max_len() == 10);\n/// ```\npub struct BoundedVec<T, let MaxLen: u32> {\n    storage: [T; MaxLen],\n    len: u32,\n}\n\nimpl<T, let MaxLen: u32> BoundedVec<T, MaxLen> {\n    /// Creates a new, empty vector of length zero.\n    ///\n    /// Since this container is backed by an array internally, it still needs an initial value\n    /// to give each element. To resolve this, each element is zeroed internally. This value\n    /// is guaranteed to be inaccessible unless `get_unchecked` is used.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let empty_vector: BoundedVec<Field, 10> = BoundedVec::new();\n    /// assert(empty_vector.len() == 0);\n    /// ```\n    ///\n    /// Note that whenever calling `new` the maximum length of the vector should always be specified\n    /// via a type signature:\n    ///\n    /// ```noir\n    /// fn good() -> BoundedVec<Field, 10> {\n    ///     // Ok! MaxLen is specified with a type annotation\n    ///     let v1: BoundedVec<Field, 3> = BoundedVec::new();\n    ///     let v2 = BoundedVec::new();\n    ///\n    ///     // Ok! MaxLen is known from the type of `good`'s return value\n    ///     v2\n    /// }\n    ///\n    /// fn bad() {\n    ///     // Error: Type annotation needed\n    ///     // The compiler can't infer `MaxLen` from the following code:\n    ///     let mut v3 = BoundedVec::new();\n    ///     v3.push(5);\n    /// }\n    /// ```\n    ///\n    /// This defaulting of `MaxLen` (and numeric generics in general) to zero may change in future noir versions\n    /// but for now make sure to use type annotations when using bounded vectors. Otherwise, you will receive a\n    /// constraint failure at runtime when the vec is pushed to.\n    pub fn new() -> Self {\n        let zeroed = crate::mem::zeroed();\n        BoundedVec { storage: [zeroed; MaxLen], len: 0 }\n    }\n\n    /// Retrieves an element from the vector at the given index, starting from zero.\n    ///\n    /// If the given index is equal to or greater than the length of the vector, this\n    /// will issue a constraint failure.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n    ///     let first = v.get(0);\n    ///     let last = v.get(v.len() - 1);\n    ///     assert(first != last);\n    /// }\n    /// ```\n    pub fn get(&self, index: u32) -> T {\n        assert(index < self.len, \"Attempted to read past end of BoundedVec\");\n        self.get_unchecked(index)\n    }\n\n    /// Retrieves an element from the vector at the given index, starting from zero, without\n    /// performing a bounds check.\n    ///\n    /// Since this function does not perform a bounds check on length before accessing the element,\n    /// it is unsafe! Use at your own risk!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn sum_of_first_three<let N: u32>(v: BoundedVec<u32, N>) -> u32 {\n    ///     // Always ensure the length is larger than the largest\n    ///     // index passed to get_unchecked\n    ///     assert(v.len() > 2);\n    ///     let first = v.get_unchecked(0);\n    ///     let second = v.get_unchecked(1);\n    ///     let third = v.get_unchecked(2);\n    ///     first + second + third\n    /// }\n    /// ```\n    pub fn get_unchecked(&self, index: u32) -> T {\n        self.storage[index]\n    }\n\n    /// Writes an element to the vector at the given index, starting from zero.\n    ///\n    /// If the given index is equal to or greater than the length of the vector, this will issue a constraint failure.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n    ///     let first = v.get(0);\n    ///     assert(first != 42);\n    ///     v.set(0, 42);\n    ///     let new_first = v.get(0);\n    ///     assert(new_first == 42);\n    /// }\n    /// ```\n    pub fn set(&mut self, index: u32, value: T) {\n        assert(index < self.len, \"Attempted to write past end of BoundedVec\");\n        self.set_unchecked(index, value)\n    }\n\n    /// Writes an element to the vector at the given index, starting from zero, without performing a bounds check.\n    ///\n    /// Since this function does not perform a bounds check on length before accessing the element, it is unsafe! Use at your own risk!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// fn set_unchecked_example() {\n    ///     let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n    ///     vec.extend_from_array([1, 2]);\n    ///\n    ///     // Here we're safely writing within the valid range of `vec`\n    ///     // `vec` now has the value [42, 2]\n    ///     vec.set_unchecked(0, 42);\n    ///\n    ///     // We can then safely read this value back out of `vec`.\n    ///     // Notice that we use the checked version of `get` which would prevent reading unsafe values.\n    ///     assert_eq(vec.get(0), 42);\n    ///\n    ///     // We've now written past the end of `vec`.\n    ///     // As this index is still within the maximum potential length of `v`,\n    ///     // it won't cause a constraint failure.\n    ///     vec.set_unchecked(2, 42);\n    ///     println(vec);\n    ///\n    ///     // This will write past the end of the maximum potential length of `vec`,\n    ///     // it will then trigger a constraint failure.\n    ///     vec.set_unchecked(5, 42);\n    ///     println(vec);\n    /// }\n    /// ```\n    pub fn set_unchecked(&mut self, index: u32, value: T) {\n        self.storage[index] = value;\n    }\n\n    /// Pushes an element to the end of the vector. This increases the length\n    /// of the vector by one.\n    ///\n    /// Panics if the new length of the vector will be greater than the max length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n    ///\n    /// v.push(1);\n    /// v.push(2);\n    ///\n    /// // Panics with failed assertion \"push out of bounds\"\n    /// v.push(3);\n    /// ```\n    pub fn push(&mut self, elem: T) {\n        assert(self.len < MaxLen, \"push out of bounds\");\n\n        self.storage[self.len] = elem;\n        self.len += 1;\n    }\n\n    /// Returns the current length of this vector\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 4> = BoundedVec::new();\n    /// assert(v.len() == 0);\n    ///\n    /// v.push(100);\n    /// assert(v.len() == 1);\n    ///\n    /// v.push(200);\n    /// v.push(300);\n    /// v.push(400);\n    /// assert(v.len() == 4);\n    ///\n    /// let _ = v.pop();\n    /// let _ = v.pop();\n    /// assert(v.len() == 2);\n    /// ```\n    pub fn len(&self) -> u32 {\n        self.len\n    }\n\n    /// Returns the maximum length of this vector. This is always\n    /// equal to the `MaxLen` parameter this vector was initialized with.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n    ///\n    /// assert(v.max_len() == 5);\n    /// v.push(10);\n    /// assert(v.max_len() == 5);\n    /// ```\n    pub fn max_len(_self: &BoundedVec<T, MaxLen>) -> u32 {\n        MaxLen\n    }\n\n    /// Returns the internal array within this vector.\n    ///\n    /// Since arrays in Noir are immutable, mutating the returned storage array will not mutate\n    /// the storage held internally by this vector.\n    ///\n    /// Note that uninitialized elements may be zeroed out!\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n    ///\n    /// assert(v.storage() == [0, 0, 0, 0, 0]);\n    ///\n    /// v.push(57);\n    /// assert(v.storage() == [57, 0, 0, 0, 0]);\n    /// ```\n    pub fn storage(&self) -> [T; MaxLen] {\n        self.storage\n    }\n\n    /// Pushes each element from the given array to this vector.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n    /// vec.extend_from_array([2, 4]);\n    ///\n    /// assert(vec.len == 2);\n    /// assert(vec.get(0) == 2);\n    /// assert(vec.get(1) == 4);\n    /// ```\n    pub fn extend_from_array<let Len: u32>(&mut self, array: [T; Len]) {\n        let new_len = self.len + array.len();\n        assert(new_len <= MaxLen, \"extend_from_array out of bounds\");\n        for i in 0..array.len() {\n            self.storage[self.len + i] = array[i];\n        }\n        self.len = new_len;\n    }\n\n    /// Pushes each element from the given vector to this vector.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n    /// vec.extend_from_vector([2, 4].as_vector());\n    ///\n    /// assert(vec.len == 2);\n    /// assert(vec.get(0) == 2);\n    /// assert(vec.get(1) == 4);\n    /// ```\n    pub fn extend_from_vector(&mut self, vector: [T]) {\n        let new_len = self.len + vector.len();\n        assert(new_len <= MaxLen, \"extend_from_vector out of bounds\");\n        for i in 0..vector.len() {\n            self.storage[self.len + i] = vector[i];\n        }\n        self.len = new_len;\n    }\n\n    /// Pushes each element from the other vector to this vector. The length of\n    /// the other vector is left unchanged.\n    ///\n    /// Panics if pushing each element would cause the length of this vector\n    /// to exceed the maximum length.\n    ///\n    /// ```noir\n    /// let mut v1: BoundedVec<Field, 5> = BoundedVec::new();\n    /// let mut v2: BoundedVec<Field, 7> = BoundedVec::new();\n    ///\n    /// v2.extend_from_array([1, 2, 3]);\n    /// v1.extend_from_bounded_vec(v2);\n    ///\n    /// assert(v1.storage() == [1, 2, 3, 0, 0]);\n    /// assert(v2.storage() == [1, 2, 3, 0, 0, 0, 0]);\n    /// ```\n    pub fn extend_from_bounded_vec<let Len: u32>(&mut self, vec: BoundedVec<T, Len>) {\n        let append_len = vec.len();\n        let new_len = self.len + append_len;\n        assert(new_len <= MaxLen, \"extend_from_bounded_vec out of bounds\");\n\n        if is_unconstrained() {\n            for i in 0..append_len {\n                self.storage[self.len + i] = vec.get_unchecked(i);\n            }\n        } else {\n            // The source vector can be longer than the destination, or vice versa;\n            // regardless we will only ever be able to read or write whichever is\n            // the shorter max length of the two. We asserted that the actual content fits,\n            // but the capacity of the source vector could be higher.\n            let max = crate::cmp::min(Len, MaxLen);\n\n            // Save the last item in case we have to do a fixup on an already full array.\n            let last = if MaxLen > 0 {\n                self.storage[MaxLen - 1]\n            } else {\n                crate::mem::zeroed()\n            };\n\n            for src in 0..max {\n                // Since we are iterating to the static capacity of the arrays,\n                // the destination could be out of bounds. If that's the case,\n                // overwrite the last item, which we'll fixup in the end.\n                // NB using cmp::min resulted in more opcodes here.\n                let mut dst = self.len + src;\n                if dst >= MaxLen { dst = MaxLen - 1; };\n                // Assigning the source or zeroed to avoid having to merge arrays in SSA.\n                self.storage[dst] = if src < append_len {\n                    vec.get_unchecked(src)\n                } else {\n                    last\n                }\n            }\n\n            // Fixup the last item if we have to.\n            if MaxLen > 0 {\n                self.storage[MaxLen - 1] = if (self.len + append_len == MaxLen) & (append_len > 0) {\n                    vec.get_unchecked(append_len - 1)\n                } else {\n                    last\n                }\n            }\n        }\n        self.len = new_len;\n    }\n\n    /// Creates a new vector, populating it with values derived from an array input.\n    /// The maximum length of the vector is determined based on the type signature.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array([1, 2, 3])\n    /// ```\n    pub fn from_array<let Len: u32>(array: [T; Len]) -> Self {\n        static_assert(Len <= MaxLen, \"from array out of bounds\");\n        let mut vec: BoundedVec<T, MaxLen> = BoundedVec::new();\n        vec.extend_from_array(array);\n        vec\n    }\n\n    /// Pops the element at the end of the vector. This will decrease the length\n    /// of the vector by one.\n    ///\n    /// Panics if the vector is empty.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n    /// v.push(1);\n    /// v.push(2);\n    ///\n    /// let two = v.pop();\n    /// let one = v.pop();\n    ///\n    /// assert(two == 2);\n    /// assert(one == 1);\n    ///\n    /// // error: cannot pop from an empty vector\n    /// let _ = v.pop();\n    /// ```\n    pub fn pop(&mut self) -> T {\n        assert(self.len > 0, \"cannot pop from an empty vector\");\n        self.len -= 1;\n\n        let elem = self.storage[self.len];\n        self.storage[self.len] = crate::mem::zeroed();\n        elem\n    }\n\n    /// Returns true if the given predicate returns true for any element\n    /// in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let mut v: BoundedVec<u32, 3> = BoundedVec::new();\n    /// v.extend_from_array([2, 4, 6]);\n    ///\n    /// let all_even = !v.any(|elem: u32| elem % 2 != 0);\n    /// assert(all_even);\n    /// ```\n    pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n        let mut ret = false;\n        if is_unconstrained() {\n            for i in 0..self.len {\n                ret |= predicate(self.storage[i]);\n            }\n        } else {\n            let mut exceeded_len = false;\n            for i in 0..MaxLen {\n                exceeded_len |= i == self.len;\n                if !exceeded_len {\n                    ret |= predicate(self.storage[i]);\n                }\n            }\n        }\n        ret\n    }\n\n    /// Creates a new vector of equal size by calling a closure on each element in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let result = vec.map(|value| value * 2);\n    ///\n    /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn map<U, Env>(&self, f: fn[Env](T) -> U) -> BoundedVec<U, MaxLen> {\n        let mut ret = BoundedVec::new();\n        ret.len = self.len();\n\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                ret.storage[i] = f(self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                ret.storage[i] = if i < self.len() {\n                    f(self.get_unchecked(i))\n                } else {\n                    crate::mem::zeroed()\n                }\n            }\n        }\n\n        ret\n    }\n\n    /// Creates a new vector of equal size by calling a closure on each element\n    /// in this vector, along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let result = vec.mapi(|i, value| i + value * 2);\n    ///\n    /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn mapi<U, Env>(&self, f: fn[Env](u32, T) -> U) -> BoundedVec<U, MaxLen> {\n        let mut ret = BoundedVec::new();\n        ret.len = self.len();\n\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                ret.storage[i] = f(i, self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                ret.storage[i] = if i < self.len() {\n                    f(i, self.get_unchecked(i))\n                } else {\n                    crate::mem::zeroed()\n                }\n            }\n        }\n\n        ret\n    }\n\n    /// Calls a closure on each element in this vector.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let mut result = BoundedVec::<u32, 4>::new();\n    /// vec.for_each(|value| result.push(value * 2));\n    ///\n    /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn for_each<Env>(&self, f: fn[Env](T) -> ()) {\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                f(self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    f(self.get_unchecked(i));\n                }\n            }\n        }\n    }\n\n    /// Calls a closure on each element in this vector, along with its index.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n    /// let mut result = BoundedVec::<u32, 4>::new();\n    /// vec.for_eachi(|i, value| result.push(i + value * 2));\n    ///\n    /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n    /// assert_eq(result, expected);\n    /// ```\n    pub fn for_eachi<Env>(&self, f: fn[Env](u32, T) -> ()) {\n        if is_unconstrained() {\n            for i in 0..self.len() {\n                f(i, self.get_unchecked(i));\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i < self.len() {\n                    f(i, self.get_unchecked(i));\n                }\n            }\n        }\n    }\n\n    /// Creates a new BoundedVec from the given array and length.\n    /// The given length must be less than or equal to the length of the array.\n    ///\n    /// This function will zero out any elements at or past index `len` of `array`.\n    /// This incurs an extra runtime cost of O(MaxLen). If you are sure your array is\n    /// zeroed after that index, you can use [`from_parts_unchecked`][Self::from_parts_unchecked] to remove the extra loop.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n    /// assert_eq(vec.len(), 3);\n    /// ```\n    pub fn from_parts(mut array: [T; MaxLen], len: u32) -> Self {\n        assert(len <= MaxLen);\n        let zeroed = crate::mem::zeroed();\n\n        if is_unconstrained() {\n            for i in len..MaxLen {\n                array[i] = zeroed;\n            }\n        } else {\n            for i in 0..MaxLen {\n                if i >= len {\n                    array[i] = zeroed;\n                }\n            }\n        }\n\n        BoundedVec { storage: array, len }\n    }\n\n    /// Creates a new BoundedVec from the given array and length.\n    /// The given length must be less than or equal to the length of the array.\n    ///\n    /// This function is unsafe because it expects all elements past the `len` index\n    /// of `array` to be zeroed, but does not check for this internally. Use `from_parts`\n    /// for a safe version of this function which does zero out any indices past the\n    /// given length. Invalidating this assumption can notably cause `BoundedVec::eq`\n    /// to give incorrect results since it will check even elements past `len`.\n    ///\n    /// Example:\n    ///\n    /// ```noir\n    /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n    /// assert_eq(vec.len(), 3);\n    ///\n    /// // invalid use!\n    /// let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n    /// let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n    ///\n    /// // both vecs have length 3 so we'd expect them to be equal, but this\n    /// // fails because elements past the length are still checked in eq\n    /// assert_eq(vec1, vec2); // fails\n    /// ```\n    pub fn from_parts_unchecked(array: [T; MaxLen], len: u32) -> Self {\n        assert(len <= MaxLen);\n        BoundedVec { storage: array, len }\n    }\n}\n\nimpl<T, let MaxLen: u32> Eq for BoundedVec<T, MaxLen>\nwhere\n    T: Eq,\n{\n    fn eq(self, other: BoundedVec<T, MaxLen>) -> bool {\n        // TODO: https://github.com/noir-lang/noir/issues/4837\n        //\n        // We make the assumption that the user has used the proper interface for working with `BoundedVec`s\n        // rather than directly manipulating the internal fields as this can result in an inconsistent internal state.\n        if self.len == other.len {\n            self.storage == other.storage\n        } else {\n            false\n        }\n    }\n}\n\nimpl<T, let MaxLen: u32, let Len: u32> From<[T; Len]> for BoundedVec<T, MaxLen> {\n    fn from(array: [T; Len]) -> BoundedVec<T, MaxLen> {\n        BoundedVec::from_array(array)\n    }\n}\n\nmod bounded_vec_tests {\n\n    mod get {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn panics_when_reading_elements_past_end_of_vec() {\n            let vec: BoundedVec<Field, 5> = BoundedVec::new();\n\n            let _ = vec.get(0);\n        }\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn panics_when_reading_beyond_length() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            let _ = vec.get(3);\n        }\n\n        #[test]\n        fn get_works_within_bounds() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(2), 3);\n            assert_eq(vec.get(4), 5);\n        }\n\n        #[test]\n        fn get_unchecked_works() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            assert_eq(vec.get_unchecked(0), 1);\n            assert_eq(vec.get_unchecked(2), 3);\n        }\n\n        #[test]\n        fn get_unchecked_works_past_len() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            assert_eq(vec.get_unchecked(4), 0);\n        }\n    }\n\n    mod set {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn set_updates_values_properly() {\n            let mut vec = BoundedVec::from_array([0, 0, 0, 0, 0]);\n\n            vec.set(0, 42);\n            assert_eq(vec.storage, [42, 0, 0, 0, 0]);\n\n            vec.set(1, 43);\n            assert_eq(vec.storage, [42, 43, 0, 0, 0]);\n\n            vec.set(2, 44);\n            assert_eq(vec.storage, [42, 43, 44, 0, 0]);\n\n            vec.set(1, 10);\n            assert_eq(vec.storage, [42, 10, 44, 0, 0]);\n\n            vec.set(0, 0);\n            assert_eq(vec.storage, [0, 10, 44, 0, 0]);\n        }\n\n        #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n        fn panics_when_writing_elements_past_end_of_vec() {\n            let mut vec: BoundedVec<Field, 5> = BoundedVec::new();\n            vec.set(0, 42);\n        }\n\n        #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n        fn panics_when_setting_beyond_length() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n            vec.set(3, 4);\n        }\n\n        #[test]\n        fn set_unchecked_operations() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            vec.set_unchecked(0, 10);\n            assert_eq(vec.get(0), 10);\n        }\n\n        #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n        fn set_unchecked_operations_past_len() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            vec.set_unchecked(3, 40);\n            assert_eq(vec.get(3), 40);\n        }\n\n        #[test]\n        fn set_preserves_other_elements() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n            vec.set(2, 30);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 30);\n            assert_eq(vec.get(3), 4);\n            assert_eq(vec.get(4), 5);\n        }\n    }\n\n    mod any {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn returns_false_if_predicate_not_satisfied() {\n            let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, false, false]);\n            let result = vec.any(|value| value);\n\n            assert(!result);\n        }\n\n        #[test]\n        fn returns_true_if_predicate_satisfied() {\n            let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, true, true]);\n            let result = vec.any(|value| value);\n\n            assert(result);\n        }\n\n        #[test]\n        fn returns_false_on_empty_boundedvec() {\n            let vec: BoundedVec<bool, 0> = BoundedVec::new();\n            let result = vec.any(|value| value);\n\n            assert(!result);\n        }\n\n        #[test]\n        fn any_with_complex_predicates() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n            assert(vec.any(|x| x > 3));\n            assert(!vec.any(|x| x > 10));\n            assert(vec.any(|x| x % 2 == 0)); // has a even number\n            assert(vec.any(|x| x == 3)); // has a specific value\n        }\n\n        #[test]\n        fn any_with_partial_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n\n            assert(vec.any(|x| x == 1));\n            assert(vec.any(|x| x == 2));\n            assert(!vec.any(|x| x == 3));\n        }\n    }\n\n    mod map {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn applies_function_correctly() {\n            // docs:start:bounded-vec-map-example\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|value| value * 2);\n            // docs:end:bounded-vec-map-example\n            let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|value| (value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = vec.map(|value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn map_with_conditional_logic() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n            let result = vec.map(|x| if x % 2 == 0 { x * 2 } else { x });\n            let expected = BoundedVec::from_array([1, 4, 3, 8]);\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn map_preserves_length() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.map(|x| x * 2);\n\n            assert_eq(result.len(), vec.len());\n            assert_eq(result.max_len(), vec.max_len());\n        }\n\n        #[test]\n        fn map_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let result = vec.map(|x| x * 2);\n            assert_eq(result, vec);\n            assert_eq(result.len(), 0);\n            assert_eq(result.max_len(), 5);\n        }\n    }\n\n    mod mapi {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn applies_function_correctly() {\n            // docs:start:bounded-vec-mapi-example\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.mapi(|i, value| i + value * 2);\n            // docs:end:bounded-vec-mapi-example\n            let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = vec.mapi(|i, value| (i + value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = vec.mapi(|_, value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn mapi_with_index_branching_logic() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n            let result = vec.mapi(|i, x| if i % 2 == 0 { x * 2 } else { x });\n            let expected = BoundedVec::from_array([2, 2, 6, 4]);\n            assert_eq(result, expected);\n        }\n    }\n\n    mod for_each {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        // map in terms of for_each\n        fn for_each_map<T, U, Env, let MaxLen: u32>(\n            input: BoundedVec<T, MaxLen>,\n            f: fn[Env](T) -> U,\n        ) -> BoundedVec<U, MaxLen> {\n            let mut output = BoundedVec::<U, MaxLen>::new();\n            let output_ref = &mut output;\n            input.for_each(|x| output_ref.push(f(x)));\n            output\n        }\n\n        #[test]\n        fn smoke_test() {\n            let mut acc = 0;\n            let acc_ref = &mut acc;\n            // docs:start:bounded-vec-for-each-example\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            vec.for_each(|value| { *acc_ref += value; });\n            // docs:end:bounded-vec-for-each-example\n            assert_eq(acc, 6);\n        }\n\n        #[test]\n        fn applies_function_correctly() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_each_map(vec, |value| value * 2);\n            let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_each_map(vec, |value| (value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = for_each_map(vec, |value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn for_each_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut count = 0;\n            let count_ref = &mut count;\n            vec.for_each(|_| { *count_ref += 1; });\n            assert_eq(count, 0);\n        }\n\n        #[test]\n        fn for_each_with_side_effects() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            let mut seen = BoundedVec::<u32, 3>::new();\n            let seen_ref = &mut seen;\n            vec.for_each(|x| seen_ref.push(x));\n            assert_eq(seen, vec);\n        }\n    }\n\n    mod for_eachi {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        // mapi in terms of for_eachi\n        fn for_eachi_mapi<T, U, Env, let MaxLen: u32>(\n            input: BoundedVec<T, MaxLen>,\n            f: fn[Env](u32, T) -> U,\n        ) -> BoundedVec<U, MaxLen> {\n            let mut output = BoundedVec::<U, MaxLen>::new();\n            let output_ref = &mut output;\n            input.for_eachi(|i, x| output_ref.push(f(i, x)));\n            output\n        }\n\n        #[test]\n        fn smoke_test() {\n            let mut acc = 0;\n            let acc_ref = &mut acc;\n            // docs:start:bounded-vec-for-eachi-example\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            vec.for_eachi(|i, value| { *acc_ref += i * value; });\n            // docs:end:bounded-vec-for-eachi-example\n\n            // 0 * 1 + 1 * 2 + 2 * 3\n            assert_eq(acc, 8);\n        }\n\n        #[test]\n        fn applies_function_correctly() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_eachi_mapi(vec, |i, value| i + value * 2);\n            let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn applies_function_that_changes_return_type() {\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n            let result = for_eachi_mapi(vec, |i, value| (i + value * 2) as Field);\n            let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n            assert_eq(result, expected);\n        }\n\n        #[test]\n        fn does_not_apply_function_past_len() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n            let result = for_eachi_mapi(vec, |_, value| if value == 0 { 5 } else { value });\n            let expected = BoundedVec::from_array([5, 1]);\n\n            assert_eq(result, expected);\n            assert_eq(result.get_unchecked(2), 0);\n        }\n\n        #[test]\n        fn for_eachi_on_empty_vector() {\n            let vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut count = 0;\n            let count_ref = &mut count;\n            vec.for_eachi(|_, _| { *count_ref += 1; });\n            assert_eq(count, 0);\n        }\n\n        #[test]\n        fn for_eachi_with_index_tracking() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([10, 20, 30]);\n            let mut indices = BoundedVec::<u32, 3>::new();\n            let indices_ref = &mut indices;\n            vec.for_eachi(|i, _| indices_ref.push(i));\n\n            let expected = BoundedVec::from_array([0, 1, 2]);\n            assert_eq(indices, expected);\n        }\n\n    }\n\n    mod from_array {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn empty() {\n            let empty_array: [Field; 0] = [];\n            let bounded_vec = BoundedVec::from_array([]);\n\n            assert_eq(bounded_vec.max_len(), 0);\n            assert_eq(bounded_vec.len(), 0);\n            assert_eq(bounded_vec.storage(), empty_array);\n        }\n\n        #[test]\n        fn equal_len() {\n            let array = [1, 2, 3];\n            let bounded_vec = BoundedVec::from_array(array);\n\n            assert_eq(bounded_vec.max_len(), 3);\n            assert_eq(bounded_vec.len(), 3);\n            assert_eq(bounded_vec.storage(), array);\n        }\n\n        #[test]\n        fn max_len_greater_then_array_len() {\n            let array = [1, 2, 3];\n            let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array(array);\n\n            assert_eq(bounded_vec.max_len(), 10);\n            assert_eq(bounded_vec.len(), 3);\n            assert_eq(bounded_vec.get(0), 1);\n            assert_eq(bounded_vec.get(1), 2);\n            assert_eq(bounded_vec.get(2), 3);\n        }\n\n        #[test(should_fail_with = \"from array out of bounds\")]\n        fn max_len_lower_then_array_len() {\n            let _: BoundedVec<Field, 2> = BoundedVec::from_array([0; 3]);\n        }\n\n        #[test]\n        fn from_array_preserves_order() {\n            let array = [5, 3, 1, 4, 2];\n            let vec: BoundedVec<u32, 5> = BoundedVec::from_array(array);\n            for i in 0..array.len() {\n                assert_eq(vec.get(i), array[i]);\n            }\n        }\n\n        #[test]\n        fn from_array_with_different_types() {\n            let bool_array = [true, false, true];\n            let bool_vec: BoundedVec<bool, 3> = BoundedVec::from_array(bool_array);\n            assert_eq(bool_vec.len(), 3);\n            assert_eq(bool_vec.get(0), true);\n            assert_eq(bool_vec.get(1), false);\n        }\n    }\n\n    mod trait_from {\n        use crate::collections::bounded_vec::BoundedVec;\n        use crate::convert::From;\n\n        #[test]\n        fn simple() {\n            let array = [1, 2];\n            let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from(array);\n\n            assert_eq(bounded_vec.max_len(), 10);\n            assert_eq(bounded_vec.len(), 2);\n            assert_eq(bounded_vec.get(0), 1);\n            assert_eq(bounded_vec.get(1), 2);\n        }\n    }\n\n    mod trait_eq {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn empty_equality() {\n            let bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n            let bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n\n            assert_eq(bounded_vec1, bounded_vec2);\n        }\n\n        #[test]\n        fn inequality() {\n            let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n            let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n            bounded_vec1.push(1);\n            bounded_vec2.push(2);\n\n            assert(bounded_vec1 != bounded_vec2);\n        }\n    }\n\n    mod from_parts {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn from_parts() {\n            // docs:start:from-parts\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n            assert_eq(vec.len(), 3);\n\n            // Any elements past the given length are zeroed out, so these\n            // two BoundedVecs will be completely equal\n            let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 1], 3);\n            let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 2], 3);\n            assert_eq(vec1, vec2);\n            // docs:end:from-parts\n        }\n\n        #[test]\n        fn from_parts_unchecked() {\n            // docs:start:from-parts-unchecked\n            let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n            assert_eq(vec.len(), 3);\n\n            // invalid use!\n            let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n            let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n\n            // both vecs have length 3 so we'd expect them to be equal, but this\n            // fails because elements past the length are still checked in eq\n            assert(vec1 != vec2);\n            // docs:end:from-parts-unchecked\n        }\n    }\n\n    mod push_pop {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn push_and_pop_operations() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n            assert_eq(vec.len(), 0);\n\n            vec.push(1);\n            assert_eq(vec.len(), 1);\n            assert_eq(vec.get(0), 1);\n\n            vec.push(2);\n            assert_eq(vec.len(), 2);\n            assert_eq(vec.get(1), 2);\n\n            let popped = vec.pop();\n            assert_eq(popped, 2);\n            assert_eq(vec.len(), 1);\n\n            let popped2 = vec.pop();\n            assert_eq(popped2, 1);\n            assert_eq(vec.len(), 0);\n        }\n\n        #[test(should_fail_with = \"push out of bounds\")]\n        fn push_to_full_vector() {\n            let mut vec: BoundedVec<u32, 2> = BoundedVec::new();\n            vec.push(1);\n            vec.push(2);\n            vec.push(3); // should panic\n        }\n\n        #[test(should_fail_with = \"cannot pop from an empty vector\")]\n        fn pop_from_empty_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let _ = vec.pop(); // should panic\n        }\n\n        #[test]\n        fn push_pop_cycle() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n\n            // push to full\n            vec.push(1);\n            vec.push(2);\n            vec.push(3);\n            assert_eq(vec.len(), 3);\n\n            // pop all\n            assert_eq(vec.pop(), 3);\n            assert_eq(vec.pop(), 2);\n            assert_eq(vec.pop(), 1);\n            assert_eq(vec.len(), 0);\n\n            // push again\n            vec.push(4);\n            assert_eq(vec.len(), 1);\n            assert_eq(vec.get(0), 4);\n        }\n    }\n\n    mod extend {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn extend_from_array() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_array([2, 3]);\n\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_vector() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_vector([2, 3].as_vector());\n\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec() {\n            // The source deliberately has a higher capacity,\n            // to make sure we are not trying to assign out-of-bounds.\n            let mut vec1: BoundedVec<u32, 5> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 9> = BoundedVec::new();\n\n            vec1.push(1);\n            vec2.push(2);\n            vec2.push(3);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_limit() {\n            // Capacity and contents chosen so the last item must be assigned to.\n            let mut vec1: BoundedVec<u32, 2> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 5> = BoundedVec::new();\n\n            vec1.push(1);\n            vec2.push(2);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 2);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_full_and_empty() {\n            // Capacity and contents chosen so the last item must be assigned to.\n            let mut vec1: BoundedVec<u32, 2> = BoundedVec::new();\n            let vec2: BoundedVec<u32, 5> = BoundedVec::new();\n\n            vec1.push(1);\n            vec1.push(2);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 2);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_zero_len() {\n            let mut vec1: BoundedVec<u32, 0> = BoundedVec::new();\n            let vec2: BoundedVec<u32, 0> = BoundedVec::new();\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 0);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_last_zeroed() {\n            let mut vec1: BoundedVec<u32, 4> = BoundedVec::new();\n            let mut vec2: BoundedVec<u32, 4> = BoundedVec::new();\n\n            vec1.push(1);\n            vec1.push(2);\n            vec2.push(3);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get_unchecked(3), 0);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_empty_self() {\n            // self.len == 0 with Len > MaxLen: the loop doesn't reach\n            // the last storage slot, so the fixup must write it.\n            let mut vec1: BoundedVec<u32, 3> = BoundedVec::new();\n            let vec2: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 3);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n        }\n\n        #[test]\n        fn extend_from_bounded_vec_equal_capacity() {\n            // Len == MaxLen, fills to capacity.\n            let mut vec1: BoundedVec<u32, 4> = BoundedVec::new();\n            vec1.push(1);\n            let vec2: BoundedVec<u32, 4> = BoundedVec::from_array([2, 3, 4]);\n\n            vec1.extend_from_bounded_vec(vec2);\n\n            assert_eq(vec1.len(), 4);\n            assert_eq(vec1.get(0), 1);\n            assert_eq(vec1.get(1), 2);\n            assert_eq(vec1.get(2), 3);\n            assert_eq(vec1.get(3), 4);\n        }\n\n        #[test(should_fail_with = \"extend_from_array out of bounds\")]\n        fn extend_array_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_array([2, 3, 4]); // should panic\n        }\n\n        #[test(should_fail_with = \"extend_from_vector out of bounds\")]\n        fn extend_vector_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.push(1);\n            vec.extend_from_vector([2, 3, 4].as_vector()); // S]should panic\n        }\n\n        #[test(should_fail_with = \"extend_from_bounded_vec out of bounds\")]\n        fn extend_bounded_vec_beyond_max_len() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n            let other: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n            vec.extend_from_bounded_vec(other); // should panic\n        }\n\n        #[test]\n        fn extend_with_empty_collections() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n            let original_len = vec.len();\n\n            vec.extend_from_array([]);\n            assert_eq(vec.len(), original_len);\n\n            vec.extend_from_vector([].as_vector());\n            assert_eq(vec.len(), original_len);\n\n            let empty: BoundedVec<u32, 3> = BoundedVec::new();\n            vec.extend_from_bounded_vec(empty);\n            assert_eq(vec.len(), original_len);\n        }\n    }\n\n    mod storage {\n        use crate::collections::bounded_vec::BoundedVec;\n\n        #[test]\n        fn storage_consistency() {\n            let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n            // test initial storage state\n            assert_eq(vec.storage(), [0, 0, 0, 0, 0]);\n\n            vec.push(1);\n            vec.push(2);\n\n            // test storage after modifications\n            assert_eq(vec.storage(), [1, 2, 0, 0, 0]);\n\n            // storage doesn't change length\n            assert_eq(vec.len(), 2);\n            assert_eq(vec.max_len(), 5);\n        }\n\n        #[test]\n        fn storage_after_pop() {\n            let mut vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n\n            let _ = vec.pop();\n            // after pop, the last element should be zeroed\n            assert_eq(vec.storage(), [1, 2, 0]);\n            assert_eq(vec.len(), 2);\n        }\n\n        #[test]\n        fn vector_immutable() {\n            let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n            let storage = vec.storage();\n\n            assert_eq(storage, [1, 2, 3]);\n\n            // Verify that the original vector is unchanged\n            assert_eq(vec.len(), 3);\n            assert_eq(vec.get(0), 1);\n            assert_eq(vec.get(1), 2);\n            assert_eq(vec.get(2), 3);\n        }\n    }\n}\n"
     },
-    "69": {
+    "67": {
       "function_locations": [
         {
           "name": "PrivateContext::new",
-          "start": 10161
+          "start": 10178
         },
         {
           "name": "PrivateContext::maybe_msg_sender",
-          "start": 12345
+          "start": 12362
         },
         {
           "name": "PrivateContext::this_address",
-          "start": 13052
+          "start": 13069
         },
         {
           "name": "PrivateContext::chain_id",
-          "start": 13557
+          "start": 13574
         },
         {
           "name": "PrivateContext::version",
-          "start": 14140
+          "start": 14157
         },
         {
           "name": "PrivateContext::gas_settings",
-          "start": 14693
+          "start": 14710
         },
         {
           "name": "PrivateContext::selector",
-          "start": 15736
+          "start": 15753
         },
         {
           "name": "PrivateContext::get_args_hash",
-          "start": 16458
+          "start": 16475
         },
         {
           "name": "PrivateContext::push_note_hash",
-          "start": 18126
+          "start": 18143
         },
         {
           "name": "PrivateContext::push_nullifier",
-          "start": 19302
+          "start": 19319
         },
         {
           "name": "PrivateContext::push_nullifier_for_note_hash",
-          "start": 21071
+          "start": 21088
         },
         {
           "name": "PrivateContext::get_anchor_block_header",
-          "start": 22367
+          "start": 22384
         },
         {
           "name": "PrivateContext::get_block_header_at",
-          "start": 24428
+          "start": 24445
         },
         {
           "name": "PrivateContext::set_return_hash",
-          "start": 24857
+          "start": 24874
         },
         {
           "name": "PrivateContext::finish",
-          "start": 25352
+          "start": 25369
         },
         {
           "name": "PrivateContext::set_as_fee_payer",
-          "start": 27971
+          "start": 27988
         },
         {
           "name": "PrivateContext::in_revertible_phase",
-          "start": 28161
+          "start": 28178
         },
         {
           "name": "PrivateContext::end_setup",
-          "start": 30473
+          "start": 30490
         },
         {
           "name": "PrivateContext::set_expiration_timestamp",
-          "start": 33202
+          "start": 33219
         },
         {
           "name": "PrivateContext::assert_note_exists",
-          "start": 34597
+          "start": 34614
         },
         {
           "name": "PrivateContext::assert_nullifier_exists",
-          "start": 37233
+          "start": 37250
         },
         {
           "name": "PrivateContext::request_nhk_app",
-          "start": 39330
+          "start": 39347
         },
         {
           "name": "PrivateContext::request_ovsk_app",
-          "start": 40976
+          "start": 40993
         },
         {
           "name": "PrivateContext::request_sk_app",
-          "start": 42390
+          "start": 42407
         },
         {
           "name": "PrivateContext::message_portal",
-          "start": 45608
+          "start": 45625
         },
         {
           "name": "PrivateContext::consume_l1_to_l2_message",
-          "start": 47490
+          "start": 47507
         },
         {
           "name": "PrivateContext::emit_private_log_unsafe",
-          "start": 51902
+          "start": 51919
         },
         {
           "name": "PrivateContext::emit_raw_note_log_unsafe",
-          "start": 53491
+          "start": 53508
         },
         {
           "name": "PrivateContext::emit_contract_class_log",
-          "start": 53828
+          "start": 54103
         },
         {
           "name": "PrivateContext::call_private_function",
-          "start": 58378
+          "start": 58662
         },
         {
           "name": "PrivateContext::static_call_private_function",
-          "start": 59580
+          "start": 59864
         },
         {
           "name": "PrivateContext::call_private_function_no_args",
-          "start": 60595
+          "start": 60879
         },
         {
           "name": "PrivateContext::static_call_private_function_no_args",
-          "start": 61448
+          "start": 61732
         },
         {
           "name": "PrivateContext::call_private_function_with_args_hash",
-          "start": 62426
+          "start": 62710
         },
         {
           "name": "PrivateContext::call_public_function",
-          "start": 66586
+          "start": 66870
         },
         {
           "name": "PrivateContext::static_call_public_function",
-          "start": 67853
+          "start": 68137
         },
         {
           "name": "PrivateContext::call_public_function_no_args",
-          "start": 68872
+          "start": 69156
         },
         {
           "name": "PrivateContext::static_call_public_function_no_args",
-          "start": 69771
+          "start": 70055
         },
         {
           "name": "PrivateContext::call_public_function_with_calldata_hash",
-          "start": 70960
+          "start": 71244
         },
         {
           "name": "PrivateContext::set_public_teardown_function",
-          "start": 73488
+          "start": 73772
         },
         {
           "name": "PrivateContext::set_public_teardown_function_with_calldata_hash",
-          "start": 74759
+          "start": 75043
         },
         {
           "name": "PrivateContext::next_counter",
-          "start": 80163
+          "start": 80447
         },
         {
           "name": "<impl Empty for PrivateContext>::empty",
-          "start": 80332
+          "start": 80616
         }
       ],
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/private_context.nr",
-      "source": "use crate::{\n    context::{inputs::PrivateContextInputs, NoteExistenceRequest, NullifierExistenceRequest, ReturnsHash},\n    hash::{hash_args, hash_calldata_array},\n    keys::constants::{NULLIFIER_INDEX, NUM_KEY_TYPES, OUTGOING_INDEX, public_key_domain_separators},\n    messaging::process_l1_to_l2_message,\n    oracle::{\n        block_header::get_block_header_at,\n        call_private_function::call_private_function_internal,\n        execution_cache,\n        key_validation_request::get_key_validation_request,\n        logs::notify_created_contract_class_log,\n        notes::notify_nullified_note,\n        nullifiers::notify_created_nullifier,\n        public_call::assert_valid_public_call_data,\n        tx_phase::{is_execution_in_revertible_phase, notify_revertible_phase_start},\n    },\n};\nuse crate::logging::aztecnr_trace_log_format;\nuse crate::protocol::{\n    abis::{\n        block_header::BlockHeader,\n        call_context::CallContext,\n        function_selector::FunctionSelector,\n        gas_settings::GasSettings,\n        log_hash::LogHash,\n        note_hash::NoteHash,\n        nullifier::Nullifier,\n        private_call_request::PrivateCallRequest,\n        private_circuit_public_inputs::PrivateCircuitPublicInputs,\n        private_log::{PrivateLog, PrivateLogData},\n        public_call_request::PublicCallRequest,\n        validation_requests::{KeyValidationRequest, KeyValidationRequestAndSeparator},\n    },\n    address::{AztecAddress, EthAddress},\n    constants::{\n        CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, MAX_CONTRACT_CLASS_LOGS_PER_CALL, MAX_ENQUEUED_CALLS_PER_CALL,\n        MAX_KEY_VALIDATION_REQUESTS_PER_CALL, MAX_L2_TO_L1_MSGS_PER_CALL, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL,\n        MAX_NOTE_HASHES_PER_CALL, MAX_NULLIFIER_READ_REQUESTS_PER_CALL, MAX_NULLIFIERS_PER_CALL,\n        MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL, MAX_PRIVATE_LOGS_PER_CALL, MAX_TX_LIFETIME,\n        NULL_MSG_SENDER_CONTRACT_ADDRESS, PRIVATE_LOG_CIPHERTEXT_LEN,\n    },\n    hash::poseidon2_hash,\n    messaging::l2_to_l1_message::L2ToL1Message,\n    side_effect::{Counted, scoped::Scoped},\n    traits::{Empty, Hash, ToField},\n    utils::arrays::{ClaimedLengthArray, trimmed_array_length_hint},\n};\n\n/// # PrivateContext\n///\n/// The **main interface** between an #[external(\"private\")] function and the Aztec blockchain.\n///\n/// An instance of the PrivateContext is initialized automatically at the outset of every private function, within the\n/// #[external(\"private\")] macro, so you'll never need to consciously instantiate this yourself.\n///\n/// The instance is always named `context`, and it is always be available within the body of every\n/// #[external(\"private\")] function in your smart contract.\n///\n/// > For those used to \"vanilla\" Noir, it might be jarring to have access to > `context` without seeing a declaration\n/// `let context = PrivateContext::new(...)` > within the body of your function. This is just a consequence of using >\n/// macros to tidy-up verbose boilerplate. You can use `nargo expand` to > expand all macros, if you dare.\n///\n/// Typical usage for a smart contract developer will be to call getter methods of the PrivateContext.\n///\n/// _Pushing_ data and requests to the context is mostly handled within aztec-nr's own functions, so typically a smart\n/// contract developer won't need to call any setter methods directly.\n///\n/// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n/// find yourself doing this, please > open an issue on GitHub to describe your use case: it might be that > new\n/// functionality should be added to aztec-nr.\n///\n/// ## Responsibilities\n/// - Exposes contextual data to a private function:\n/// - Data relating to how this private function was called.\n/// - msg_sender\n/// - this_address - (the contract address of the private function being executed)\n/// - See `CallContext` for more data.\n/// - Data relating to the transaction in which this private function is being executed.\n/// - chain_id\n/// - version\n/// - gas_settings\n/// - Provides state access:\n/// - Access to the \"Anchor block\" header. Recall, a private function cannot read from the \"current\" block header, but\n/// must read from some historical block header, because as soon as private function execution begins (asynchronously,\n/// on a user's device), the public state of the chain (the \"current state\") will have progressed forward. We call this\n/// reference the \"Anchor block\". See `BlockHeader`.\n///   - Enables consumption of L1->L2 messages.\n/// - Enables calls to functions of other smart contracts:\n/// - Private function calls\n/// - Enqueueing of public function call requests (Since public functions are executed at a later time, by a block\n/// proposer, we say they are \"enqueued\").\n/// - Writes data to the blockchain:\n/// - New notes\n/// - New nullifiers\n/// - Private logs (for sending encrypted note contents or encrypted events)\n///   - New L2->L1 messages.\n/// - Provides args to the private function (handled by the #[external(\"private\")] macro).\n/// - Returns the return values of this private function (handled by the\n///   #[external(\"private\")] macro).\n/// - Makes Key Validation Requests.\n/// - Private functions are not allowed to see master secret keys, because we do not trust them. They are instead given\n/// \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then request validation of\n/// this claim, by making a \"key validation request\" to the protocol's kernel circuits (which _are_ allowed to see\n/// certain master secret keys).\n///\n/// ## Advanced Responsibilities\n///\n/// - Ultimately, the PrivateContext is responsible for constructing the PrivateCircuitPublicInputs of the private\n/// function being executed. All private functions on Aztec must have public inputs which adhere to the rigid layout of\n/// the PrivateCircuitPublicInputs, in order to be compatible with the protocol's kernel circuits. A well-known\n/// misnomer:\n/// - \"public inputs\" contain both inputs and outputs of this function.\n/// - By \"outputs\" we mean a lot more side-effects than just the \"return values\" of the function.\n/// - Most of the so-called \"public inputs\" are kept _private_, and never leak to the outside world, because they are\n/// 'swallowed' by the protocol's kernel circuits before the tx is sent to the network. Only the following are exposed\n/// to the outside world:\n/// - New note_hashes\n/// - New nullifiers\n/// - New private logs\n///     - New L2->L1 messages\n/// - New enqueued public function call requests All the above-listed arrays of side-effects can be padded by the\n/// user's wallet (through instructions to the kernel circuits, via the PXE) to obscure their true lengths.\n///\n/// ## Syntax Justification\n///\n/// Both user-defined functions _and_ most functions in aztec-nr need access to the PrivateContext instance to\n/// read/write data. This is why you'll see the arguably-ugly pervasiveness of the \"context\" throughout your smart\n/// contract and the aztec-nr library. For example, `&mut context` is prevalent. In some languages, you can access and\n/// mutate a global variable (such as a PrivateContext instance) from a function without polluting the function's\n/// parameters. With Noir, a function must explicitly pass control of a mutable variable to another function, by\n/// reference. Since many functions in aztec-nr need to be able to push new data to the PrivateContext, they need to be\n/// handed a mutable reference _to_ the context as a parameter. For example, `Context` is prevalent as a generic\n/// parameter, to give better type safety at compile time. Many `aztec-nr` functions don't make sense if they're called\n/// in a particular runtime (private, public or utility), and so are intentionally only implemented over certain\n/// [Private|Public|Utility]Context structs. This gives smart contract developers a much faster feedback loop if\n/// they're making a mistake, as an error will be thrown by the LSP or when they compile their contract.\n///\n#[derive(Eq)]\npub struct PrivateContext {\n    // docs:start:private-context\n    pub inputs: PrivateContextInputs,\n    pub side_effect_counter: u32,\n\n    pub min_revertible_side_effect_counter: u32,\n    pub is_fee_payer: bool,\n\n    pub args_hash: Field,\n    pub return_hash: Field,\n\n    pub expiration_timestamp: u64,\n\n    pub(crate) note_hash_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>,\n    pub(crate) nullifier_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n    key_validation_requests_and_separators: BoundedVec<KeyValidationRequestAndSeparator, MAX_KEY_VALIDATION_REQUESTS_PER_CALL>,\n\n    pub note_hashes: BoundedVec<Counted<NoteHash>, MAX_NOTE_HASHES_PER_CALL>,\n    pub nullifiers: BoundedVec<Counted<Nullifier>, MAX_NULLIFIERS_PER_CALL>,\n\n    pub private_call_requests: BoundedVec<PrivateCallRequest, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL>,\n    pub public_call_requests: BoundedVec<Counted<PublicCallRequest>, MAX_ENQUEUED_CALLS_PER_CALL>,\n    pub public_teardown_call_request: PublicCallRequest,\n    pub l2_to_l1_msgs: BoundedVec<Counted<L2ToL1Message>, MAX_L2_TO_L1_MSGS_PER_CALL>,\n    // docs:end:private-context\n\n    // Header of a block whose state is used during private execution (not the block the transaction is included in).\n    pub anchor_block_header: BlockHeader,\n\n    pub private_logs: BoundedVec<Counted<PrivateLogData>, MAX_PRIVATE_LOGS_PER_CALL>,\n    pub contract_class_logs_hashes: BoundedVec<Counted<LogHash>, MAX_CONTRACT_CLASS_LOGS_PER_CALL>,\n\n    // Contains the last key validation request for each key type. This is used to cache the last request and avoid\n    // fetching the same request multiple times. The index of the array corresponds to the key type (0 nullifier, 1\n    // incoming, 2 outgoing, 3 tagging).\n    pub last_key_validation_requests: [Option<KeyValidationRequest>; NUM_KEY_TYPES],\n\n    pub expected_non_revertible_side_effect_counter: u32,\n    pub expected_revertible_side_effect_counter: u32,\n}\n\nimpl PrivateContext {\n    pub fn new(inputs: PrivateContextInputs, args_hash: Field) -> PrivateContext {\n        PrivateContext {\n            inputs,\n            side_effect_counter: inputs.start_side_effect_counter + 1,\n            min_revertible_side_effect_counter: 0,\n            is_fee_payer: false,\n            args_hash,\n            return_hash: 0,\n            expiration_timestamp: inputs.anchor_block_header.timestamp() + MAX_TX_LIFETIME,\n            note_hash_read_requests: BoundedVec::new(),\n            nullifier_read_requests: BoundedVec::new(),\n            key_validation_requests_and_separators: BoundedVec::new(),\n            note_hashes: BoundedVec::new(),\n            nullifiers: BoundedVec::new(),\n            anchor_block_header: inputs.anchor_block_header,\n            private_call_requests: BoundedVec::new(),\n            public_call_requests: BoundedVec::new(),\n            public_teardown_call_request: PublicCallRequest::empty(),\n            l2_to_l1_msgs: BoundedVec::new(),\n            private_logs: BoundedVec::new(),\n            contract_class_logs_hashes: BoundedVec::new(),\n            last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n            expected_non_revertible_side_effect_counter: 0,\n            expected_revertible_side_effect_counter: 0,\n        }\n    }\n\n    /// Returns the contract address that initiated this function call.\n    ///\n    /// This is similar to `msg.sender` in Solidity (hence the name).\n    ///\n    /// Important Note: Since Aztec doesn't have a concept of an EoA (Externally-owned Account), the msg_sender is\n    /// \"none\" for the first function call of every transaction. The first function call of a tx is likely to be a call\n    /// to the user's account contract, so this quirk will most often be handled by account contract developers.\n    ///\n    /// # Returns\n    /// * `Option<AztecAddress>` - The address of the smart contract that called this function (be it an app contract\n    /// or a user's account contract). Returns `Option<AztecAddress>::none` for the first function call of the tx. No\n    /// other _private_ function calls in the tx will have a `none` msg_sender, but _public_ function calls might (see\n    /// the PublicContext).\n    pub fn maybe_msg_sender(self) -> Option<AztecAddress> {\n        let maybe_msg_sender = self.inputs.call_context.msg_sender;\n        if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n            Option::none()\n        } else {\n            Option::some(maybe_msg_sender)\n        }\n    }\n\n    /// Returns the contract address of the current function being executed.\n    ///\n    /// This is equivalent to `address(this)` in Solidity (hence the name). Use this to identify the current contract's\n    /// address, commonly needed for access control or when interacting with other contracts.\n    ///\n    /// # Returns\n    /// * `AztecAddress` - The contract address of the current function being executed.\n    ///\n    pub fn this_address(self) -> AztecAddress {\n        self.inputs.call_context.contract_address\n    }\n\n    /// Returns the chain ID of the current network.\n    ///\n    /// This is similar to `block.chainid` in Solidity. Returns the unique identifier for the blockchain network this\n    /// transaction is executing on.\n    ///\n    /// Helps prevent cross-chain replay attacks. Useful if implementing multi-chain contract logic.\n    ///\n    /// # Returns\n    /// * `Field` - The chain ID as a field element\n    ///\n    pub fn chain_id(self) -> Field {\n        self.inputs.tx_context.chain_id\n    }\n\n    /// Returns the Aztec protocol version that this transaction is executing under. Different versions may have\n    /// different rules, opcodes, or cryptographic primitives.\n    ///\n    /// This is similar to how Ethereum has different EVM versions.\n    ///\n    /// Useful for forward/backward compatibility checks\n    ///\n    /// Not to be confused with contract versions; this is the protocol version.\n    ///\n    /// # Returns\n    /// * `Field` - The protocol version as a field element\n    ///\n    pub fn version(self) -> Field {\n        self.inputs.tx_context.version\n    }\n\n    /// Returns the gas settings for the current transaction.\n    ///\n    /// This provides information about gas limits and pricing for the transaction, similar to `tx.gasprice` and gas\n    /// limits in Ethereum. However, Aztec has a more sophisticated gas model with separate accounting for L2\n    /// computation and data availability (DA) costs.\n    ///\n    /// # Returns\n    /// * `GasSettings` - Struct containing gas limits and fee information\n    ///\n    pub fn gas_settings(self) -> GasSettings {\n        self.inputs.tx_context.gas_settings\n    }\n\n    /// Returns the function selector of the currently executing function.\n    ///\n    /// Low-level function: Ordinarily, smart contract developers will not need to access this.\n    ///\n    /// This is similar to `msg.sig` in Solidity, which returns the first 4 bytes of the function signature. In Aztec,\n    /// the selector uniquely identifies which function within the contract is being called.\n    ///\n    /// # Returns\n    /// * `FunctionSelector` - The 4-byte function identifier\n    ///\n    /// # Advanced\n    /// Only #[external(\"private\")] functions have a function selector as a protocol- enshrined concept. The function\n    /// selectors of private functions are baked into the preimage of the contract address, and are used by the\n    /// protocol's kernel circuits to identify each private function and ensure the correct one is being executed.\n    ///\n    /// Used internally for function dispatch and call verification.\n    ///\n    pub fn selector(self) -> FunctionSelector {\n        self.inputs.call_context.function_selector\n    }\n\n    /// Returns the hash of the arguments passed to the current function.\n    ///\n    /// Very low-level function: You shouldn't need to call this. The #[external(\"private\")] macro calls this, and it\n    /// makes the arguments neatly available to the body of your private function.\n    ///\n    /// # Returns\n    /// * `Field` - Hash of the function arguments\n    ///\n    /// # Advanced\n    /// * Arguments are hashed to reduce proof size and verification time\n    /// * Enables efficient argument passing in recursive function calls\n    /// * The hash can be used to retrieve the original arguments from the PXE.\n    ///\n    pub fn get_args_hash(self) -> Field {\n        self.args_hash\n    }\n\n    /// Pushes a new note_hash to the Aztec blockchain's global Note Hash Tree (a state tree).\n    ///\n    /// A note_hash is a commitment to a piece of private state.\n    ///\n    /// Low-level function: Ordinarily, smart contract developers will not need to manually call this. Aztec-nr's state\n    /// variables (see `../state_vars/`) are designed to understand when to create and push new note hashes.\n    ///\n    /// # Arguments\n    /// * `note_hash` - The new note_hash.\n    ///\n    /// # Advanced\n    /// From here, the protocol's kernel circuits will take over and insert the note_hash into the protocol's \"note\n    /// hash tree\" (in the Base Rollup circuit). Before insertion, the protocol will:\n    /// - \"Silo\" the `note_hash` with the contract address of this function, to yield a `siloed_note_hash`. This\n    /// prevents state collisions between different smart contracts.\n    /// - Ensure uniqueness of the `siloed_note_hash`, to prevent Faerie-Gold attacks, by hashing the\n    /// `siloed_note_hash` with a unique value, to yield a `unique_siloed_note_hash` (see the protocol spec for more).\n    ///\n    /// In addition to calling this function, aztec-nr provides the contents of the newly-created note to the PXE, via\n    /// the `notify_created_note` oracle.\n    ///\n    /// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n    /// find yourself doing this, > please open an issue on GitHub to describe your use case: it might be > that new\n    /// functionality should be added to aztec-nr.\n    ///\n    pub fn push_note_hash(&mut self, note_hash: Field) {\n        self.note_hashes.push(Counted::new(note_hash, self.next_counter()));\n    }\n\n    /// Creates a new [nullifier](crate::nullifier).\n    ///\n    /// ## Safety\n    ///\n    /// This is a low-level function that must be used with great care to avoid subtle corruption of contract state.\n    /// Instead of calling this function, consider using the higher-level [`crate::state_vars::SingleUseClaim`].\n    ///\n    /// In particular, callers must ensure all nullifiers created by a contract are properly domain-separated, so that\n    /// unrelated components don't interfere with one another (e.g. a transaction nullifier accidentally marking a\n    /// variable as initialized). Only [`PrivateContext::push_nullifier_for_note_hash`] should be used for note\n    /// nullifiers, never this one.\n    ///\n    /// ## Advanced\n    ///\n    /// The raw `nullifier` is not what is inserted into the Aztec state tree: it will be first siloed by contract\n    /// address via [`crate::protocol::hash::compute_siloed_nullifier`] in order to prevent accidental or malicious\n    /// interference of nullifiers from different contracts.\n    pub fn push_nullifier(&mut self, nullifier: Field) {\n        notify_created_nullifier(nullifier);\n        self.nullifiers.push(Nullifier { value: nullifier, note_hash: 0 }.count(self.next_counter()));\n    }\n\n    /// Creates a new [nullifier](crate::nullifier) associated with a note.\n    ///\n    /// This is a variant of [`PrivateContext::push_nullifier`] that is used for note nullifiers, i.e. nullifiers that\n    /// correspond to a note. If a note and its nullifier are created in the same transaction, then the private kernels\n    /// will 'squash' these values, deleting them both as if they never existed and reducing transaction fees.\n    ///\n    /// The `nullification_note_hash` must be the result of calling\n    /// [`crate::note::utils::compute_confirmed_note_hash_for_nullification`] for pending notes, and `0` for settled\n    /// notes (which cannot be squashed).\n    ///\n    /// ## Safety\n    ///\n    /// This is a low-level function that must be used with great care to avoid subtle corruption of contract state.\n    /// Instead of calling this function, consider using the higher-level [`crate::note::lifecycle::destroy_note`].\n    ///\n    /// The precautions listed for [`PrivateContext::push_nullifier`] apply here as well, and callers should\n    /// additionally ensure `nullification_note_hash` corresponds to a note emitted by this contract, with its hash\n    /// computed in the same transaction execution phase as the call to this function. Finally, only this function\n    /// should be used for note nullifiers, never [`PrivateContext::push_nullifier`].\n    ///\n    /// Failure to do these things can result in unprovable contexts, accidental deletion of notes, or double-spend\n    /// attacks.\n    pub fn push_nullifier_for_note_hash(&mut self, nullifier: Field, nullification_note_hash: Field) {\n        let nullifier_counter = self.next_counter();\n        notify_nullified_note(nullifier, nullification_note_hash, nullifier_counter);\n        self.nullifiers.push(Nullifier { value: nullifier, note_hash: nullification_note_hash }.count(\n            nullifier_counter,\n        ));\n    }\n\n    /// Returns the anchor block header - the historical block header that this private function is reading from.\n    ///\n    /// A private function CANNOT read from the \"current\" block header, but must read from some older block header,\n    /// because as soon as private function execution begins (asynchronously, on a user's device), the public state of\n    /// the chain (the \"current state\") will have progressed forward.\n    ///\n    /// # Returns\n    /// * `BlockHeader` - The anchor block header.\n    ///\n    /// # Advanced\n    /// * All private functions of a tx read from the same anchor block header.\n    /// * The protocol asserts that the `expiration_timestamp` of every tx is at most 24 hours beyond the timestamp of\n    /// the tx's chosen anchor block header. This enables the network's nodes to safely prune old txs from the mempool.\n    /// Therefore, the chosen block header _must_ be one from within the last 24 hours.\n    ///\n    pub fn get_anchor_block_header(self) -> BlockHeader {\n        self.anchor_block_header\n    }\n\n    /// Returns the header of any historical block at or before the anchor block.\n    ///\n    /// This enables private contracts to access information from even older blocks than the anchor block header.\n    ///\n    /// Useful for time-based contract logic that needs to compare against multiple historical points.\n    ///\n    /// # Arguments\n    /// * `block_number` - The block number to retrieve (must be <= anchor block number)\n    ///\n    /// # Returns\n    /// * `BlockHeader` - The header of the requested historical block\n    ///\n    /// # Advanced\n    /// This function uses an oracle to fetch block header data from the user's PXE. Depending on how much blockchain\n    /// data the user's PXE has been set up to store, this might require a query from the PXE to another Aztec node to\n    /// get the data. > This is generally true of all oracle getters (see `../oracle`).\n    ///\n    /// Each block header gets hashed and stored as a leaf in the protocol's Archive Tree. In fact, the i-th block\n    /// header gets stored at the i-th leaf index of the Archive Tree. Behind the scenes, this `get_block_header_at`\n    /// function will add Archive Tree merkle-membership constraints (~3k) to your smart contract function's circuit,\n    /// to prove existence of the block header in the Archive Tree.\n    ///\n    /// Note: we don't do any caching, so avoid making duplicate calls for the same block header, because each call\n    /// will add duplicate constraints.\n    ///\n    /// Calling this function is more expensive (constraint-wise) than getting the anchor block header (via\n    /// `get_block_header`). This is because the anchor block's merkle membership proof is handled by Aztec's protocol\n    /// circuits, and is only performed once for the entire tx because all private functions of a tx share a common\n    /// anchor block header. Therefore, the cost (constraint-wise) of calling `get_block_header` is effectively free.\n    ///\n    pub fn get_block_header_at(self, block_number: u32) -> BlockHeader {\n        get_block_header_at(block_number, self)\n    }\n\n    /// Sets the hash of the return values for this private function.\n    ///\n    /// Very low-level function: this is called by the #[external(\"private\")] macro.\n    ///\n    /// # Arguments\n    /// * `serialized_return_values` - The serialized return values as a field array\n    ///\n    pub fn set_return_hash<let N: u32>(&mut self, serialized_return_values: [Field; N]) {\n        let return_hash = hash_args(serialized_return_values);\n        self.return_hash = return_hash;\n        execution_cache::store(serialized_return_values, return_hash);\n    }\n\n    /// Builds the PrivateCircuitPublicInputs for this private function, to ensure compatibility with the protocol's\n    /// kernel circuits.\n    ///\n    /// Very low-level function: This function is automatically called by the #[external(\"private\")] macro.\n    pub fn finish(self) -> PrivateCircuitPublicInputs {\n        PrivateCircuitPublicInputs {\n            call_context: self.inputs.call_context,\n            args_hash: self.args_hash,\n            returns_hash: self.return_hash,\n            min_revertible_side_effect_counter: self.min_revertible_side_effect_counter,\n            is_fee_payer: self.is_fee_payer,\n            expiration_timestamp: self.expiration_timestamp,\n            note_hash_read_requests: ClaimedLengthArray::from_bounded_vec(self.note_hash_read_requests),\n            nullifier_read_requests: ClaimedLengthArray::from_bounded_vec(self.nullifier_read_requests),\n            key_validation_requests_and_separators: ClaimedLengthArray::from_bounded_vec(\n                self.key_validation_requests_and_separators,\n            ),\n            note_hashes: ClaimedLengthArray::from_bounded_vec(self.note_hashes),\n            nullifiers: ClaimedLengthArray::from_bounded_vec(self.nullifiers),\n            private_call_requests: ClaimedLengthArray::from_bounded_vec(self.private_call_requests),\n            public_call_requests: ClaimedLengthArray::from_bounded_vec(self.public_call_requests),\n            public_teardown_call_request: self.public_teardown_call_request,\n            l2_to_l1_msgs: ClaimedLengthArray::from_bounded_vec(self.l2_to_l1_msgs),\n            start_side_effect_counter: self.inputs.start_side_effect_counter,\n            end_side_effect_counter: self.side_effect_counter,\n            private_logs: ClaimedLengthArray::from_bounded_vec(self.private_logs),\n            contract_class_logs_hashes: ClaimedLengthArray::from_bounded_vec(self.contract_class_logs_hashes),\n            anchor_block_header: self.anchor_block_header,\n            tx_context: self.inputs.tx_context,\n            expected_non_revertible_side_effect_counter: self.expected_non_revertible_side_effect_counter,\n            expected_revertible_side_effect_counter: self.expected_revertible_side_effect_counter,\n        }\n    }\n\n    /// Designates this contract as the fee payer for the transaction.\n    ///\n    /// Unlike Ethereum, where the transaction sender always pays fees, Aztec allows any contract to voluntarily pay\n    /// transaction fees. This enables patterns like sponsored transactions or fee abstraction where users don't need\n    /// to hold fee-juice themselves. (Fee juice is a fee-paying asset for Aztec).\n    ///\n    /// Only one contract per transaction can declare itself as the fee payer, and it must have sufficient fee-juice\n    /// balance (>= the gas limits specified in the TxContext) by the time we reach the public setup phase of the tx.\n    ///\n    pub fn set_as_fee_payer(&mut self) {\n        aztecnr_trace_log_format!(\"Setting {0} as fee payer\")([self.this_address().to_field()]);\n        self.is_fee_payer = true;\n    }\n\n    pub fn in_revertible_phase(&mut self) -> bool {\n        let current_counter = self.side_effect_counter;\n\n        // Safety: Kernel will validate that the claim is correct by validating the expected counters.\n        let is_revertible = unsafe { is_execution_in_revertible_phase(current_counter) };\n\n        if is_revertible {\n            if (self.expected_revertible_side_effect_counter == 0)\n                | (current_counter < self.expected_revertible_side_effect_counter) {\n                self.expected_revertible_side_effect_counter = current_counter;\n            }\n        } else if current_counter > self.expected_non_revertible_side_effect_counter {\n            self.expected_non_revertible_side_effect_counter = current_counter;\n        }\n\n        is_revertible\n    }\n\n    /// Declares the end of the \"setup phase\" of this tx.\n    ///\n    /// Only one function per tx can declare the end of the setup phase.\n    ///\n    /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n    /// to make use of this function.\n    ///\n    /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n    /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n    /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n    /// phase enables such a payment to be made, because the setup phase _cannot revert_: a reverting function within\n    /// the setup phase would result in an invalid block which cannot be proven. Any side-effects generated during that\n    /// phase are guaranteed to be inserted into Aztec's state trees (except for squashed notes & nullifiers, of\n    /// course).\n    ///\n    /// Even though the end of the setup phase is declared within a private function, you might have noticed that\n    /// _public_ functions can also execute within the setup phase. This is because any public function calls which\n    /// were enqueued _within the setup phase_ by a private function are considered part of the setup phase.\n    ///\n    /// # Advanced\n    /// * Sets the minimum revertible side effect counter of this tx to be the PrivateContext's _current_ side effect\n    /// counter.\n    ///\n    pub fn end_setup(&mut self) {\n        // Incrementing the side effect counter when ending setup ensures non ambiguity for the counter where we change\n        // phases.\n        self.side_effect_counter += 1;\n        aztecnr_trace_log_format!(\"Ending setup at counter {0}\")([self.side_effect_counter as Field]);\n        self.min_revertible_side_effect_counter = self.next_counter();\n        notify_revertible_phase_start(self.min_revertible_side_effect_counter);\n    }\n\n    /// Sets a deadline (an \"include-by timestamp\") for when this transaction must be included in a block.\n    ///\n    /// Other functions in this tx might call this setter with differing values for the include-by timestamp. To ensure\n    /// that all functions' deadlines are met, the _minimum_ of all these include-by timestamps will be exposed when\n    /// this tx is submitted to the network.\n    ///\n    /// If the transaction is not included in a block by its include-by timestamp, it becomes invalid and it will never\n    /// be included.\n    ///\n    /// This expiry timestamp is publicly visible. See the \"Advanced\" section for privacy concerns.\n    ///\n    /// # Arguments\n    /// * `expiration_timestamp` - Unix timestamp (seconds) deadline for inclusion. The include-by timestamp of this tx\n    /// will be _at most_ the timestamp specified.\n    ///\n    /// # Advanced\n    /// * If multiple functions set differing `expiration_timestamp`s, the kernel circuits will set it to be the\n    /// _minimum_ of the two. This ensures the tx expiry requirements of all functions in the tx are met.\n    /// * Rollup circuits will reject expired txs.\n    /// * The protocol enforces that all transactions must be included within 24 hours of their chosen anchor block's\n    /// timestamp, to enable safe mempool pruning.\n    /// * The DelayedPublicMutable design makes heavy use of this functionality, to enable private functions to read\n    /// public state.\n    /// * A sophisticated Wallet should cleverly set an include-by timestamp to improve the privacy of the user and the\n    /// network as a whole. For example, if a contract interaction sets include-by to some publicly-known value (e.g.\n    /// the time when a contract upgrades), then the wallet might wish to set an even lower one to avoid revealing that\n    /// this tx is interacting with said contract. Ideally, all wallets should standardize on an approach in order to\n    ///   provide users with a large privacy set -- although the exact approach\n    /// will need to be discussed. Wallets that deviate from a standard might accidentally reveal which wallet each\n    /// transaction originates from.\n    ///\n    // docs:start:expiration-timestamp\n    pub fn set_expiration_timestamp(&mut self, expiration_timestamp: u64) {\n        // docs:end:expiration-timestamp\n        self.expiration_timestamp = std::cmp::min(self.expiration_timestamp, expiration_timestamp);\n    }\n\n    /// Asserts that a note has been created.\n    ///\n    /// This function will cause the transaction to fail unless the requested note exists. This is the preferred\n    /// mechanism for performing this check, and the only one that works for pending notes.\n    ///\n    /// ## Pending Notes\n    ///\n    /// Both settled notes (created in prior transactions) and pending notes (created in the current transaction) will\n    /// be considered by this function. Pending notes must have been created **before** this call is made for the check\n    /// to pass.\n    ///\n    /// ## Historical Notes\n    ///\n    /// If you need to assert that a note existed _by some specific block in the past_, instead of simply proving that\n    /// it exists by the current anchor block, use [`crate::history::note::assert_note_existed_by`] instead.\n    ///\n    /// ## Cost\n    ///\n    /// This uses up one of the call's kernel note hash read requests, which are limited. Like all kernel requests,\n    /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n    /// an additional invocation of the kernel reset circuit.\n    pub fn assert_note_exists(&mut self, note_existence_request: NoteExistenceRequest) {\n        // Note that the `note_hash_read_requests` array does not hold `NoteExistenceRequest` objects, but rather a\n        // custom kernel type. We convert from the aztec-nr type into it.\n\n        let note_hash = note_existence_request.note_hash();\n        let contract_address = note_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n        let side_effect = Scoped::new(\n            Counted::new(note_hash, self.next_counter()),\n            contract_address,\n        );\n\n        self.note_hash_read_requests.push(side_effect);\n    }\n\n    /// Asserts that a nullifier has been emitted.\n    ///\n    /// This function will cause the transaction to fail unless the requested nullifier exists. This is the preferred\n    /// mechanism for performing this check, and the only one that works for pending nullifiers.\n    ///\n    /// ## Pending Nullifiers\n    ///\n    /// Both settled nullifiers (emitted in prior transactions) and pending nullifiers (emitted in the current\n    /// transaction) will be considered by this function. Pending nullifiers must have been emitted **before** this\n    /// call is made for the check to pass.\n    ///\n    /// ## Historical Nullifiers\n    ///\n    /// If you need to assert that a nullifier existed _by some specific block in the past_, instead of simply proving\n    /// that it exists by the current anchor block, use [`crate::history::nullifier::assert_nullifier_existed_by`]\n    /// instead.\n    ///\n    /// ## Public vs Private\n    ///\n    /// In general, it is unsafe to check for nullifier non-existence in private, as that will not consider the\n    /// possibility of the nullifier having been emitted in any transaction between the anchor block and the inclusion\n    /// block. Private functions instead prove existence via this function and 'prove' non-existence by _emitting_ the\n    /// nullifer, which would cause the transaction to fail if the nullifier existed.\n    ///\n    /// This is not the case in public functions, which do have access to the tip of the blockchain and so can reliably\n    /// prove whether a nullifier exists or not via\n    /// [`crate::context::public_context::PublicContext::nullifier_exists_unsafe`].\n    ///\n    /// ## Cost\n    ///\n    /// This uses up one of the call's kernel nullifier read requests, which are limited. Like all kernel requests,\n    /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n    /// an additional invocation of the kernel reset circuit.\n    pub fn assert_nullifier_exists(&mut self, nullifier_existence_request: NullifierExistenceRequest) {\n        let nullifier = nullifier_existence_request.nullifier();\n        let contract_address = nullifier_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n        let request = Scoped::new(\n            Counted::new(nullifier, self.next_counter()),\n            contract_address,\n        );\n\n        self.nullifier_read_requests.push(request);\n    }\n\n    /// Requests the app-siloed nullifier hiding key (nhk_app) for the given (hashed) master nullifier public key\n    /// (npk_m), from the user's PXE.\n    ///\n    /// Advanced function: Only needed if you're designing your own notes and/or nullifiers.\n    ///\n    /// Contracts are not allowed to compute nullifiers for other contracts, as that would let them read parts of their\n    /// private state. Because of this, a contract is only given an \"app-siloed key\", which is constructed by\n    /// hashing the user's master nullifier hiding key with the contract's address. However, because contracts cannot\n    /// be trusted with a user's master nullifier hiding key (because we don't know which contracts are honest or\n    /// malicious), the PXE refuses to provide any master secret keys to any app smart contract function. This means\n    /// app functions are unable to prove that the derivation of an app-siloed nullifier hiding key has been computed\n    /// correctly. Instead, an app function can request to the kernel (via `request_nhk_app`) that it validates the\n    /// siloed derivation, since the kernel has been vetted to not leak any master secret keys.\n    ///\n    /// A common nullification scheme is to inject a nullifier hiding key into the preimage of a nullifier, to make the\n    /// nullifier deterministic but random-looking. This function enables that flow.\n    ///\n    /// # Arguments\n    /// * `npk_m_hash` - A hash of the master nullifier public key of the user whose PXE is executing this function.\n    ///\n    /// # Returns\n    /// * The app-siloed nullifier hiding key that corresponds to the given `npk_m_hash`.\n    ///\n    pub fn request_nhk_app(&mut self, npk_m_hash: Field) -> Field {\n        self.request_sk_app(npk_m_hash, NULLIFIER_INDEX)\n    }\n\n    /// Requests the app-siloed outgoing viewing secret key (ovsk_app) for the given (hashed) master outgoing\n    /// viewing public key (ovpk_m), from the user's PXE.\n    ///\n    /// See `request_nhk_app` and `request_sk_app` for more info.\n    ///\n    /// The intention of the \"outgoing\" keypair is to provide a second secret key for all of a user's outgoing activity\n    /// (i.e. for notes that a user creates, as opposed to notes that a user receives from others). The separation of\n    /// incoming and outgoing data was a distinction made by zcash, with the intention of enabling a user to optionally\n    /// share with a 3rd party a controlled view of only incoming or outgoing notes. Similar functionality of sharing\n    /// select data can be achieved with offchain zero-knowledge proofs. It is up to an app developer whether they\n    /// choose to make use of a user's outgoing keypair within their application logic, or instead simply use the same\n    /// keypair (the address keypair (which is effectively the same as the \"incoming\" keypair)) for all incoming &\n    /// outgoing messages to a user.\n    ///\n    /// Currently, all of the exposed encryption functions in aztec-nr ignore the outgoing viewing keys, and instead\n    /// encrypt all note logs and event logs to a user's address public key.\n    ///\n    /// # Arguments\n    /// * `ovpk_m_hash` - Hash of the outgoing viewing public key master\n    ///\n    /// # Returns\n    /// * The application-specific outgoing viewing secret key\n    ///\n    pub fn request_ovsk_app(&mut self, ovpk_m_hash: Field) -> Field {\n        self.request_sk_app(ovpk_m_hash, OUTGOING_INDEX)\n    }\n\n    /// Pushes a Key Validation Request to the kernel.\n    ///\n    /// Private functions are not allowed to see a user's master secret keys, because we do not trust them. They are\n    /// instead given \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then\n    /// request validation of this claim, by making a \"key validation request\" to the protocol's kernel circuits (which\n    /// _are_ allowed to see certain master secret keys).\n    ///\n    /// When a Key Validation Request tuple of (sk_app, Pk_m, app_address) is submitted to the kernel, it will perform\n    /// the following derivations to validate the relationship between the claimed sk_app and the user's Pk_m:\n    ///\n    ///       (sk_m) ----> * G ----> Pk_m\n    ///         |                     |\n    ///         v                       We use the kernel to prove this\n    ///  h(sk_m, app_address)         | sk_app-Pk_m relationship, because app\n    ///         |                       circuits must not be trusted to see sk_m.\n    ///         v                     |\n    /// sk_app - -  - - - - - - -\n    ///\n    /// The function is named \"request_\" instead of \"get_\" to remind the user that a Key Validation Request will be\n    /// emitted to the kernel.\n    ///\n    fn request_sk_app(&mut self, pk_m_hash: Field, key_index: Field) -> Field {\n        let cached_request =\n            self.last_key_validation_requests[key_index as u32].unwrap_or(KeyValidationRequest::empty());\n\n        if cached_request.pk_m.hash() == pk_m_hash {\n            // We get a match so the cached request is the latest one\n            cached_request.sk_app\n        } else {\n            // We didn't get a match meaning the cached result is stale Typically we'd validate keys by showing that\n            // they are the preimage of `pk_m_hash`, but that'd require the oracle returning the master secret keys,\n            // which could cause malicious contracts to leak it or learn about secrets from other contracts. We\n            // therefore silo secret keys, and rely on the private kernel to validate that we siloed secret key\n            // corresponds to correct siloing of the master secret key that hashes to `pk_m_hash`.\n\n            // Safety: Kernels verify that the key validation request is valid and below we verify that a request for\n            // the correct public key has been received.\n            let request = unsafe { get_key_validation_request(pk_m_hash, key_index) };\n            assert(!request.pk_m.is_infinite, \"Infinite public key points are not allowed\");\n            assert_eq(request.pk_m.hash(), pk_m_hash, \"Obtained invalid key validation request\");\n\n            self.key_validation_requests_and_separators.push(\n                KeyValidationRequestAndSeparator {\n                    request,\n                    key_type_domain_separator: public_key_domain_separators[key_index as u32],\n                },\n            );\n            self.last_key_validation_requests[key_index as u32] = Option::some(request);\n            request.sk_app\n        }\n    }\n\n    /// Sends an \"L2 -> L1 message\" from this function (Aztec, L2) to a smart contract on Ethereum (L1). L1 contracts\n    /// which are designed to send/receive messages to/from Aztec are called \"Portal Contracts\".\n    ///\n    /// Common use cases include withdrawals, cross-chain asset transfers, and triggering L1 actions based on L2 state\n    /// changes.\n    ///\n    /// The message will be inserted into an Aztec \"Outbox\" contract on L1, when this transaction's block is proposed\n    /// to L1. Sending the message will not result in any immediate state changes in the target portal contract. The\n    /// message will need to be manually consumed from the Outbox through a separate Ethereum transaction: a user will\n    /// need to call a function of the portal contract -- a function specifically designed to make a call to the Outbox\n    /// to consume the message. The message will only be available for consumption once the _epoch_ proof has been\n    /// submitted. Given that there are multiple Aztec blocks within an epoch, it might take some time for this epoch\n    /// proof to be submitted -- especially if the block was near the start of an epoch.\n    ///\n    /// # Arguments\n    /// * `recipient` - Ethereum address that will receive the message\n    /// * `content` - Message content (32 bytes as a Field element). This content has a very\n    /// specific layout. docs:start:context_message_portal\n    pub fn message_portal(&mut self, recipient: EthAddress, content: Field) {\n        let message = L2ToL1Message { recipient, content };\n        self.l2_to_l1_msgs.push(message.count(self.next_counter()));\n    }\n\n    /// Consumes a message sent from Ethereum (L1) to Aztec (L2).\n    ///\n    /// Common use cases include token bridging, cross-chain governance, and triggering L2 actions based on L1 events.\n    ///\n    /// Use this function if you only want the message to ever be \"referred to\" once. Once consumed using this method,\n    /// the message cannot be consumed again, because a nullifier is emitted. If your use case wants for the message to\n    /// be read unlimited times, then you can always read any historic message from the L1-to-L2 messages tree;\n    /// messages never technically get deleted from that tree.\n    ///\n    /// The message will first be inserted into an Aztec \"Inbox\" smart contract on L1. Sending the message will not\n    /// result in any immediate state changes in the target L2 contract. The message will need to be manually consumed\n    /// by the target contract through a separate Aztec transaction. The message will not be available for consumption\n    /// immediately. Messages get copied over from the L1 Inbox to L2 by the next Proposer in batches. So you will need\n    /// to wait until the messages are copied before you can consume them.\n    ///\n    /// # Arguments\n    /// * `content` - The message content that was sent from L1\n    /// * `secret` - Secret value used for message privacy (if needed)\n    /// * `sender` - Ethereum address that sent the message\n    /// * `leaf_index` - Index of the message in the L1-to-L2 message tree\n    ///\n    /// # Advanced\n    /// Validates message existence in the L1-to-L2 message tree and nullifies the message to prevent\n    /// double-consumption.\n    pub fn consume_l1_to_l2_message(&mut self, content: Field, secret: Field, sender: EthAddress, leaf_index: Field) {\n        let nullifier = process_l1_to_l2_message(\n            self.anchor_block_header.state.l1_to_l2_message_tree.root,\n            self.this_address(),\n            sender,\n            self.chain_id(),\n            self.version(),\n            content,\n            secret,\n            leaf_index,\n        );\n\n        // Push nullifier (and the \"commitment\" corresponding to this can be \"empty\")\n        self.push_nullifier(nullifier)\n    }\n\n    /// Emits a private log (an array of Fields) that will be published to an Ethereum blob.\n    ///\n    /// Private logs are intended for the broadcasting of ciphertexts: that is, encrypted events or encrypted note\n    /// contents. Since the data in the logs is meant to be _encrypted_, private_logs are broadcast to publicly-visible\n    /// Ethereum blobs. The intended recipients of such encrypted messages can then discover and decrypt these\n    /// encrypted logs using their viewing secret key. (See `../messages/discovery` for more details).\n    ///\n    /// Important note: This function DOES NOT _do_ any encryption of the input `log` fields. This function blindly\n    /// publishes whatever input `log` data is fed into it, so the caller of this function should have already\n    /// performed the encryption, and the `log` should be the result of that encryption.\n    ///\n    /// The protocol does not dictate what encryption scheme should be used: a smart contract developer can choose\n    /// whatever encryption scheme they like. Aztec-nr includes some off-the-shelf encryption libraries that developers\n    /// might wish to use, for convenience. These libraries not only encrypt a plaintext (to produce a ciphertext);\n    /// they also prepend the ciphertext with a `tag` and `ephemeral public key` for easier message discovery. This is\n    /// a very dense topic, and we will be writing more libraries and docs soon.\n    ///\n    /// > Currently, AES128 CBC encryption is the main scheme included in > aztec.nr. > We are currently making\n    /// significant changes to the interfaces of the > encryption library.\n    ///\n    /// In some niche use cases, an app might be tempted to publish _un-encrypted_ data via a private log, because\n    /// _public logs_ are not available to private functions. Be warned that emitting public data via private logs is\n    /// strongly discouraged, and is considered a \"privacy anti-pattern\", because it reveals identifiable information\n    /// about _which_ function has been executed. A tx which leaks such information does not contribute to the privacy\n    /// set of the network.\n    ///\n    /// * Unlike `emit_raw_note_log_unsafe`, this log is not tied to any specific note\n    ///\n    /// # Arguments\n    /// * `tag` - A tag placed at `fields[0]` of the emitted log. Used by recipients and nodes to identify and\n    /// filter for relevant logs without scanning all of them.\n    /// * `log` - The log data that will be publicly broadcast (so make sure it's already been encrypted before you\n    /// call this function). Private logs are bounded in size (`PRIVATE_LOG_CIPHERTEXT_LEN`), to encourage all logs\n    /// from all smart contracts look identical.\n    /// * `length` - The actual length of `log` (measured in number of Fields). Although the input log has a max\n    /// size of `PRIVATE_LOG_CIPHERTEXT_LEN`, the latter values of the array might all be 0's for small logs. This\n    /// `length` should reflect the trimmed length of the array. The protocol's kernel circuits can then append\n    /// random fields as \"padding\" after the `length`, so that the logs of this smart contract look\n    /// indistinguishable from (the same length as) the logs of all other applications. It's up to wallets how much\n    /// padding to apply, so ideally all wallets should agree on standards for this.\n    ///\n    /// ## Safety\n    ///\n    /// The `tag` should be domain-separated (e.g. via [`crate::protocol::hash::compute_log_tag`]) to prevent\n    /// collisions between logs from different sources. Without domain separation, two unrelated log types that\n    /// happen to share a raw tag value become indistinguishable. Prefer the higher-level APIs\n    /// ([`crate::messages::message_delivery::MessageDelivery`] for messages, `self.emit(event)` for events) which\n    /// handle tagging automatically.\n    pub fn emit_private_log_unsafe(&mut self, tag: Field, log: [Field; PRIVATE_LOG_CIPHERTEXT_LEN], length: u32) {\n        let counter = self.next_counter();\n        let full_log = [tag].concat(log);\n        self.private_logs.push(PrivateLogData { log: PrivateLog::new(full_log, length + 1), note_hash_counter: 0 }\n            .count(counter));\n    }\n\n    // TODO: rename.\n    /// Emits a private log that is explicitly tied to a newly-emitted note_hash, to convey to the kernel: \"this log\n    /// relates to this note\".\n    ///\n    /// This linkage is important in case the note gets squashed (due to being read later in this same tx), since we\n    /// can then squash the log as well.\n    ///\n    /// See `emit_private_log_unsafe` for more info about private log emission.\n    ///\n    /// # Arguments\n    /// * `tag` - A tag placed at `fields[0]`. See `emit_private_log_unsafe`.\n    /// * `log` - The log data as an array of Field elements\n    /// * `length` - The actual length of the `log` (measured in number of Fields).\n    /// * `note_hash_counter` - The side-effect counter that was assigned to the new note_hash when it was pushed to\n    /// this `PrivateContext`.\n    ///\n    /// Important: If your application logic requires the log to always be emitted regardless of note squashing,\n    /// consider using `emit_private_log_unsafe` instead, or emitting additional events.\n    ///\n    /// ## Safety\n    ///\n    /// Same as [`PrivateContext::emit_private_log_unsafe`]: the `tag` should be domain-separated.\n    pub fn emit_raw_note_log_unsafe(\n        &mut self,\n        tag: Field,\n        log: [Field; PRIVATE_LOG_CIPHERTEXT_LEN],\n        length: u32,\n        note_hash_counter: u32,\n    ) {\n        let counter = self.next_counter();\n        let full_log = [tag].concat(log);\n        let private_log = PrivateLogData { log: PrivateLog::new(full_log, length + 1), note_hash_counter };\n        self.private_logs.push(private_log.count(counter));\n    }\n\n    pub fn emit_contract_class_log<let N: u32>(&mut self, log: [Field; N]) {\n        let contract_address = self.this_address();\n        let counter = self.next_counter();\n\n        let log_to_emit: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS] =\n            log.concat([0; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS - N]);\n        // Note: the length is not always N, it is the number of fields we want to broadcast, omitting trailing zeros\n        // to save blob space.\n        // Safety: The below length is constrained in the base rollup, which will make sure that all the fields beyond\n        // length are zero. However, it won't be able to check that we didn't add extra padding (trailing zeroes) or\n        // that we cut trailing zeroes from the end.\n        let length = unsafe { trimmed_array_length_hint(log_to_emit) };\n        // We hash the entire padded log to ensure a user cannot pass a shorter length and so emit incorrect shorter\n        // bytecode.\n        let log_hash = poseidon2_hash(log_to_emit);\n        // Safety: the below only exists to broadcast the raw log, so we can provide it to the base rollup later to be\n        // constrained.\n        unsafe {\n            notify_created_contract_class_log(contract_address, log_to_emit, length, counter);\n        }\n\n        self.contract_class_logs_hashes.push(LogHash { value: log_hash, length: length }.count(counter));\n    }\n\n    /// Calls a private function on another contract (or the same contract).\n    ///\n    /// Very low-level function.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the called function\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    /// This enables contracts to interact with each other while maintaining privacy. This \"composability\" of private\n    /// contract functions is a key feature of the Aztec network.\n    ///\n    /// If a user's transaction includes multiple private function calls, then by the design of Aztec, the following\n    /// information will remain private[1]:\n    /// - The function selectors and contract addresses of all private function calls will remain private, so an\n    /// observer of the public mempool will not be able to look at a tx and deduce which private functions have been\n    /// executed.\n    /// - The arguments and return values of all private function calls will remain private.\n    /// - The person who initiated the tx will remain private.\n    /// - The notes and nullifiers and private logs that are emitted by all private function calls will (if designed\n    /// well) not leak any user secrets, nor leak which functions have been executed.\n    ///\n    /// [1] Caveats: Some of these privacy guarantees depend on how app developers design their smart contracts. Some\n    /// actions _can_ leak information, such as:\n    /// - Calling an internal public function.\n    /// - Calling a public function and not setting msg_sender to Option::none (feature not built yet - see github).\n    /// - Calling any public function will always leak details about the nature of the transaction, so devs should be\n    /// careful in their contract designs. If it can be done in a private function, then that will give the best\n    /// privacy.\n    /// - Not padding the side-effects of a tx to some standardized, uniform size. The kernel circuits can take hints\n    /// to pad side-effects, so a wallet should be able to request for a particular amount of padding. Wallets should\n    /// ideally agree on some standard.\n    /// - Padding should include:\n    /// - Padding the lengths of note & nullifier arrays\n    /// - Padding private logs with random fields, up to some standardized size. See also:\n    /// https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n    ///\n    /// # Advanced\n    /// * The call is added to the private call stack and executed by kernel circuits after this function completes\n    /// * The called function can modify its own contract's private state\n    /// * Side effects from the called function are included in this transaction\n    /// * The call inherits the current transaction's context and gas limits\n    ///\n    pub fn call_private_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n    ) -> ReturnsHash {\n        let args_hash = hash_args(args);\n        execution_cache::store(args, args_hash);\n        self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, false)\n    }\n\n    /// Makes a read-only call to a private function on another contract.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function cannot modify state, emit L2->L2 messages, nor\n    /// emit events. Any nested calls are constrained to also be staticcalls.\n    ///\n    /// See `call_private_function` for more general info on private function calls.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract to call\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the called function\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn static_call_private_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n    ) -> ReturnsHash {\n        let args_hash = hash_args(args);\n        execution_cache::store(args, args_hash);\n        self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, true)\n    }\n\n    /// Calls a private function that takes no arguments.\n    ///\n    /// This is a convenience function for calling private functions that don't require any input parameters. It's\n    /// equivalent to `call_private_function` but slightly more efficient to use when no arguments are needed.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn call_private_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n    ) -> ReturnsHash {\n        self.call_private_function_with_args_hash(contract_address, function_selector, 0, false)\n    }\n\n    /// Makes a read-only call to a private function which takes no arguments.\n    ///\n    /// This combines the optimisation of `call_private_function_no_args` with the safety of\n    /// `static_call_private_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn static_call_private_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n    ) -> ReturnsHash {\n        self.call_private_function_with_args_hash(contract_address, function_selector, 0, true)\n    }\n\n    /// Low-level private function call.\n    ///\n    /// This is the underlying implementation used by all other private function call methods. Instead of taking raw\n    /// arguments, it accepts a hash of the arguments.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args_hash` - Pre-computed hash of the function arguments\n    /// * `is_static_call` - Whether this should be a read-only call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values\n    ///\n    pub fn call_private_function_with_args_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args_hash: Field,\n        is_static_call: bool,\n    ) -> ReturnsHash {\n        let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n        let start_side_effect_counter = self.side_effect_counter;\n\n        // Safety: The oracle simulates the private call and returns the value of the side effects counter after\n        // execution of the call (which means that end_side_effect_counter - start_side_effect_counter is the number of\n        // side effects that took place), along with the hash of the return values. We validate these by requesting a\n        // private kernel iteration in which the return values are constrained to hash to `returns_hash` and the side\n        // effects counter to increment from start to end.\n        let (end_side_effect_counter, returns_hash) = unsafe {\n            call_private_function_internal(\n                contract_address,\n                function_selector,\n                args_hash,\n                start_side_effect_counter,\n                is_static_call,\n            )\n        };\n\n        self.private_call_requests.push(\n            PrivateCallRequest {\n                call_context: CallContext {\n                    msg_sender: self.this_address(),\n                    contract_address,\n                    function_selector,\n                    is_static_call,\n                },\n                args_hash,\n                returns_hash,\n                start_side_effect_counter,\n                end_side_effect_counter,\n            },\n        );\n\n        // TODO (fees) figure out why this crashes the prover and enable it we need this in order to pay fees inside\n        // child call contexts assert(\n        //     (item.public_inputs.min_revertible_side_effect_counter == 0 as u32)\n        //     | (item.public_inputs.min_revertible_side_effect_counter\n        //         > self.min_revertible_side_effect_counter)\n        // ); if item.public_inputs.min_revertible_side_effect_counter\n        //     > self.min_revertible_side_effect_counter { self.min_revertible_side_effect_counter =\n        // item.public_inputs.min_revertible_side_effect_counter; }\n        self.side_effect_counter = end_side_effect_counter + 1; // TODO: call `next_counter`\n        // instead, for consistency\n        ReturnsHash::new(returns_hash)\n    }\n\n    /// Enqueues a call to a public function to be executed later.\n    ///\n    /// Unlike private functions which execute immediately on the user's device, public function calls are \"enqueued\"\n    /// and executed some time later by a block proposer.\n    ///\n    /// This means a public function cannot return any values back to a private function, because by the time the\n    /// public function is being executed, the private function which called it has already completed execution. (In\n    /// fact, the private function has been executed and proven, along with all other private function calls of the\n    /// user's tx. A single proof of the tx has been submitted to the Aztec network, and some time later a proposer has\n    /// picked the tx up from the mempool and begun executing all of the enqueued public functions).\n    ///\n    /// # Privacy warning Enqueueing a public function call is an inherently leaky action. Many interesting applications will require some interaction with public state, but smart contract developers should try to use public function calls sparingly, and carefully. _Internal_ public function calls are especially leaky, because they completely leak which private contract made the call. See also: https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the public function\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Enqueues a read-only call to a public function.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function cannot modify state or emit events. Any nested\n    /// calls are constrained to also be staticcalls.\n    ///\n    /// See also `call_public_function` for more important information about making private -> public function calls.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the public function\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn static_call_public_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n    }\n\n    /// Enqueues a call to a public function that takes no arguments.\n    ///\n    /// This is an optimisation for calling public functions that don't take any input parameters. It's otherwise\n    /// equivalent to `call_public_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        hide_msg_sender: bool,\n    ) {\n        let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Enqueues a read-only call to a public function with no arguments.\n    ///\n    /// This combines the optimisation of `call_public_function_no_args` with the safety of\n    /// `static_call_public_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn static_call_public_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        hide_msg_sender: bool,\n    ) {\n        let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n    }\n\n    /// Low-level public function call.\n    ///\n    /// This is the underlying implementation used by all other public function call methods. Instead of taking raw\n    /// arguments, it accepts a hash of the arguments.\n    ///\n    /// Advanced function: Most developers should use `call_public_function` or `static_call_public_function` instead.\n    /// This function is exposed for performance optimization and advanced use cases.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `calldata_hash` - Hash of the function calldata\n    /// * `is_static_call` - Whether this should be a read-only call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function_with_calldata_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        calldata_hash: Field,\n        is_static_call: bool,\n        hide_msg_sender: bool,\n    ) {\n        let counter = self.next_counter();\n\n        let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n        assert_valid_public_call_data(calldata_hash);\n\n        let msg_sender = if hide_msg_sender {\n            NULL_MSG_SENDER_CONTRACT_ADDRESS\n        } else {\n            self.this_address()\n        };\n\n        let call_request = PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n\n        self.public_call_requests.push(Counted::new(call_request, counter));\n    }\n\n    /// Enqueues a public function call, and designates it to be the teardown function for this tx. Only one teardown\n    /// function call can be made by a tx.\n    ///\n    /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n    /// to make use of this function.\n    ///\n    /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n    /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n    /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n    /// phase ensures the fee payer has sufficient balance to pay the proposer their fees. The teardown phase is\n    /// primarily intended to: calculate exactly how much the user owes, based on gas consumption, and refund the user\n    /// any change.\n    ///\n    /// Note: in some cases, the cost of refunding the user (i.e. DA costs of tx side-effects) might exceed the refund\n    /// amount. For app logic with fairly stable and predictable gas consumption, a material refund amount is unlikely.\n    /// For app logic with unpredictable gas consumption, a refund might be important to the user (e.g. if a hefty\n    /// function reverts very early). Wallet/FPC/Paymaster developers should be mindful of this.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the teardown function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - An array of fields to pass to the function.\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    pub fn set_public_teardown_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.set_public_teardown_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Low-level function to set the public teardown function.\n    ///\n    /// This is the underlying implementation for setting the teardown function call that will execute at the end of\n    /// the transaction. Instead of taking raw arguments, it accepts a hash of the arguments.\n    ///\n    /// Advanced function: Most developers should use `set_public_teardown_function` instead.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the teardown function\n    /// * `calldata_hash` - Hash of the function calldata\n    /// * `is_static_call` - Whether this should be a read-only call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn set_public_teardown_function_with_calldata_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        calldata_hash: Field,\n        is_static_call: bool,\n        hide_msg_sender: bool,\n    ) {\n        let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n        assert_valid_public_call_data(calldata_hash);\n\n        let msg_sender = if hide_msg_sender {\n            NULL_MSG_SENDER_CONTRACT_ADDRESS\n        } else {\n            self.this_address()\n        };\n\n        self.public_teardown_call_request =\n            PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n    }\n\n    /// Increments the side-effect counter.\n    ///\n    /// Very low-level function.\n    ///\n    /// # Advanced\n    ///\n    /// Every side-effect of a private function is given a \"side-effect counter\", based on when it is created. This\n    /// PrivateContext is in charge of assigning the counters.\n    ///\n    /// The reason we have side-effect counters is complicated. Consider this illustrative pseudocode of inter-contract\n    /// function calls:\n    /// ```\n    /// contract A {\n    ///    let x = 5; // pseudocode for storage var x.\n    ///    fn a1 {\n    ///        read x; // value: 5, counter: 1.\n    ///        x = x + 1;\n    ///        write x; // value: 6, counter: 2.\n    ///\n    ///        B.b(); // start_counter: 2, end_counter: 4\n    ///\n    ///        read x; // value: 36, counter: 5.\n    ///        x = x + 1;\n    ///        write x; // value: 37, counter: 6.\n    ///    }\n    ///\n    ///    fn a2 {\n    ///        read x; // value: 6, counter: 3.\n    ///        x = x * x;\n    ///        write x; // value: 36, counter: 4.\n    ///    }\n    /// }\n    ///\n    /// contract B {\n    ///     fn b() {\n    ///         A.a2();\n    ///     }\n    /// }\n    /// ```\n    ///\n    /// Suppose a1 is the first function called. The comments show the execution counter of each side-effect, and what\n    /// the new value of `x` is.\n    ///\n    /// These (private) functions are processed by Aztec's kernel circuits in an order that is different from execution\n    /// order: All of A.a1 is proven before B.b is proven, before A.a2 is proven. So when we're in the 2nd execution\n    /// frame of A.a1 (after the call to B.b), the circuit needs to justify why x went from being `6` to `36`. But the\n    /// circuit doesn't know why, and given the order of proving, the kernel hasn't _seen_ a value of 36 get written\n    /// yet. The kernel needs to track big arrays of all side-effects of all private functions in a tx. Then, as it\n    /// recurses and processes B.b(), it will eventually see a value of 36 get written.\n    ///\n    /// Suppose side-effect counters weren't exposed: The kernel would only see this ordering (in order of proof\n    /// verification): [ A.a1.read, A.a1.write, A.a1.read, A.a1.write, A.a2.read, A.a2.write ]\n    /// [         5,          6,        36,         37,         6,         36 ]\n    /// The kernel wouldn't know _when_ B.b() was called within A.a1(), because it can't see what's going on within an\n    /// app circuit. So the kernel wouldn't know that the ordering of reads and writes should actually be: [ A.a1.read,\n    /// A.a1.write, A.a2.read, A.a2.write, A.a1.read, A.a1.write ]\n    /// [         5,          6,        6,         36,         36,         37 ]\n    ///\n    /// And so, we introduced side-effect counters: every private function must assign side-effect counters alongside\n    /// every side-effect that it emits, and also expose to the kernel the counters that it started and ended with.\n    /// This gives the kernel enough information to arrange all side-effects in the correct order. It can then catch\n    /// (for example) if a function tries to read state before it has been written (e.g. if A.a2() maliciously tried to\n    /// read a value of x=37) (e.g. if A.a1() maliciously tried to read x=6).\n    ///\n    /// If a malicious app contract _lies_ and does not count correctly:\n    /// - It cannot lie about its start and end counters because the kernel will catch this.\n    /// - It _could_ lie about its intermediate counters:\n    /// - 1. It could not increment its side-effects correctly\n    /// - 2. It could label its side-effects with counters outside of its start and end counters' range. The kernel\n    /// will catch 2. The kernel will not catch 1., but this would only cause corruption to the private state of the\n    /// malicious contract, and not any other contracts (because a contract can only modify its own state). If a \"good\"\n    /// contract is given _read access_ to a maliciously-counting contract (via an external getter function, or by\n    /// reading historic state from the archive tree directly), and they then make state changes to their _own_ state\n    /// accordingly, that could be dangerous. Developers should be mindful not to trust the claimed innards of external\n    /// contracts unless they have audited/vetted the contracts including vetting the side-effect counter\n    /// incrementation. This is a similar paradigm to Ethereum smart contract development: you must vet external\n    /// contracts that your contract relies upon, and you must not make any presumptions about their claimed behaviour.\n    /// (Hopefully if a contract imports a version of aztec-nr, we will get contract verification tooling that can\n    /// validate the authenticity of the imported aztec-nr package, and hence infer that the side- effect counting will\n    /// be correct, without having to re-audit such logic for every contract).\n    ///\n    fn next_counter(&mut self) -> u32 {\n        let counter = self.side_effect_counter;\n        self.side_effect_counter += 1;\n        counter\n    }\n}\n\nimpl Empty for PrivateContext {\n    fn empty() -> Self {\n        PrivateContext {\n            inputs: PrivateContextInputs::empty(),\n            side_effect_counter: 0 as u32,\n            min_revertible_side_effect_counter: 0 as u32,\n            is_fee_payer: false,\n            args_hash: 0,\n            return_hash: 0,\n            expiration_timestamp: 0,\n            note_hash_read_requests: BoundedVec::new(),\n            nullifier_read_requests: BoundedVec::new(),\n            key_validation_requests_and_separators: BoundedVec::new(),\n            note_hashes: BoundedVec::new(),\n            nullifiers: BoundedVec::new(),\n            private_call_requests: BoundedVec::new(),\n            public_call_requests: BoundedVec::new(),\n            public_teardown_call_request: PublicCallRequest::empty(),\n            l2_to_l1_msgs: BoundedVec::new(),\n            anchor_block_header: BlockHeader::empty(),\n            private_logs: BoundedVec::new(),\n            contract_class_logs_hashes: BoundedVec::new(),\n            last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n            expected_non_revertible_side_effect_counter: 0,\n            expected_revertible_side_effect_counter: 0,\n        }\n    }\n}\n"
+      "source": "use crate::{\n    context::{inputs::PrivateContextInputs, NoteExistenceRequest, NullifierExistenceRequest, ReturnsHash},\n    hash::{hash_args, hash_calldata_array},\n    keys::constants::{NULLIFIER_INDEX, NUM_KEY_TYPES, OUTGOING_INDEX, public_key_domain_separators},\n    messaging::process_l1_to_l2_message,\n    oracle::{\n        block_header::get_block_header_at,\n        call_private_function::call_private_function_internal,\n        execution_cache,\n        key_validation_request::get_key_validation_request,\n        logs::notify_created_contract_class_log,\n        notes::notify_nullified_note,\n        nullifiers::notify_created_nullifier,\n        public_call::assert_valid_public_call_data,\n        tx_phase::{is_execution_in_revertible_phase, notify_revertible_phase_start},\n    },\n};\nuse crate::logging::aztecnr_trace_log_format;\nuse crate::protocol::{\n    abis::{\n        block_header::BlockHeader,\n        call_context::CallContext,\n        function_selector::FunctionSelector,\n        gas_settings::GasSettings,\n        log_hash::LogHash,\n        note_hash::NoteHash,\n        nullifier::Nullifier,\n        private_call_request::PrivateCallRequest,\n        private_circuit_public_inputs::PrivateCircuitPublicInputs,\n        private_log::{PrivateLog, PrivateLogData},\n        public_call_request::PublicCallRequest,\n        validation_requests::{KeyValidationRequest, KeyValidationRequestAndSeparator},\n    },\n    address::{AztecAddress, EthAddress},\n    constants::{\n        CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, MAX_CONTRACT_CLASS_LOGS_PER_CALL, MAX_ENQUEUED_CALLS_PER_CALL,\n        MAX_KEY_VALIDATION_REQUESTS_PER_CALL, MAX_L2_TO_L1_MSGS_PER_CALL, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL,\n        MAX_NOTE_HASHES_PER_CALL, MAX_NULLIFIER_READ_REQUESTS_PER_CALL, MAX_NULLIFIERS_PER_CALL,\n        MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL, MAX_PRIVATE_LOGS_PER_CALL, MAX_TX_LIFETIME,\n        NULL_MSG_SENDER_CONTRACT_ADDRESS, PRIVATE_LOG_CIPHERTEXT_LEN,\n    },\n    hash::compute_contract_class_log_hash,\n    messaging::l2_to_l1_message::L2ToL1Message,\n    side_effect::{Counted, scoped::Scoped},\n    traits::{Empty, Hash, ToField},\n    utils::arrays::{ClaimedLengthArray, trimmed_array_length_hint},\n};\n\n/// # PrivateContext\n///\n/// The **main interface** between an #[external(\"private\")] function and the Aztec blockchain.\n///\n/// An instance of the PrivateContext is initialized automatically at the outset of every private function, within the\n/// #[external(\"private\")] macro, so you'll never need to consciously instantiate this yourself.\n///\n/// The instance is always named `context`, and it is always be available within the body of every\n/// #[external(\"private\")] function in your smart contract.\n///\n/// > For those used to \"vanilla\" Noir, it might be jarring to have access to > `context` without seeing a declaration\n/// `let context = PrivateContext::new(...)` > within the body of your function. This is just a consequence of using >\n/// macros to tidy-up verbose boilerplate. You can use `nargo expand` to > expand all macros, if you dare.\n///\n/// Typical usage for a smart contract developer will be to call getter methods of the PrivateContext.\n///\n/// _Pushing_ data and requests to the context is mostly handled within aztec-nr's own functions, so typically a smart\n/// contract developer won't need to call any setter methods directly.\n///\n/// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n/// find yourself doing this, please > open an issue on GitHub to describe your use case: it might be that > new\n/// functionality should be added to aztec-nr.\n///\n/// ## Responsibilities\n/// - Exposes contextual data to a private function:\n/// - Data relating to how this private function was called.\n/// - msg_sender\n/// - this_address - (the contract address of the private function being executed)\n/// - See `CallContext` for more data.\n/// - Data relating to the transaction in which this private function is being executed.\n/// - chain_id\n/// - version\n/// - gas_settings\n/// - Provides state access:\n/// - Access to the \"Anchor block\" header. Recall, a private function cannot read from the \"current\" block header, but\n/// must read from some historical block header, because as soon as private function execution begins (asynchronously,\n/// on a user's device), the public state of the chain (the \"current state\") will have progressed forward. We call this\n/// reference the \"Anchor block\". See `BlockHeader`.\n///   - Enables consumption of L1->L2 messages.\n/// - Enables calls to functions of other smart contracts:\n/// - Private function calls\n/// - Enqueueing of public function call requests (Since public functions are executed at a later time, by a block\n/// proposer, we say they are \"enqueued\").\n/// - Writes data to the blockchain:\n/// - New notes\n/// - New nullifiers\n/// - Private logs (for sending encrypted note contents or encrypted events)\n///   - New L2->L1 messages.\n/// - Provides args to the private function (handled by the #[external(\"private\")] macro).\n/// - Returns the return values of this private function (handled by the\n///   #[external(\"private\")] macro).\n/// - Makes Key Validation Requests.\n/// - Private functions are not allowed to see master secret keys, because we do not trust them. They are instead given\n/// \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then request validation of\n/// this claim, by making a \"key validation request\" to the protocol's kernel circuits (which _are_ allowed to see\n/// certain master secret keys).\n///\n/// ## Advanced Responsibilities\n///\n/// - Ultimately, the PrivateContext is responsible for constructing the PrivateCircuitPublicInputs of the private\n/// function being executed. All private functions on Aztec must have public inputs which adhere to the rigid layout of\n/// the PrivateCircuitPublicInputs, in order to be compatible with the protocol's kernel circuits. A well-known\n/// misnomer:\n/// - \"public inputs\" contain both inputs and outputs of this function.\n/// - By \"outputs\" we mean a lot more side-effects than just the \"return values\" of the function.\n/// - Most of the so-called \"public inputs\" are kept _private_, and never leak to the outside world, because they are\n/// 'swallowed' by the protocol's kernel circuits before the tx is sent to the network. Only the following are exposed\n/// to the outside world:\n/// - New note_hashes\n/// - New nullifiers\n/// - New private logs\n///     - New L2->L1 messages\n/// - New enqueued public function call requests All the above-listed arrays of side-effects can be padded by the\n/// user's wallet (through instructions to the kernel circuits, via the PXE) to obscure their true lengths.\n///\n/// ## Syntax Justification\n///\n/// Both user-defined functions _and_ most functions in aztec-nr need access to the PrivateContext instance to\n/// read/write data. This is why you'll see the arguably-ugly pervasiveness of the \"context\" throughout your smart\n/// contract and the aztec-nr library. For example, `&mut context` is prevalent. In some languages, you can access and\n/// mutate a global variable (such as a PrivateContext instance) from a function without polluting the function's\n/// parameters. With Noir, a function must explicitly pass control of a mutable variable to another function, by\n/// reference. Since many functions in aztec-nr need to be able to push new data to the PrivateContext, they need to be\n/// handed a mutable reference _to_ the context as a parameter. For example, `Context` is prevalent as a generic\n/// parameter, to give better type safety at compile time. Many `aztec-nr` functions don't make sense if they're called\n/// in a particular runtime (private, public or utility), and so are intentionally only implemented over certain\n/// [Private|Public|Utility]Context structs. This gives smart contract developers a much faster feedback loop if\n/// they're making a mistake, as an error will be thrown by the LSP or when they compile their contract.\n///\n#[derive(Eq)]\npub struct PrivateContext {\n    // docs:start:private-context\n    pub inputs: PrivateContextInputs,\n    pub side_effect_counter: u32,\n\n    pub min_revertible_side_effect_counter: u32,\n    pub is_fee_payer: bool,\n\n    pub args_hash: Field,\n    pub return_hash: Field,\n\n    pub expiration_timestamp: u64,\n\n    pub(crate) note_hash_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>,\n    pub(crate) nullifier_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n    key_validation_requests_and_separators: BoundedVec<KeyValidationRequestAndSeparator, MAX_KEY_VALIDATION_REQUESTS_PER_CALL>,\n\n    pub note_hashes: BoundedVec<Counted<NoteHash>, MAX_NOTE_HASHES_PER_CALL>,\n    pub nullifiers: BoundedVec<Counted<Nullifier>, MAX_NULLIFIERS_PER_CALL>,\n\n    pub private_call_requests: BoundedVec<PrivateCallRequest, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL>,\n    pub public_call_requests: BoundedVec<Counted<PublicCallRequest>, MAX_ENQUEUED_CALLS_PER_CALL>,\n    pub public_teardown_call_request: PublicCallRequest,\n    pub l2_to_l1_msgs: BoundedVec<Counted<L2ToL1Message>, MAX_L2_TO_L1_MSGS_PER_CALL>,\n    // docs:end:private-context\n\n    // Header of a block whose state is used during private execution (not the block the transaction is included in).\n    pub anchor_block_header: BlockHeader,\n\n    pub private_logs: BoundedVec<Counted<PrivateLogData>, MAX_PRIVATE_LOGS_PER_CALL>,\n    pub contract_class_logs_hashes: BoundedVec<Counted<LogHash>, MAX_CONTRACT_CLASS_LOGS_PER_CALL>,\n\n    // Contains the last key validation request for each key type. This is used to cache the last request and avoid\n    // fetching the same request multiple times. The index of the array corresponds to the key type (0 nullifier, 1\n    // incoming, 2 outgoing, 3 tagging).\n    pub last_key_validation_requests: [Option<KeyValidationRequest>; NUM_KEY_TYPES],\n\n    pub expected_non_revertible_side_effect_counter: u32,\n    pub expected_revertible_side_effect_counter: u32,\n}\n\nimpl PrivateContext {\n    pub fn new(inputs: PrivateContextInputs, args_hash: Field) -> PrivateContext {\n        PrivateContext {\n            inputs,\n            side_effect_counter: inputs.start_side_effect_counter + 1,\n            min_revertible_side_effect_counter: 0,\n            is_fee_payer: false,\n            args_hash,\n            return_hash: 0,\n            expiration_timestamp: inputs.anchor_block_header.timestamp() + MAX_TX_LIFETIME,\n            note_hash_read_requests: BoundedVec::new(),\n            nullifier_read_requests: BoundedVec::new(),\n            key_validation_requests_and_separators: BoundedVec::new(),\n            note_hashes: BoundedVec::new(),\n            nullifiers: BoundedVec::new(),\n            anchor_block_header: inputs.anchor_block_header,\n            private_call_requests: BoundedVec::new(),\n            public_call_requests: BoundedVec::new(),\n            public_teardown_call_request: PublicCallRequest::empty(),\n            l2_to_l1_msgs: BoundedVec::new(),\n            private_logs: BoundedVec::new(),\n            contract_class_logs_hashes: BoundedVec::new(),\n            last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n            expected_non_revertible_side_effect_counter: 0,\n            expected_revertible_side_effect_counter: 0,\n        }\n    }\n\n    /// Returns the contract address that initiated this function call.\n    ///\n    /// This is similar to `msg.sender` in Solidity (hence the name).\n    ///\n    /// Important Note: Since Aztec doesn't have a concept of an EoA (Externally-owned Account), the msg_sender is\n    /// \"none\" for the first function call of every transaction. The first function call of a tx is likely to be a call\n    /// to the user's account contract, so this quirk will most often be handled by account contract developers.\n    ///\n    /// # Returns\n    /// * `Option<AztecAddress>` - The address of the smart contract that called this function (be it an app contract\n    /// or a user's account contract). Returns `Option<AztecAddress>::none` for the first function call of the tx. No\n    /// other _private_ function calls in the tx will have a `none` msg_sender, but _public_ function calls might (see\n    /// the PublicContext).\n    pub fn maybe_msg_sender(self) -> Option<AztecAddress> {\n        let maybe_msg_sender = self.inputs.call_context.msg_sender;\n        if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n            Option::none()\n        } else {\n            Option::some(maybe_msg_sender)\n        }\n    }\n\n    /// Returns the contract address of the current function being executed.\n    ///\n    /// This is equivalent to `address(this)` in Solidity (hence the name). Use this to identify the current contract's\n    /// address, commonly needed for access control or when interacting with other contracts.\n    ///\n    /// # Returns\n    /// * `AztecAddress` - The contract address of the current function being executed.\n    ///\n    pub fn this_address(self) -> AztecAddress {\n        self.inputs.call_context.contract_address\n    }\n\n    /// Returns the chain ID of the current network.\n    ///\n    /// This is similar to `block.chainid` in Solidity. Returns the unique identifier for the blockchain network this\n    /// transaction is executing on.\n    ///\n    /// Helps prevent cross-chain replay attacks. Useful if implementing multi-chain contract logic.\n    ///\n    /// # Returns\n    /// * `Field` - The chain ID as a field element\n    ///\n    pub fn chain_id(self) -> Field {\n        self.inputs.tx_context.chain_id\n    }\n\n    /// Returns the Aztec protocol version that this transaction is executing under. Different versions may have\n    /// different rules, opcodes, or cryptographic primitives.\n    ///\n    /// This is similar to how Ethereum has different EVM versions.\n    ///\n    /// Useful for forward/backward compatibility checks\n    ///\n    /// Not to be confused with contract versions; this is the protocol version.\n    ///\n    /// # Returns\n    /// * `Field` - The protocol version as a field element\n    ///\n    pub fn version(self) -> Field {\n        self.inputs.tx_context.version\n    }\n\n    /// Returns the gas settings for the current transaction.\n    ///\n    /// This provides information about gas limits and pricing for the transaction, similar to `tx.gasprice` and gas\n    /// limits in Ethereum. However, Aztec has a more sophisticated gas model with separate accounting for L2\n    /// computation and data availability (DA) costs.\n    ///\n    /// # Returns\n    /// * `GasSettings` - Struct containing gas limits and fee information\n    ///\n    pub fn gas_settings(self) -> GasSettings {\n        self.inputs.tx_context.gas_settings\n    }\n\n    /// Returns the function selector of the currently executing function.\n    ///\n    /// Low-level function: Ordinarily, smart contract developers will not need to access this.\n    ///\n    /// This is similar to `msg.sig` in Solidity, which returns the first 4 bytes of the function signature. In Aztec,\n    /// the selector uniquely identifies which function within the contract is being called.\n    ///\n    /// # Returns\n    /// * `FunctionSelector` - The 4-byte function identifier\n    ///\n    /// # Advanced\n    /// Only #[external(\"private\")] functions have a function selector as a protocol- enshrined concept. The function\n    /// selectors of private functions are baked into the preimage of the contract address, and are used by the\n    /// protocol's kernel circuits to identify each private function and ensure the correct one is being executed.\n    ///\n    /// Used internally for function dispatch and call verification.\n    ///\n    pub fn selector(self) -> FunctionSelector {\n        self.inputs.call_context.function_selector\n    }\n\n    /// Returns the hash of the arguments passed to the current function.\n    ///\n    /// Very low-level function: You shouldn't need to call this. The #[external(\"private\")] macro calls this, and it\n    /// makes the arguments neatly available to the body of your private function.\n    ///\n    /// # Returns\n    /// * `Field` - Hash of the function arguments\n    ///\n    /// # Advanced\n    /// * Arguments are hashed to reduce proof size and verification time\n    /// * Enables efficient argument passing in recursive function calls\n    /// * The hash can be used to retrieve the original arguments from the PXE.\n    ///\n    pub fn get_args_hash(self) -> Field {\n        self.args_hash\n    }\n\n    /// Pushes a new note_hash to the Aztec blockchain's global Note Hash Tree (a state tree).\n    ///\n    /// A note_hash is a commitment to a piece of private state.\n    ///\n    /// Low-level function: Ordinarily, smart contract developers will not need to manually call this. Aztec-nr's state\n    /// variables (see `../state_vars/`) are designed to understand when to create and push new note hashes.\n    ///\n    /// # Arguments\n    /// * `note_hash` - The new note_hash.\n    ///\n    /// # Advanced\n    /// From here, the protocol's kernel circuits will take over and insert the note_hash into the protocol's \"note\n    /// hash tree\" (in the Base Rollup circuit). Before insertion, the protocol will:\n    /// - \"Silo\" the `note_hash` with the contract address of this function, to yield a `siloed_note_hash`. This\n    /// prevents state collisions between different smart contracts.\n    /// - Ensure uniqueness of the `siloed_note_hash`, to prevent Faerie-Gold attacks, by hashing the\n    /// `siloed_note_hash` with a unique value, to yield a `unique_siloed_note_hash` (see the protocol spec for more).\n    ///\n    /// In addition to calling this function, aztec-nr provides the contents of the newly-created note to the PXE, via\n    /// the `notify_created_note` oracle.\n    ///\n    /// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n    /// find yourself doing this, > please open an issue on GitHub to describe your use case: it might be > that new\n    /// functionality should be added to aztec-nr.\n    ///\n    pub fn push_note_hash(&mut self, note_hash: Field) {\n        self.note_hashes.push(Counted::new(note_hash, self.next_counter()));\n    }\n\n    /// Creates a new [nullifier](crate::nullifier).\n    ///\n    /// ## Safety\n    ///\n    /// This is a low-level function that must be used with great care to avoid subtle corruption of contract state.\n    /// Instead of calling this function, consider using the higher-level [`crate::state_vars::SingleUseClaim`].\n    ///\n    /// In particular, callers must ensure all nullifiers created by a contract are properly domain-separated, so that\n    /// unrelated components don't interfere with one another (e.g. a transaction nullifier accidentally marking a\n    /// variable as initialized). Only [`PrivateContext::push_nullifier_for_note_hash`] should be used for note\n    /// nullifiers, never this one.\n    ///\n    /// ## Advanced\n    ///\n    /// The raw `nullifier` is not what is inserted into the Aztec state tree: it will be first siloed by contract\n    /// address via [`crate::protocol::hash::compute_siloed_nullifier`] in order to prevent accidental or malicious\n    /// interference of nullifiers from different contracts.\n    pub fn push_nullifier(&mut self, nullifier: Field) {\n        notify_created_nullifier(nullifier);\n        self.nullifiers.push(Nullifier { value: nullifier, note_hash: 0 }.count(self.next_counter()));\n    }\n\n    /// Creates a new [nullifier](crate::nullifier) associated with a note.\n    ///\n    /// This is a variant of [`PrivateContext::push_nullifier`] that is used for note nullifiers, i.e. nullifiers that\n    /// correspond to a note. If a note and its nullifier are created in the same transaction, then the private kernels\n    /// will 'squash' these values, deleting them both as if they never existed and reducing transaction fees.\n    ///\n    /// The `nullification_note_hash` must be the result of calling\n    /// [`crate::note::utils::compute_confirmed_note_hash_for_nullification`] for pending notes, and `0` for settled\n    /// notes (which cannot be squashed).\n    ///\n    /// ## Safety\n    ///\n    /// This is a low-level function that must be used with great care to avoid subtle corruption of contract state.\n    /// Instead of calling this function, consider using the higher-level [`crate::note::lifecycle::destroy_note`].\n    ///\n    /// The precautions listed for [`PrivateContext::push_nullifier`] apply here as well, and callers should\n    /// additionally ensure `nullification_note_hash` corresponds to a note emitted by this contract, with its hash\n    /// computed in the same transaction execution phase as the call to this function. Finally, only this function\n    /// should be used for note nullifiers, never [`PrivateContext::push_nullifier`].\n    ///\n    /// Failure to do these things can result in unprovable contexts, accidental deletion of notes, or double-spend\n    /// attacks.\n    pub fn push_nullifier_for_note_hash(&mut self, nullifier: Field, nullification_note_hash: Field) {\n        let nullifier_counter = self.next_counter();\n        notify_nullified_note(nullifier, nullification_note_hash, nullifier_counter);\n        self.nullifiers.push(Nullifier { value: nullifier, note_hash: nullification_note_hash }.count(\n            nullifier_counter,\n        ));\n    }\n\n    /// Returns the anchor block header - the historical block header that this private function is reading from.\n    ///\n    /// A private function CANNOT read from the \"current\" block header, but must read from some older block header,\n    /// because as soon as private function execution begins (asynchronously, on a user's device), the public state of\n    /// the chain (the \"current state\") will have progressed forward.\n    ///\n    /// # Returns\n    /// * `BlockHeader` - The anchor block header.\n    ///\n    /// # Advanced\n    /// * All private functions of a tx read from the same anchor block header.\n    /// * The protocol asserts that the `expiration_timestamp` of every tx is at most 24 hours beyond the timestamp of\n    /// the tx's chosen anchor block header. This enables the network's nodes to safely prune old txs from the mempool.\n    /// Therefore, the chosen block header _must_ be one from within the last 24 hours.\n    ///\n    pub fn get_anchor_block_header(self) -> BlockHeader {\n        self.anchor_block_header\n    }\n\n    /// Returns the header of any historical block at or before the anchor block.\n    ///\n    /// This enables private contracts to access information from even older blocks than the anchor block header.\n    ///\n    /// Useful for time-based contract logic that needs to compare against multiple historical points.\n    ///\n    /// # Arguments\n    /// * `block_number` - The block number to retrieve (must be <= anchor block number)\n    ///\n    /// # Returns\n    /// * `BlockHeader` - The header of the requested historical block\n    ///\n    /// # Advanced\n    /// This function uses an oracle to fetch block header data from the user's PXE. Depending on how much blockchain\n    /// data the user's PXE has been set up to store, this might require a query from the PXE to another Aztec node to\n    /// get the data. > This is generally true of all oracle getters (see `../oracle`).\n    ///\n    /// Each block header gets hashed and stored as a leaf in the protocol's Archive Tree. In fact, the i-th block\n    /// header gets stored at the i-th leaf index of the Archive Tree. Behind the scenes, this `get_block_header_at`\n    /// function will add Archive Tree merkle-membership constraints (~3k) to your smart contract function's circuit,\n    /// to prove existence of the block header in the Archive Tree.\n    ///\n    /// Note: we don't do any caching, so avoid making duplicate calls for the same block header, because each call\n    /// will add duplicate constraints.\n    ///\n    /// Calling this function is more expensive (constraint-wise) than getting the anchor block header (via\n    /// `get_block_header`). This is because the anchor block's merkle membership proof is handled by Aztec's protocol\n    /// circuits, and is only performed once for the entire tx because all private functions of a tx share a common\n    /// anchor block header. Therefore, the cost (constraint-wise) of calling `get_block_header` is effectively free.\n    ///\n    pub fn get_block_header_at(self, block_number: u32) -> BlockHeader {\n        get_block_header_at(block_number, self)\n    }\n\n    /// Sets the hash of the return values for this private function.\n    ///\n    /// Very low-level function: this is called by the #[external(\"private\")] macro.\n    ///\n    /// # Arguments\n    /// * `serialized_return_values` - The serialized return values as a field array\n    ///\n    pub fn set_return_hash<let N: u32>(&mut self, serialized_return_values: [Field; N]) {\n        let return_hash = hash_args(serialized_return_values);\n        self.return_hash = return_hash;\n        execution_cache::store(serialized_return_values, return_hash);\n    }\n\n    /// Builds the PrivateCircuitPublicInputs for this private function, to ensure compatibility with the protocol's\n    /// kernel circuits.\n    ///\n    /// Very low-level function: This function is automatically called by the #[external(\"private\")] macro.\n    pub fn finish(self) -> PrivateCircuitPublicInputs {\n        PrivateCircuitPublicInputs {\n            call_context: self.inputs.call_context,\n            args_hash: self.args_hash,\n            returns_hash: self.return_hash,\n            min_revertible_side_effect_counter: self.min_revertible_side_effect_counter,\n            is_fee_payer: self.is_fee_payer,\n            expiration_timestamp: self.expiration_timestamp,\n            note_hash_read_requests: ClaimedLengthArray::from_bounded_vec(self.note_hash_read_requests),\n            nullifier_read_requests: ClaimedLengthArray::from_bounded_vec(self.nullifier_read_requests),\n            key_validation_requests_and_separators: ClaimedLengthArray::from_bounded_vec(\n                self.key_validation_requests_and_separators,\n            ),\n            note_hashes: ClaimedLengthArray::from_bounded_vec(self.note_hashes),\n            nullifiers: ClaimedLengthArray::from_bounded_vec(self.nullifiers),\n            private_call_requests: ClaimedLengthArray::from_bounded_vec(self.private_call_requests),\n            public_call_requests: ClaimedLengthArray::from_bounded_vec(self.public_call_requests),\n            public_teardown_call_request: self.public_teardown_call_request,\n            l2_to_l1_msgs: ClaimedLengthArray::from_bounded_vec(self.l2_to_l1_msgs),\n            start_side_effect_counter: self.inputs.start_side_effect_counter,\n            end_side_effect_counter: self.side_effect_counter,\n            private_logs: ClaimedLengthArray::from_bounded_vec(self.private_logs),\n            contract_class_logs_hashes: ClaimedLengthArray::from_bounded_vec(self.contract_class_logs_hashes),\n            anchor_block_header: self.anchor_block_header,\n            tx_context: self.inputs.tx_context,\n            expected_non_revertible_side_effect_counter: self.expected_non_revertible_side_effect_counter,\n            expected_revertible_side_effect_counter: self.expected_revertible_side_effect_counter,\n        }\n    }\n\n    /// Designates this contract as the fee payer for the transaction.\n    ///\n    /// Unlike Ethereum, where the transaction sender always pays fees, Aztec allows any contract to voluntarily pay\n    /// transaction fees. This enables patterns like sponsored transactions or fee abstraction where users don't need\n    /// to hold fee-juice themselves. (Fee juice is a fee-paying asset for Aztec).\n    ///\n    /// Only one contract per transaction can declare itself as the fee payer, and it must have sufficient fee-juice\n    /// balance (>= the gas limits specified in the TxContext) by the time we reach the public setup phase of the tx.\n    ///\n    pub fn set_as_fee_payer(&mut self) {\n        aztecnr_trace_log_format!(\"Setting {0} as fee payer\")([self.this_address().to_field()]);\n        self.is_fee_payer = true;\n    }\n\n    pub fn in_revertible_phase(&mut self) -> bool {\n        let current_counter = self.side_effect_counter;\n\n        // Safety: Kernel will validate that the claim is correct by validating the expected counters.\n        let is_revertible = unsafe { is_execution_in_revertible_phase(current_counter) };\n\n        if is_revertible {\n            if (self.expected_revertible_side_effect_counter == 0)\n                | (current_counter < self.expected_revertible_side_effect_counter) {\n                self.expected_revertible_side_effect_counter = current_counter;\n            }\n        } else if current_counter > self.expected_non_revertible_side_effect_counter {\n            self.expected_non_revertible_side_effect_counter = current_counter;\n        }\n\n        is_revertible\n    }\n\n    /// Declares the end of the \"setup phase\" of this tx.\n    ///\n    /// Only one function per tx can declare the end of the setup phase.\n    ///\n    /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n    /// to make use of this function.\n    ///\n    /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n    /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n    /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n    /// phase enables such a payment to be made, because the setup phase _cannot revert_: a reverting function within\n    /// the setup phase would result in an invalid block which cannot be proven. Any side-effects generated during that\n    /// phase are guaranteed to be inserted into Aztec's state trees (except for squashed notes & nullifiers, of\n    /// course).\n    ///\n    /// Even though the end of the setup phase is declared within a private function, you might have noticed that\n    /// _public_ functions can also execute within the setup phase. This is because any public function calls which\n    /// were enqueued _within the setup phase_ by a private function are considered part of the setup phase.\n    ///\n    /// # Advanced\n    /// * Sets the minimum revertible side effect counter of this tx to be the PrivateContext's _current_ side effect\n    /// counter.\n    ///\n    pub fn end_setup(&mut self) {\n        // Incrementing the side effect counter when ending setup ensures non ambiguity for the counter where we change\n        // phases.\n        self.side_effect_counter += 1;\n        aztecnr_trace_log_format!(\"Ending setup at counter {0}\")([self.side_effect_counter as Field]);\n        self.min_revertible_side_effect_counter = self.next_counter();\n        notify_revertible_phase_start(self.min_revertible_side_effect_counter);\n    }\n\n    /// Sets a deadline (an \"include-by timestamp\") for when this transaction must be included in a block.\n    ///\n    /// Other functions in this tx might call this setter with differing values for the include-by timestamp. To ensure\n    /// that all functions' deadlines are met, the _minimum_ of all these include-by timestamps will be exposed when\n    /// this tx is submitted to the network.\n    ///\n    /// If the transaction is not included in a block by its include-by timestamp, it becomes invalid and it will never\n    /// be included.\n    ///\n    /// This expiry timestamp is publicly visible. See the \"Advanced\" section for privacy concerns.\n    ///\n    /// # Arguments\n    /// * `expiration_timestamp` - Unix timestamp (seconds) deadline for inclusion. The include-by timestamp of this tx\n    /// will be _at most_ the timestamp specified.\n    ///\n    /// # Advanced\n    /// * If multiple functions set differing `expiration_timestamp`s, the kernel circuits will set it to be the\n    /// _minimum_ of the two. This ensures the tx expiry requirements of all functions in the tx are met.\n    /// * Rollup circuits will reject expired txs.\n    /// * The protocol enforces that all transactions must be included within 24 hours of their chosen anchor block's\n    /// timestamp, to enable safe mempool pruning.\n    /// * The DelayedPublicMutable design makes heavy use of this functionality, to enable private functions to read\n    /// public state.\n    /// * A sophisticated Wallet should cleverly set an include-by timestamp to improve the privacy of the user and the\n    /// network as a whole. For example, if a contract interaction sets include-by to some publicly-known value (e.g.\n    /// the time when a contract upgrades), then the wallet might wish to set an even lower one to avoid revealing that\n    /// this tx is interacting with said contract. Ideally, all wallets should standardize on an approach in order to\n    ///   provide users with a large privacy set -- although the exact approach\n    /// will need to be discussed. Wallets that deviate from a standard might accidentally reveal which wallet each\n    /// transaction originates from.\n    ///\n    // docs:start:expiration-timestamp\n    pub fn set_expiration_timestamp(&mut self, expiration_timestamp: u64) {\n        // docs:end:expiration-timestamp\n        self.expiration_timestamp = std::cmp::min(self.expiration_timestamp, expiration_timestamp);\n    }\n\n    /// Asserts that a note has been created.\n    ///\n    /// This function will cause the transaction to fail unless the requested note exists. This is the preferred\n    /// mechanism for performing this check, and the only one that works for pending notes.\n    ///\n    /// ## Pending Notes\n    ///\n    /// Both settled notes (created in prior transactions) and pending notes (created in the current transaction) will\n    /// be considered by this function. Pending notes must have been created **before** this call is made for the check\n    /// to pass.\n    ///\n    /// ## Historical Notes\n    ///\n    /// If you need to assert that a note existed _by some specific block in the past_, instead of simply proving that\n    /// it exists by the current anchor block, use [`crate::history::note::assert_note_existed_by`] instead.\n    ///\n    /// ## Cost\n    ///\n    /// This uses up one of the call's kernel note hash read requests, which are limited. Like all kernel requests,\n    /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n    /// an additional invocation of the kernel reset circuit.\n    pub fn assert_note_exists(&mut self, note_existence_request: NoteExistenceRequest) {\n        // Note that the `note_hash_read_requests` array does not hold `NoteExistenceRequest` objects, but rather a\n        // custom kernel type. We convert from the aztec-nr type into it.\n\n        let note_hash = note_existence_request.note_hash();\n        let contract_address = note_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n        let side_effect = Scoped::new(\n            Counted::new(note_hash, self.next_counter()),\n            contract_address,\n        );\n\n        self.note_hash_read_requests.push(side_effect);\n    }\n\n    /// Asserts that a nullifier has been emitted.\n    ///\n    /// This function will cause the transaction to fail unless the requested nullifier exists. This is the preferred\n    /// mechanism for performing this check, and the only one that works for pending nullifiers.\n    ///\n    /// ## Pending Nullifiers\n    ///\n    /// Both settled nullifiers (emitted in prior transactions) and pending nullifiers (emitted in the current\n    /// transaction) will be considered by this function. Pending nullifiers must have been emitted **before** this\n    /// call is made for the check to pass.\n    ///\n    /// ## Historical Nullifiers\n    ///\n    /// If you need to assert that a nullifier existed _by some specific block in the past_, instead of simply proving\n    /// that it exists by the current anchor block, use [`crate::history::nullifier::assert_nullifier_existed_by`]\n    /// instead.\n    ///\n    /// ## Public vs Private\n    ///\n    /// In general, it is unsafe to check for nullifier non-existence in private, as that will not consider the\n    /// possibility of the nullifier having been emitted in any transaction between the anchor block and the inclusion\n    /// block. Private functions instead prove existence via this function and 'prove' non-existence by _emitting_ the\n    /// nullifer, which would cause the transaction to fail if the nullifier existed.\n    ///\n    /// This is not the case in public functions, which do have access to the tip of the blockchain and so can reliably\n    /// prove whether a nullifier exists or not via\n    /// [`crate::context::public_context::PublicContext::nullifier_exists_unsafe`].\n    ///\n    /// ## Cost\n    ///\n    /// This uses up one of the call's kernel nullifier read requests, which are limited. Like all kernel requests,\n    /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n    /// an additional invocation of the kernel reset circuit.\n    pub fn assert_nullifier_exists(&mut self, nullifier_existence_request: NullifierExistenceRequest) {\n        let nullifier = nullifier_existence_request.nullifier();\n        let contract_address = nullifier_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n        let request = Scoped::new(\n            Counted::new(nullifier, self.next_counter()),\n            contract_address,\n        );\n\n        self.nullifier_read_requests.push(request);\n    }\n\n    /// Requests the app-siloed nullifier hiding key (nhk_app) for the given (hashed) master nullifier public key\n    /// (npk_m), from the user's PXE.\n    ///\n    /// Advanced function: Only needed if you're designing your own notes and/or nullifiers.\n    ///\n    /// Contracts are not allowed to compute nullifiers for other contracts, as that would let them read parts of their\n    /// private state. Because of this, a contract is only given an \"app-siloed key\", which is constructed by\n    /// hashing the user's master nullifier hiding key with the contract's address. However, because contracts cannot\n    /// be trusted with a user's master nullifier hiding key (because we don't know which contracts are honest or\n    /// malicious), the PXE refuses to provide any master secret keys to any app smart contract function. This means\n    /// app functions are unable to prove that the derivation of an app-siloed nullifier hiding key has been computed\n    /// correctly. Instead, an app function can request to the kernel (via `request_nhk_app`) that it validates the\n    /// siloed derivation, since the kernel has been vetted to not leak any master secret keys.\n    ///\n    /// A common nullification scheme is to inject a nullifier hiding key into the preimage of a nullifier, to make the\n    /// nullifier deterministic but random-looking. This function enables that flow.\n    ///\n    /// # Arguments\n    /// * `npk_m_hash` - A hash of the master nullifier public key of the user whose PXE is executing this function.\n    ///\n    /// # Returns\n    /// * The app-siloed nullifier hiding key that corresponds to the given `npk_m_hash`.\n    ///\n    pub fn request_nhk_app(&mut self, npk_m_hash: Field) -> Field {\n        self.request_sk_app(npk_m_hash, NULLIFIER_INDEX)\n    }\n\n    /// Requests the app-siloed outgoing viewing secret key (ovsk_app) for the given (hashed) master outgoing\n    /// viewing public key (ovpk_m), from the user's PXE.\n    ///\n    /// See `request_nhk_app` and `request_sk_app` for more info.\n    ///\n    /// The intention of the \"outgoing\" keypair is to provide a second secret key for all of a user's outgoing activity\n    /// (i.e. for notes that a user creates, as opposed to notes that a user receives from others). The separation of\n    /// incoming and outgoing data was a distinction made by zcash, with the intention of enabling a user to optionally\n    /// share with a 3rd party a controlled view of only incoming or outgoing notes. Similar functionality of sharing\n    /// select data can be achieved with offchain zero-knowledge proofs. It is up to an app developer whether they\n    /// choose to make use of a user's outgoing keypair within their application logic, or instead simply use the same\n    /// keypair (the address keypair (which is effectively the same as the \"incoming\" keypair)) for all incoming &\n    /// outgoing messages to a user.\n    ///\n    /// Currently, all of the exposed encryption functions in aztec-nr ignore the outgoing viewing keys, and instead\n    /// encrypt all note logs and event logs to a user's address public key.\n    ///\n    /// # Arguments\n    /// * `ovpk_m_hash` - Hash of the outgoing viewing public key master\n    ///\n    /// # Returns\n    /// * The application-specific outgoing viewing secret key\n    ///\n    pub fn request_ovsk_app(&mut self, ovpk_m_hash: Field) -> Field {\n        self.request_sk_app(ovpk_m_hash, OUTGOING_INDEX)\n    }\n\n    /// Pushes a Key Validation Request to the kernel.\n    ///\n    /// Private functions are not allowed to see a user's master secret keys, because we do not trust them. They are\n    /// instead given \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then\n    /// request validation of this claim, by making a \"key validation request\" to the protocol's kernel circuits (which\n    /// _are_ allowed to see certain master secret keys).\n    ///\n    /// When a Key Validation Request tuple of (sk_app, Pk_m, app_address) is submitted to the kernel, it will perform\n    /// the following derivations to validate the relationship between the claimed sk_app and the user's Pk_m:\n    ///\n    ///       (sk_m) ----> * G ----> Pk_m\n    ///         |                     |\n    ///         v                       We use the kernel to prove this\n    ///  h(sk_m, app_address)         | sk_app-Pk_m relationship, because app\n    ///         |                       circuits must not be trusted to see sk_m.\n    ///         v                     |\n    /// sk_app - -  - - - - - - -\n    ///\n    /// The function is named \"request_\" instead of \"get_\" to remind the user that a Key Validation Request will be\n    /// emitted to the kernel.\n    ///\n    fn request_sk_app(&mut self, pk_m_hash: Field, key_index: Field) -> Field {\n        let cached_request =\n            self.last_key_validation_requests[key_index as u32].unwrap_or(KeyValidationRequest::empty());\n\n        if cached_request.pk_m.hash() == pk_m_hash {\n            // We get a match so the cached request is the latest one\n            cached_request.sk_app\n        } else {\n            // We didn't get a match meaning the cached result is stale Typically we'd validate keys by showing that\n            // they are the preimage of `pk_m_hash`, but that'd require the oracle returning the master secret keys,\n            // which could cause malicious contracts to leak it or learn about secrets from other contracts. We\n            // therefore silo secret keys, and rely on the private kernel to validate that we siloed secret key\n            // corresponds to correct siloing of the master secret key that hashes to `pk_m_hash`.\n\n            // Safety: Kernels verify that the key validation request is valid and below we verify that a request for\n            // the correct public key has been received.\n            let request = unsafe { get_key_validation_request(pk_m_hash, key_index) };\n            assert(!request.pk_m.is_infinite, \"Infinite public key points are not allowed\");\n            assert_eq(request.pk_m.hash(), pk_m_hash, \"Obtained invalid key validation request\");\n\n            self.key_validation_requests_and_separators.push(\n                KeyValidationRequestAndSeparator {\n                    request,\n                    key_type_domain_separator: public_key_domain_separators[key_index as u32],\n                },\n            );\n            self.last_key_validation_requests[key_index as u32] = Option::some(request);\n            request.sk_app\n        }\n    }\n\n    /// Sends an \"L2 -> L1 message\" from this function (Aztec, L2) to a smart contract on Ethereum (L1). L1 contracts\n    /// which are designed to send/receive messages to/from Aztec are called \"Portal Contracts\".\n    ///\n    /// Common use cases include withdrawals, cross-chain asset transfers, and triggering L1 actions based on L2 state\n    /// changes.\n    ///\n    /// The message will be inserted into an Aztec \"Outbox\" contract on L1, when this transaction's block is proposed\n    /// to L1. Sending the message will not result in any immediate state changes in the target portal contract. The\n    /// message will need to be manually consumed from the Outbox through a separate Ethereum transaction: a user will\n    /// need to call a function of the portal contract -- a function specifically designed to make a call to the Outbox\n    /// to consume the message. The message will only be available for consumption once the _epoch_ proof has been\n    /// submitted. Given that there are multiple Aztec blocks within an epoch, it might take some time for this epoch\n    /// proof to be submitted -- especially if the block was near the start of an epoch.\n    ///\n    /// # Arguments\n    /// * `recipient` - Ethereum address that will receive the message\n    /// * `content` - Message content (32 bytes as a Field element). This content has a very\n    /// specific layout. docs:start:context_message_portal\n    pub fn message_portal(&mut self, recipient: EthAddress, content: Field) {\n        let message = L2ToL1Message { recipient, content };\n        self.l2_to_l1_msgs.push(message.count(self.next_counter()));\n    }\n\n    /// Consumes a message sent from Ethereum (L1) to Aztec (L2).\n    ///\n    /// Common use cases include token bridging, cross-chain governance, and triggering L2 actions based on L1 events.\n    ///\n    /// Use this function if you only want the message to ever be \"referred to\" once. Once consumed using this method,\n    /// the message cannot be consumed again, because a nullifier is emitted. If your use case wants for the message to\n    /// be read unlimited times, then you can always read any historic message from the L1-to-L2 messages tree;\n    /// messages never technically get deleted from that tree.\n    ///\n    /// The message will first be inserted into an Aztec \"Inbox\" smart contract on L1. Sending the message will not\n    /// result in any immediate state changes in the target L2 contract. The message will need to be manually consumed\n    /// by the target contract through a separate Aztec transaction. The message will not be available for consumption\n    /// immediately. Messages get copied over from the L1 Inbox to L2 by the next Proposer in batches. So you will need\n    /// to wait until the messages are copied before you can consume them.\n    ///\n    /// # Arguments\n    /// * `content` - The message content that was sent from L1\n    /// * `secret` - Secret value used for message privacy (if needed)\n    /// * `sender` - Ethereum address that sent the message\n    /// * `leaf_index` - Index of the message in the L1-to-L2 message tree\n    ///\n    /// # Advanced\n    /// Validates message existence in the L1-to-L2 message tree and nullifies the message to prevent\n    /// double-consumption.\n    pub fn consume_l1_to_l2_message(&mut self, content: Field, secret: Field, sender: EthAddress, leaf_index: Field) {\n        let nullifier = process_l1_to_l2_message(\n            self.anchor_block_header.state.l1_to_l2_message_tree.root,\n            self.this_address(),\n            sender,\n            self.chain_id(),\n            self.version(),\n            content,\n            secret,\n            leaf_index,\n        );\n\n        // Push nullifier (and the \"commitment\" corresponding to this can be \"empty\")\n        self.push_nullifier(nullifier)\n    }\n\n    /// Emits a private log (an array of Fields) that will be published to an Ethereum blob.\n    ///\n    /// Private logs are intended for the broadcasting of ciphertexts: that is, encrypted events or encrypted note\n    /// contents. Since the data in the logs is meant to be _encrypted_, private_logs are broadcast to publicly-visible\n    /// Ethereum blobs. The intended recipients of such encrypted messages can then discover and decrypt these\n    /// encrypted logs using their viewing secret key. (See `../messages/discovery` for more details).\n    ///\n    /// Important note: This function DOES NOT _do_ any encryption of the input `log` fields. This function blindly\n    /// publishes whatever input `log` data is fed into it, so the caller of this function should have already\n    /// performed the encryption, and the `log` should be the result of that encryption.\n    ///\n    /// The protocol does not dictate what encryption scheme should be used: a smart contract developer can choose\n    /// whatever encryption scheme they like. Aztec-nr includes some off-the-shelf encryption libraries that developers\n    /// might wish to use, for convenience. These libraries not only encrypt a plaintext (to produce a ciphertext);\n    /// they also prepend the ciphertext with a `tag` and `ephemeral public key` for easier message discovery. This is\n    /// a very dense topic, and we will be writing more libraries and docs soon.\n    ///\n    /// > Currently, AES128 CBC encryption is the main scheme included in > aztec.nr. > We are currently making\n    /// significant changes to the interfaces of the > encryption library.\n    ///\n    /// In some niche use cases, an app might be tempted to publish _un-encrypted_ data via a private log, because\n    /// _public logs_ are not available to private functions. Be warned that emitting public data via private logs is\n    /// strongly discouraged, and is considered a \"privacy anti-pattern\", because it reveals identifiable information\n    /// about _which_ function has been executed. A tx which leaks such information does not contribute to the privacy\n    /// set of the network.\n    ///\n    /// * Unlike `emit_raw_note_log_unsafe`, this log is not tied to any specific note\n    ///\n    /// # Arguments\n    /// * `tag` - A tag placed at `fields[0]` of the emitted log. Used by recipients and nodes to identify and\n    /// filter for relevant logs without scanning all of them.\n    /// * `log` - The log data that will be publicly broadcast (so make sure it's already been encrypted before you\n    /// call this function). Private logs are bounded in size (`PRIVATE_LOG_CIPHERTEXT_LEN`), to encourage all logs\n    /// from all smart contracts look identical.\n    /// * `length` - The actual length of `log` (measured in number of Fields). Although the input log has a max\n    /// size of `PRIVATE_LOG_CIPHERTEXT_LEN`, the latter values of the array might all be 0's for small logs. This\n    /// `length` should reflect the trimmed length of the array. The protocol's kernel circuits can then append\n    /// random fields as \"padding\" after the `length`, so that the logs of this smart contract look\n    /// indistinguishable from (the same length as) the logs of all other applications. It's up to wallets how much\n    /// padding to apply, so ideally all wallets should agree on standards for this.\n    ///\n    /// ## Safety\n    ///\n    /// The `tag` should be domain-separated (e.g. via [`crate::protocol::hash::compute_log_tag`]) to prevent\n    /// collisions between logs from different sources. Without domain separation, two unrelated log types that\n    /// happen to share a raw tag value become indistinguishable. Prefer the higher-level APIs\n    /// ([`crate::messages::message_delivery::MessageDelivery`] for messages, `self.emit(event)` for events) which\n    /// handle tagging automatically.\n    pub fn emit_private_log_unsafe(&mut self, tag: Field, log: [Field; PRIVATE_LOG_CIPHERTEXT_LEN], length: u32) {\n        let counter = self.next_counter();\n        let full_log = [tag].concat(log);\n        self.private_logs.push(PrivateLogData { log: PrivateLog::new(full_log, length + 1), note_hash_counter: 0 }\n            .count(counter));\n    }\n\n    // TODO: rename.\n    /// Emits a private log that is explicitly tied to a newly-emitted note_hash, to convey to the kernel: \"this log\n    /// relates to this note\".\n    ///\n    /// This linkage is important in case the note gets squashed (due to being read later in this same tx), since we\n    /// can then squash the log as well.\n    ///\n    /// See `emit_private_log_unsafe` for more info about private log emission.\n    ///\n    /// # Arguments\n    /// * `tag` - A tag placed at `fields[0]`. See `emit_private_log_unsafe`.\n    /// * `log` - The log data as an array of Field elements\n    /// * `length` - The actual length of the `log` (measured in number of Fields).\n    /// * `note_hash_counter` - The side-effect counter that was assigned to the new note_hash when it was pushed to\n    /// this `PrivateContext`.\n    ///\n    /// Important: If your application logic requires the log to always be emitted regardless of note squashing,\n    /// consider using `emit_private_log_unsafe` instead, or emitting additional events.\n    ///\n    /// ## Safety\n    ///\n    /// Same as [`PrivateContext::emit_private_log_unsafe`]: the `tag` should be domain-separated.\n    pub fn emit_raw_note_log_unsafe(\n        &mut self,\n        tag: Field,\n        log: [Field; PRIVATE_LOG_CIPHERTEXT_LEN],\n        length: u32,\n        note_hash_counter: u32,\n    ) {\n        let counter = self.next_counter();\n        let full_log = [tag].concat(log);\n        let private_log = PrivateLogData { log: PrivateLog::new(full_log, length + 1), note_hash_counter };\n        self.private_logs.push(private_log.count(counter));\n    }\n\n    /// Emits large data blobs.\n    ///\n    /// This reuses the Contract Class Log channel to emit blobs of up to [`CONTRACT_CLASS_LOG_SIZE_IN_FIELDS`].\n    ///\n    /// ## Privacy\n    ///\n    /// The address of the contract emitting these blobs is revelead.\n    pub fn emit_contract_class_log<let N: u32>(&mut self, log: [Field; N]) {\n        let contract_address = self.this_address();\n        let counter = self.next_counter();\n\n        let log_to_emit: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS] =\n            log.concat([0; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS - N]);\n        // Note: the length is not always N, it is the number of fields we want to broadcast, omitting trailing zeros\n        // to save blob space.\n        // Safety: The below length is constrained in the base rollup, which will make sure that all the fields beyond\n        // length are zero. However, it won't be able to check that we didn't add extra padding (trailing zeroes) or\n        // that we cut trailing zeroes from the end.\n        let length = unsafe { trimmed_array_length_hint(log) };\n        // We hash the entire padded log to ensure a user cannot pass a shorter length and so emit incorrect shorter\n        // bytecode.\n        let log_hash = compute_contract_class_log_hash(log_to_emit);\n        // Safety: the below only exists to broadcast the raw log, so we can provide it to the base rollup later to be\n        // constrained.\n        unsafe {\n            notify_created_contract_class_log(contract_address, log_to_emit, length, counter);\n        }\n\n        self.contract_class_logs_hashes.push(LogHash { value: log_hash, length: length }.count(counter));\n    }\n\n    /// Calls a private function on another contract (or the same contract).\n    ///\n    /// Very low-level function.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the called function\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    /// This enables contracts to interact with each other while maintaining privacy. This \"composability\" of private\n    /// contract functions is a key feature of the Aztec network.\n    ///\n    /// If a user's transaction includes multiple private function calls, then by the design of Aztec, the following\n    /// information will remain private[1]:\n    /// - The function selectors and contract addresses of all private function calls will remain private, so an\n    /// observer of the public mempool will not be able to look at a tx and deduce which private functions have been\n    /// executed.\n    /// - The arguments and return values of all private function calls will remain private.\n    /// - The person who initiated the tx will remain private.\n    /// - The notes and nullifiers and private logs that are emitted by all private function calls will (if designed\n    /// well) not leak any user secrets, nor leak which functions have been executed.\n    ///\n    /// [1] Caveats: Some of these privacy guarantees depend on how app developers design their smart contracts. Some\n    /// actions _can_ leak information, such as:\n    /// - Calling an internal public function.\n    /// - Calling a public function and not setting msg_sender to Option::none (feature not built yet - see github).\n    /// - Calling any public function will always leak details about the nature of the transaction, so devs should be\n    /// careful in their contract designs. If it can be done in a private function, then that will give the best\n    /// privacy.\n    /// - Not padding the side-effects of a tx to some standardized, uniform size. The kernel circuits can take hints\n    /// to pad side-effects, so a wallet should be able to request for a particular amount of padding. Wallets should\n    /// ideally agree on some standard.\n    /// - Padding should include:\n    /// - Padding the lengths of note & nullifier arrays\n    /// - Padding private logs with random fields, up to some standardized size. See also:\n    /// https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n    ///\n    /// # Advanced\n    /// * The call is added to the private call stack and executed by kernel circuits after this function completes\n    /// * The called function can modify its own contract's private state\n    /// * Side effects from the called function are included in this transaction\n    /// * The call inherits the current transaction's context and gas limits\n    ///\n    pub fn call_private_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n    ) -> ReturnsHash {\n        let args_hash = hash_args(args);\n        execution_cache::store(args, args_hash);\n        self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, false)\n    }\n\n    /// Makes a read-only call to a private function on another contract.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function cannot modify state, emit L2->L2 messages, nor\n    /// emit events. Any nested calls are constrained to also be staticcalls.\n    ///\n    /// See `call_private_function` for more general info on private function calls.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract to call\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the called function\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn static_call_private_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n    ) -> ReturnsHash {\n        let args_hash = hash_args(args);\n        execution_cache::store(args, args_hash);\n        self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, true)\n    }\n\n    /// Calls a private function that takes no arguments.\n    ///\n    /// This is a convenience function for calling private functions that don't require any input parameters. It's\n    /// equivalent to `call_private_function` but slightly more efficient to use when no arguments are needed.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn call_private_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n    ) -> ReturnsHash {\n        self.call_private_function_with_args_hash(contract_address, function_selector, 0, false)\n    }\n\n    /// Makes a read-only call to a private function which takes no arguments.\n    ///\n    /// This combines the optimisation of `call_private_function_no_args` with the safety of\n    /// `static_call_private_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n    /// return values.\n    ///\n    pub fn static_call_private_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n    ) -> ReturnsHash {\n        self.call_private_function_with_args_hash(contract_address, function_selector, 0, true)\n    }\n\n    /// Low-level private function call.\n    ///\n    /// This is the underlying implementation used by all other private function call methods. Instead of taking raw\n    /// arguments, it accepts a hash of the arguments.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args_hash` - Pre-computed hash of the function arguments\n    /// * `is_static_call` - Whether this should be a read-only call\n    ///\n    /// # Returns\n    /// * `ReturnsHash` - Hash of the called function's return values\n    ///\n    pub fn call_private_function_with_args_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args_hash: Field,\n        is_static_call: bool,\n    ) -> ReturnsHash {\n        let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n        let start_side_effect_counter = self.side_effect_counter;\n\n        // Safety: The oracle simulates the private call and returns the value of the side effects counter after\n        // execution of the call (which means that end_side_effect_counter - start_side_effect_counter is the number of\n        // side effects that took place), along with the hash of the return values. We validate these by requesting a\n        // private kernel iteration in which the return values are constrained to hash to `returns_hash` and the side\n        // effects counter to increment from start to end.\n        let (end_side_effect_counter, returns_hash) = unsafe {\n            call_private_function_internal(\n                contract_address,\n                function_selector,\n                args_hash,\n                start_side_effect_counter,\n                is_static_call,\n            )\n        };\n\n        self.private_call_requests.push(\n            PrivateCallRequest {\n                call_context: CallContext {\n                    msg_sender: self.this_address(),\n                    contract_address,\n                    function_selector,\n                    is_static_call,\n                },\n                args_hash,\n                returns_hash,\n                start_side_effect_counter,\n                end_side_effect_counter,\n            },\n        );\n\n        // TODO (fees) figure out why this crashes the prover and enable it we need this in order to pay fees inside\n        // child call contexts assert(\n        //     (item.public_inputs.min_revertible_side_effect_counter == 0 as u32)\n        //     | (item.public_inputs.min_revertible_side_effect_counter\n        //         > self.min_revertible_side_effect_counter)\n        // ); if item.public_inputs.min_revertible_side_effect_counter\n        //     > self.min_revertible_side_effect_counter { self.min_revertible_side_effect_counter =\n        // item.public_inputs.min_revertible_side_effect_counter; }\n        self.side_effect_counter = end_side_effect_counter + 1; // TODO: call `next_counter`\n        // instead, for consistency\n        ReturnsHash::new(returns_hash)\n    }\n\n    /// Enqueues a call to a public function to be executed later.\n    ///\n    /// Unlike private functions which execute immediately on the user's device, public function calls are \"enqueued\"\n    /// and executed some time later by a block proposer.\n    ///\n    /// This means a public function cannot return any values back to a private function, because by the time the\n    /// public function is being executed, the private function which called it has already completed execution. (In\n    /// fact, the private function has been executed and proven, along with all other private function calls of the\n    /// user's tx. A single proof of the tx has been submitted to the Aztec network, and some time later a proposer has\n    /// picked the tx up from the mempool and begun executing all of the enqueued public functions).\n    ///\n    /// # Privacy warning Enqueueing a public function call is an inherently leaky action. Many interesting applications will require some interaction with public state, but smart contract developers should try to use public function calls sparingly, and carefully. _Internal_ public function calls are especially leaky, because they completely leak which private contract made the call. See also: https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the public function\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Enqueues a read-only call to a public function.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function cannot modify state or emit events. Any nested\n    /// calls are constrained to also be staticcalls.\n    ///\n    /// See also `call_public_function` for more important information about making private -> public function calls.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - Array of arguments to pass to the public function\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn static_call_public_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n    }\n\n    /// Enqueues a call to a public function that takes no arguments.\n    ///\n    /// This is an optimisation for calling public functions that don't take any input parameters. It's otherwise\n    /// equivalent to `call_public_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        hide_msg_sender: bool,\n    ) {\n        let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Enqueues a read-only call to a public function with no arguments.\n    ///\n    /// This combines the optimisation of `call_public_function_no_args` with the safety of\n    /// `static_call_public_function`.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn static_call_public_function_no_args(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        hide_msg_sender: bool,\n    ) {\n        let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n        self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n    }\n\n    /// Low-level public function call.\n    ///\n    /// This is the underlying implementation used by all other public function call methods. Instead of taking raw\n    /// arguments, it accepts a hash of the arguments.\n    ///\n    /// Advanced function: Most developers should use `call_public_function` or `static_call_public_function` instead.\n    /// This function is exposed for performance optimization and advanced use cases.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the function\n    /// * `calldata_hash` - Hash of the function calldata\n    /// * `is_static_call` - Whether this should be a read-only call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn call_public_function_with_calldata_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        calldata_hash: Field,\n        is_static_call: bool,\n        hide_msg_sender: bool,\n    ) {\n        let counter = self.next_counter();\n\n        let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n        assert_valid_public_call_data(calldata_hash);\n\n        let msg_sender = if hide_msg_sender {\n            NULL_MSG_SENDER_CONTRACT_ADDRESS\n        } else {\n            self.this_address()\n        };\n\n        let call_request = PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n\n        self.public_call_requests.push(Counted::new(call_request, counter));\n    }\n\n    /// Enqueues a public function call, and designates it to be the teardown function for this tx. Only one teardown\n    /// function call can be made by a tx.\n    ///\n    /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n    /// to make use of this function.\n    ///\n    /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n    /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n    /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n    /// phase ensures the fee payer has sufficient balance to pay the proposer their fees. The teardown phase is\n    /// primarily intended to: calculate exactly how much the user owes, based on gas consumption, and refund the user\n    /// any change.\n    ///\n    /// Note: in some cases, the cost of refunding the user (i.e. DA costs of tx side-effects) might exceed the refund\n    /// amount. For app logic with fairly stable and predictable gas consumption, a material refund amount is unlikely.\n    /// For app logic with unpredictable gas consumption, a refund might be important to the user (e.g. if a hefty\n    /// function reverts very early). Wallet/FPC/Paymaster developers should be mindful of this.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the teardown function\n    /// * `function_selector` - 4-byte identifier of the function to call\n    /// * `args` - An array of fields to pass to the function.\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    pub fn set_public_teardown_function<let ArgsCount: u32>(\n        &mut self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; ArgsCount],\n        hide_msg_sender: bool,\n    ) {\n        let calldata = [function_selector.to_field()].concat(args);\n        let calldata_hash = hash_calldata_array(calldata);\n        execution_cache::store(calldata, calldata_hash);\n        self.set_public_teardown_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n    }\n\n    /// Low-level function to set the public teardown function.\n    ///\n    /// This is the underlying implementation for setting the teardown function call that will execute at the end of\n    /// the transaction. Instead of taking raw arguments, it accepts a hash of the arguments.\n    ///\n    /// Advanced function: Most developers should use `set_public_teardown_function` instead.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract containing the teardown function\n    /// * `calldata_hash` - Hash of the function calldata\n    /// * `is_static_call` - Whether this should be a read-only call\n    /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n    ///\n    pub fn set_public_teardown_function_with_calldata_hash(\n        &mut self,\n        contract_address: AztecAddress,\n        calldata_hash: Field,\n        is_static_call: bool,\n        hide_msg_sender: bool,\n    ) {\n        let is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n        assert_valid_public_call_data(calldata_hash);\n\n        let msg_sender = if hide_msg_sender {\n            NULL_MSG_SENDER_CONTRACT_ADDRESS\n        } else {\n            self.this_address()\n        };\n\n        self.public_teardown_call_request =\n            PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n    }\n\n    /// Increments the side-effect counter.\n    ///\n    /// Very low-level function.\n    ///\n    /// # Advanced\n    ///\n    /// Every side-effect of a private function is given a \"side-effect counter\", based on when it is created. This\n    /// PrivateContext is in charge of assigning the counters.\n    ///\n    /// The reason we have side-effect counters is complicated. Consider this illustrative pseudocode of inter-contract\n    /// function calls:\n    /// ```\n    /// contract A {\n    ///    let x = 5; // pseudocode for storage var x.\n    ///    fn a1 {\n    ///        read x; // value: 5, counter: 1.\n    ///        x = x + 1;\n    ///        write x; // value: 6, counter: 2.\n    ///\n    ///        B.b(); // start_counter: 2, end_counter: 4\n    ///\n    ///        read x; // value: 36, counter: 5.\n    ///        x = x + 1;\n    ///        write x; // value: 37, counter: 6.\n    ///    }\n    ///\n    ///    fn a2 {\n    ///        read x; // value: 6, counter: 3.\n    ///        x = x * x;\n    ///        write x; // value: 36, counter: 4.\n    ///    }\n    /// }\n    ///\n    /// contract B {\n    ///     fn b() {\n    ///         A.a2();\n    ///     }\n    /// }\n    /// ```\n    ///\n    /// Suppose a1 is the first function called. The comments show the execution counter of each side-effect, and what\n    /// the new value of `x` is.\n    ///\n    /// These (private) functions are processed by Aztec's kernel circuits in an order that is different from execution\n    /// order: All of A.a1 is proven before B.b is proven, before A.a2 is proven. So when we're in the 2nd execution\n    /// frame of A.a1 (after the call to B.b), the circuit needs to justify why x went from being `6` to `36`. But the\n    /// circuit doesn't know why, and given the order of proving, the kernel hasn't _seen_ a value of 36 get written\n    /// yet. The kernel needs to track big arrays of all side-effects of all private functions in a tx. Then, as it\n    /// recurses and processes B.b(), it will eventually see a value of 36 get written.\n    ///\n    /// Suppose side-effect counters weren't exposed: The kernel would only see this ordering (in order of proof\n    /// verification): [ A.a1.read, A.a1.write, A.a1.read, A.a1.write, A.a2.read, A.a2.write ]\n    /// [         5,          6,        36,         37,         6,         36 ]\n    /// The kernel wouldn't know _when_ B.b() was called within A.a1(), because it can't see what's going on within an\n    /// app circuit. So the kernel wouldn't know that the ordering of reads and writes should actually be: [ A.a1.read,\n    /// A.a1.write, A.a2.read, A.a2.write, A.a1.read, A.a1.write ]\n    /// [         5,          6,        6,         36,         36,         37 ]\n    ///\n    /// And so, we introduced side-effect counters: every private function must assign side-effect counters alongside\n    /// every side-effect that it emits, and also expose to the kernel the counters that it started and ended with.\n    /// This gives the kernel enough information to arrange all side-effects in the correct order. It can then catch\n    /// (for example) if a function tries to read state before it has been written (e.g. if A.a2() maliciously tried to\n    /// read a value of x=37) (e.g. if A.a1() maliciously tried to read x=6).\n    ///\n    /// If a malicious app contract _lies_ and does not count correctly:\n    /// - It cannot lie about its start and end counters because the kernel will catch this.\n    /// - It _could_ lie about its intermediate counters:\n    /// - 1. It could not increment its side-effects correctly\n    /// - 2. It could label its side-effects with counters outside of its start and end counters' range. The kernel\n    /// will catch 2. The kernel will not catch 1., but this would only cause corruption to the private state of the\n    /// malicious contract, and not any other contracts (because a contract can only modify its own state). If a \"good\"\n    /// contract is given _read access_ to a maliciously-counting contract (via an external getter function, or by\n    /// reading historic state from the archive tree directly), and they then make state changes to their _own_ state\n    /// accordingly, that could be dangerous. Developers should be mindful not to trust the claimed innards of external\n    /// contracts unless they have audited/vetted the contracts including vetting the side-effect counter\n    /// incrementation. This is a similar paradigm to Ethereum smart contract development: you must vet external\n    /// contracts that your contract relies upon, and you must not make any presumptions about their claimed behaviour.\n    /// (Hopefully if a contract imports a version of aztec-nr, we will get contract verification tooling that can\n    /// validate the authenticity of the imported aztec-nr package, and hence infer that the side- effect counting will\n    /// be correct, without having to re-audit such logic for every contract).\n    ///\n    fn next_counter(&mut self) -> u32 {\n        let counter = self.side_effect_counter;\n        self.side_effect_counter += 1;\n        counter\n    }\n}\n\nimpl Empty for PrivateContext {\n    fn empty() -> Self {\n        PrivateContext {\n            inputs: PrivateContextInputs::empty(),\n            side_effect_counter: 0 as u32,\n            min_revertible_side_effect_counter: 0 as u32,\n            is_fee_payer: false,\n            args_hash: 0,\n            return_hash: 0,\n            expiration_timestamp: 0,\n            note_hash_read_requests: BoundedVec::new(),\n            nullifier_read_requests: BoundedVec::new(),\n            key_validation_requests_and_separators: BoundedVec::new(),\n            note_hashes: BoundedVec::new(),\n            nullifiers: BoundedVec::new(),\n            private_call_requests: BoundedVec::new(),\n            public_call_requests: BoundedVec::new(),\n            public_teardown_call_request: PublicCallRequest::empty(),\n            l2_to_l1_msgs: BoundedVec::new(),\n            anchor_block_header: BlockHeader::empty(),\n            private_logs: BoundedVec::new(),\n            contract_class_logs_hashes: BoundedVec::new(),\n            last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n            expected_non_revertible_side_effect_counter: 0,\n            expected_revertible_side_effect_counter: 0,\n        }\n    }\n}\n"
     },
-    "70": {
+    "68": {
       "function_locations": [
         {
           "name": "<impl Eq for PublicContext>::eq",
@@ -7341,7 +7301,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/public_context.nr",
       "source": "use crate::{\n    context::gas::GasOpts,\n    hash::{\n        compute_l1_to_l2_message_hash, compute_l1_to_l2_message_nullifier, compute_secret_hash,\n        compute_siloed_nullifier,\n    },\n    oracle::avm,\n};\nuse crate::protocol::{\n    abis::function_selector::FunctionSelector,\n    address::{AztecAddress, EthAddress},\n    constants::{MAX_U32_VALUE, NULL_MSG_SENDER_CONTRACT_ADDRESS},\n    traits::{Empty, FromField, Packable, Serialize, ToField},\n    utils::writer::Writer,\n};\n\n/// # PublicContext\n///\n/// The **main interface** between an #[external(\"public\")] function and the Aztec blockchain.\n///\n/// An instance of the PublicContext is initialized automatically at the outset of every public function, within the\n/// #[external(\"public\")] macro, so you'll never need to consciously instantiate this yourself.\n///\n/// The instance is always named `context`, and it will always be available within the body of every\n/// #[external(\"public\")] function in your smart contract.\n///\n/// Typical usage for a smart contract developer will be to call getter methods of the PublicContext.\n///\n/// _Pushing_ data and requests to the context is mostly handled within aztec-nr's own functions, so typically a smart\n/// contract developer won't need to call any setter methods directly.\n///\n/// ## Responsibilities\n/// - Exposes contextual data to a public function:\n/// - Data relating to how this public function was called:\n/// - msg_sender, this_address\n/// - Data relating to the current blockchain state:\n/// - timestamp, block_number, chain_id, version\n/// - Gas and fee information\n/// - Provides state access:\n/// - Read/write public storage (key-value mapping)\n/// - Check existence of notes and nullifiers (Some patterns use notes & nullifiers to store public (not private)\n/// information)\n///   - Enables consumption of L1->L2 messages.\n/// - Enables calls to other public smart contract functions:\n/// - Writes data to the blockchain:\n/// - Updates to public state variables\n/// - New public logs (for events)\n///   - New L2->L1 messages\n/// - New notes & nullifiers (E.g. pushing public info to notes/nullifiers, or for completing \"partial notes\")\n///\n/// ## Key Differences from Private Execution\n///\n/// Unlike private functions -- which are executed on the user's device and which can only reference historic state --\n/// public functions are executed by a block proposer and are executed \"live\" on the _current_ tip of the chain. This\n/// means public functions can:\n/// - Read and write _current_ public state\n/// - Immediately see the effects of earlier transactions in the same block\n///\n/// Also, public functions are executed within a zkVM (the \"AVM\"), so that they can _revert_ whilst still ensuring\n/// payment to the proposer and prover. (Private functions cannot revert: they either succeed, or they cannot be\n/// included).\n///\n/// ## Optimising Public Functions\n///\n/// Using the AVM to execute public functions means they compile down to \"AVM bytecode\" instead of the ACIR that\n/// private functions (standalone circuits) compile to. Therefore the approach to optimising a public function is\n/// fundamentally different from optimising a public function.\n///\npub struct PublicContext {\n    pub args_hash: Option<Field>,\n    pub compute_args_hash: fn() -> Field,\n}\n\nimpl Eq for PublicContext {\n    fn eq(self, other: Self) -> bool {\n        (self.args_hash == other.args_hash)\n        // Can't compare the function compute_args_hash\n    }\n}\n\nimpl PublicContext {\n    /// Creates a new PublicContext instance.\n    ///\n    /// Low-level function: This is called automatically by the #[external(\"public\")] macro, so you shouldn't need to\n    /// be called directly by smart contract developers.\n    ///\n    /// # Arguments\n    /// * `compute_args_hash` - Function to compute the args_hash\n    ///\n    /// # Returns\n    /// * A new PublicContext instance\n    ///\n    pub fn new(compute_args_hash: fn() -> Field) -> Self {\n        PublicContext { args_hash: Option::none(), compute_args_hash }\n    }\n\n    /// Emits a _public_ log that will be visible onchain to everyone.\n    ///\n    /// # Arguments\n    /// * `tag` - A tag placed at `fields[0]` of the emitted log. Nodes index logs by this value, allowing\n    /// clients to efficiently query for matching logs without scanning all of them.\n    /// * `log` - The data to log, must implement Serialize trait.\n    ///\n    /// ## Safety\n    ///\n    /// The `tag` should be domain-separated (e.g. via [`crate::protocol::hash::compute_log_tag`]) to prevent\n    /// collisions between logs from different sources. Without domain separation, two unrelated log types that\n    /// happen to share a raw tag value become indistinguishable. Prefer `self.emit(event)` for events, which\n    /// handles tagging automatically.\n    pub fn emit_public_log_unsafe<T>(_self: Self, tag: Field, log: T)\n    where\n        T: Serialize,\n    {\n        // We use a Writer to serialize the log directly after the tag, avoiding an extra O(n) copy that would\n        // result from serializing first and then prepending the tag.\n        let mut writer: Writer<1 + <T as Serialize>::N> = Writer::new();\n        writer.write(tag);\n        Serialize::stream_serialize(log, &mut writer);\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { avm::emit_public_log(writer.finish().as_vector()) };\n    }\n\n    /// Checks if a given note hash exists in the note hash tree at a particular leaf_index.\n    ///\n    /// # Arguments\n    /// * `note_hash` - The note hash to check for existence\n    /// * `leaf_index` - The index where the note hash should be located\n    ///\n    /// # Returns\n    /// * `bool` - True if the note hash exists at the specified index\n    ///\n    pub fn note_hash_exists(_self: Self, note_hash: Field, leaf_index: u64) -> bool {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { avm::note_hash_exists(note_hash, leaf_index) } == 1\n    }\n\n    /// Checks if a specific L1-to-L2 message exists in the L1-to-L2 message tree at a particular leaf index.\n    ///\n    /// Common use cases include token bridging, cross-chain governance, and triggering L2 actions based on L1 events.\n    ///\n    /// This function should be called before attempting to consume an L1-to-L2 message.\n    ///\n    /// # Arguments\n    /// * `msg_hash` - Hash of the L1-to-L2 message to check\n    /// * `msg_leaf_index` - The index where the message should be located\n    ///\n    /// # Returns\n    /// * `bool` - True if the message exists at the specified index\n    ///\n    /// # Advanced\n    /// * Uses the AVM l1_to_l2_msg_exists opcode for tree lookup\n    /// * Messages are copied from L1 Inbox to L2 by block proposers\n    ///\n    pub fn l1_to_l2_msg_exists(_self: Self, msg_hash: Field, msg_leaf_index: Field) -> bool {\n        // Safety: AVM opcodes are constrained by the AVM itself TODO(alvaro): Make l1l2msg leaf index a u64 upstream\n        unsafe { avm::l1_to_l2_msg_exists(msg_hash, msg_leaf_index as u64) } == 1\n    }\n\n    /// Returns `true` if an `unsiloed_nullifier` has been emitted by `contract_address`.\n    ///\n    /// Note that unsiloed nullifiers are not the actual values stored in the nullifier tree: they are first siloed via\n    /// [`crate::hash::compute_siloed_nullifier`] with the emitting contract's address.\n    ///\n    /// ## Use Cases\n    ///\n    /// Nullifiers are typically used as a _privacy-preserving_ record of a one-time action, but they can also be used\n    /// to efficiently record _public_ one-time actions as well. This is cheaper than using public storage, and has the\n    /// added benefit of the nullifier being emittable from a private function.\n    ///\n    /// An example is to check whether a contract has been published: we emit a nullifier that is deterministic and\n    /// which has a _public_ preimage.\n    ///\n    /// ## Public vs Private\n    ///\n    /// In general, one should not attempt to prove nullifier non-existence in private, as that will not consider the\n    /// possibility of the nullifier having been emitted in any transaction between the anchor block and the inclusion\n    /// block. Private functions instead prove existence via\n    /// [`crate::context::PrivateContext::assert_nullifier_exists`]\n    /// and 'prove' non-existence by _emitting_ the nullifer, which would cause the transaction to fail if the\n    /// nullifier existed.\n    ///\n    /// This is not the case in public functions, which **do** have access to the tip of the blockchain and so can\n    /// reliably prove whether a nullifier exists or not.\n    ///\n    /// ## Safety\n    ///\n    /// While it is safe to rely on this function's return value to determine if a nullifier exists or not, it is often\n    /// **not** safe to infer additional information from that. In particular, it is **unsafe** to infer that the\n    /// existence of a nullifier emitted from a private function implies that all other side-effects of said private\n    /// execution have been completed, more concretely that any enqueued public calls have been executed.\n    ///\n    /// For example, if a function in contract `A` privately emits nullifier `X` and then enqueues public function `Y`,\n    /// then it is **unsafe** for a contract `B` to infer that `Y` has alredy executed simply because `X` exists.\n    ///\n    /// This is because **all** private transaction effects are committed _before_ enqueued public functions are run\n    /// (in\n    /// order to not reveal detailed timing information about the transaction), so it is possible to observe a\n    /// nullifier that was emitted alongside the enqueuing of a public call **before** said call has been completed.\n    ///\n    /// ## Cost\n    ///\n    /// This emits the `CHECKNULLIFIEREXISTS` opcode, which conceptually performs a merkle inclusion proof on the\n    /// nullifier tree (both when the nullifier exists and when it doesn't).\n    pub fn nullifier_exists_unsafe(_self: Self, unsiloed_nullifier: Field, contract_address: AztecAddress) -> bool {\n        let siloed_nullifier = compute_siloed_nullifier(contract_address, unsiloed_nullifier);\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { avm::nullifier_exists(siloed_nullifier) } == 1\n    }\n\n    /// Consumes a message sent from Ethereum (L1) to Aztec (L2) -- effectively marking it as \"read\".\n    ///\n    /// Use this function if you only want the message to ever be \"referred to\" once. Once consumed using this method,\n    /// the message cannot be consumed again, because a nullifier is emitted. If your use case wants for the message to\n    /// be read unlimited times, then you can always read any historic message from the L1-to-L2 messages tree, using\n    /// the `l1_to_l2_msg_exists` method. Messages never technically get deleted from that tree.\n    ///\n    /// The message will first be inserted into an Aztec \"Inbox\" smart contract on L1. It will not be available for\n    /// consumption immediately. Messages get copied-over from the L1 Inbox to L2 by the next Proposer in batches. So\n    /// you will need to wait until the messages are copied before you can consume them.\n    ///\n    /// # Arguments\n    /// * `content` - The message content that was sent from L1\n    /// * `secret` - Secret value used for message privacy (if needed)\n    /// * `sender` - Ethereum address that sent the message\n    /// * `leaf_index` - Index of the message in the L1-to-L2 message tree\n    ///\n    /// # Advanced\n    /// * Validates message existence in the L1-to-L2 message tree\n    /// * Prevents double-consumption by emitting a nullifier\n    /// * Message hash is computed from all parameters + chain context\n    /// * Will revert if message doesn't exist or was already consumed\n    ///\n    pub fn consume_l1_to_l2_message(self: Self, content: Field, secret: Field, sender: EthAddress, leaf_index: Field) {\n        let secret_hash = compute_secret_hash(secret);\n        let message_hash = compute_l1_to_l2_message_hash(\n            sender,\n            self.chain_id(),\n            /*recipient=*/\n            self.this_address(),\n            self.version(),\n            content,\n            secret_hash,\n            leaf_index,\n        );\n        let nullifier = compute_l1_to_l2_message_nullifier(message_hash, secret);\n\n        assert(!self.nullifier_exists_unsafe(nullifier, self.this_address()), \"L1-to-L2 message is already nullified\");\n        assert(self.l1_to_l2_msg_exists(message_hash, leaf_index), \"Tried to consume nonexistent L1-to-L2 message\");\n\n        self.push_nullifier(nullifier);\n    }\n\n    /// Sends an \"L2 -> L1 message\" from this function (Aztec, L2) to a smart contract on Ethereum (L1). L1 contracts\n    /// which are designed to send/receive messages to/from Aztec are called \"Portal Contracts\".\n    ///\n    /// Common use cases include withdrawals, cross-chain asset transfers, and triggering L1 actions based on L2 state\n    /// changes.\n    ///\n    /// The message will be inserted into an Aztec \"Outbox\" contract on L1, when this transaction's block is proposed\n    /// to L1. Sending the message will not result in any immediate state changes in the target portal contract. The\n    /// message will need to be manually consumed from the Outbox through a separate Ethereum transaction: a user will\n    /// need to call a function of the portal contract -- a function specifically designed to make a call to the Outbox\n    /// to consume the message. The message will only be available for consumption once the _epoch_ proof has been\n    /// submitted. Given that there are multiple Aztec blocks within an epoch, it might take some time for this epoch\n    /// proof to be submitted -- especially if the block was near the start of an epoch.\n    ///\n    /// # Arguments\n    /// * `recipient` - Ethereum address that will receive the message\n    /// * `content` - Message content (32 bytes as a Field element)\n    ///\n    pub fn message_portal(_self: Self, recipient: EthAddress, content: Field) {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { avm::send_l2_to_l1_msg(recipient, content) };\n    }\n\n    /// Calls a public function on another contract.\n    ///\n    /// Will revert if the called function reverts or runs out of gas.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract to call\n    /// * `function_selector` - Function to call on the target contract\n    /// * `args` - Arguments to pass to the function\n    /// * `gas_opts` - An optional allocation of gas to the called function.\n    ///\n    /// # Returns\n    /// * `[Field]` - Return data from the called function\n    ///\n    pub unconstrained fn call_public_function<let N: u32>(\n        _self: Self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; N],\n        gas_opts: GasOpts,\n    ) -> [Field] {\n        let calldata = [function_selector.to_field()].concat(args);\n\n        avm::call(\n            gas_opts.l2_gas.unwrap_or(MAX_U32_VALUE),\n            gas_opts.da_gas.unwrap_or(MAX_U32_VALUE),\n            contract_address,\n            calldata,\n        );\n        // Use success_copy to determine whether the call succeeded\n        let success = avm::success_copy();\n\n        let result_data = avm::returndata_copy(0, avm::returndata_size());\n        if !success {\n            // Rethrow the revert data.\n            avm::revert(result_data);\n        }\n        result_data\n    }\n\n    /// Makes a read-only call to a public function on another contract.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function cannot modify state or emit events. Any nested\n    /// calls are constrained to also be staticcalls.\n    ///\n    /// Useful for querying data from other contracts safely.\n    ///\n    /// Will revert if the called function reverts or runs out of gas.\n    ///\n    /// # Arguments\n    /// * `contract_address` - Address of the contract to call\n    /// * `function_selector` - Function to call on the target contract\n    /// * `args` - Array of arguments to pass to the called function\n    /// * `gas_opts` - An optional allocation of gas to the called function.\n    ///\n    /// # Returns\n    /// * `[Field]` - Return data from the called function\n    ///\n    pub unconstrained fn static_call_public_function<let N: u32>(\n        _self: Self,\n        contract_address: AztecAddress,\n        function_selector: FunctionSelector,\n        args: [Field; N],\n        gas_opts: GasOpts,\n    ) -> [Field] {\n        let calldata = [function_selector.to_field()].concat(args);\n\n        avm::call_static(\n            gas_opts.l2_gas.unwrap_or(MAX_U32_VALUE),\n            gas_opts.da_gas.unwrap_or(MAX_U32_VALUE),\n            contract_address,\n            calldata,\n        );\n        // Use success_copy to determine whether the call succeeded\n        let success = avm::success_copy();\n\n        let result_data = avm::returndata_copy(0, avm::returndata_size());\n        if !success {\n            // Rethrow the revert data.\n            avm::revert(result_data);\n        }\n        result_data\n    }\n\n    /// Adds a new note hash to the Aztec blockchain's global Note Hash Tree.\n    ///\n    /// Notes are ordinarily constructed and emitted by _private_ functions, to ensure that both the content of the\n    /// note, and the contract that emitted the note, stay private.\n    ///\n    /// There are however some useful patterns whereby a note needs to contain _public_ data. The ability to push a new\n    /// note_hash from a _public_ function means that notes can be injected with public data immediately -- as soon as\n    /// the public value is known. The slower alternative would be to submit a follow-up transaction so that a private\n    /// function can inject the data. Both are possible on Aztec.\n    ///\n    /// Search \"Partial Note\" for a very common pattern which enables a note to be \"partially\" populated with some data\n    /// in a _private_ function, and then later \"completed\" with some data in a public function.\n    ///\n    /// # Arguments\n    /// * `note_hash` - The hash of the note to add to the tree\n    ///\n    /// # Advanced\n    /// * The note hash will be siloed with the contract address by the protocol\n    ///\n    pub fn push_note_hash(_self: Self, note_hash: Field) {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { avm::emit_note_hash(note_hash) };\n    }\n\n    /// Creates a new [nullifier](crate::nullifier).\n    ///\n    /// While nullifiers are primarily intended as a _privacy-preserving_ record of a one-time action, they can also\n    /// be used to efficiently record _public_ one-time actions. This function allows creating nullifiers from public\n    /// contract functions, which behave just like those created from private functions.\n    ///\n    /// ## Safety\n    ///\n    /// This is a low-level function that must be used with great care to avoid subtle corruption of contract state.\n    ///\n    /// In particular, callers must ensure all nullifiers created by a contract are properly domain-separated, so that\n    /// unrelated components don't interfere with one another (e.g. a transaction nullifier accidentally marking a\n    /// variable as initialized). Note nullifiers should only be created via\n    /// [`crate::context::PrivateContext::push_nullifier_for_note_hash`].\n    ///\n    /// ## Advanced\n    ///\n    /// The raw `nullifier` is not what is inserted into the Aztec state tree: it will be first siloed by contract\n    /// address via [`crate::protocol::hash::compute_siloed_nullifier`] in order to prevent accidental or malicious\n    /// interference of nullifiers from different contracts.\n    pub fn push_nullifier(_self: Self, nullifier: Field) {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { avm::emit_nullifier(nullifier) };\n    }\n\n    /// Returns the address of the current contract being executed.\n    ///\n    /// This is equivalent to `address(this)` in Solidity (hence the name). Use this to identify the current contract's\n    /// address, commonly needed for access control or when interacting with other contracts.\n    ///\n    /// # Returns\n    /// * `AztecAddress` - The contract address of the current function being executed.\n    ///\n    pub fn this_address(_self: Self) -> AztecAddress {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            avm::address()\n        }\n    }\n\n    /// Returns the contract address that initiated this function call.\n    ///\n    /// This is similar to `msg.sender` in Solidity (hence the name).\n    ///\n    /// Important Note: If the calling function is a _private_ function, then it had the option of hiding its address\n    /// when enqueuing this public function call. In such cases, this method will return `Option<AztecAddress>::none`.\n    /// If the calling function is a _public_ function, it will always return an `Option<AztecAddress>::some` (i.e. a\n    /// non-null value).\n    ///\n    /// # Returns\n    /// * `Option<AztecAddress>` - The address of the smart contract that called this function (be it an app contract\n    /// or a user's account contract).\n    ///\n    /// # Advanced\n    /// * Value is provided by the AVM sender opcode\n    /// * In nested calls, this is the immediate caller, not the original transaction sender\n    ///\n    pub fn maybe_msg_sender(_self: Self) -> Option<AztecAddress> {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        let maybe_msg_sender = unsafe { avm::sender() };\n        if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n            Option::none()\n        } else {\n            Option::some(maybe_msg_sender)\n        }\n    }\n\n    /// Returns the function selector of the currently-executing function.\n    ///\n    /// This is similar to `msg.sig` in Solidity, returning the first 4 bytes of the function signature.\n    ///\n    /// # Returns\n    /// * `FunctionSelector` - The 4-byte function identifier\n    ///\n    /// # Advanced\n    /// * Extracted from the first element of calldata\n    /// * Used internally for function dispatch in the AVM\n    ///\n    pub fn selector(_self: Self) -> FunctionSelector {\n        // The selector is the first element of the calldata when calling a public function through dispatch.\n        // Safety: AVM opcodes are constrained by the AVM itself.\n        let raw_selector: [Field; 1] = unsafe { avm::calldata_copy(0, 1) };\n        FunctionSelector::from_field(raw_selector[0])\n    }\n\n    /// Returns the hash of the arguments passed to the current function.\n    ///\n    /// Very low-level function: The #[external(\"public\")] macro uses this internally. Smart contract developers\n    /// typically won't need to access this directly as arguments are automatically made available.\n    ///\n    /// # Returns\n    /// * `Field` - Hash of the function arguments\n    ///\n    pub fn get_args_hash(mut self) -> Field {\n        if !self.args_hash.is_some() {\n            self.args_hash = Option::some((self.compute_args_hash)());\n        }\n\n        self.args_hash.unwrap_unchecked()\n    }\n\n    /// Returns the \"transaction fee\" for the current transaction. This is the final tx fee that will be deducted from\n    /// the fee_payer's \"fee-juice\" balance (in the protocol's Base Rollup circuit).\n    ///\n    /// # Returns\n    /// * `Field` - The actual, final cost of the transaction, taking into account: the actual gas used during the\n    /// setup and app-logic phases, and the fixed amount of gas that's been allocated by the user for the teardown\n    /// phase. I.e. effectiveL2FeePerGas * l2GasUsed + effectiveDAFeePerGas * daGasUsed\n    ///\n    /// This will return `0` during the \"setup\" and \"app-logic\" phases of tx execution (because the final tx fee is not\n    /// known at that time). This will only return a nonzero value during the \"teardown\" phase of execution, where the\n    /// final tx fee can actually be computed.\n    ///\n    /// Regardless of _when_ this function is called during the teardown phase, it will always return the same final tx\n    /// fee value. The teardown phase does not consume a variable amount of gas: it always consumes a pre-allocated\n    /// amount of gas, as specified by the user when they generate their tx.\n    ///\n    pub fn transaction_fee(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            avm::transaction_fee()\n        }\n    }\n\n    /// Returns the chain ID of the current network.\n    ///\n    /// This is similar to `block.chainid` in Solidity. Returns the unique identifier for the blockchain network this\n    /// transaction is executing on.\n    ///\n    /// Helps prevent cross-chain replay attacks. Useful if implementing multi-chain contract logic.\n    ///\n    /// # Returns\n    /// * `Field` - The chain ID as a field element\n    ///\n    pub fn chain_id(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            avm::chain_id()\n        }\n    }\n\n    /// Returns the Aztec protocol version that this transaction is executing under. Different versions may have\n    /// different rules, opcodes, or cryptographic primitives.\n    ///\n    /// This is similar to how Ethereum has different EVM versions.\n    ///\n    /// Useful for forward/backward compatibility checks\n    ///\n    /// Not to be confused with contract versions; this is the protocol version.\n    ///\n    /// # Returns\n    /// * `Field` - The protocol version as a field element\n    ///\n    pub fn version(_self: Self) -> Field {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            avm::version()\n        }\n    }\n    /// Returns the current block number.\n    ///\n    /// This is similar to `block.number` in Solidity.\n    ///\n    /// Note: the current block number is only available within a public function (as opposed to a private function).\n    ///\n    /// Note: the time intervals between blocks should not be relied upon as being consistent:\n    /// - Timestamps of blocks fall within a range, rather than at exact regular intervals.\n    /// - Slots can be missed.\n    /// - Protocol upgrades can completely change the intervals between blocks (and indeed the current roadmap plans to\n    /// reduce the time between blocks, eventually). Use `context.timestamp()` for more-reliable time-based logic.\n    ///\n    /// # Returns\n    /// * `u32` - The current block number\n    ///\n    pub fn block_number(_self: Self) -> u32 {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            avm::block_number()\n        }\n    }\n\n    /// Returns the timestamp of the current block.\n    ///\n    /// This is similar to `block.timestamp` in Solidity.\n    ///\n    /// All functions of all transactions in a block share the exact same timestamp (even though technically each\n    /// transaction is executed one-after-the-other).\n    ///\n    /// Important note: Timestamps of Aztec blocks are not at reliably-fixed intervals. The proposer of the block has\n    /// some flexibility to choose a timestamp which is in a valid _range_: Obviously the timestamp of this block must\n    /// be strictly greater than that of the previous block, and must must be less than the timestamp of whichever\n    /// ethereum block the aztec block is proposed to. Furthermore, if the timestamp is not deemed close enough to the\n    /// actual current time, the committee of validators will not attest to the block.\n    ///\n    /// # Returns\n    /// * `u64` - Unix timestamp in seconds\n    ///\n    pub fn timestamp(_self: Self) -> u64 {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            avm::timestamp()\n        }\n    }\n\n    /// Returns the fee per unit of L2 gas for this transaction (aka the \"L2 gas price\"), as chosen by the user.\n    ///\n    /// L2 gas covers the cost of executing public functions and handling side-effects within the AVM.\n    ///\n    /// # Returns\n    /// * `u128` - Fee per unit of L2 gas\n    ///\n    /// Wallet developers should be mindful that the choice of gas price (which is publicly visible) can leak\n    /// information about the user, e.g.:\n    /// - which wallet software the user is using;\n    /// - the amount of time which has elapsed from the time the user's wallet chose a gas price (at the going rate),\n    /// to the time of tx submission. This can give clues about the proving time, and hence the nature of the tx.\n    /// - the urgency of the transaction (which is kind of unavoidable, if the tx is indeed urgent).\n    /// - the wealth of the user.\n    /// - the exact user (if the gas price is explicitly chosen by the user to be some unique number like 0.123456789,\n    /// or their favorite number). Wallet devs might wish to consider fuzzing the choice of gas price.\n    ///\n    pub fn min_fee_per_l2_gas(_self: Self) -> u128 {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            avm::min_fee_per_l2_gas()\n        }\n    }\n\n    /// Returns the fee per unit of DA (Data Availability) gas (aka the \"DA gas price\").\n    ///\n    /// DA gas covers the cost of making transaction data available on L1.\n    ///\n    /// See the warning in `min_fee_per_l2_gas` for how gas prices can be leaky.\n    ///\n    /// # Returns\n    /// * `u128` - Fee per unit of DA gas\n    ///\n    pub fn min_fee_per_da_gas(_self: Self) -> u128 {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            avm::min_fee_per_da_gas()\n        }\n    }\n\n    /// Returns the remaining L2 gas available for this transaction.\n    ///\n    /// Different AVM opcodes consume different amounts of gas.\n    ///\n    /// # Returns\n    /// * `u32` - Remaining L2 gas units\n    ///\n    pub fn l2_gas_left(_self: Self) -> u32 {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            avm::l2_gas_left()\n        }\n    }\n\n    /// Returns the remaining DA (Data Availability) gas available for this transaction.\n    ///\n    /// DA gas is consumed when emitting data that needs to be made available on L1, such as public logs or state\n    /// updates. All of the side-effects from the private part of the tx also consume DA gas before execution of any\n    /// public functions even begins.\n    ///\n    /// # Returns\n    /// * `u32` - Remaining DA gas units\n    ///\n    pub fn da_gas_left(_self: Self) -> u32 {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe {\n            avm::da_gas_left()\n        }\n    }\n\n    /// Checks if the current execution is within a staticcall context, where no state changes or logs are allowed to\n    /// be emitted (by this function or any nested function calls).\n    ///\n    /// # Returns\n    /// * `bool` - True if in staticcall context, false otherwise\n    ///\n    pub fn is_static_call(_self: Self) -> bool {\n        // Safety: AVM opcodes are constrained by the AVM itself\n        unsafe { avm::is_static_call() } == 1\n    }\n\n    /// Reads raw field values from public storage. Reads N consecutive storage slots starting from the given slot.\n    ///\n    /// Very low-level function. Users should typically use the public state variable abstractions to perform reads:\n    /// PublicMutable & PublicImmutable.\n    ///\n    /// # Arguments\n    /// * `storage_slot` - The starting storage slot to read from\n    ///\n    /// # Returns\n    /// * `[Field; N]` - Array of N field values from consecutive storage slots\n    ///\n    /// # Generic Parameters\n    /// * `N` - the number of consecutive slots to return, starting from the `storage_slot`.\n    ///\n    pub fn raw_storage_read<let N: u32>(self: Self, storage_slot: Field) -> [Field; N] {\n        let mut out = [0; N];\n        for i in 0..N {\n            // Safety: AVM opcodes are constrained by the AVM itself\n            out[i] = unsafe { avm::storage_read(storage_slot + i as Field, self.this_address().to_field()) };\n        }\n        out\n    }\n\n    /// Reads a typed value from public storage.\n    ///\n    /// Low-level function. Users should typically use the public state variable abstractions to perform reads:\n    /// PublicMutable & PublicImmutable.\n    ///\n    /// # Arguments\n    /// * `storage_slot` - The storage slot to read from\n    ///\n    /// # Returns\n    /// * `T` - The deserialized value from storage\n    ///\n    /// # Generic Parameters\n    /// * `T` - The type that the caller expects to read from the `storage_slot`.\n    ///\n    pub fn storage_read<T>(self, storage_slot: Field) -> T\n    where\n        T: Packable,\n    {\n        T::unpack(self.raw_storage_read(storage_slot))\n    }\n\n    /// Writes raw field values to public storage. Writes to N consecutive storage slots starting from the given slot.\n    ///\n    /// Very low-level function. Users should typically use the public state variable abstractions to perform writes:\n    /// PublicMutable & PublicImmutable.\n    ///\n    /// Public storage writes take effect immediately.\n    ///\n    /// # Arguments\n    /// * `storage_slot` - The starting storage slot to write to\n    /// * `values` - Array of N Fields to write to storage\n    ///\n    pub fn raw_storage_write<let N: u32>(_self: Self, storage_slot: Field, values: [Field; N]) {\n        for i in 0..N {\n            // Safety: AVM opcodes are constrained by the AVM itself\n            unsafe { avm::storage_write(storage_slot + i as Field, values[i]) };\n        }\n    }\n\n    /// Writes a typed value to public storage.\n    ///\n    /// Low-level function. Users should typically use the public state variable abstractions to perform writes:\n    /// PublicMutable & PublicImmutable.\n    ///\n    /// # Arguments\n    /// * `storage_slot` - The storage slot to write to\n    /// * `value` - The typed value to write to storage\n    ///\n    /// # Generic Parameters\n    /// * `T` - The type to write to storage.\n    ///\n    pub fn storage_write<T>(self, storage_slot: Field, value: T)\n    where\n        T: Packable,\n    {\n        self.raw_storage_write(storage_slot, value.pack());\n    }\n}\n\nimpl Empty for PublicContext {\n    fn empty() -> Self {\n        PublicContext::new(|| 0)\n    }\n}\n"
     },
-    "71": {
+    "69": {
       "function_locations": [
         {
           "name": "ReturnsHash::new",
@@ -7367,7 +7327,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/returns_hash.nr",
       "source": "use crate::{hash::hash_args, oracle::execution_cache};\nuse crate::protocol::traits::Deserialize;\n\n/// The hash of a private contract function call's return value.\n///\n/// Use [`ReturnsHash::get_preimage`] to get the underlying value.\n///\n/// The kernels don't process the actual return values but instead their hashes, so it is up to contracts to populate\n/// oracles with the preimages of these hashes on return to make them available to their callers.\n///\n/// Public calls don't utilize this mechanism since the AVM does process the full return values.\npub struct ReturnsHash {\n    hash: Field,\n}\n\nimpl ReturnsHash {\n    pub fn new(hash: Field) -> Self {\n        ReturnsHash { hash }\n    }\n\n    /// Fetches the underlying return value from an oracle, constraining that it corresponds to the return data hash.\n    pub fn get_preimage<T>(self) -> T\n    where\n        T: Deserialize,\n    {\n        // Safety: We verify that the value returned by `load` is the preimage of `hash`, fully constraining it. If `T`\n        // is `()`, then `preimage` must be an array of length 0 (since that is `()`'s deserialization length).\n        // `hash_args` handles empty arrays following the protocol rules (i.e. an empty args array is signaled with a\n        // zero hash), correctly constraining `self.hash`.\n        let preimage = unsafe { execution_cache::load(self.hash) };\n        assert_eq(self.hash, hash_args(preimage), \"Preimage mismatch\");\n\n        Deserialize::deserialize(preimage)\n    }\n}\n\nmod test {\n    use crate::{\n        hash::hash_args,\n        oracle::execution_cache,\n        test::{helpers::test_environment::TestEnvironment, mocks::MockStruct},\n    };\n    use crate::protocol::traits::Serialize;\n    use super::ReturnsHash;\n    use std::test::OracleMock;\n\n    #[test]\n    unconstrained fn retrieves_preimage() {\n        let env = TestEnvironment::new();\n        env.private_context(|_| {\n            let value = MockStruct::new(4, 7);\n            let serialized = value.serialize();\n\n            let hash = hash_args(serialized);\n            execution_cache::store(serialized, hash);\n\n            assert_eq(ReturnsHash::new(hash).get_preimage(), value);\n        });\n    }\n\n    #[test]\n    unconstrained fn retrieves_empty_preimage() {\n        let env = TestEnvironment::new();\n        env.private_context(|_| {\n            let value = ();\n            let serialized = [];\n\n            let hash = hash_args(serialized);\n            execution_cache::store(serialized, hash);\n\n            assert_eq(ReturnsHash::new(hash).get_preimage(), value);\n        });\n    }\n\n    #[test(should_fail_with = \"Preimage mismatch\")]\n    unconstrained fn rejects_bad_preimage() {\n        let value = MockStruct::new(4, 7);\n        let serialized = value.serialize();\n\n        let mut bad_serialized = serialized;\n        bad_serialized[0] += 1;\n\n        let hash = hash_args(serialized);\n\n        let _ = OracleMock::mock(\"aztec_prv_getHashPreimage\").returns(bad_serialized);\n        assert_eq(ReturnsHash::new(hash).get_preimage(), value);\n    }\n}\n"
     },
-    "72": {
+    "70": {
       "function_locations": [
         {
           "name": "UtilityContext::new",
@@ -7413,7 +7373,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/utility_context.nr",
       "source": "use crate::oracle::{execution::get_utility_context, storage::storage_read};\nuse crate::protocol::{abis::block_header::BlockHeader, address::AztecAddress, traits::Packable};\n\n// If you'll modify this struct don't forget to update utility_context.ts as well.\npub struct UtilityContext {\n    block_header: BlockHeader,\n    contract_address: AztecAddress,\n}\n\nimpl UtilityContext {\n    pub unconstrained fn new() -> Self {\n        get_utility_context()\n    }\n\n    pub unconstrained fn at(contract_address: AztecAddress) -> Self {\n        // We get a context with default contract address, and then we construct the final context with the provided\n        // contract address.\n        let default_context = get_utility_context();\n\n        Self { block_header: default_context.block_header, contract_address }\n    }\n\n    pub fn block_header(self) -> BlockHeader {\n        self.block_header\n    }\n\n    pub fn block_number(self) -> u32 {\n        self.block_header.block_number()\n    }\n\n    pub fn timestamp(self) -> u64 {\n        self.block_header.timestamp()\n    }\n\n    pub fn this_address(self) -> AztecAddress {\n        self.contract_address\n    }\n\n    pub fn version(self) -> Field {\n        self.block_header.version()\n    }\n\n    pub fn chain_id(self) -> Field {\n        self.block_header.chain_id()\n    }\n\n    pub unconstrained fn raw_storage_read<let N: u32>(self: Self, storage_slot: Field) -> [Field; N] {\n        storage_read(self.block_header, self.this_address(), storage_slot)\n    }\n\n    pub unconstrained fn storage_read<T>(self, storage_slot: Field) -> T\n    where\n        T: Packable,\n    {\n        T::unpack(self.raw_storage_read(storage_slot))\n    }\n}\n"
     },
-    "74": {
+    "72": {
       "function_locations": [
         {
           "name": "ContractSelfPublic<Storage, CallSelf, CallSelfStatic, CallInternal>::new",
@@ -7439,7 +7399,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/contract_self/contract_self_public.nr",
       "source": "//! The `self` contract value for public execution contexts.\n\nuse crate::{\n    context::{calls::{PublicCall, PublicStaticCall}, PublicContext},\n    event::{event_emission::emit_event_in_public, event_interface::EventInterface},\n};\nuse crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Core interface for interacting with aztec-nr contract features in public execution contexts.\n///\n/// This struct is automatically injected into every [`external`](crate::macros::functions::external) and\n/// [`internal`](crate::macros::functions::internal) contract function marked with `\"public\"` by the Aztec macro\n/// system and is accessible through the `self` variable.\n///\n/// ## Type Parameters\n///\n/// - `Storage`: The contract's storage struct (defined with [`storage`](crate::macros::storage::storage), or `()` if\n/// the contract has no storage\n/// - `CallSelf`: Macro-generated type for calling contract's own non-view functions\n/// - `CallSelfStatic`: Macro-generated type for calling contract's own view functions\n/// - `CallInternal`: Macro-generated type for calling internal functions\npub struct ContractSelfPublic<Storage, CallSelf, CallSelfStatic, CallInternal> {\n    /// The address of this contract\n    pub address: AztecAddress,\n\n    /// The contract's storage instance, representing the struct to which the\n    /// [`storage`](crate::macros::storage::storage) macro was applied in your contract. If the contract has no\n    /// storage, the type of this will be `()`.\n    ///\n    /// This storage instance is specialized for the current execution context (public) and\n    /// provides access to the contract's state variables.\n    ///\n    /// ## Developer Note\n    ///\n    /// If you've arrived here while trying to access your contract's storage while the `Storage` generic type is set\n    /// to unit type `()`, it means you haven't yet defined a Storage struct using the\n    /// [`storage`](crate::macros::storage::storage) macro in your contract. For guidance on setting this up, please\n    /// refer to our docs: https://docs.aztec.network/developers/docs/guides/smart_contracts/storage\n    pub storage: Storage,\n\n    /// The public execution context.\n    pub context: PublicContext,\n\n    /// Provides type-safe methods for calling this contract's own non-view functions.\n    ///\n    /// Example API:\n    /// ```noir\n    /// self.call_self.some_public_function(args)\n    /// ```\n    pub call_self: CallSelf,\n\n    /// Provides type-safe methods for calling this contract's own view functions.\n    ///\n    /// Example API:\n    /// ```noir\n    /// self.call_self_static.some_view_function(args)\n    /// ```\n    pub call_self_static: CallSelfStatic,\n\n    /// Provides type-safe methods for calling internal functions.\n    ///\n    /// Example API:\n    /// ```noir\n    /// self.internal.some_internal_function(args)\n    /// ```\n    pub internal: CallInternal,\n}\n\nimpl<Storage, CallSelf, CallSelfStatic, CallInternal> ContractSelfPublic<Storage, CallSelf, CallSelfStatic, CallInternal> {\n    /// Creates a new `ContractSelfPublic` instance for a public function.\n    ///\n    /// This constructor is called automatically by the macro system and should not be called directly.\n    pub fn new(\n        context: PublicContext,\n        storage: Storage,\n        call_self: CallSelf,\n        call_self_static: CallSelfStatic,\n        internal: CallInternal,\n    ) -> Self {\n        Self { context, storage, address: context.this_address(), call_self, call_self_static, internal }\n    }\n\n    /// The address of the contract address that made this function call.\n    ///\n    /// This is similar to Solidity's `msg.sender` value.\n    ///\n    /// ## Incognito Calls\n    ///\n    /// Contracts can call public functions from private ones hiding their identity (see\n    ///\n    /// [`ContractSelfPrivate::enqueue_incognito`](crate::contract_self::ContractSelfPrivate::enqueue_incognito)).\n    /// This function reverts when executed in such a context.\n    ///\n    /// If you need to handle these cases, use [`PublicContext::maybe_msg_sender`].\n    pub fn msg_sender(self: Self) -> AztecAddress {\n        self.context.maybe_msg_sender().unwrap()\n    }\n\n    /// Emits an event publicly.\n    ///\n    /// Public events are emitted as plaintext and are therefore visible to everyone. This is is the same as Solidity\n    /// events on EVM chains.\n    ///\n    /// Unlike private events, they don't require delivery of an event message.\n    ///\n    /// # Example\n    /// ```noir\n    /// #[event]\n    /// struct Update { value: Field }\n    ///\n    /// #[external(\"public\")]\n    /// fn publish_update(value: Field) {\n    ///     self.emit(Update { value });\n    /// }\n    /// ```\n    ///\n    /// # Cost\n    ///\n    /// Public event emission is achieved by emitting public transaction logs. A total of `N+1` fields are emitted,\n    /// where `N` is the serialization length of the event.\n    pub fn emit<Event>(&mut self, event: Event)\n    where\n        Event: EventInterface + Serialize,\n    {\n        emit_event_in_public(self.context, event);\n    }\n\n    /// Makes a public contract call.\n    ///\n    /// Will revert if the called function reverts or runs out of gas.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the public function to invoke.\n    ///\n    /// # Returns\n    /// * `T` - Whatever data the called function has returned.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.call(Token::at(address).transfer_in_public(recipient, amount));\n    /// ```\n    ///\n    pub unconstrained fn call<let M: u32, let N: u32, T>(self, call: PublicCall<M, N, T>) -> T\n    where\n        T: Deserialize,\n    {\n        call.call(self.context)\n    }\n\n    /// Makes a public read-only contract call.\n    ///\n    /// This is similar to Solidity's `staticcall`. The called function cannot modify state or emit events. Any nested\n    /// calls are constrained to also be static calls.\n    ///\n    /// Will revert if the called function reverts or runs out of gas.\n    ///\n    /// # Arguments\n    /// * `call` - The object representing the read-only public function to invoke.\n    ///\n    /// # Returns\n    /// * `T` - Whatever data the called function has returned.\n    ///\n    /// # Example\n    /// ```noir\n    /// self.view(Token::at(address).balance_of_public(recipient));\n    /// ```\n    ///\n    pub unconstrained fn view<let M: u32, let N: u32, T>(self, call: PublicStaticCall<M, N, T>) -> T\n    where\n        T: Deserialize,\n    {\n        call.view(self.context)\n    }\n}\n"
     },
-    "78": {
+    "76": {
       "function_locations": [
         {
           "name": "compute_private_event_commitment",
@@ -7461,37 +7421,37 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/event/event_interface.nr",
       "source": "use crate::{event::EventSelector, messages::logs::event::MAX_EVENT_SERIALIZED_LEN};\nuse crate::protocol::{\n    constants::DOM_SEP__EVENT_COMMITMENT,\n    hash::{poseidon2_hash_with_separator, poseidon2_hash_with_separator_bounded_vec},\n    traits::{Serialize, ToField},\n};\n\npub trait EventInterface {\n    fn get_event_type_id() -> EventSelector;\n}\n\n/// A private event's commitment is a value stored on-chain which is used to verify that the event was indeed emitted.\n///\n/// It requires a `randomness` value that must be produced alongside the event in order to perform said validation.\n/// This random value prevents attacks in which someone guesses plausible events (e.g. 'Alice transfers to Bob an\n/// amount of 10'), since they will not be able to test for existence of their guessed events without brute-forcing the\n/// entire `Field` space by guessing `randomness` values.\npub fn compute_private_event_commitment<Event>(event: Event, randomness: Field) -> Field\nwhere\n    Event: EventInterface + Serialize,\n{\n    poseidon2_hash_with_separator(\n        [randomness, Event::get_event_type_id().to_field()].concat(event.serialize()),\n        DOM_SEP__EVENT_COMMITMENT,\n    )\n}\n\n/// Unconstrained variant of [`compute_private_event_commitment`] which takes the event in serialized form.\n///\n/// This function is unconstrained as the mechanism it uses to compute the commitment would be very inefficient in a\n/// constrained environment (due to the hashing of a dynamically sized array). This is not an issue as it is typically\n/// invoked when processing event messages, which is an unconstrained operation.\npub unconstrained fn compute_private_serialized_event_commitment(\n    serialized_event: BoundedVec<Field, MAX_EVENT_SERIALIZED_LEN>,\n    randomness: Field,\n    event_type_id: Field,\n) -> Field {\n    let mut commitment_preimage =\n        BoundedVec::<_, 2 + MAX_EVENT_SERIALIZED_LEN>::from_array([randomness, event_type_id]);\n    commitment_preimage.extend_from_bounded_vec(serialized_event);\n\n    poseidon2_hash_with_separator_bounded_vec(commitment_preimage, DOM_SEP__EVENT_COMMITMENT)\n}\n\nmod test {\n    use crate::event::event_interface::{\n        compute_private_event_commitment, compute_private_serialized_event_commitment, EventInterface,\n    };\n    use crate::messages::logs::event::MAX_EVENT_SERIALIZED_LEN;\n    use crate::protocol::traits::{Serialize, ToField};\n    use crate::test::mocks::mock_event::MockEvent;\n\n    global VALUE: Field = 7;\n    global RANDOMNESS: Field = 10;\n\n    #[test]\n    unconstrained fn max_size_serialized_event_commitment() {\n        let serialized_event = BoundedVec::from_array([0; MAX_EVENT_SERIALIZED_LEN]);\n        let _ = compute_private_serialized_event_commitment(serialized_event, 0, 0);\n    }\n\n    #[test]\n    unconstrained fn event_commitment_equivalence() {\n        let event = MockEvent::new(VALUE).build_event();\n\n        assert_eq(\n            compute_private_event_commitment(event, RANDOMNESS),\n            compute_private_serialized_event_commitment(\n                BoundedVec::from_array(event.serialize()),\n                RANDOMNESS,\n                MockEvent::get_event_type_id().to_field(),\n            ),\n        );\n    }\n}\n"
     },
-    "80": {
+    "78": {
       "function_locations": [
         {
           "name": "<impl FromField for EventSelector>::from_field",
-          "start": 342
+          "start": 337
         },
         {
           "name": "<impl ToField for EventSelector>::to_field",
-          "start": 454
+          "start": 449
         },
         {
           "name": "<impl Empty for EventSelector>::empty",
-          "start": 547
+          "start": 542
         },
         {
           "name": "EventSelector::from_u32",
-          "start": 652
+          "start": 647
         },
         {
           "name": "EventSelector::from_signature",
-          "start": 756
+          "start": 751
         },
         {
           "name": "EventSelector::zero",
-          "start": 990
+          "start": 985
         }
       ],
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/event/event_selector.nr",
-      "source": "use crate::protocol::{hash::poseidon2_hash_bytes, traits::{Deserialize, Empty, FromField, Serialize, ToField}};\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct EventSelector {\n    // 1st 4-bytes (big-endian leftmost) of abi-encoding of an event.\n    inner: u32,\n}\n\nimpl FromField for EventSelector {\n    fn from_field(field: Field) -> Self {\n        Self { inner: field as u32 }\n    }\n}\n\nimpl ToField for EventSelector {\n    fn to_field(self) -> Field {\n        self.inner as Field\n    }\n}\n\nimpl Empty for EventSelector {\n    fn empty() -> Self {\n        Self { inner: 0 as u32 }\n    }\n}\n\nimpl EventSelector {\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 = poseidon2_hash_bytes(bytes);\n\n        // `hash` is automatically truncated to fit within 32 bits.\n        EventSelector::from_field(hash)\n    }\n\n    pub fn zero() -> Self {\n        Self { inner: 0 }\n    }\n}\n"
+      "source": "use crate::protocol::{hash::poseidon2_hash_bytes, traits::{Deserialize, Empty, FromField, Serialize, ToField}};\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct EventSelector {\n    // Low 32 bits of the poseidon2 hash of the event signature.\n    inner: u32,\n}\n\nimpl FromField for EventSelector {\n    fn from_field(field: Field) -> Self {\n        Self { inner: field as u32 }\n    }\n}\n\nimpl ToField for EventSelector {\n    fn to_field(self) -> Field {\n        self.inner as Field\n    }\n}\n\nimpl Empty for EventSelector {\n    fn empty() -> Self {\n        Self { inner: 0 as u32 }\n    }\n}\n\nimpl EventSelector {\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 = poseidon2_hash_bytes(bytes);\n\n        // `hash` is automatically truncated to fit within 32 bits.\n        EventSelector::from_field(hash)\n    }\n\n    pub fn zero() -> Self {\n        Self { inner: 0 }\n    }\n}\n"
     },
-    "82": {
+    "80": {
       "function_locations": [
         {
           "name": "compute_secret_hash",
@@ -7537,7 +7497,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/hash.nr",
       "source": "//! Aztec hash functions.\n\nuse crate::protocol::{\n    address::{AztecAddress, EthAddress},\n    constants::{\n        DOM_SEP__FUNCTION_ARGS, DOM_SEP__MESSAGE_NULLIFIER, DOM_SEP__PUBLIC_BYTECODE, DOM_SEP__PUBLIC_CALLDATA,\n        DOM_SEP__SECRET_HASH, MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS,\n    },\n    hash::{poseidon2_hash_subarray, poseidon2_hash_with_separator, sha256_to_field},\n    traits::ToField,\n};\n\npub use crate::protocol::hash::compute_siloed_nullifier;\n\npub fn compute_secret_hash(secret: Field) -> Field {\n    poseidon2_hash_with_separator([secret], DOM_SEP__SECRET_HASH)\n}\n\npub fn compute_l1_to_l2_message_hash(\n    sender: EthAddress,\n    chain_id: Field,\n    recipient: AztecAddress,\n    version: Field,\n    content: Field,\n    secret_hash: Field,\n    leaf_index: Field,\n) -> Field {\n    let mut hash_bytes = [0 as u8; 224];\n    let sender_bytes: [u8; 32] = sender.to_field().to_be_bytes();\n    let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n    let recipient_bytes: [u8; 32] = recipient.to_field().to_be_bytes();\n    let version_bytes: [u8; 32] = version.to_be_bytes();\n    let content_bytes: [u8; 32] = content.to_be_bytes();\n    let secret_hash_bytes: [u8; 32] = secret_hash.to_be_bytes();\n    let leaf_index_bytes: [u8; 32] = leaf_index.to_be_bytes();\n\n    for i in 0..32 {\n        hash_bytes[i] = sender_bytes[i];\n        hash_bytes[i + 32] = chain_id_bytes[i];\n        hash_bytes[i + 64] = recipient_bytes[i];\n        hash_bytes[i + 96] = version_bytes[i];\n        hash_bytes[i + 128] = content_bytes[i];\n        hash_bytes[i + 160] = secret_hash_bytes[i];\n        hash_bytes[i + 192] = leaf_index_bytes[i];\n    }\n\n    sha256_to_field(hash_bytes)\n}\n\n// The nullifier of a l1 to l2 message is the hash of the message salted with the secret\npub fn compute_l1_to_l2_message_nullifier(message_hash: Field, secret: Field) -> Field {\n    poseidon2_hash_with_separator([message_hash, secret], DOM_SEP__MESSAGE_NULLIFIER)\n}\n\n// Computes the hash of input arguments or return values for private functions, or for authwit creation.\npub fn hash_args<let N: u32>(args: [Field; N]) -> Field {\n    if args.len() == 0 {\n        0\n    } else {\n        poseidon2_hash_with_separator(args, DOM_SEP__FUNCTION_ARGS)\n    }\n}\n\n// Computes the hash of calldata for public functions.\npub fn hash_calldata_array<let N: u32>(calldata: [Field; N]) -> Field {\n    poseidon2_hash_with_separator(calldata, DOM_SEP__PUBLIC_CALLDATA)\n}\n\n/// Computes the public bytecode commitment for a contract class. The commitment is `hash([(length | separator),\n/// ...bytecode])`.\n///\n/// @param packed_bytecode - The packed bytecode of the contract class. 0th word is the length in bytes.\n/// packed_bytecode is mutable so that we can avoid copying the array to construct one starting with first_field\n/// instead of length. @returns The public bytecode commitment.\npub fn compute_public_bytecode_commitment(\n    mut packed_public_bytecode: [Field; MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS],\n) -> Field {\n    // First field element contains the length of the bytecode\n    let bytecode_length_in_bytes: u32 = packed_public_bytecode[0] as u32;\n    let bytecode_length_in_fields: u32 = (bytecode_length_in_bytes / 31) + (bytecode_length_in_bytes % 31 != 0) as u32;\n    // Don't allow empty public bytecode. AVM doesn't handle execution of contracts that exist with empty bytecode.\n    assert(bytecode_length_in_fields != 0);\n    assert(bytecode_length_in_fields < MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS);\n\n    // Packed_bytecode's 0th entry is the length. Append it to the separator before hashing.\n    let first_field = DOM_SEP__PUBLIC_BYTECODE.to_field() + (packed_public_bytecode[0] as u64 << 32) as Field;\n    packed_public_bytecode[0] = first_field;\n\n    // `fields_to_hash` is the number of fields from the start of `packed_public_bytecode` that should be included in\n    // the hash. Fields after this length are ignored. +1 to account for the prepended field.\n    let num_fields_to_hash = bytecode_length_in_fields + 1;\n\n    poseidon2_hash_subarray(packed_public_bytecode, num_fields_to_hash)\n}\n\n#[test]\nunconstrained fn secret_hash_matches_typescript() {\n    let secret = 8;\n    let hash = compute_secret_hash(secret);\n\n    // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n    let secret_hash_from_ts = 0x1848b066724ab0ffb50ecb0ee3398eb839f162823d262bad959721a9c13d1e96;\n\n    assert_eq(hash, secret_hash_from_ts);\n}\n\n#[test]\nunconstrained fn var_args_hash_matches_typescript() {\n    let mut input = [0; 100];\n    for i in 0..100 {\n        input[i] = i as Field;\n    }\n    let hash = hash_args(input);\n\n    // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n    let var_args_hash_from_ts = 0x262e5e121a8efc0382566ab42f0ae2a78bd85db88484f83018fe07fc2552ba0c;\n\n    assert_eq(hash, var_args_hash_from_ts);\n}\n\n#[test]\nunconstrained fn compute_calldata_hash() {\n    let mut input = [0; 100];\n    for i in 0..input.len() {\n        input[i] = i as Field;\n    }\n    let hash = hash_calldata_array(input);\n\n    // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n    let calldata_hash_from_ts = 0x14a1539bdb1d26e03097cf4d40c87e02ca03f0bb50a3e617ace5a7bfd3943944;\n\n    // Used in cpp vm2 tests:\n    assert_eq(hash, calldata_hash_from_ts);\n}\n\n#[test]\nunconstrained fn public_bytecode_commitment() {\n    let mut input = [0; MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS];\n    let len = 99;\n    for i in 1..len + 1 {\n        input[i] = i as Field;\n    }\n    input[0] = (len as Field) * 31;\n    let hash = compute_public_bytecode_commitment(input);\n    // Used in cpp vm2 tests:\n    assert_eq(hash, 0x09348974e76c3602893d7a4b4bb52c2ec746f1ade5004ac471d0fbb4587a81a6);\n}\n"
     },
-    "93": {
+    "91": {
       "function_locations": [
         {
           "name": "derive_ecdh_shared_secret",
@@ -7575,7 +7535,7 @@
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/keys/ecdh_shared_secret.nr",
       "source": "use crate::protocol::{\n    address::aztec_address::AztecAddress,\n    constants::{DOM_SEP__APP_SILOED_ECDH_SHARED_SECRET, DOM_SEP__ECDH_FIELD_MASK, DOM_SEP__ECDH_SUBKEY},\n    hash::poseidon2_hash_with_separator,\n    point::Point,\n    scalar::Scalar,\n    traits::{FromField, ToField},\n};\nuse std::{embedded_curve_ops::multi_scalar_mul, ops::Neg};\n\n/// Computes a standard ECDH shared secret: secret * public_key = shared_secret.\n///\n/// The input secret is known only to one party. The output shared secret can be derived given knowledge of\n/// `public_key`'s key-pair and the public ephemeral secret, using this same function (with reversed inputs).\n///\n/// E.g.: Epk = esk * G // ephemeral key-pair\n///       Pk = sk * G // recipient key-pair\n///       Shared secret S = esk * Pk = sk * Epk\n///\n/// See also: https://en.wikipedia.org/wiki/Elliptic-curve_Diffie%E2%80%93Hellman\npub fn derive_ecdh_shared_secret(secret: Scalar, public_key: Point) -> Point {\n    multi_scalar_mul([public_key], [secret])\n}\n\n/// Computes an app-siloed shared secret from a raw ECDH shared secret point and a contract address.\n///\n/// `s_app = h(DOM_SEP__APP_SILOED_ECDH_SHARED_SECRET, S.x, S.y, contract_address)`\npub(crate) fn compute_app_siloed_shared_secret(shared_secret: Point, contract_address: AztecAddress) -> Field {\n    poseidon2_hash_with_separator(\n        [shared_secret.x, shared_secret.y, contract_address.to_field()],\n        DOM_SEP__APP_SILOED_ECDH_SHARED_SECRET,\n    )\n}\n\n/// Derives an indexed subkey from an app-siloed shared secret, used for AES key/IV derivation.\n///\n/// `s_i = h(DOM_SEP__ECDH_SUBKEY + i, s_app)`\npub(crate) fn derive_shared_secret_subkey(s_app: Field, index: u32) -> Field {\n    poseidon2_hash_with_separator([s_app], DOM_SEP__ECDH_SUBKEY + index)\n}\n\n/// Derives an indexed field mask from an app-siloed shared secret, used for masking ciphertext fields.\n///\n/// `m_i = h(DOM_SEP__ECDH_FIELD_MASK + i, s_app)`\npub(crate) fn derive_shared_secret_field_mask(s_app: Field, index: u32) -> Field {\n    poseidon2_hash_with_separator([s_app], DOM_SEP__ECDH_FIELD_MASK + index)\n}\n\n#[test]\nunconstrained fn test_consistency_with_typescript() {\n    let secret = Scalar {\n        lo: 0x00000000000000000000000000000000649e7ca01d9de27b21624098b897babd,\n        hi: 0x0000000000000000000000000000000023b3127c127b1f29a7adff5cccf8fb06,\n    };\n    let point = Point {\n        x: 0x2688431c705a5ff3e6c6f2573c9e3ba1c1026d2251d0dbbf2d810aa53fd1d186,\n        y: 0x1e96887b117afca01c00468264f4f80b5bb16d94c1808a448595f115556e5c8e,\n        is_infinite: false,\n    };\n\n    let shared_secret = derive_ecdh_shared_secret(secret, point);\n\n    // This is just pasted from a test run. The original typescript code from which this could be generated seems to\n    // have been deleted by someone, and soon the typescript code for encryption and decryption won't be needed, so\n    // this will have to do.\n    let hard_coded_shared_secret = Point {\n        x: 0x15d55a5b3b2caa6a6207f313f05c5113deba5da9927d6421bcaa164822b911bc,\n        y: 0x0974c3d0825031ae933243d653ebb1a0b08b90ee7f228f94c5c74739ea3c871e,\n        is_infinite: false,\n    };\n    assert_eq(shared_secret, hard_coded_shared_secret);\n}\n\n#[test]\nunconstrained fn test_shared_secret_computation_in_both_directions() {\n    let secret_a = Scalar { lo: 0x1234, hi: 0x2345 };\n    let secret_b = Scalar { lo: 0x3456, hi: 0x4567 };\n\n    let pk_a = std::embedded_curve_ops::fixed_base_scalar_mul(secret_a);\n    let pk_b = std::embedded_curve_ops::fixed_base_scalar_mul(secret_b);\n\n    let shared_secret = derive_ecdh_shared_secret(secret_a, pk_b);\n    let shared_secret_alt = derive_ecdh_shared_secret(secret_b, pk_a);\n\n    assert_eq(shared_secret, shared_secret_alt);\n}\n\n#[test]\nunconstrained fn test_shared_secret_computation_from_address_in_both_directions() {\n    let secret_a = Scalar { lo: 0x1234, hi: 0x2345 };\n    let secret_b = Scalar { lo: 0x3456, hi: 0x4567 };\n\n    let mut pk_a = std::embedded_curve_ops::fixed_base_scalar_mul(secret_a);\n    let mut pk_b = std::embedded_curve_ops::fixed_base_scalar_mul(secret_b);\n\n    let address_b = AztecAddress::from_field(pk_b.x);\n\n    // We were lazy in deriving the secret keys, and didn't check the resulting y-coordinates of the pk_a or pk_b to be\n    // less than half the field modulus. If needed, we negate the pk's so that they yield valid address points. (We\n    // could also have negated the secrets, but there's no negate method for EmbeddedCurvesScalar).\n    pk_a = if (AztecAddress::from_field(pk_a.x).to_address_point().unwrap().inner == pk_a) {\n        pk_a\n    } else {\n        pk_a.neg()\n    };\n    pk_b = if (address_b.to_address_point().unwrap().inner == pk_b) {\n        pk_b\n    } else {\n        pk_b.neg()\n    };\n\n    let shared_secret = derive_ecdh_shared_secret(secret_a, address_b.to_address_point().unwrap().inner);\n    let shared_secret_alt = derive_ecdh_shared_secret(secret_b, pk_a);\n\n    assert_eq(shared_secret, shared_secret_alt);\n}\n\n#[test]\nunconstrained fn test_app_siloed_shared_secret_differs_per_contract() {\n    let secret_a = Scalar { lo: 0x1234, hi: 0x2345 };\n    let pk_b = std::embedded_curve_ops::fixed_base_scalar_mul(Scalar { lo: 0x3456, hi: 0x4567 });\n\n    let shared_secret = derive_ecdh_shared_secret(secret_a, pk_b);\n\n    let contract_a = AztecAddress::from_field(0xAAAA);\n    let contract_b = AztecAddress::from_field(0xBBBB);\n\n    let s_app_a = compute_app_siloed_shared_secret(shared_secret, contract_a);\n    let s_app_b = compute_app_siloed_shared_secret(shared_secret, contract_b);\n\n    assert(s_app_a != s_app_b, \"app-siloed secrets must differ for different contracts\");\n}\n"
     },
-    "98": {
+    "96": {
       "function_locations": [
         {
           "name": "log_prefix",
@@ -7644,6 +7604,58 @@
       ],
       "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/logging.nr",
       "source": "// Not all log levels are currently used, but we provide the full set so that new call sites can use any level. Because\n// of that we tag all with `#[allow(dead_code)]` to prevent warnings.\n//\n// All wrappers resolve function paths at comptime via `resolve_fn` so that the emitted `Quoted` code works both inside\n// aztec-nr (where `crate::` = aztec) and inside macro-generated contract code (where `crate::` = the contract).\n\nuse std::meta::ctstring::AsCtString;\n\ncomptime fn log_prefix<let N: u32>(msg: str<N>) -> CtString {\n    \"[aztec-nr] \".as_ctstring().append_str(msg)\n}\n\n// --- No-args variants (direct call) ---\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_fatal_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::fatal_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_error_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::error_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_warn_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::warn_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_info_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::info_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_verbose_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::verbose_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_debug_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::debug_log });\n    quote { $f($msg) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_trace_log<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::trace_log });\n    quote { $f($msg) }\n}\n\n// --- Format variants (return lambda for runtime args) ---\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_fatal_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::fatal_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_error_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::error_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_warn_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::warn_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_info_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::info_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_verbose_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::verbose_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_debug_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::debug_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n#[allow(dead_code)]\npub(crate) comptime fn aztecnr_trace_log_format<let N: u32>(msg: str<N>) -> Quoted {\n    let msg = log_prefix(msg);\n    let f = resolve_fn(quote { crate::protocol::logging::trace_log_format });\n    quote { (|args| $f($msg, args)) }\n}\n\n// See module-level comment for why this is needed.\ncomptime fn resolve_fn(path: Quoted) -> TypedExpr {\n    path.as_expr().unwrap().resolve(Option::none())\n}\n"
+    },
+    "98": {
+      "function_locations": [
+        {
+          "name": "generate_contract_library_methods_compute_note_hash_and_nullifier",
+          "start": 534
+        },
+        {
+          "name": "generate_contract_library_method_compute_note_hash",
+          "start": 2449
+        },
+        {
+          "name": "generate_contract_library_method_compute_note_nullifier",
+          "start": 7674
+        }
+      ],
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec/compute_note_hash_and_nullifier.nr",
+      "source": "use crate::logging;\nuse crate::macros::{notes::NOTES, utils::get_trait_impl_method};\n\n/// Generates two contract library methods called `_compute_note_hash` and `_compute_note_nullifier`, plus a\n/// (deprecated) wrapper called `_compute_note_hash_and_nullifier`, which are used for note discovery (i.e. these are\n/// of the `aztec::messages::discovery::ComputeNoteHash` and `aztec::messages::discovery::ComputeNoteNullifier` types).\npub(crate) comptime fn generate_contract_library_methods_compute_note_hash_and_nullifier() -> Quoted {\n    let compute_note_hash = generate_contract_library_method_compute_note_hash();\n    let compute_note_nullifier = generate_contract_library_method_compute_note_nullifier();\n\n    quote {\n        $compute_note_hash\n        $compute_note_nullifier\n\n        /// Unpacks an array into a note corresponding to `note_type_id` and then computes its note hash (non-siloed) and inner nullifier (non-siloed) assuming the note has been inserted into the note hash tree with `note_nonce`.\n        ///\n        /// This function is automatically injected by the `#[aztec]` macro.\n        #[contract_library_method]\n        #[allow(dead_code)]\n        unconstrained fn _compute_note_hash_and_nullifier(\n            packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n            owner: aztec::protocol::address::AztecAddress,\n            storage_slot: Field,\n            note_type_id: Field,\n            contract_address: aztec::protocol::address::AztecAddress,\n            randomness: Field,\n            note_nonce: Field,\n        ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n            _compute_note_hash(packed_note, owner, storage_slot, note_type_id, contract_address, randomness).map(|note_hash| {\n\n                let siloed_note_hash = aztec::protocol::hash::compute_siloed_note_hash(contract_address, note_hash);\n                let unique_note_hash = aztec::protocol::hash::compute_unique_note_hash(note_nonce, siloed_note_hash);\n                \n                let inner_nullifier = _compute_note_nullifier(unique_note_hash, packed_note, owner, storage_slot, note_type_id, contract_address, randomness);\n\n                aztec::messages::discovery::NoteHashAndNullifier {\n                    note_hash,\n                    inner_nullifier,\n                }\n            })\n        }\n    }\n}\n\ncomptime fn generate_contract_library_method_compute_note_hash() -> Quoted {\n    if NOTES.len() == 0 {\n        // Contracts with no notes still implement this function to avoid having special-casing, the implementation\n        // simply throws immediately.\n        quote {\n            /// This contract does not use private notes, so this function should never be called as it will unconditionally fail.\n            ///\n            /// This function is automatically injected by the `#[aztec]` macro.\n            #[contract_library_method]\n            unconstrained fn _compute_note_hash(\n                _packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n                _owner: aztec::protocol::address::AztecAddress,\n                _storage_slot: Field,\n                _note_type_id: Field,\n                _contract_address: aztec::protocol::address::AztecAddress,\n                _randomness: Field,\n            ) -> Option<Field> {\n                panic(f\"This contract does not use private notes\")\n            }\n        }\n    } else {\n        // Contracts that do define notes produce an if-else chain where `note_type_id` is matched against the\n        // `get_note_type_id()` function of each note type that we know of, in order to identify the note type. Once we\n        // know it we call the correct `unpack` method from the `Packable` trait to obtain the underlying note type, and\n        // compute the note hash (non-siloed).\n\n        // We resolve the log format calls here so that the resulting Quoted values can be spliced into the quote\n        // block below.\n        let warn_length_mismatch = logging::aztecnr_warn_log_format(\n            \"Packed note length mismatch for note type id {0}: expected {1} fields, got {2}. Skipping note.\",\n        );\n        let warn_unknown_note_type = logging::aztecnr_warn_log_format(\"Unknown note type id {0}. Skipping note.\");\n\n        let mut if_note_type_id_match_statements_list = @[];\n        for i in 0..NOTES.len() {\n            let typ = NOTES.get(i);\n\n            let get_note_type_id = get_trait_impl_method(\n                typ,\n                quote { crate::note::note_interface::NoteType },\n                quote { get_id },\n            );\n            let unpack = get_trait_impl_method(\n                typ,\n                quote { crate::protocol::traits::Packable },\n                quote { unpack },\n            );\n\n            let compute_note_hash = get_trait_impl_method(\n                typ,\n                quote { crate::note::note_interface::NoteHash },\n                quote { compute_note_hash },\n            );\n\n            let if_or_else_if = if i == 0 {\n                quote { if }\n            } else {\n                quote { else if }\n            };\n\n            if_note_type_id_match_statements_list = if_note_type_id_match_statements_list.push_back(\n                quote {\n                    $if_or_else_if note_type_id == $get_note_type_id() {\n                        // As an extra safety check we make sure that the packed_note BoundedVec has the expected\n                        // length, since we're about to interpret its raw storage as a fixed-size array by calling the\n                        // unpack function on it.\n                        let expected_len = <$typ as $crate::protocol::traits::Packable>::N;\n                        let actual_len = packed_note.len();\n                        if actual_len != expected_len {\n                            $warn_length_mismatch([note_type_id, expected_len as Field, actual_len as Field]);\n                            Option::none()\n                        } else {\n                            let note = $unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n\n                            Option::some($compute_note_hash(note, owner, storage_slot, randomness))\n                        }\n                    }\n                },\n            );\n        }\n\n        let if_note_type_id_match_statements = if_note_type_id_match_statements_list.join(quote {});\n\n        quote {\n            /// Unpacks an array into a note corresponding to `note_type_id` and then computes its note hash (non-siloed).\n            ///\n            /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteHash` type, and so it can be used to call functions from that module such as `do_sync_state` and `attempt_note_discovery`.\n            ///\n            /// This function is automatically injected by the `#[aztec]` macro.\n            #[contract_library_method]\n            unconstrained fn _compute_note_hash(\n                packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n                owner: aztec::protocol::address::AztecAddress,\n                storage_slot: Field,\n                note_type_id: Field,\n                _contract_address: aztec::protocol::address::AztecAddress,\n                randomness: Field,\n            ) -> Option<Field> {\n                $if_note_type_id_match_statements\n                else {\n                    $warn_unknown_note_type([note_type_id]);\n                    Option::none()\n                }\n            }\n        }\n    }\n}\n\ncomptime fn generate_contract_library_method_compute_note_nullifier() -> Quoted {\n    if NOTES.len() == 0 {\n        // Contracts with no notes still implement this function to avoid having special-casing, the implementation\n        // simply throws immediately.\n        quote {\n            /// This contract does not use private notes, so this function should never be called as it will unconditionally fail.\n            ///\n            /// This function is automatically injected by the `#[aztec]` macro.\n            #[contract_library_method]\n            unconstrained fn _compute_note_nullifier(\n                _unique_note_hash: Field,\n                _packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n                _owner: aztec::protocol::address::AztecAddress,\n                _storage_slot: Field,\n                _note_type_id: Field,\n                _contract_address: aztec::protocol::address::AztecAddress,\n                _randomness: Field,\n            ) -> Option<Field> {\n                panic(f\"This contract does not use private notes\")\n            }\n        }\n    } else {\n        // Contracts that do define notes produce an if-else chain where `note_type_id` is matched against the\n        // `get_note_type_id()` function of each note type that we know of, in order to identify the note type. Once we\n        // know it we call the correct `unpack` method from the `Packable` trait to obtain the underlying note type, and\n        // compute the inner nullifier (non-siloed).\n\n        // We resolve the log format calls here so that the resulting Quoted values can be spliced into the quote\n        // block below.\n        let warn_length_mismatch = logging::aztecnr_warn_log_format(\n            \"Packed note length mismatch for note type id {0}: expected {1} fields, got {2}. Skipping note.\",\n        );\n        let warn_unknown_note_type = logging::aztecnr_warn_log_format(\"Unknown note type id {0}. Skipping note.\");\n\n        let mut if_note_type_id_match_statements_list = @[];\n        for i in 0..NOTES.len() {\n            let typ = NOTES.get(i);\n\n            let get_note_type_id = get_trait_impl_method(\n                typ,\n                quote { crate::note::note_interface::NoteType },\n                quote { get_id },\n            );\n            let unpack = get_trait_impl_method(\n                typ,\n                quote { crate::protocol::traits::Packable },\n                quote { unpack },\n            );\n\n            let compute_nullifier_unconstrained = get_trait_impl_method(\n                typ,\n                quote { crate::note::note_interface::NoteHash },\n                quote { compute_nullifier_unconstrained },\n            );\n\n            let if_or_else_if = if i == 0 {\n                quote { if }\n            } else {\n                quote { else if }\n            };\n\n            if_note_type_id_match_statements_list = if_note_type_id_match_statements_list.push_back(\n                quote {\n                    $if_or_else_if note_type_id == $get_note_type_id() {\n                        // As an extra safety check we make sure that the packed_note BoundedVec has the expected\n                        // length, since we're about to interpret its raw storage as a fixed-size array by calling the\n                        // unpack function on it.\n                        let expected_len = <$typ as $crate::protocol::traits::Packable>::N;\n                        let actual_len = packed_note.len();\n                        if actual_len != expected_len {\n                            $warn_length_mismatch([note_type_id, expected_len as Field, actual_len as Field]);\n                            Option::none()\n                        } else {\n                            let note = $unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n\n                            // The message discovery process finds settled notes, that is, notes that were created in\n                            // prior transactions and are therefore already part of the note hash tree. The note hash\n                            // for nullification is hence the unique note hash.\n                            $compute_nullifier_unconstrained(note, owner, unique_note_hash)\n                        }\n                    }\n                },\n            );\n        }\n\n        let if_note_type_id_match_statements = if_note_type_id_match_statements_list.join(quote {});\n\n        quote {\n            /// Computes a note's inner nullifier (non-siloed) given its unique note hash, preimage and extra data.\n            ///\n            /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteNullifier` type, and so it can be used to call functions from that module such as `do_sync_state` and `attempt_note_discovery`.\n            ///\n            /// This function is automatically injected by the `#[aztec]` macro.\n            #[contract_library_method]\n            unconstrained fn _compute_note_nullifier(\n                unique_note_hash: Field,\n                packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n                owner: aztec::protocol::address::AztecAddress,\n                _storage_slot: Field,\n                note_type_id: Field,\n                _contract_address: aztec::protocol::address::AztecAddress,\n                _randomness: Field,\n            ) -> Option<Field> {\n                $if_note_type_id_match_statements\n                else {\n                    $warn_unknown_note_type([note_type_id]);\n                    Option::none()\n                }\n            }\n        }\n    }\n}\n"
+    },
+    "99": {
+      "function_locations": [
+        {
+          "name": "AztecConfig::new",
+          "start": 1648
+        },
+        {
+          "name": "AztecConfig::custom_message_handler",
+          "start": 2156
+        },
+        {
+          "name": "aztec",
+          "start": 3050
+        },
+        {
+          "name": "generate_contract_interface",
+          "start": 6527
+        },
+        {
+          "name": "generate_sync_state",
+          "start": 8389
+        },
+        {
+          "name": "generate_offchain_receive",
+          "start": 9443
+        },
+        {
+          "name": "check_each_fn_macroified",
+          "start": 11087
+        }
+      ],
+      "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec.nr",
+      "source": "mod compute_note_hash_and_nullifier;\n\nuse crate::{\n    macros::{\n        calls_generation::{\n            external_functions::{generate_external_function_calls, generate_external_function_self_calls_structs},\n            internal_functions::generate_call_internal_struct,\n        },\n        dispatch::generate_public_dispatch,\n        emit_public_init_nullifier::generate_emit_public_init_nullifier,\n        internals_functions_generation::{create_fn_abi_exports, process_functions},\n        storage::STORAGE_LAYOUT_NAME,\n        utils::{is_fn_contract_library_method, is_fn_external, is_fn_internal, is_fn_test, module_has_storage},\n    },\n    messages::discovery::CustomMessageHandler,\n};\n\nuse compute_note_hash_and_nullifier::generate_contract_library_methods_compute_note_hash_and_nullifier;\n\n/// Configuration for the [`aztec`] macro.\n///\n/// This type lets users override different parts of the default aztec-nr contract behavior, such\n/// as message handling. These are advanced features that require careful understanding of\n/// the behavior of these systems.\n///\n/// ## Examples\n///\n/// ```noir\n/// #[aztec(aztec::macros::AztecConfig::new().custom_message_handler(my_handler))]\n/// contract MyContract { ... }\n/// ```\npub struct AztecConfig {\n    custom_message_handler: Option<CustomMessageHandler<()>>,\n}\n\nimpl AztecConfig {\n    /// Creates a new `AztecConfig` with default values.\n    ///\n    /// Calling `new` is equivalent to invoking the [`aztec`] macro with no parameters. The different methods\n    /// (e.g. [`AztecConfig::custom_message_handler`]) can then be used to change the default behavior.\n    pub comptime fn new() -> Self {\n        Self { custom_message_handler: Option::none() }\n    }\n\n    /// Sets a handler for custom messages.\n    ///\n    /// This enables contracts to process non-standard messages (i.e. any with a message type that is not in\n    /// [`crate::messages::msg_type`]).\n    ///\n    /// `handler` must be a function that conforms to the\n    /// [`crate::messages::discovery::CustomMessageHandler`] type signature.\n    pub comptime fn custom_message_handler(_self: Self, handler: CustomMessageHandler<()>) -> Self {\n        Self { custom_message_handler: Option::some(handler) }\n    }\n}\n\n/// Enables aztec-nr features on a `contract`.\n///\n/// All aztec-nr contracts should have this macro invoked on them, as it is the one that processes all contract\n/// functions, notes, storage, generates interfaces for external calls, and creates the message processing\n/// boilerplate.\n///\n/// ## Examples\n///\n/// Most contracts can simply invoke the macro with no parameters, resulting in default aztec-nr behavior:\n/// ```noir\n/// #[aztec]\n/// contract MyContract { ... }\n/// ```\n///\n/// Advanced contracts can use [`AztecConfig`] to customize parts of its behavior, such as message\n/// processing.\n/// ```noir\n/// #[aztec(aztec::macros::AztecConfig::new().custom_message_handler(my_handler))]\n/// contract MyAdvancedContract { ... }\n/// ```\n#[varargs]\npub comptime fn aztec(m: Module, args: [AztecConfig]) -> Quoted {\n    let num_args = args.len();\n    let config = if num_args == 0 {\n        AztecConfig::new()\n    } else if num_args == 1 {\n        args[0]\n    } else {\n        panic(f\"#[aztec] expects 0 or 1 arguments, got {num_args}\")\n    };\n\n    // Functions that don't have #[external(...)], #[contract_library_method], or #[test] are not allowed in contracts.\n    check_each_fn_macroified(m);\n\n    // We generate new functions prefixed with `__aztec_nr_internals__` and we replace the original functions' bodies\n    // with `static_assert(false, ...)` to prevent them from being called directly from within the contract.\n    let functions = process_functions(m);\n\n    // We generate structs and their implementations necessary for convenient functions calls.\n    let interface = generate_contract_interface(m);\n    let self_call_structs = generate_external_function_self_calls_structs(m);\n    let call_internal_struct = generate_call_internal_struct(m);\n\n    // We generate ABI exports for all the external functions in the contract.\n    let fn_abi_exports = create_fn_abi_exports(m);\n\n    // We generate `_compute_note_hash`, `_compute_note_nullifier` (and the deprecated\n    // `_compute_note_hash_and_nullifier` wrapper) and `sync_state` functions only if they are not already implemented.\n    // If they are implemented we just insert empty quotes.\n    let contract_library_method_compute_note_hash_and_nullifier = if !m.functions().any(|f| {\n        // Note that we don't test for `_compute_note_hash` or `_compute_note_nullifier` in order to make this simpler\n        // - users must either implement all three or none.\n        // Down the line we'll remove this check and use `AztecConfig`.\n        f.name() == quote { _compute_note_hash_and_nullifier }\n    }) {\n        generate_contract_library_methods_compute_note_hash_and_nullifier()\n    } else {\n        quote {}\n    };\n    let process_custom_message_option = if config.custom_message_handler.is_some() {\n        let handler = config.custom_message_handler.unwrap();\n        quote { Option::some($handler) }\n    } else {\n        quote { Option::<aztec::messages::discovery::CustomMessageHandler<()>>::none() }\n    };\n\n    let offchain_inbox_sync_option = quote {\n        Option::some(aztec::messages::processing::offchain::sync_inbox)\n    };\n\n    let sync_state_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { sync_state }) {\n        generate_sync_state(process_custom_message_option, offchain_inbox_sync_option)\n    } else {\n        quote {}\n    };\n\n    if m.functions().any(|f| f.name() == quote { offchain_receive }) {\n        panic(\n            \"User-defined 'offchain_receive' is not allowed. The function is auto-injected by the #[aztec] macro. See https://docs.aztec.network/errors/7\",\n        );\n    }\n    let offchain_receive_fn_and_abi_export = generate_offchain_receive();\n\n    let (has_public_init_nullifier_fn, emit_public_init_nullifier_fn_body) = generate_emit_public_init_nullifier(m);\n    let public_dispatch = generate_public_dispatch(m, has_public_init_nullifier_fn);\n\n    quote {\n        $interface\n        $self_call_structs\n        $call_internal_struct\n        $functions\n        $fn_abi_exports\n        $contract_library_method_compute_note_hash_and_nullifier\n        $public_dispatch\n        $sync_state_fn_and_abi_export\n        $emit_public_init_nullifier_fn_body\n        $offchain_receive_fn_and_abi_export\n    }\n}\n\ncomptime fn generate_contract_interface(m: Module) -> Quoted {\n    let calls = generate_external_function_calls(m);\n\n    let module_name = m.name();\n\n    let has_storage_layout = module_has_storage(m) & STORAGE_LAYOUT_NAME.get(m).is_some();\n    let storage_layout_getter = if has_storage_layout {\n        let storage_layout_name = STORAGE_LAYOUT_NAME.get(m).unwrap();\n        quote {\n            pub fn storage_layout() -> StorageLayoutFields {\n                $storage_layout_name.fields\n            }\n        }\n    } else {\n        quote {}\n    };\n\n    let library_storage_layout_getter = if has_storage_layout {\n        quote {\n            #[contract_library_method]\n            $storage_layout_getter\n        }\n    } else {\n        quote {}\n    };\n\n    quote {\n        pub struct $module_name {\n            pub target_contract: aztec::protocol::address::AztecAddress\n        }\n\n        impl $module_name {\n            $calls\n\n            pub fn at(\n                addr: aztec::protocol::address::AztecAddress\n            ) -> Self {\n                Self { target_contract: addr }\n            }\n\n            pub fn interface() -> Self {\n                Self { target_contract: aztec::protocol::address::AztecAddress::zero() }\n            }\n\n            $storage_layout_getter\n        }\n\n        #[contract_library_method]\n        pub fn at(\n            addr: aztec::protocol::address::AztecAddress\n        ) -> $module_name {\n            $module_name { target_contract: addr }\n        }\n\n        #[contract_library_method]\n        pub fn interface() -> $module_name {\n            $module_name { target_contract: aztec::protocol::address::AztecAddress::zero() }\n        }\n\n        $library_storage_layout_getter\n\n    }\n}\n\n/// Generates the `sync_state` utility function that performs message discovery.\ncomptime fn generate_sync_state(process_custom_message_option: Quoted, offchain_inbox_sync_option: Quoted) -> Quoted {\n    quote {\n        pub struct sync_state_parameters {\n            pub scope: aztec::protocol::address::AztecAddress,\n        }\n\n        #[abi(functions)]\n        pub struct sync_state_abi {\n            parameters: sync_state_parameters,\n        }\n\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n        unconstrained fn sync_state(scope: aztec::protocol::address::AztecAddress) {\n            let address = aztec::context::UtilityContext::new().this_address();\n            aztec::messages::discovery::do_sync_state(\n                address,\n                _compute_note_hash,\n                _compute_note_nullifier,\n                $process_custom_message_option,\n                $offchain_inbox_sync_option,\n                scope,\n            );\n        }\n    }\n}\n\n/// Generates an `offchain_receive` utility function that lets callers add messages to the offchain message inbox.\n///\n/// For more details, see `aztec::messages::processing::offchain::receive`.\ncomptime fn generate_offchain_receive() -> Quoted {\n    quote {\n        pub struct offchain_receive_parameters {\n            pub messages: BoundedVec<\n                aztec::messages::processing::offchain::OffchainMessage,\n                aztec::messages::processing::offchain::MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL,\n            >,\n        }\n\n        #[abi(functions)]\n        pub struct offchain_receive_abi {\n            parameters: offchain_receive_parameters,\n        }\n\n        /// Receives offchain messages into this contract's offchain inbox for subsequent processing.\n        ///\n        /// Each message is routed to the inbox scoped to its `recipient` field.\n        ///\n        /// For more details, see `aztec::messages::processing::offchain::receive`.\n        ///\n        /// This function is automatically injected by the `#[aztec]` macro.\n        #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n        unconstrained fn offchain_receive(\n            messages: BoundedVec<\n                aztec::messages::processing::offchain::OffchainMessage,\n                aztec::messages::processing::offchain::MAX_OFFCHAIN_MESSAGES_PER_RECEIVE_CALL,\n            >,\n        ) {\n            let address = aztec::context::UtilityContext::new().this_address();\n            aztec::messages::processing::offchain::receive(address, messages);\n        }\n    }\n}\n\n/// Checks that all functions in the module have a context macro applied.\n///\n/// Non-macroified functions are not allowed in contracts. They must all be one of\n/// [`crate::macros::functions::external`], [`crate::macros::functions::internal`] or `test`.\ncomptime fn check_each_fn_macroified(m: Module) {\n    for f in m.functions() {\n        let name = f.name();\n        if !is_fn_external(f) & !is_fn_contract_library_method(f) & !is_fn_internal(f) & !is_fn_test(f) {\n            // We  don't suggest that #[contract_library_method] is allowed because we don't want to introduce another\n            // concept\n            panic(\n                f\"Function {name} must be marked as either #[external(...)], #[internal(...)], or #[test]\",\n            );\n        }\n    }\n}\n"
     }
   }
 }