@aztec/ivc-integration 5.0.0-nightly.20260430 → 5.0.0-nightly.20260502
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.
- package/artifacts/app_creator.json +1 -1
- package/artifacts/app_reader.json +1 -1
- package/artifacts/mock_hiding.json +2 -2
- package/artifacts/mock_private_kernel_init.json +2 -2
- package/artifacts/mock_private_kernel_inner.json +85 -85
- package/artifacts/mock_private_kernel_reset.json +2 -2
- package/artifacts/mock_private_kernel_tail.json +2 -2
- package/artifacts/mock_rollup_root.json +2 -2
- package/artifacts/mock_rollup_tx_base_private.json +2 -2
- package/artifacts/mock_rollup_tx_base_public.json +2 -2
- package/artifacts/mock_rollup_tx_merge.json +2 -2
- package/package.json +16 -16
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
|
-
"noir_version": "1.0.0-beta.20+
|
|
3
|
-
"hash": "
|
|
2
|
+
"noir_version": "1.0.0-beta.20+20391fdcb15a8ec9086a4ad69c15b33d72ce5ea8",
|
|
3
|
+
"hash": "10315170073161630053",
|
|
4
4
|
"abi": {
|
|
5
5
|
"parameters": [
|
|
6
6
|
{
|
|
@@ -176,8 +176,8 @@
|
|
|
176
176
|
}
|
|
177
177
|
}
|
|
178
178
|
},
|
|
179
|
-
"bytecode": "H4sIAAAAAAAA/
|
|
180
|
-
"debug_symbols": "
|
|
179
|
+
"bytecode": "H4sIAAAAAAAA/8WdB3RU1RaGcxN6CEVUBCyDCEhRKWKjSULHUJVeDGGII8kkJJNIbDCoIGJJJqFZ0YSAAQRFqmBF3nu6R3zPrti72HvnnUnw7IFE57+Ts3NdLNdHOHef/+x9zr37n9yVxAUKV5RmpHi8MQesFv7NiekpqXMSM+cNzvWmJqWkp/vXjB0wcsiggH/tBI/P687JiXFVM+jhse7U3OwcT557QFpatjstxefJ9C4/EDNfX9ZQUyNN8Zoaa0rQ1ERTU03NNDXXdIymFpqO1XScpuM1tdR0gqZWmlpraqPpRE0naTpZ0ymaXJraajpVUztNp2lqr6mDpo6aTtfUSVNnTV00ddV0hqYzNZ2lqZum7pp6aOqp6WxNvTSdo+lcTedpOl/TBZp6a+qjqa+mfpr6a7pQ0wBNiZqSNA3UNEjTYE1DNA3VNEzTcE0jNF2kKVnTSE2jNI3WNEbTWE3jNF2s6RJN4zVN0DRR0yRNkzVN0TRV0zRN0zXN0HSpphRNMzWlapqlya1ptqY0TZdp8mi6XNMcTemaMjR5NWVqytI0V1O2phxNPk25mvI0XaFpnqZ8TVdqukrT1Zqu0XStJr5L0QJGP+NCxusYr2e8gXER4+KCAv7LjbH+dUmZ3hxfite31xXzz/9ZUd1j6RbGWxlvYwzTU8jIN3cqYixmXMa4nHEF40rGVYy3M97BeCfjXYx3M97DuJrxXsb7GEsYSxnXMJYxrmVcx3g/YznjesYNjBsZH2DcxLiZ8UHGhxi3MD7MuJVxG+N2xh2MOxl3MT7CuJtxD+OjjI8xPs74BOOTjE8x7mV8mnEf478Y/834H8ZnGJ9lJMYg43OM+xmfZ/wv4/8YX2B8kfElxpcZX2F8lfE1xtcZ32A8wPgm41uMbzO+w/gu43uM7zN+wPgh40eMHzN+wvgp42eMBxk/Z/yC8UvGrxi/ZvyG8VvG7xi/Z/yB8UfGnxh/ZvyF8VfG3xh/Z/yD8U/GQxqDVkwYW2EcG8ZxYVwnjOuGcb0wrh/GDcK4YRg3CuP4sNt80Gps7z6/PjHbk57uSQvd4otjCv1l4zzetHR3UUFhIPLVVsQhlREzstLdQev4ooICQFH5ANUVZPsmu7MziwqLABEqMiI2aLXc6+o2a2T2u91Xd9oxetA2v3/itNN7fjI0f2dWYdK7PxR9rUZFM3vLyKuKqVmeY23l+QSZPMeqyFieWwnkWc3eynaercCReY6kqmKL/FP4Q4cO/cEh/1mPFfpfgMvSmrENVqHIZlhFxYa1cR2R8YIiLBv/PCrwdUW5W0Ox2gCZtbsp1J5Q02OVbQ1snqPnjxQ1dPgDyH0SUniiTYXglj4JCZvszsjMzh/m9fiK6hUrKeqyyj9llf8SRWlaquoY2WaHR7WCRp0MnKt1lWsalRWoV4ScxBjsLo1MDoc6xeZmCADbNXQPRU/VKci+joVK4gKWYrcklgMlkVgHPPlJ5kK1lbnPnOrkyTvVXKh2Muk5LWLYWLn0nGYuVHuZ9HSIGDZOLj0dzIXqKO0F4mx5gdNlvECciozlo5OAF1Czd6qJF0CelYf7F/BpWdEFGmt0InbKf0brQTozdjHnQTpjw7oc5UGKa685POxUOkOxugD5t98Od1LTY7fCzlG0fpHnV7v0RGjfq4FtA9DZbgstp6uA8apQ2Q5T2Q5SeYaUyvaYyvaQyjOlVHbEVHaEVJ5l03E2VI6zqyqBWp+6uDrHWVD7RrIb0K8dIRF7BHSCRnUXeGarJanA2C2ohy2r09BsN9bDXKieArdS1X10h45VdzU/dqx6QkU5W6AolgNFOTuKm1jkqKHNjWW7O5TtXoBKpOvp5ZI7KQY/FDjHyRNv0L2f6+Q6DNrs85xch0E/fL60H65jyw9fIOOH66jIWD56C/hhNXvvmvrhSHNUGJhu0ED13OtVENFD/R6th+3D2Nech+2DDevris76dcP6rqDIozFUEGz+5+x+uFcM+e4+0OR9oQMUhEY9B+w/+4nsrZaCJbKPiIdXG6krWvFzMKH9pISegQo9FxPaX0romajQ8zChF0oJPQsVej4mdIBNm95I2fR+qhBqieriGtj0xNo76JWLsG/Te0OjkkRseqIKjFVwoK0msZHZJnGguVCDBI6MaoqSIJuepObHjOMgqCiDBYpiOVCUwTaLgm9uLNtJULaHGLLpQ1xyJ8WgTR/q5Ik3aNOHObkOgzZ9uJPrMGjTR0jb9Lq2bPpFMja9roqM5SNZwKar2ZPFXxWuZyvPI2XyXE9FxvI8SiDPavZRtfCqcHJEixn1q8KjGceY+4hjNDZsTFSvCidDHwSMhmKNATJrv/MYpabHKjs6is4nUtTQ4Uf6nrqQwrE2rVu8sm5jDbzTm6zSaGQ/HB41Cho1DjgA/JCNN/uQHWcu1MVR2JxI2Qnd7NDtfzGyAetBJbnEVt8Tb9bkGCyJxDqc8AXjnVyHQV8wwcl1GPQFE51ch0FfMEm6X61vq1+dLNOv1leRsXxMEehX1exT5F9nTbbxoEgOmHzGR+zmon6ddSrjNHN98lRs2LSoXmc10hcd7qanQrGmAfm33wlOUdNj3fRUgQ93K3bpWGjfq4HjsQ8cx0PLmS5gDipUTsBUToBUzpBSORFTORFSeamUykmYykmQyhSbZquxMlvTVQnU+tTFNfg+mUkPNTPiIqJ6nXUKNCpV5PtkM1Vg7BY0y1Y31thsNzbLXCi3wK1UdR+p0LFKVfNjx8oNFWW2QFEsB4oyO4qbWOSooc2NZTsVynaaoe+TpbnkTopBP3yZkyfeoB/2OLkOg374cifXYdAPz5H2ww1s+eF0GT/cQEXG8pEh4IfV7Bnyr7MqAzMTGqiee2mCr7N6GTPNeVgvNizTFZ31m4n1XW+LPBpDBcHmf8fm/ODrrF5o8kzoAL0NjXoH2H/2E5mhloIl0ivi4dVGmo5W/DJMaJaU0BmoUA8mdK6U0EtRoZdjQrOlhKagQudgQnNs2vQEZdOzVCHUEtXFNbDpvto76JWLsG/TM6BRuSI23acCYxXMs9UkJphtEvPMhbpC4MiopigXsum5an7MOF4BFWWeQFEsB4oyz2ZR8M2NZTsXyna+IZue75I7KQZt+pVOnniDNv0qJ9dh0KZf7eQ6DNr0a6RtOi2x5dOvlfHptESFxjIyX8Coh6afL+/UewetRGhgUtAaIujUFzD6zTn1BdgwfzROPZQ5rPU6KPJ0DBUEm/9zGae+AJrcD52gg9Coz0Wc+ny1FCyRC0TsmtpI/dCKD8WELpQS2h8VOgwTep2U0AtRocMxoddLCR2ACh2BCb3BplNvopz6QlUItUR1cQ2c+qLaO+iVi7Dv1OdDoxaLOPVFKjBWwRtt9YlNzPaJN5oLtUTgyIS6osWQVV+sBGDmcQlUlZsEqmI5UJWbbFYF391YthdD2V5qyKovdckdFYNW/WYnj7xBq36Lk+swaNVvdXIdBq36beJWHbidhFn1AiGrfpMKjWWkUMKqq+kL5a268imLoIHq0bdU0KqHYZE5qx7AhhW5onN4i7De6yeRp2OoINj8P8tYdaw9LoJO0E/QqJ9FrHqhWgqWyIDNRMJHcCFa8ZsxocVSQq9Dhd6CCV0mJfR6VOitmNDlUkJvQIXehgldYdOqN1VWXf1ZppaoLq6BVV9Zewe9chH2rTqWwVUiVn2lCozNf7utPrGp2T7xdnOh7pCw6qorWgVZ9VVKAGYe74CqcqdAVSwHqnKnzarguxvL9ioo23cZsup3ueSOikGrfreTR96gVb/HyXUYtOqrnVyHQat+r7hVBz5TC7Pq9wlZ9aUqNJaREgmrrqYvkbfqGUHLBw3MDVr5gla9lHGNOateig1bE41VD2UO6r1igd/VFcX8oYJg89exOT9o1Uuhh+4a5ATFxkGj6ohY9RK1FKyJLhXxa2ojZaEVvxITWiYldC4q9CpM6Fopodmo0KsxoeukhOagQq/BhN5v06o3Uz69TBVCLVFdXAOrXl57B71yEfategk0ar2IVS9XgbEKbrDVJzYz2yduMBdqo4RVV13Resiqr1cCMPO4EarKAwJVsRyoygM2q4Lvbizb66FsbzJk1Te55I6KQau+2ckjb9CqP+jkOgxa9YecXIdBq75F3KoD74OEWfWHhaz6zSo0lpGtElZdTb9V3qorn1IODVSPvk2CVn0b43ZzVn0bNmy7KzqHV45Z5aYiT8dQQbD5m8lY9W3QQ3c71Js3hUY1E7HqW9VSsCZ6m4hfUxupDK34ZkzoDimha1GhD2JCd0oJXYcKfQgTuktK6P2o0C2Y0EdsWvXmyqrvUIVQS1QX18Cq7669g165CPtWfSs0ao+IVd+tAmMVfNRWn9jcbJ/4qLlQj0lYddUV7YGs+h4lADOPj0FVeVygKpYDVXncZlXw3Y1lew+U7ScMWfUnXHJHxaBVf9LJI2/Qqj/l5DoMWvW9Tq7DoFV/OprnaKSwMdAJ3gd4YuQE73PZVxi0ElCNMXbSg/009MKgVYy++HU3VscmUkKXoULvwYQ2lRK6HBW6GhPaTEroClTovZjQ5iJClefdgbZRT2JCj5ESuhMV+hQmtIWU0F2o0L2Y0GOlhD6CCn0aE3qcTc95jNr+Cequpu4X6iSqPa52j6qLWrGKVT7W7cvN9g5M8aUccVH9VTFWbFyduvXqN/CvCz0sQiOOjNugmJbQTbSUbuYR1gErQV/YsFF844QmTZs1P6bFsccd3/KEVq3bnHjSyae42p7a7rT2HTqe3qlzl65nnHlWt+49ep7d65xzzzv/gt59+vbrf+GAxKSBgwYPGTps+IiLkkeOGj1m7LiLLxk/YeKkyVOmTps+49KUmamz3LPTLvNcPic9w5uZNTc7x5ebd8W8/Cuvuvqaa+fTAvLTQrqOrqcbaBEtphv/0km30K10GxVQIQWoiIppGS2nFbSSVtHtdAfdSXfR3XQPraZ76T4qoVJaQ2W0ltbR/VRO62kDbaQHaBNtpgfpIdpCD9NW2kbbaQftpF30CO2mPfQoPUaP0xP0JD1Fe+lp2kf/on/Tf+gZepaIgvQc7afn6b/0P3qBXqSX6GV6hV6l1+h1eoMO0Jv0Fr1N79C79B69Tx/Qh/QRfUyf0Kf0GR2kz+kL+pK+oq/pG/qWvqPv6Qf6kX6in+kX+pV+o9/pD/qTDgUttZ3UPokNWnHB0G/PrRsM/Sa9+sHQjx5rGLQaBa34oNW4oOBATIuAv3RAqic7IbB/S6+uFyRM7LCg4PCX2lX9UrfA/ufrH/z+2X1pBX99qV/VUSOqjppcdVR61S/lV72QFlcdRsXVjLuvmnGbqhm3p5pxz1Qz7tVqxn1Yzbjvqo5T6a86UFUgsL/Nbvfz/Q98dkB1VZtnebLdqT5PnnuGx5unbimr/GuSMr05viJ/2cCKfzrOv3aY1+dOc2eXXNKzB/AhyVHXH2vv+hj/htAZnqXOcFJmVr4OE8N6dOCjZopdM9jjTkd+Mv/GRI83JTu/YviorOK/AsSVDZqbm5KeU2XOWH/Z8NyMrGGzA3pog6Nnt8DZrb+bPaZkoCdPR2MNpeN8mVmFAV72X4kI7AovXkWKZ8zNzfR53F7fyqPlNbJXhtijr483XMZGHPhv8hFbfnjCsLTEcH7+5iqrJDk3PaxuEYePy51ZTfSS5My8QDX74KhixOvl/B9drSuzda4AAA==",
|
|
180
|
+
"debug_symbols": "tZhbbhpBFET3Mt98TN9HP7KVKLKwjSMkhC0CkSIre093Vxd5SDNCRvmhjo2nXLeayyDep+fd4+Xrw/748vpt+vT5fXo87Q+H/deHw+vT9rx/Pdbfvv/cTPzx4Xza7eqvpj+er1e9bU+743n6dLwcDpvp+/Zw6X/07W177Hrenuqz82baHZ+rVsOX/WHX6Ofm99Xz8qXmNi529evl/vf1Yfl6VQ/DQE3t6iDh1gRuNIghLiXQ/5kgRh0GyWwpgS9fL1HTMJCY5bdDuNkhzZxBkviSQ1qZIaXIGlPRq0O82SALh4jZykcMUr4apCWDtRJy5AhSgn6kxqJydfC85BDk3h5XHW4qct3hliZXXtDJ+Y6Qcllc6riyUyHzbUEl2GKRaxaierXwZYt891nku88i33sWq0VovhZhwT/UZX1fu1p4WrIQvbfLVYebulx3uLtLN2cRbnGpiJXVyDOHyP/c777Un7ZP+9Nfd+gp1JE2k9Qb5WbSGnUzWX/0/hj7Y+qPuT+WaryZwgwJEIEopBqUKg6JkATJkNJFZkjoziIQpBDEEOQQBBEkEUSR0kVnCLIosiiyqEEcgiyKLIosiiyGLBYgAlEIJjJMZHCx6hLqQVgeijSONI6ZHDM5ZvJRLWby2EN5gmQI+o3oN2KmiJki0kSkiUgTkSZipoiZImZKmClhpoSZElySIXbyoeOo0XBCwwkz5eoT6v07h6EyVIfaUB9avULdk5yG5qEFWuahza++7ooM1aE21IfGoQn+JQ8t0DDPhEAQghIM/zTMToiERMiEgv8Y2gsdEAhCUIIRnBAJiZAJdG4v/uANAoGZhZnFCE6IhETIhNFu0JkQCEJQAttQtqHMrMyszKzMbGzD2IaxDWMbxjaMbRid+8q0SfvOdOAJOk/QeYLONtryhNTACE5ozv29JhEyoQxoqwQIBCFUZ5kbGMEJkZAImVAGtPUCBIIQ6NzWTNoUbc8AcYRvqwbIhDKgL1yHQBCCjvB96To4gW1ktpHZRmYbhZkLMxdmLsxc2EZhG4VtFLZR2EYZbcg8EwImlbaDgHGCMhvBCZHQnNudqO0goAxoOyjWIBCEoAQjOCESmrM3yIQyoO0gIBCEoAQjOCES6Nx2UPotrAxoO9jDtx0ECEEJRnBCJKQRvu0goAwwtmFsw9iGsQ1jZmNmY2ZjZmMbxjacbTjbcLbhbMPp3HawT9p2EMATdJ6g8wQj22g72D5lSdtBaR/0vm9P++3jYTe+Lni5HJ/++Pbg/OONz/D7hbfT69Pu+XLatc8x/bn6yeYX",
|
|
181
181
|
"file_map": {
|
|
182
182
|
"6": {
|
|
183
183
|
"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",
|
|
@@ -669,35 +669,35 @@
|
|
|
669
669
|
}
|
|
670
670
|
},
|
|
671
671
|
"verificationKey": {
|
|
672
|
-
"bytes": "
|
|
672
|
+
"bytes": "000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000000000000000000000000000210000000000000000000000000000000000000000000000000000000000000164000000000000000000000000000000cdc41b285d261a63d5017568df9f424bba00000000000000000000000000000000000464edda659e9dfa0300e55633bc4e000000000000000000000000000000ae0a237c7f7c8092bacfa4c45b14214b2e00000000000000000000000000000000001ed5bf0dafaa12d5b6c2c9c5f2d879000000000000000000000000000000a9be959680e45fc6731e02456738e51499000000000000000000000000000000000029e27039e98e04039ed290ee28d0e8000000000000000000000000000000ab41a84d2ac77eda214bdfa4b4a1eb413e00000000000000000000000000000000000d96beb460095e924ecc66bc6e0688000000000000000000000000000000dc09d0373c7d254624b470e7088d42c17d00000000000000000000000000000000001e4fdaf942ed89144c0c3a588a59e1000000000000000000000000000000d720eaf49abebf4f6c0f5d2ab2a14a54f500000000000000000000000000000000000cceb15bc516fd648dee88b4d11e6e000000000000000000000000000000dcf21f94df942e7af6e3ce9730f6a1aef800000000000000000000000000000000001fcb7ba9a09c374c9a8a8d7566b46f0000000000000000000000000000001f9a1142d9a0deac3c562d21cf7c6b3805000000000000000000000000000000000007e4adb79c396b5aabad715c17e3170000000000000000000000000000001048d96e4691d4ba8778ca53d64bda176300000000000000000000000000000000002eece405ca59308a7bd159957bc421000000000000000000000000000000df5e2ad25c0399fdcd66676882949aabdf0000000000000000000000000000000000250fdedeaf596c687a851682194473000000000000000000000000000000944cc7d8a98cc2f993c4e56bc9b33aa3c2000000000000000000000000000000000007884bf16c8bed0bc64c0399e02178000000000000000000000000000000e6aaaf7c2c7b9f06ca345ecc701d8dfe4600000000000000000000000000000000001ce12d56661e65a841e74390b5d06c0000000000000000000000000000003092444d77dcaa70d6b230ceb32d41ed9000000000000000000000000000000000000091ab08bc8b8468a1333ad9e8f21a00000000000000000000000000000012c2745475365c4dceb6a898d326d5b67100000000000000000000000000000000002b7f39cf462e564f9a0fd008a3ba660000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000c5a42168063c333643cec5150b9eabe2b300000000000000000000000000000000002cdf2b87e67901d8980ed5ea3960e60000000000000000000000000000001bdb69a7523d78e8770d3cb1c2fb95470a0000000000000000000000000000000000108b6d10d8a7d157533d8118bec0d3000000000000000000000000000000b69859c77b721d59f5b3fd7680b3d6f8d3000000000000000000000000000000000009dcc0b83b775dcb71a7bbbd88e593000000000000000000000000000000cb1df32535cbfbeac4fdd3d4bb2e2f6d7900000000000000000000000000000000000890a3d00b4543fde4ef51f075e5e500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002ea14af724c2e44410a957466463802bb800000000000000000000000000000000002ee294ce979312299b92d21e54aaa80000000000000000000000000000004ee278b31ffd0976e2f40563dde071ca48000000000000000000000000000000000025387d7bcbe2dbc534b330c69ca7e50000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e12796a947954d44b715ba2d4a9420b5be00000000000000000000000000000000001c9520b9f53e1732e7b317ad270721000000000000000000000000000000ad594c9fe520f008f827767186e3a5605f00000000000000000000000000000000002458b669fa8d52eccd5568a720356a000000000000000000000000000000021fb7cff94c4fe5aa96e00ac2dd2e299600000000000000000000000000000000002b7404fbc5d559ea3a53080ad334d800000000000000000000000000000040db0e65c6da4f8baad987756933082893000000000000000000000000000000000025e6cffea0d8c55ffc7f34bc78a604000000000000000000000000000000a3d1b0516491b5891d398836a96e04b9090000000000000000000000000000000000115596c011a2bebde69b7224bead8b000000000000000000000000000000791d21b1dd451d8bdafae9d4e46edde7e30000000000000000000000000000000000074f5587003e8ac6547801312f962b000000000000000000000000000000d8cdd9e3670adb6c83091d1fb7c47b7e2500000000000000000000000000000000000f7d6572c5985b9445e6919f9cc918000000000000000000000000000000de68495b76b97729c7ea2b18cefa30d06a00000000000000000000000000000000002d14d0bea5424d6de0e94b73f6a112000000000000000000000000000000a10daff73d2f7f24b2ba6b2e25cbd9c85d00000000000000000000000000000000001727455d6943a7b85e15cfd2a44afb000000000000000000000000000000244c68255b28d06df9eab137c8e95c82460000000000000000000000000000000000057c48c18e0f53812f7633a14e5e94000000000000000000000000000000ca6963cf3fdb7b12c0a53c65039ae8498b00000000000000000000000000000000002ff2ff4ebba84e1cf54d38f802ffe100000000000000000000000000000059415ac92ac42c4d84c8f52ecc0a86252d00000000000000000000000000000000000d4ec3e79873f51e38866b304271db0000000000000000000000000000008f231a6586a81734e55bca16b3a28a90ad0000000000000000000000000000000000004161b60a9fee351526e27828ad2600000000000000000000000000000012659cbd1a328e155017a670fc268c623f000000000000000000000000000000000018734457fa3cbc6fe6ebc5babb4ae8000000000000000000000000000000ebdf74d4104f49141c3faa22b410e458a900000000000000000000000000000000000fcda573c144da92363dcf20c21f360000000000000000000000000000001bd95b8dbf0b2cfe4c5771a0fe8416297f00000000000000000000000000000000000dee78ab47e4c5f7d7de5da4c53e38000000000000000000000000000000df75aeb119998a84c1397a8c0b6992801e0000000000000000000000000000000000045cd72777687d3ba4d0881c6b76e30000000000000000000000000000000a7b87d15509579596d2b9aebab167533c00000000000000000000000000000000000baf1696c9bb0e89e89ceb84bcb9410000000000000000000000000000009597a6140ff1d76e5f426277c47a2b54cf00000000000000000000000000000000000905f08e7e753ccff2b4cf030f0cf0000000000000000000000000000000d4b122839eef07c0d97aa36c46b98e97c80000000000000000000000000000000000299ee3df8a4b27a1e146cbaded89e3000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002b81f74bcc5a6754c493db4ce0a05f82f7000000000000000000000000000000000024a6aadd179220b0db53d1dfe9ff1700000000000000000000000000000069c6bf62cc62d8e427ede7bb73d18d4d63000000000000000000000000000000000002a459f11edd03308970404f9b36480000000000000000000000000000005f9561f074f3a72a87cdee41ee5b5ff7e20000000000000000000000000000000000242215a8a7120eb0cc42ffe9c01790000000000000000000000000000000821e8e89bb46328a624a03d5b7f5b3ac6100000000000000000000000000000000000e7a352b445ee4f62e2812fdf8997000000000000000000000000000000014f0863f2eef8c90fa2ecd91e1e10b572c000000000000000000000000000000000017bd913cb2426b7f89ca0e2dd4e73d000000000000000000000000000000bc2c6d52ed3523bb441f7674e48465fa98000000000000000000000000000000000017bd63ba535af74d8a9188e022f432",
|
|
673
673
|
"fields": [
|
|
674
674
|
"0x0000000000000000000000000000000000000000000000000000000000000010",
|
|
675
675
|
"0x0000000000000000000000000000000000000000000000000000000000000021",
|
|
676
676
|
"0x0000000000000000000000000000000000000000000000000000000000000164",
|
|
677
|
-
"
|
|
678
|
-
"
|
|
679
|
-
"
|
|
680
|
-
"
|
|
681
|
-
"
|
|
682
|
-
"
|
|
683
|
-
"
|
|
684
|
-
"
|
|
685
|
-
"
|
|
686
|
-
"
|
|
687
|
-
"
|
|
688
|
-
"
|
|
689
|
-
"
|
|
690
|
-
"
|
|
691
|
-
"
|
|
692
|
-
"
|
|
693
|
-
"
|
|
694
|
-
"
|
|
695
|
-
"
|
|
696
|
-
"
|
|
697
|
-
"
|
|
698
|
-
"
|
|
699
|
-
"
|
|
700
|
-
"
|
|
677
|
+
"0x000000000000000000000000000000cdc41b285d261a63d5017568df9f424bba",
|
|
678
|
+
"0x00000000000000000000000000000000000464edda659e9dfa0300e55633bc4e",
|
|
679
|
+
"0x000000000000000000000000000000ae0a237c7f7c8092bacfa4c45b14214b2e",
|
|
680
|
+
"0x00000000000000000000000000000000001ed5bf0dafaa12d5b6c2c9c5f2d879",
|
|
681
|
+
"0x000000000000000000000000000000a9be959680e45fc6731e02456738e51499",
|
|
682
|
+
"0x000000000000000000000000000000000029e27039e98e04039ed290ee28d0e8",
|
|
683
|
+
"0x000000000000000000000000000000ab41a84d2ac77eda214bdfa4b4a1eb413e",
|
|
684
|
+
"0x00000000000000000000000000000000000d96beb460095e924ecc66bc6e0688",
|
|
685
|
+
"0x000000000000000000000000000000dc09d0373c7d254624b470e7088d42c17d",
|
|
686
|
+
"0x00000000000000000000000000000000001e4fdaf942ed89144c0c3a588a59e1",
|
|
687
|
+
"0x000000000000000000000000000000d720eaf49abebf4f6c0f5d2ab2a14a54f5",
|
|
688
|
+
"0x00000000000000000000000000000000000cceb15bc516fd648dee88b4d11e6e",
|
|
689
|
+
"0x000000000000000000000000000000dcf21f94df942e7af6e3ce9730f6a1aef8",
|
|
690
|
+
"0x00000000000000000000000000000000001fcb7ba9a09c374c9a8a8d7566b46f",
|
|
691
|
+
"0x0000000000000000000000000000001f9a1142d9a0deac3c562d21cf7c6b3805",
|
|
692
|
+
"0x000000000000000000000000000000000007e4adb79c396b5aabad715c17e317",
|
|
693
|
+
"0x0000000000000000000000000000001048d96e4691d4ba8778ca53d64bda1763",
|
|
694
|
+
"0x00000000000000000000000000000000002eece405ca59308a7bd159957bc421",
|
|
695
|
+
"0x000000000000000000000000000000df5e2ad25c0399fdcd66676882949aabdf",
|
|
696
|
+
"0x0000000000000000000000000000000000250fdedeaf596c687a851682194473",
|
|
697
|
+
"0x000000000000000000000000000000944cc7d8a98cc2f993c4e56bc9b33aa3c2",
|
|
698
|
+
"0x000000000000000000000000000000000007884bf16c8bed0bc64c0399e02178",
|
|
699
|
+
"0x000000000000000000000000000000e6aaaf7c2c7b9f06ca345ecc701d8dfe46",
|
|
700
|
+
"0x00000000000000000000000000000000001ce12d56661e65a841e74390b5d06c",
|
|
701
701
|
"0x0000000000000000000000000000003092444d77dcaa70d6b230ceb32d41ed90",
|
|
702
702
|
"0x00000000000000000000000000000000000091ab08bc8b8468a1333ad9e8f21a",
|
|
703
703
|
"0x00000000000000000000000000000012c2745475365c4dceb6a898d326d5b671",
|
|
@@ -706,66 +706,66 @@
|
|
|
706
706
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
707
707
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
708
708
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
709
|
-
"
|
|
710
|
-
"
|
|
711
|
-
"
|
|
712
|
-
"
|
|
713
|
-
"
|
|
714
|
-
"
|
|
715
|
-
"
|
|
716
|
-
"
|
|
709
|
+
"0x000000000000000000000000000000c5a42168063c333643cec5150b9eabe2b3",
|
|
710
|
+
"0x00000000000000000000000000000000002cdf2b87e67901d8980ed5ea3960e6",
|
|
711
|
+
"0x0000000000000000000000000000001bdb69a7523d78e8770d3cb1c2fb95470a",
|
|
712
|
+
"0x0000000000000000000000000000000000108b6d10d8a7d157533d8118bec0d3",
|
|
713
|
+
"0x000000000000000000000000000000b69859c77b721d59f5b3fd7680b3d6f8d3",
|
|
714
|
+
"0x000000000000000000000000000000000009dcc0b83b775dcb71a7bbbd88e593",
|
|
715
|
+
"0x000000000000000000000000000000cb1df32535cbfbeac4fdd3d4bb2e2f6d79",
|
|
716
|
+
"0x00000000000000000000000000000000000890a3d00b4543fde4ef51f075e5e5",
|
|
717
717
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
718
718
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
719
719
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
720
720
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
721
|
-
"
|
|
722
|
-
"
|
|
723
|
-
"
|
|
724
|
-
"
|
|
721
|
+
"0x0000000000000000000000000000002ea14af724c2e44410a957466463802bb8",
|
|
722
|
+
"0x00000000000000000000000000000000002ee294ce979312299b92d21e54aaa8",
|
|
723
|
+
"0x0000000000000000000000000000004ee278b31ffd0976e2f40563dde071ca48",
|
|
724
|
+
"0x000000000000000000000000000000000025387d7bcbe2dbc534b330c69ca7e5",
|
|
725
725
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
726
726
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
727
727
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
728
728
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
729
|
-
"
|
|
730
|
-
"
|
|
731
|
-
"
|
|
732
|
-
"
|
|
733
|
-
"
|
|
734
|
-
"
|
|
735
|
-
"
|
|
736
|
-
"
|
|
737
|
-
"
|
|
738
|
-
"
|
|
739
|
-
"
|
|
740
|
-
"
|
|
741
|
-
"
|
|
742
|
-
"
|
|
743
|
-
"
|
|
744
|
-
"
|
|
745
|
-
"
|
|
746
|
-
"
|
|
747
|
-
"
|
|
748
|
-
"
|
|
749
|
-
"
|
|
750
|
-
"
|
|
751
|
-
"
|
|
752
|
-
"
|
|
753
|
-
"
|
|
754
|
-
"
|
|
755
|
-
"
|
|
756
|
-
"
|
|
757
|
-
"
|
|
758
|
-
"
|
|
759
|
-
"
|
|
760
|
-
"
|
|
761
|
-
"
|
|
762
|
-
"
|
|
763
|
-
"
|
|
764
|
-
"
|
|
765
|
-
"
|
|
766
|
-
"
|
|
767
|
-
"
|
|
768
|
-
"
|
|
729
|
+
"0x000000000000000000000000000000e12796a947954d44b715ba2d4a9420b5be",
|
|
730
|
+
"0x00000000000000000000000000000000001c9520b9f53e1732e7b317ad270721",
|
|
731
|
+
"0x000000000000000000000000000000ad594c9fe520f008f827767186e3a5605f",
|
|
732
|
+
"0x00000000000000000000000000000000002458b669fa8d52eccd5568a720356a",
|
|
733
|
+
"0x000000000000000000000000000000021fb7cff94c4fe5aa96e00ac2dd2e2996",
|
|
734
|
+
"0x00000000000000000000000000000000002b7404fbc5d559ea3a53080ad334d8",
|
|
735
|
+
"0x00000000000000000000000000000040db0e65c6da4f8baad987756933082893",
|
|
736
|
+
"0x000000000000000000000000000000000025e6cffea0d8c55ffc7f34bc78a604",
|
|
737
|
+
"0x000000000000000000000000000000a3d1b0516491b5891d398836a96e04b909",
|
|
738
|
+
"0x0000000000000000000000000000000000115596c011a2bebde69b7224bead8b",
|
|
739
|
+
"0x000000000000000000000000000000791d21b1dd451d8bdafae9d4e46edde7e3",
|
|
740
|
+
"0x0000000000000000000000000000000000074f5587003e8ac6547801312f962b",
|
|
741
|
+
"0x000000000000000000000000000000d8cdd9e3670adb6c83091d1fb7c47b7e25",
|
|
742
|
+
"0x00000000000000000000000000000000000f7d6572c5985b9445e6919f9cc918",
|
|
743
|
+
"0x000000000000000000000000000000de68495b76b97729c7ea2b18cefa30d06a",
|
|
744
|
+
"0x00000000000000000000000000000000002d14d0bea5424d6de0e94b73f6a112",
|
|
745
|
+
"0x000000000000000000000000000000a10daff73d2f7f24b2ba6b2e25cbd9c85d",
|
|
746
|
+
"0x00000000000000000000000000000000001727455d6943a7b85e15cfd2a44afb",
|
|
747
|
+
"0x000000000000000000000000000000244c68255b28d06df9eab137c8e95c8246",
|
|
748
|
+
"0x0000000000000000000000000000000000057c48c18e0f53812f7633a14e5e94",
|
|
749
|
+
"0x000000000000000000000000000000ca6963cf3fdb7b12c0a53c65039ae8498b",
|
|
750
|
+
"0x00000000000000000000000000000000002ff2ff4ebba84e1cf54d38f802ffe1",
|
|
751
|
+
"0x00000000000000000000000000000059415ac92ac42c4d84c8f52ecc0a86252d",
|
|
752
|
+
"0x00000000000000000000000000000000000d4ec3e79873f51e38866b304271db",
|
|
753
|
+
"0x0000000000000000000000000000008f231a6586a81734e55bca16b3a28a90ad",
|
|
754
|
+
"0x0000000000000000000000000000000000004161b60a9fee351526e27828ad26",
|
|
755
|
+
"0x00000000000000000000000000000012659cbd1a328e155017a670fc268c623f",
|
|
756
|
+
"0x000000000000000000000000000000000018734457fa3cbc6fe6ebc5babb4ae8",
|
|
757
|
+
"0x000000000000000000000000000000ebdf74d4104f49141c3faa22b410e458a9",
|
|
758
|
+
"0x00000000000000000000000000000000000fcda573c144da92363dcf20c21f36",
|
|
759
|
+
"0x0000000000000000000000000000001bd95b8dbf0b2cfe4c5771a0fe8416297f",
|
|
760
|
+
"0x00000000000000000000000000000000000dee78ab47e4c5f7d7de5da4c53e38",
|
|
761
|
+
"0x000000000000000000000000000000df75aeb119998a84c1397a8c0b6992801e",
|
|
762
|
+
"0x0000000000000000000000000000000000045cd72777687d3ba4d0881c6b76e3",
|
|
763
|
+
"0x0000000000000000000000000000000a7b87d15509579596d2b9aebab167533c",
|
|
764
|
+
"0x00000000000000000000000000000000000baf1696c9bb0e89e89ceb84bcb941",
|
|
765
|
+
"0x0000000000000000000000000000009597a6140ff1d76e5f426277c47a2b54cf",
|
|
766
|
+
"0x00000000000000000000000000000000000905f08e7e753ccff2b4cf030f0cf0",
|
|
767
|
+
"0x000000000000000000000000000000d4b122839eef07c0d97aa36c46b98e97c8",
|
|
768
|
+
"0x0000000000000000000000000000000000299ee3df8a4b27a1e146cbaded89e3",
|
|
769
769
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
770
770
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
771
771
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
@@ -786,10 +786,10 @@
|
|
|
786
786
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
787
787
|
"0x0000000000000000000000000000000000000000000000000000000000000002",
|
|
788
788
|
"0x0000000000000000000000000000000000000000000000000000000000000000",
|
|
789
|
-
"
|
|
790
|
-
"
|
|
791
|
-
"
|
|
792
|
-
"
|
|
789
|
+
"0x0000000000000000000000000000002b81f74bcc5a6754c493db4ce0a05f82f7",
|
|
790
|
+
"0x000000000000000000000000000000000024a6aadd179220b0db53d1dfe9ff17",
|
|
791
|
+
"0x00000000000000000000000000000069c6bf62cc62d8e427ede7bb73d18d4d63",
|
|
792
|
+
"0x000000000000000000000000000000000002a459f11edd03308970404f9b3648",
|
|
793
793
|
"0x0000000000000000000000000000005f9561f074f3a72a87cdee41ee5b5ff7e2",
|
|
794
794
|
"0x0000000000000000000000000000000000242215a8a7120eb0cc42ffe9c01790",
|
|
795
795
|
"0x000000000000000000000000000000821e8e89bb46328a624a03d5b7f5b3ac61",
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@aztec/ivc-integration",
|
|
3
|
-
"version": "5.0.0-nightly.
|
|
3
|
+
"version": "5.0.0-nightly.20260502",
|
|
4
4
|
"type": "module",
|
|
5
5
|
"exports": {
|
|
6
6
|
".": "./dest/index.js",
|
|
@@ -59,14 +59,14 @@
|
|
|
59
59
|
]
|
|
60
60
|
},
|
|
61
61
|
"dependencies": {
|
|
62
|
-
"@aztec/bb.js": "5.0.0-nightly.
|
|
63
|
-
"@aztec/constants": "5.0.0-nightly.
|
|
64
|
-
"@aztec/foundation": "5.0.0-nightly.
|
|
65
|
-
"@aztec/noir-noir_codegen": "5.0.0-nightly.
|
|
66
|
-
"@aztec/noir-noir_js": "5.0.0-nightly.
|
|
67
|
-
"@aztec/noir-noirc_abi": "5.0.0-nightly.
|
|
68
|
-
"@aztec/noir-types": "5.0.0-nightly.
|
|
69
|
-
"@aztec/stdlib": "5.0.0-nightly.
|
|
62
|
+
"@aztec/bb.js": "5.0.0-nightly.20260502",
|
|
63
|
+
"@aztec/constants": "5.0.0-nightly.20260502",
|
|
64
|
+
"@aztec/foundation": "5.0.0-nightly.20260502",
|
|
65
|
+
"@aztec/noir-noir_codegen": "5.0.0-nightly.20260502",
|
|
66
|
+
"@aztec/noir-noir_js": "5.0.0-nightly.20260502",
|
|
67
|
+
"@aztec/noir-noirc_abi": "5.0.0-nightly.20260502",
|
|
68
|
+
"@aztec/noir-types": "5.0.0-nightly.20260502",
|
|
69
|
+
"@aztec/stdlib": "5.0.0-nightly.20260502",
|
|
70
70
|
"change-case": "^5.4.4",
|
|
71
71
|
"pako": "^2.1.0",
|
|
72
72
|
"playwright": "1.49.0",
|
|
@@ -74,13 +74,13 @@
|
|
|
74
74
|
"tslib": "^2.4.0"
|
|
75
75
|
},
|
|
76
76
|
"devDependencies": {
|
|
77
|
-
"@aztec/bb-prover": "5.0.0-nightly.
|
|
78
|
-
"@aztec/kv-store": "5.0.0-nightly.
|
|
79
|
-
"@aztec/noir-protocol-circuits-types": "5.0.0-nightly.
|
|
80
|
-
"@aztec/noir-test-contracts.js": "5.0.0-nightly.
|
|
81
|
-
"@aztec/simulator": "5.0.0-nightly.
|
|
82
|
-
"@aztec/telemetry-client": "5.0.0-nightly.
|
|
83
|
-
"@aztec/world-state": "5.0.0-nightly.
|
|
77
|
+
"@aztec/bb-prover": "5.0.0-nightly.20260502",
|
|
78
|
+
"@aztec/kv-store": "5.0.0-nightly.20260502",
|
|
79
|
+
"@aztec/noir-protocol-circuits-types": "5.0.0-nightly.20260502",
|
|
80
|
+
"@aztec/noir-test-contracts.js": "5.0.0-nightly.20260502",
|
|
81
|
+
"@aztec/simulator": "5.0.0-nightly.20260502",
|
|
82
|
+
"@aztec/telemetry-client": "5.0.0-nightly.20260502",
|
|
83
|
+
"@aztec/world-state": "5.0.0-nightly.20260502",
|
|
84
84
|
"@jest/globals": "^30.0.0",
|
|
85
85
|
"@playwright/test": "1.49.0",
|
|
86
86
|
"@types/jest": "^30.0.0",
|