@aztec/ivc-integration 1.0.0-staging.2 → 1.0.0
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/keys/mock_private_kernel_init.vk.data.json +61 -61
- package/artifacts/keys/mock_private_kernel_inner.vk.data.json +61 -61
- package/artifacts/keys/mock_private_kernel_reset.vk.data.json +61 -61
- package/artifacts/keys/mock_private_kernel_tail.ivc.vk +0 -0
- package/artifacts/keys/mock_private_kernel_tail.vk.data.json +61 -61
- package/artifacts/keys/mock_rollup_base_public.vk.data.json +85 -85
- package/artifacts/keys/mock_rollup_root_verifier.sol +2 -2
- package/artifacts/mock_private_kernel_init.json +1 -1
- package/artifacts/mock_private_kernel_inner.json +1 -1
- package/artifacts/mock_private_kernel_reset.json +1 -1
- package/artifacts/mock_private_kernel_tail.json +1 -1
- package/artifacts/mock_rollup_base_private.json +1 -1
- package/artifacts/mock_rollup_base_public.json +1 -1
- package/artifacts/mock_rollup_merge.json +1 -1
- package/artifacts/mock_rollup_root.json +1 -1
- package/dest/prove_native.d.ts +1 -2
- package/dest/prove_native.d.ts.map +1 -1
- package/dest/prove_native.js +1 -2
- package/dest/types/index.d.ts +17 -17
- package/dest/types/index.d.ts.map +1 -1
- package/dest/witgen.d.ts +8 -6
- package/dest/witgen.d.ts.map +1 -1
- package/dest/witgen.js +17 -14
- package/package.json +16 -16
- package/src/prove_native.ts +3 -3
- package/src/types/index.ts +18 -18
- package/src/witgen.ts +35 -26
|
@@ -1 +1 @@
|
|
|
1
|
-
{"noir_version":"1.0.0-beta.7+0000000000000000000000000000000000000000","hash":"5249758506543020047","abi":{"parameters":[{"name":"prev_kernel_public_inputs","type":{"kind":"struct","path":"mock_types::PrivateKernelPublicInputs","fields":[{"name":"remaining_calls","type":{"kind":"integer","sign":"unsigned","width":32}},{"name":"commitments","type":{"kind":"array","length":4,"type":{"kind":"field"}}},{"name":"read_requests","type":{"kind":"array","length":4,"type":{"kind":"field"}}}]},"visibility":"databus"},{"name":"kernel_vk","type":{"kind":"struct","path":"mock_types::protocol_types::proof::verification_key::VerificationKey","fields":[{"name":"key","type":{"kind":"array","length":127,"type":{"kind":"field"}}},{"name":"hash","type":{"kind":"field"}}]},"visibility":"private"},{"name":"commitment_read_hints","type":{"kind":"array","length":4,"type":{"kind":"integer","sign":"unsigned","width":32}},"visibility":"private"}],"return_type":{"abi_type":{"kind":"struct","path":"mock_types::PrivateKernelPublicInputs","fields":[{"name":"remaining_calls","type":{"kind":"integer","sign":"unsigned","width":32}},{"name":"commitments","type":{"kind":"array","length":4,"type":{"kind":"field"}}},{"name":"read_requests","type":{"kind":"array","length":4,"type":{"kind":"field"}}}]},"visibility":"databus"},"error_types":{"14225679739041873922":{"error_kind":"string","string":"Index out of bounds"}}},"bytecode":"H4sIAAAAAAAA/+Wc91cdRRzFhweYgonRgN34jLG33fcoDwti7C3GrlFjQgBLLLF3E2Ol2DWQxBhCCKQBaUAKP+q/5fFddwevy4Ln5N15hz2Zc/bsh91luN+Z7+ybGeCWmKCM549lIZfkj9LwjJKmr8vCa+X547T8MSt/zI75vrbw+/hae8y1jphrnXStIn+sp/rn5I+/Qp5LXEF8OvE84vnEZxAvID6T+CzihcSVxFXEZxOfQ3wu8XnE5xNfQHwh8UXEi4gvJk4TX0K8mPhS4iXElxFfTnwF8ZXEVxFfTXwN8bXE1xFfT3wDsUfsE2eIs8TVxDXEtcR1xDnieuIbiW8ivpn4FuIG4luJG4lvI15KfDvxHcR3Et9FfDfxPcT3Et9HfD/xA8QPEi8jfoh4OfHDxI8QP0r8GPHjxE8QP0n8FPHTxCuInyF+lvg54pXEzxOvIl5N3ES8hriZuIW4lfgF4heJXyJ+mXgt8SvErxK/Rvw68TriN4jfJH6L+G3id4jfJX6P+H3iD4g/JP6I+GPiT4g/JV5PvIH4M+KNxJ8Tf0H8JfFXxF+HHC249014D58XZXQ97lmUxvDsFVb8Nqor69VWV7fUZVr8rL/ay9Q35Wq86pqm2pyf82tyNc2ZXDbbkqvO1dU31dd59X51tsVvranPtrT+U5pZ7yaXglF5KlJvoeI3CTV2CXS1hpW5asOumHoLbcMunUavLNRn+7lYg8A7yRI0QeuaGLmF1u1b4LboDs+bbYPYmWZ3eOZreCgdEVXqsBFPMpEyYdL73UY3gDaLO1edfF3UZ0YYd7dOo2c/leZQ/tjBae9FV08lkWeVsdkXWErcF21CjVuEulLm31kBF1H93lT95BVW/C0J0LhVrVGdlOVhsqsSE3VtNboZlK23fCZ3yhTJU2jMvwl1pkz8lF/dDuoBpGwDVxq3qTW6mAVsc5CgvycnQf1TOUGV/fSfzlEn1HajndYk8Y23PQEae0xCEmqHTmgmqQm1IwEae01CEmqnTmg2qQm1MwEa+5Qai7ln3i5I1rg9810uBaNy1YrPit8l1NhvdG8AV23Yb/R75v06jUXdM28X1FXsPfOB8LzbNojdHx8wk/fM8VA6Ikq9Zy54k0zsmQ8Y3QDaLe5cdfL1U58ZYdwDRvuxqdZnX0LqLcZ2ocY9Ql1J3ffekwCNe9Ua1UmJXyap9717HOjsEWrc5yBx4vqmUJ3K2dp+YV+4inWvuI/3z/ABXczlVIegbeOWU4MuBQ8a/XJqUKhxSJiwrtpwyOiXU0NGOwiKtZzqENRV7OXUcHg+YBvELp2GzeTlFB5KR0Spl1OCN8nEcmrY6AbQAXHnqpNviPrMCOMeNtrZjFqffQmpZ4QdQo0HhbqSupw6mACNh9Qa1UmJv8tTL6d6HejsFWo87CBx4vqmUJ3K2doRYV+4ivWQuI+PzPABXczlVKegbeOWUyMuBY8Y/XJqRKhxVJiwrtpw1OiXU6NGOwiKtZzqFNRV7OXUWHg+ahvELp3GzOTlFB5KR0Spl1OCN8nEcmrM6AbQUXHnqpNvlPrMCOMeM9rZjFqffQmpZ4SdQo3HhLqSupw6lgCNx9Ua1UmJf3FSL6f6HOjsE2o84SBx4vqmUJ3K2dq4sC9cxXpc3MfjSRjQjnJHGfO3CYm5RBjzdwmJOSWM+fuExFwqjPmHhMRcJoz5R3HM6gm4/U9R9bv7pxkeN/5CY5+DuH+e4XFjK/Wwg7h/meFxY85zwkHcvwrjxrsW49FaJmAugM9GfFbg3Yl3CcYVcgztjZ+dCmMqo++x5f/sFvBzYB4H0ziYxcEkDuZwMIVbYAITOJi/wfQNZm8weYO5G0zdYOYGEzeYt8G0DWZtMGlbZAJTtrQJTNgWm8B0DWZrMFmDuRpM1WCmBhM1mKfBNA1maTBJgzkaTNGQBJj8wvwMpmcwO4PJGczNYGoGMzOYmMG8DKZlMCuDSVmDCUzJGk1gQrbUBKZjMBuDyRjMxWAqBjMxmIjBPAymYTALg0kYzMFgCrbcBCZgMP+C6RfMvmDyBXMvmHrBzAsmXjDvgmkXzLpg0rXSBKZcq0xgwtVkAtMtmG3BZAvmWjDVgpkWTLRgngXTLJhlwSQL5lgwxVpnAhMsmF/B9ApmVzC5grkVTK1gZgUTK5hXwbQKZlUwqYI5FUypNpjAhGqjCUynYDYFkymYS8FUCuZRsK7An/Hid8/YMIkW3qiYH55TZsH8FX+s/ZOfWzLNPX+aew1T3LOf53Mi56rwbDc1G8OvvcKKb+uvdFO/N8tMLlXElZE4U3SvUaTB1mc3fMvN5JKK3LPPzo7oK9Hr86NaSmN+li0Lw3MlXauaQutcqkfYpxlbf4Wb+mNzZi5xReSe7bu4zcWSKb5ORc7TPTvdryHnxdyzddq+Yr02jr8BRbrm23VVAAA=","debug_symbols":"pZTBjsIgFEX/hXUXUOBB/ZXJxNSKExJCG2wnmRj/fZ5c6+jCxDibHlu8p7dAOIl92C1f25gP41FsPk5iV2JK8WubxqGf45j56enciPV2O5cQ+JG4G+fU1JeQZ7HJS0qN+O7TUv90nPpcOfeFR2UjQt4zWXiIKVx+nZu/tHweJWmvYfJ0i9vHvHqeV6RXgXLK3wxt+2oDZ81V4Jx/1uClvJfmjbz3a76T77zfG7rlu//l6Z181/l1AaSRD4JPvuuHWB42nSBenUY4seHv9vXa1auSnGIooAU0YADL+4RBgANY4hhs4SatBBTQAhowgAUIcIAH0EVLQAHootFFo4u2AAHooj3Q1UpGAgpoq8xowACwGFiMAzzQVVhZnVYBbZVZDRjAVpklAHNrYbGwEGaXMLuELyJdnWQAW2VEAFvc+bLuJfa7FK4HxmHJw935Mf9M68h6wkxlHMJ+KeGy7HWMN8Iv","file_map":{"22":{"source":"pub mod hash;\npub mod aes128;\npub mod array;\npub mod slice;\npub mod ecdsa_secp256k1;\npub mod ecdsa_secp256r1;\npub mod embedded_curve_ops;\npub mod field;\npub mod collections;\npub mod compat;\npub mod convert;\npub mod option;\npub mod string;\npub mod test;\npub mod cmp;\npub mod ops;\npub mod default;\npub mod prelude;\npub mod runtime;\npub mod meta;\npub mod append;\npub mod mem;\npub mod panic;\npub mod hint;\n\nuse convert::AsPrimitive;\n\n// Oracle calls are required to be wrapped in an unconstrained function\n// Thus, the only argument to the `println` oracle is expected to always be an ident\n#[oracle(print)]\nunconstrained fn print_oracle<T>(with_newline: bool, input: T) {}\n\nunconstrained fn print_unconstrained<T>(with_newline: bool, input: T) {\n print_oracle(with_newline, input);\n}\n\npub fn println<T>(input: T) {\n // Safety: a print statement cannot be constrained\n unsafe {\n print_unconstrained(true, input);\n }\n}\n\npub fn print<T>(input: T) {\n // Safety: a print statement cannot be constrained\n unsafe {\n print_unconstrained(false, input);\n }\n}\n\npub fn verify_proof<let N: u32, let M: u32, let K: u32>(\n verification_key: [Field; N],\n proof: [Field; M],\n public_inputs: [Field; K],\n key_hash: Field,\n) {\n verify_proof_internal(verification_key, proof, public_inputs, key_hash, 0);\n}\n\npub fn verify_proof_with_type<let N: u32, let M: u32, let K: u32>(\n verification_key: [Field; N],\n proof: [Field; M],\n public_inputs: [Field; K],\n key_hash: Field,\n proof_type: u32,\n) {\n if !crate::runtime::is_unconstrained() {\n crate::assert_constant(proof_type);\n }\n verify_proof_internal(verification_key, proof, public_inputs, key_hash, proof_type);\n}\n\n#[foreign(recursive_aggregation)]\nfn verify_proof_internal<let N: u32, let M: u32, let K: u32>(\n verification_key: [Field; N],\n proof: [Field; M],\n public_inputs: [Field; K],\n key_hash: Field,\n proof_type: u32,\n) {}\n\n// Asserts that the given value is known at compile-time.\n// Useful for debugging for-loop bounds.\n#[builtin(assert_constant)]\npub fn assert_constant<T>(x: T) {}\n\n// Asserts that the given value is both true and known at compile-time.\n// The message can be a string, a format string, or any value, as long as it is known at compile-time\n#[builtin(static_assert)]\npub fn static_assert<T>(predicate: bool, message: T) {}\n\n#[deprecated(\"wrapping operations should be done with the Wrapping traits. E.g: x.wrapping_add(y)\")]\npub fn wrapping_add<T>(x: T, y: T) -> T\nwhere\n T: AsPrimitive<Field>,\n Field: AsPrimitive<T>,\n{\n AsPrimitive::as_(x.as_() + y.as_())\n}\n#[deprecated(\"wrapping operations should be done with the Wrapping traits. E.g: x.wrapping_sub(y)\")]\npub fn wrapping_sub<T>(x: T, y: T) -> T\nwhere\n T: AsPrimitive<Field>,\n Field: AsPrimitive<T>,\n{\n //340282366920938463463374607431768211456 is 2^128, it is used to avoid underflow\n AsPrimitive::as_(x.as_() + 340282366920938463463374607431768211456 - y.as_())\n}\n#[deprecated(\"wrapping operations should be done with the Wrapping traits. E.g: x.wrapping_mul(y)\")]\npub fn wrapping_mul<T>(x: T, y: T) -> T\nwhere\n T: AsPrimitive<Field>,\n Field: AsPrimitive<T>,\n{\n AsPrimitive::as_(x.as_() * y.as_())\n}\n\n#[builtin(as_witness)]\npub fn as_witness(x: Field) {}\n\nmod tests {\n use super::ops::arith::WrappingMul;\n\n #[test(should_fail_with = \"custom message\")]\n fn test_static_assert_custom_message() {\n super::static_assert(1 == 2, \"custom message\");\n }\n\n #[test]\n fn test_wrapping_mul() {\n let zero: u128 = 0;\n let one: u128 = 1;\n let two_pow_64: u128 = 0x10000000000000000;\n let u128_max: u128 = 0xffffffffffffffffffffffffffffffff;\n\n // 1*0==0\n assert_eq(zero, zero.wrapping_mul(one));\n\n // 0*1==0\n assert_eq(zero, one.wrapping_mul(zero));\n\n // 1*1==1\n assert_eq(one, one.wrapping_mul(one));\n\n // 0 * ( 1 << 64 ) == 0\n assert_eq(zero, zero.wrapping_mul(two_pow_64));\n\n // ( 1 << 64 ) * 0 == 0\n assert_eq(zero, two_pow_64.wrapping_mul(zero));\n\n // 1 * ( 1 << 64 ) == 1 << 64\n assert_eq(two_pow_64, two_pow_64.wrapping_mul(one));\n\n // ( 1 << 64 ) * 1 == 1 << 64\n assert_eq(two_pow_64, one.wrapping_mul(two_pow_64));\n\n // ( 1 << 64 ) * ( 1 << 64 ) == 1 << 64\n assert_eq(zero, two_pow_64.wrapping_mul(two_pow_64));\n // -1 * -1 == 1\n assert_eq(one, u128_max.wrapping_mul(u128_max));\n }\n}\n","path":"std/lib.nr"},"50":{"source":"use dep::mock_types::{\n CLIENT_IVC_VERIFICATION_KEY_LENGTH_IN_FIELDS, MAX_COMMITMENT_READ_REQUESTS_PER_TX,\n MAX_COMMITMENTS_PER_TX, PrivateKernelPublicInputs, PROOF_TYPE_PG, VerificationKey,\n};\n\n// Mock reset kernel that reset read requests.\n// It needs hints to locate the commitment that matches the read requests.\nfn main(\n mut prev_kernel_public_inputs: call_data(0) PrivateKernelPublicInputs,\n kernel_vk: VerificationKey<CLIENT_IVC_VERIFICATION_KEY_LENGTH_IN_FIELDS>,\n commitment_read_hints: [u32; MAX_COMMITMENT_READ_REQUESTS_PER_TX],\n) -> return_data PrivateKernelPublicInputs {\n std::verify_proof_with_type(kernel_vk.key, [], [], kernel_vk.hash, PROOF_TYPE_PG);\n\n for i in 0..MAX_COMMITMENT_READ_REQUESTS_PER_TX {\n if commitment_read_hints[i] != MAX_COMMITMENTS_PER_TX {\n assert_eq(\n prev_kernel_public_inputs.commitments[commitment_read_hints[i]],\n prev_kernel_public_inputs.read_requests[i],\n );\n prev_kernel_public_inputs.read_requests[i] = 0;\n }\n }\n prev_kernel_public_inputs\n}\n","path":"/home/aztec-dev/aztec-packages/noir-projects/mock-protocol-circuits/crates/mock-private-kernel-reset/src/main.nr"}},"names":["main"],"brillig_names":["directive_invert","directive_integer_quotient"]}
|
|
1
|
+
{"noir_version":"1.0.0-beta.7+0000000000000000000000000000000000000000","hash":"4347825904799225160","abi":{"parameters":[{"name":"prev_kernel_public_inputs","type":{"kind":"struct","path":"mock_types::PrivateKernelPublicInputs","fields":[{"name":"remaining_calls","type":{"kind":"integer","sign":"unsigned","width":32}},{"name":"commitments","type":{"kind":"array","length":4,"type":{"kind":"field"}}},{"name":"read_requests","type":{"kind":"array","length":4,"type":{"kind":"field"}}}]},"visibility":"databus"},{"name":"kernel_vk","type":{"kind":"array","length":127,"type":{"kind":"field"}},"visibility":"private"},{"name":"commitment_read_hints","type":{"kind":"array","length":4,"type":{"kind":"integer","sign":"unsigned","width":32}},"visibility":"private"}],"return_type":{"abi_type":{"kind":"struct","path":"mock_types::PrivateKernelPublicInputs","fields":[{"name":"remaining_calls","type":{"kind":"integer","sign":"unsigned","width":32}},{"name":"commitments","type":{"kind":"array","length":4,"type":{"kind":"field"}}},{"name":"read_requests","type":{"kind":"array","length":4,"type":{"kind":"field"}}}]},"visibility":"databus"},"error_types":{"14225679739041873922":{"error_kind":"string","string":"Index out of bounds"}}},"bytecode":"H4sIAAAAAAAA/+Wc91ccVRzFHwuYgikasBvXGHub2aUsFsTYW4xdo8aEAJZYYu8mxkaxawIphhACaUAakMKv+m953OvMw+sw4DnZ+/Ywx3fOnPkwMzzu973vzLz3drklJijj+W15yCX5rTTco6Tp57LwWHl+OyO/zcpvs2N+ry38PT7WHnOsI+ZYZ3iMi9XSGO6zXm11dUtdpsXP+mu8TH1Trsarrmmqzfk5vyZX05zJZbMtuepcXX1TfZ1X71dnW/zWmvpsqxeUzVSXV2CBtor8toG0zslvf4Y8l7iC+EziecTziRcQLyQ+i/hs4kXElcRVxOcQn0t8HvH5xBcQX0h8EfHFxIuJLyFOE19KvIT4MuKlxJcTX0F8JfFVxFcTX0N8LfF1xNcT30B8I7FH7BNniLPE1cQ1xLXEdcQ54nrim4hvJr6F+FbiBuLbiBuJbydeRnwH8Z3EdxHfTXwP8b3E9xHfT/wA8YPEDxEvJ36YeAXxI8SPEj9G/DjxE8RPEj9F/DTxM8QriZ8lfo74eeJVxC8QryZeQ9xEvJa4mbiFuJX4ReKXiF8mfoV4HfGrxK8Rv078BvF64jeJ3yJ+m/gd4neJ3yN+n/gD4g+JPyL+mPgT4k+JPyPeQLyR+HPiTcRfEH9J/BXx18TfhBwtOLc5PIf3Whkdj7sWpTHce4UVv80U/p5saf27NLPeLS4Fo/JUpN5CxW8RauwyusGHqzbsiqm30Dbs0mn0ykJ9tp+LdRN4p1mCJmhdGyO30Lp9C9wW3eF+q20QOyLuDvd8DBelI6JKHTbiaSZSJkx6v9vobqCt4s5VJ18X9ZkRxt2t0+jZt9Icyh97c9pz0VleSeRaZWz2AZYS90WbUOM2oa6U+WdUwEVUvzdVP3mFFX9bAjRuV2tUJ2V5mOyqxERd241uBGXrLZ+hnZIy8UNpaac7SEzlspMrjTvUGl28XXcY/Rvot+QkqP9/TlBlP/2rc9QJtdNohwtJfOLtTIDGHpOQhNqlE5pJakLtSoDGXpOQhNqtE5pNakLtToDGPqXGYq5FtwuSNW4teo9LwahcNZOy4vcINfYb3RPAVRv2G/1adL9OY1HXotsFdRV7LXog3O+1DWLXnQfM5LVoXJSOiFKvRQueJBNr0QNGdwPtFXeuOvn6qc+MMO4Bo31tqvXZh5B66a5dqHGfUFdS15P3JUDjfrVGdVLiQxr1enKPA509Qo0HHCROXN8UqlM5Wjso7AtXse4X9/HBGX5DF3M61SFo27jp1KBLwYNGP50aFGocEiasqzYcMvrp1JDR3gTFmk51COoq9nRqONwfsg1ip07DZvJ0ChelI6LU0ynBk2RiOjVsdDfQIXHnqpNviPrMCOMeNtrRjFqffQipR4QdQo2HhbqSOp06nACNR9Qa1UmJ77upp1O9DnT2CjUedZA4cX1TqE7laO2YsC9cxXpE3MfHZvgNXczpVKegbeOmUyMuBY8Y/XRqRKhxVJiwrtpw1OinU6NGexMUazrVKair2NOpsXB/3DaInTqNmcnTKVyUjohST6cET5KJ6dSY0d1Ax8Wdq06+UeozI4x7zGhHM2p99iGkHhF2CjWeEOpK6nTqRAI0nlRrVCcl/nVIPZ3qc6CzT6jxlIPEieubQnUqR2vjwr5wFetJcR+PJ+GGdpQ7ypi/TUjMJcKYv0tIzClhzN8nJOZSYcw/JCTmMmHMP4pjVg/A7X9gqp/dP83wuPENjQMO4v55hseNpdSjDuL+ZYbHjTHPKQdx/yqMG89a3I/WigBjAbwb8a7AsxPPEtxXyDG0N/52KoypjH7Hlv+yMcDfgSkbzNhgwgbzNZiuwWxtoQnM1WCqBjM1mKjBPA2maTBLg0kazNFgigYzNJigwfxssQnMztImMDdbYgIzM5iYwbwMpmUwK4NJGczJYEoGMzKYkMF8DKZjMBtDEmDwC1MxmInBRAzmYTANg1kYTMJgDgZTMJiBwQQM5l8NJjD7ajSBudcyE5h5wcQL5l0w7YJZF0y6YM4FUy6YccGEC+ZbMN2C2dYKE5hrwVQLZlow0YJ5FkyzYJYFkyyYY8EUC2ZYMMGC+dUqE5hdrTaBuVWTCcysYGIF8yqYVsGsCiZVMKeCKRXMqGBCBfMpmE7BbGq9CcylYCoFMymYSME8CqZRMIuCSRTMoWAKBTMomEDB/AmmTzB72mgCc6dNJjBzgokTzJtg2gSzJthB4Cu8+NwZiyXRwosUC8J9yiycv/L3dX/wdUunOedPc65hinP2XT4nsq8K93ZBszH82Sus+Lb+Sjf1e7PM5FJFXBmJM0XnGkUabH12sbfcTC6pyDl77eyIvhK9Pj+qpTTmb9myKNxX0rGqKbTOpXqEfZqx9Ve4qT82Z+YSV0TO2b6LW1gsmeLnVGQ/3bXTfQQ5L+acrdP2Feu1cfwFGscQFnFVAAA=","debug_symbols":"pZTNjoIwFIXfpWsW9O+2+CqTialYDUkDpILJxPjuc+0RRxcmhtnwAeV8PUDTi9jH3Xzcdv1hOInN10XscpdSd9ymoQ1TN/R893KtxHK5nXKMfEs8jXNqDDn2k9j0c0qVOIc0l4dOY+gLp5B5tK5E7PdMFh66FG9n1+ovXb+PWr+EyZhH3L7m5fu8JG3vAumkfxiU+rSBk+oucJreNfgsT2pF3psl72nN/L42j7z7V75Ra/KNpSXf+Jf8N1+Ftssva04Q/5xKuHL0YsOTN+Uoa0BymKEADRjAAqzgOaUDPMAWVwnFFs+QgAI0YAALEOAAD6CLRhctAXTR6KLRRaOLJgBdNLpodDE1IAFVZEYDBoDFwGIc4IGmwNbFaSWgisxqwAC2yCwBDoDFwkI1gK9LeCPSxUkGsEVGBLDlthzOIXdhl+J9vzjMffu0fUw/4zKybDBjHtq4n3O8/fYyxgvhFw==","file_map":{"22":{"source":"pub mod hash;\npub mod aes128;\npub mod array;\npub mod slice;\npub mod ecdsa_secp256k1;\npub mod ecdsa_secp256r1;\npub mod embedded_curve_ops;\npub mod field;\npub mod collections;\npub mod compat;\npub mod convert;\npub mod option;\npub mod string;\npub mod test;\npub mod cmp;\npub mod ops;\npub mod default;\npub mod prelude;\npub mod runtime;\npub mod meta;\npub mod append;\npub mod mem;\npub mod panic;\npub mod hint;\n\nuse convert::AsPrimitive;\n\n// Oracle calls are required to be wrapped in an unconstrained function\n// Thus, the only argument to the `println` oracle is expected to always be an ident\n#[oracle(print)]\nunconstrained fn print_oracle<T>(with_newline: bool, input: T) {}\n\nunconstrained fn print_unconstrained<T>(with_newline: bool, input: T) {\n print_oracle(with_newline, input);\n}\n\npub fn println<T>(input: T) {\n // Safety: a print statement cannot be constrained\n unsafe {\n print_unconstrained(true, input);\n }\n}\n\npub fn print<T>(input: T) {\n // Safety: a print statement cannot be constrained\n unsafe {\n print_unconstrained(false, input);\n }\n}\n\npub fn verify_proof<let N: u32, let M: u32, let K: u32>(\n verification_key: [Field; N],\n proof: [Field; M],\n public_inputs: [Field; K],\n key_hash: Field,\n) {\n verify_proof_internal(verification_key, proof, public_inputs, key_hash, 0);\n}\n\npub fn verify_proof_with_type<let N: u32, let M: u32, let K: u32>(\n verification_key: [Field; N],\n proof: [Field; M],\n public_inputs: [Field; K],\n key_hash: Field,\n proof_type: u32,\n) {\n if !crate::runtime::is_unconstrained() {\n crate::assert_constant(proof_type);\n }\n verify_proof_internal(verification_key, proof, public_inputs, key_hash, proof_type);\n}\n\n#[foreign(recursive_aggregation)]\nfn verify_proof_internal<let N: u32, let M: u32, let K: u32>(\n verification_key: [Field; N],\n proof: [Field; M],\n public_inputs: [Field; K],\n key_hash: Field,\n proof_type: u32,\n) {}\n\n// Asserts that the given value is known at compile-time.\n// Useful for debugging for-loop bounds.\n#[builtin(assert_constant)]\npub fn assert_constant<T>(x: T) {}\n\n// Asserts that the given value is both true and known at compile-time.\n// The message can be a string, a format string, or any value, as long as it is known at compile-time\n#[builtin(static_assert)]\npub fn static_assert<T>(predicate: bool, message: T) {}\n\n#[deprecated(\"wrapping operations should be done with the Wrapping traits. E.g: x.wrapping_add(y)\")]\npub fn wrapping_add<T>(x: T, y: T) -> T\nwhere\n T: AsPrimitive<Field>,\n Field: AsPrimitive<T>,\n{\n AsPrimitive::as_(x.as_() + y.as_())\n}\n#[deprecated(\"wrapping operations should be done with the Wrapping traits. E.g: x.wrapping_sub(y)\")]\npub fn wrapping_sub<T>(x: T, y: T) -> T\nwhere\n T: AsPrimitive<Field>,\n Field: AsPrimitive<T>,\n{\n //340282366920938463463374607431768211456 is 2^128, it is used to avoid underflow\n AsPrimitive::as_(x.as_() + 340282366920938463463374607431768211456 - y.as_())\n}\n#[deprecated(\"wrapping operations should be done with the Wrapping traits. E.g: x.wrapping_mul(y)\")]\npub fn wrapping_mul<T>(x: T, y: T) -> T\nwhere\n T: AsPrimitive<Field>,\n Field: AsPrimitive<T>,\n{\n AsPrimitive::as_(x.as_() * y.as_())\n}\n\n#[builtin(as_witness)]\npub fn as_witness(x: Field) {}\n\nmod tests {\n use super::ops::arith::WrappingMul;\n\n #[test(should_fail_with = \"custom message\")]\n fn test_static_assert_custom_message() {\n super::static_assert(1 == 2, \"custom message\");\n }\n\n #[test]\n fn test_wrapping_mul() {\n let zero: u128 = 0;\n let one: u128 = 1;\n let two_pow_64: u128 = 0x10000000000000000;\n let u128_max: u128 = 0xffffffffffffffffffffffffffffffff;\n\n // 1*0==0\n assert_eq(zero, zero.wrapping_mul(one));\n\n // 0*1==0\n assert_eq(zero, one.wrapping_mul(zero));\n\n // 1*1==1\n assert_eq(one, one.wrapping_mul(one));\n\n // 0 * ( 1 << 64 ) == 0\n assert_eq(zero, zero.wrapping_mul(two_pow_64));\n\n // ( 1 << 64 ) * 0 == 0\n assert_eq(zero, two_pow_64.wrapping_mul(zero));\n\n // 1 * ( 1 << 64 ) == 1 << 64\n assert_eq(two_pow_64, two_pow_64.wrapping_mul(one));\n\n // ( 1 << 64 ) * 1 == 1 << 64\n assert_eq(two_pow_64, one.wrapping_mul(two_pow_64));\n\n // ( 1 << 64 ) * ( 1 << 64 ) == 1 << 64\n assert_eq(zero, two_pow_64.wrapping_mul(two_pow_64));\n // -1 * -1 == 1\n assert_eq(one, u128_max.wrapping_mul(u128_max));\n }\n}\n","path":"std/lib.nr"},"50":{"source":"use dep::mock_types::{\n CLIENT_IVC_VERIFICATION_KEY_LENGTH_IN_FIELDS, MAX_COMMITMENT_READ_REQUESTS_PER_TX,\n MAX_COMMITMENTS_PER_TX, PrivateKernelPublicInputs, PROOF_TYPE_PG,\n};\n\n// Mock reset kernel that reset read requests.\n// It needs hints to locate the commitment that matches the read requests.\nfn main(\n mut prev_kernel_public_inputs: call_data(0) PrivateKernelPublicInputs,\n kernel_vk: [Field; CLIENT_IVC_VERIFICATION_KEY_LENGTH_IN_FIELDS],\n commitment_read_hints: [u32; MAX_COMMITMENT_READ_REQUESTS_PER_TX],\n) -> return_data PrivateKernelPublicInputs {\n std::verify_proof_with_type(kernel_vk, [], [], 0, PROOF_TYPE_PG);\n\n for i in 0..MAX_COMMITMENT_READ_REQUESTS_PER_TX {\n if commitment_read_hints[i] != MAX_COMMITMENTS_PER_TX {\n assert_eq(\n prev_kernel_public_inputs.commitments[commitment_read_hints[i]],\n prev_kernel_public_inputs.read_requests[i],\n );\n prev_kernel_public_inputs.read_requests[i] = 0;\n }\n }\n prev_kernel_public_inputs\n}\n","path":"/home/aztec-dev/aztec-packages/noir-projects/mock-protocol-circuits/crates/mock-private-kernel-reset/src/main.nr"}},"names":["main"],"brillig_names":["directive_invert","directive_integer_quotient"]}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"noir_version":"1.0.0-beta.7+0000000000000000000000000000000000000000","hash":"
|
|
1
|
+
{"noir_version":"1.0.0-beta.7+0000000000000000000000000000000000000000","hash":"13580903503092419398","abi":{"parameters":[{"name":"prev_kernel_public_inputs","type":{"kind":"struct","path":"mock_types::PrivateKernelPublicInputs","fields":[{"name":"remaining_calls","type":{"kind":"integer","sign":"unsigned","width":32}},{"name":"commitments","type":{"kind":"array","length":4,"type":{"kind":"field"}}},{"name":"read_requests","type":{"kind":"array","length":4,"type":{"kind":"field"}}}]},"visibility":"databus"},{"name":"kernel_vk","type":{"kind":"array","length":127,"type":{"kind":"field"}},"visibility":"private"}],"return_type":{"abi_type":{"kind":"struct","path":"mock_types::KernelPublicInputs","fields":[{"name":"commitments","type":{"kind":"array","length":4,"type":{"kind":"field"}}}]},"visibility":"public"},"error_types":{}},"bytecode":"H4sIAAAAAAAA/9XXZ1PTAACH8VRQQXDvhbi3JrSlqQPr3nsvhEpx7z3BjcJn9uS5hLvnwHeUF81drr+jZ00Y7fPPBMkxNHw2B2OPTPpYSh+zYXsuVym0VaJs1B22FctxPszly+1xFEf5ON/TFmezlTgXF4rlYiEsRrlsJerNF7O9YXIM6bXCcR5cW9Pw2adrbRw+/6aeJjfJzfJ0eYY8U54lz5bnyHPlefJ8eYG8UF4kL5aXyEvlZfJyuUVeIbfKK+VV8mp5jbxWXievlzfIG+VN8mZ5i7xV3iZvl0M5ktvkrJyT83K7XJBjuSjvkHfKu+Tdcoe8Ry7Je+V98n75gHxQPiQflo/IR+Vj8nH5hHxSPiWfls/IZ+Vz8nn5gnxRviRflq/IV+Vr8nX5hnxT7pRvyV1yt1yWb8s9ckXule/Id+V78n35gfxQfiQ/lp/IT+Vn8nP5hfxSfiW/lt/Ib+V38nv5g/xR/iR/lvvkfvmL/FX+Jn+Xf8g/5V+pRx88N5Q+V/ef5zhK6WM4viOq4muFE3mdk2vkOqfUyHVOrZHrbJig65w06jrH24SZKt7zQI3c86Qq3vPvGrnnuire858auef6Kt7zYBXvmZ8FZ2P6enxmZtL75+v16dd8jrw/ZdLnOQb0vRv97/nc4T2d98uG9P9ik7HF2GBsLzYXW4uNxbZiU7Gl2FBsJzYTW4mNxDZiE7GF2EBsn5Yg2TqtQbJt2DRsGTYM24XNwlZho7BN2CRsETYI24PNwdbgl4APdDYFW4INwXZgM7AV2AhsAzYBW4ANQPt3BEnrl4Kk7Wl6Wp6Gp91pdlqdRqfNaXJanAanvWluWpvGpq1palqahqadaWZamUamjWliWpgGpn07g6R1u4KkbWlaWpaGpV1pVlqVRqVNaVJalAalPWlOWpPGpC1pSlqShqQdaUZakUakDWlCWpAGpP1oPlqvP0jajqaj5Wg42o1mo9VGDv/e8L7F3/FgMPb4B/Yl6caYEAAA","debug_symbols":"jZHBDoMgDIbfpWcOoqLGV1kWg1oNCUGDsGQxvvsqUacHl11a2vK1P3SGFmvfV8p0wwTlY4baKq1VX+mhkU4NhrLzwmAPK2cRKQWnOlGjtGgclMZrzeAltQ+XplGa4J20VI0YoGnJU8NOaVxPC/vS0T0qoh0WWXrg4srze55nidga8JwXR4c4/ltBwbcGWSzuFPzg8+MFeXrlnxTJRtnLn0NE4hjwYGMoEwYJlCmDNFgRbEZ2WUdaJWuN2646b5rT6tx73Cv7ckc7NNh6i+vIUCMRHw==","file_map":{"22":{"source":"pub mod hash;\npub mod aes128;\npub mod array;\npub mod slice;\npub mod ecdsa_secp256k1;\npub mod ecdsa_secp256r1;\npub mod embedded_curve_ops;\npub mod field;\npub mod collections;\npub mod compat;\npub mod convert;\npub mod option;\npub mod string;\npub mod test;\npub mod cmp;\npub mod ops;\npub mod default;\npub mod prelude;\npub mod runtime;\npub mod meta;\npub mod append;\npub mod mem;\npub mod panic;\npub mod hint;\n\nuse convert::AsPrimitive;\n\n// Oracle calls are required to be wrapped in an unconstrained function\n// Thus, the only argument to the `println` oracle is expected to always be an ident\n#[oracle(print)]\nunconstrained fn print_oracle<T>(with_newline: bool, input: T) {}\n\nunconstrained fn print_unconstrained<T>(with_newline: bool, input: T) {\n print_oracle(with_newline, input);\n}\n\npub fn println<T>(input: T) {\n // Safety: a print statement cannot be constrained\n unsafe {\n print_unconstrained(true, input);\n }\n}\n\npub fn print<T>(input: T) {\n // Safety: a print statement cannot be constrained\n unsafe {\n print_unconstrained(false, input);\n }\n}\n\npub fn verify_proof<let N: u32, let M: u32, let K: u32>(\n verification_key: [Field; N],\n proof: [Field; M],\n public_inputs: [Field; K],\n key_hash: Field,\n) {\n verify_proof_internal(verification_key, proof, public_inputs, key_hash, 0);\n}\n\npub fn verify_proof_with_type<let N: u32, let M: u32, let K: u32>(\n verification_key: [Field; N],\n proof: [Field; M],\n public_inputs: [Field; K],\n key_hash: Field,\n proof_type: u32,\n) {\n if !crate::runtime::is_unconstrained() {\n crate::assert_constant(proof_type);\n }\n verify_proof_internal(verification_key, proof, public_inputs, key_hash, proof_type);\n}\n\n#[foreign(recursive_aggregation)]\nfn verify_proof_internal<let N: u32, let M: u32, let K: u32>(\n verification_key: [Field; N],\n proof: [Field; M],\n public_inputs: [Field; K],\n key_hash: Field,\n proof_type: u32,\n) {}\n\n// Asserts that the given value is known at compile-time.\n// Useful for debugging for-loop bounds.\n#[builtin(assert_constant)]\npub fn assert_constant<T>(x: T) {}\n\n// Asserts that the given value is both true and known at compile-time.\n// The message can be a string, a format string, or any value, as long as it is known at compile-time\n#[builtin(static_assert)]\npub fn static_assert<T>(predicate: bool, message: T) {}\n\n#[deprecated(\"wrapping operations should be done with the Wrapping traits. E.g: x.wrapping_add(y)\")]\npub fn wrapping_add<T>(x: T, y: T) -> T\nwhere\n T: AsPrimitive<Field>,\n Field: AsPrimitive<T>,\n{\n AsPrimitive::as_(x.as_() + y.as_())\n}\n#[deprecated(\"wrapping operations should be done with the Wrapping traits. E.g: x.wrapping_sub(y)\")]\npub fn wrapping_sub<T>(x: T, y: T) -> T\nwhere\n T: AsPrimitive<Field>,\n Field: AsPrimitive<T>,\n{\n //340282366920938463463374607431768211456 is 2^128, it is used to avoid underflow\n AsPrimitive::as_(x.as_() + 340282366920938463463374607431768211456 - y.as_())\n}\n#[deprecated(\"wrapping operations should be done with the Wrapping traits. E.g: x.wrapping_mul(y)\")]\npub fn wrapping_mul<T>(x: T, y: T) -> T\nwhere\n T: AsPrimitive<Field>,\n Field: AsPrimitive<T>,\n{\n AsPrimitive::as_(x.as_() * y.as_())\n}\n\n#[builtin(as_witness)]\npub fn as_witness(x: Field) {}\n\nmod tests {\n use super::ops::arith::WrappingMul;\n\n #[test(should_fail_with = \"custom message\")]\n fn test_static_assert_custom_message() {\n super::static_assert(1 == 2, \"custom message\");\n }\n\n #[test]\n fn test_wrapping_mul() {\n let zero: u128 = 0;\n let one: u128 = 1;\n let two_pow_64: u128 = 0x10000000000000000;\n let u128_max: u128 = 0xffffffffffffffffffffffffffffffff;\n\n // 1*0==0\n assert_eq(zero, zero.wrapping_mul(one));\n\n // 0*1==0\n assert_eq(zero, one.wrapping_mul(zero));\n\n // 1*1==1\n assert_eq(one, one.wrapping_mul(one));\n\n // 0 * ( 1 << 64 ) == 0\n assert_eq(zero, zero.wrapping_mul(two_pow_64));\n\n // ( 1 << 64 ) * 0 == 0\n assert_eq(zero, two_pow_64.wrapping_mul(zero));\n\n // 1 * ( 1 << 64 ) == 1 << 64\n assert_eq(two_pow_64, two_pow_64.wrapping_mul(one));\n\n // ( 1 << 64 ) * 1 == 1 << 64\n assert_eq(two_pow_64, one.wrapping_mul(two_pow_64));\n\n // ( 1 << 64 ) * ( 1 << 64 ) == 1 << 64\n assert_eq(zero, two_pow_64.wrapping_mul(two_pow_64));\n // -1 * -1 == 1\n assert_eq(one, u128_max.wrapping_mul(u128_max));\n }\n}\n","path":"std/lib.nr"},"50":{"source":"use dep::mock_types::{\n CLIENT_IVC_VERIFICATION_KEY_LENGTH_IN_FIELDS, KernelPublicInputs,\n MAX_COMMITMENT_READ_REQUESTS_PER_TX, PrivateKernelPublicInputs, PROOF_TYPE_PG,\n};\n\n// The tail kernel finishes the client IVC chain exposing the final public inputs with no remaining calls or unfulfilled read requests.\nfn main(\n prev_kernel_public_inputs: call_data(0) PrivateKernelPublicInputs,\n kernel_vk: [Field; CLIENT_IVC_VERIFICATION_KEY_LENGTH_IN_FIELDS],\n) -> pub KernelPublicInputs {\n std::verify_proof_with_type(kernel_vk, [], [], 0, PROOF_TYPE_PG);\n\n assert_eq(prev_kernel_public_inputs.remaining_calls, 0);\n for i in 0..MAX_COMMITMENT_READ_REQUESTS_PER_TX {\n assert_eq(prev_kernel_public_inputs.read_requests[i], 0);\n }\n\n KernelPublicInputs { commitments: prev_kernel_public_inputs.commitments }\n}\n","path":"/home/aztec-dev/aztec-packages/noir-projects/mock-protocol-circuits/crates/mock-private-kernel-tail/src/main.nr"}},"names":["main"],"brillig_names":[]}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"noir_version":"1.0.0-beta.7+0000000000000000000000000000000000000000","hash":"13074796915800592763","abi":{"parameters":[{"name":"tube_data","type":{"kind":"struct","path":"mock_types::TubeData","fields":[{"name":"public_inputs","type":{"kind":"struct","path":"mock_types::KernelPublicInputs","fields":[{"name":"commitments","type":{"kind":"array","length":4,"type":{"kind":"field"}}}]}},{"name":"proof","type":{"kind":"array","length":535,"type":{"kind":"field"}}},{"name":"vk_data","type":{"kind":"struct","path":"types::proof::verification_key::VerificationKey","fields":[{"name":"key","type":{"kind":"array","length":113,"type":{"kind":"field"}}},{"name":"hash","type":{"kind":"field"}}]}}]},"visibility":"private"}],"return_type":{"abi_type":{"kind":"struct","path":"mock_types::RollupPublicInputs","fields":[{"name":"accumulated","type":{"kind":"integer","sign":"unsigned","width":32}}]},"visibility":"public"},"error_types":{}},"bytecode":"H4sIAAAAAAAA/6XaZXCUZxRA4W+Du7sFd8hmIxs0uLt7CCS4uwf3ugul7u5Gqbu7Ueru3iLl9NtMD7+7M5SnZSbTMFN673lvJAg/e5OCICnhyIkfZU78WKS/r3PiF48lXFeuJ9eXG8jJckO5kdxYbiI3lZvJzeUWcku5ldxabiO3ldvJ7eUUOSqnyjE5TU6XM+RMOS5nyR3kjnInubPcRe4qZ8vd5O5yD7mn3EvuLfeR+8r95P7yAHmgPEgeLA+Rh8rD5OHyCHmkPEoeLY+Rx8rj5PHyBHmiPEmeLE+Rc+Spcq48TZ4u58n58gx5pjxLni3PkefK8+T58gJ5obxIXiwvkZfKy+Tl8gp5pbxKXi2vkdfK6+T18ga5QN4ob5I3y1vkrfI2ebu8Q94p75J3J1wj8Ycs/6xo8N+vF5OLyyXkknIpubRcRi4rl5PLyxXkinIlubJcRa4qV5OryzXkmnItubZcR64r15Pryw3kZLmh3EhuLDeRm8rN5OZyC7ml3EpuLbeR28rt5PZyihyVU+WYnCanyxlyphyXs+QOcke5k9xZ7iJ3lbPlbnJ3uYfcU+4l95b7yH3lfnJ/eYA8UB4kD5aHyEPlYfJweYQ8Uh4lj5bHyGPlcfJ4eYI8UZ4kT5anyDnyVDlXniZPl/PkfHmGPFOeJc+W58hz5XnyfHmBvFBeJC+Wl8hL5WXycnmFvFJeJa+W18hr5XXyenmDXCBvlDfJm+Ut8lZ5m7xd3iHvlHfJu+U98l75FPlU+TT5dPkM+Uz5LPls+Rz5XPk8+Xz5AvlC+SL5YnmffIm8X75Uvky+XL5CvlK+Sr5avka+Vr5Ovl6+Qb5Rvkm+Wb5FvlW+Tb5dvkO+U75Lvlu+R75Xvk++X35AflA+ID8kH5Qflh+RH5Ufkx+Xn5CflJ+Sn5afkZ+Vn5Ofl1+QX5Rfkl+WX5FflV+TX5ffkN+U35Lflt+R35Xfk9+XD8kfyIflD+WP5I/lT+RP5c/kz+Uv5C/lr+Sv5W/kb+Xv5O/lH+Qf5Z/kn+Vf5F/l3+Tf5T/kP+W/5L/lI/JR+Zh8XOYvhY7ISXIRuahcTC4ul5BLyqXk0nIZuaxcTi4vV5ArypXkynIVuapcTa4u15BryrXk2nIdua5cT64vN5CT5YZyI7mx3ERuKjeTm8st5JZyK7m13EZuK7eT28spclROlWNympwuZ8iZclzOkjvIHeVOcme5i9xVzpa7yd3lHnJPuZfcW+4j95X7yf3lAfJAeZA8WB4iD5WHycPlEfJIeZQ8Wh4jj5XHyePlCfJEeZI8WZ4i58hT5Vx5mjxdzpPz5RnyTHmWPFueI8+V58nz5QXyQnmRvFheIi+Vl8nL5RXySnmVvFpeI6+V18nr5Q1ygbxR3iRvlrfIW+Vt8nZ5h7xT3iXvlvfIe+VT5FPl0+TT5TPkM+Wz5LPlc+Rz5fPk8+UL5Avli+SL5X3yJfJ++VL5Mvly+Qr5Svkq+Wr5Gvla+Tr5evkG+Ub5Jvlm+Rb5Vvk2+Xb5DvlO+S75bvke+V75Pvl++QH5QfmA/JB8UH5YfkR+VH5Mflx+Qn5Sfkp+Wn5GflZ+Tn5efkF+UX5Jfll+RX5Vfk1+XX5DflN+S35bfkd+V35Pfl8+JH8gH5Y/lD+SP5Y/kT+VP5M/l7+Qv5S/kr+Wv5G/lb+Tv5d/kH+Uf5J/ln+Rf5V/k3+X/5D/lP+S/5aPyEflY/JxOVDvj8hJchG5qFxMLi6XkEvKpeTSchm5rFxOLi9XkCvKleTKchW5qlxNri7XkGvKteTaCfMeEhT+Xgb6vZST5CLynsTXKBac/Cn8WtmJn1P+3yfKO3nh14qlZKSl5WWm5kVj0akpqVm58fSUtPTcjHg0Hk2Pp09PjcdiefG0eGZWblZmSlY0LZYXzU/PiuUnvlhE3/PepJP/nZMS31/RxPfEmxBvQbwB8fbDmw9vPbzx8LbDmw5vObzh8HbDmw1vNbzR8DbDmwxvMbzB8PbCmwtvLbyx8LZSPwjfUpKD8O2ENxPeSngj4W2ENxHeQngD4e2DNw/eOnjj4G2DNw3eMnjD4O2CNwveKnij4G2CNwneIniD4O2BNwfeGnhj4G2hSxC+JWQH4dsBbwa8FfBGwNsAbwK8BfAGQPun+dP6afy0fZo+LZ+GT7un2dPqafS0eZo8LZ4GT3unudPaaey09clB2NJzgrCd08xp5TRy2jhNnBZOA6d907xp3TRu2jZNm5ZNw6Zd06xp1TRq2jRNmhZNg6Y905xpzTRm2vL6IGzJBUHYjmnGtGIaMW2YJkwLpgHTfmm+tF4aL22XpkvLpeHSbmm2tFoaLW2WJkuLpcHSXmmutFYaK211XxC21P1B2E5pprRSGiltlCZKC6WB0j5pnrROGidtk6ZJy6Rh0i5plrRKGiVtkiZJi6RB0h5pjrRGGiNt8UAQtsSDQdgOaYa0QhohbZAmSAukAdL+aH60PhofbY+mR8uj4dHuaHa0OhodbY4mR4ujwdHeaG60Nhobbe1QELa0w0HYzmhmtDIaGW2MJkYLo4HRvmhetC4aF22LpkXLomHRrmhWtCoaFW2KJkWLokHRnmhOtCYaU2FboiXxHz/tiGZEK6IR0YZoQrQgGhDth+ZD66Hx0HZoOrQcGg7thmZDq6HR0GZoMrQYGgztheZCa6Gx0FZoKrSU5EjYTmgmtBIaCW2EJkILoYHQPmgetA4aB22DpkHL4A812gXNglZBo6BN0CRoETQI2gPNgdZAY6At0BRoCdmRsB3QDGgFNALaAE2AFkADYPdn52fXZ8dnt2enZ5dnh2d3Z2dnV2dHZzdnJ2cXZwdn92bnZtdmx2a3Zqdml86JhLszOzO7MjsyuzE7MbswOzC7Lzsvuy47LrstOy27LDssuys7K7sqOyq7KTspuyg7KLsnOye7JjsmuyU7JbtkQSTcHdkZ2RXZEdkN2QnZBdkB2f3Y+dj12PHY7djp2OXY4djd2NnY1djR2M3YydjF2MHYvdi52LXYsdit2KnYpfZHwt2JnYldiR2J3YidiF2IHYjdh52HXYcdh92GnYZdhh2G3YWdhV2FHYXdhJ2EXYQdhN2DnYNdgx2D3YKdgl3iYCTcHdgZ2BXYEdgN2AnYBdgBmP2Z+Zn1mfGZ7ZnpmeWZ4ZndmdmZ1ZnRmc2ZyZnFmcGZvZm5mbWZsZmtmamZpQ9HwtmZmZlZmRmZ2ZiZmFmYGZjZl5mXWZcZl9mWmZZZlhmW2ZWZlVmVGZXZlJmUWZQZlNmTmZNZkxnz39kyEs6S/I+f2ZGZkVmRGZHZkJmQWZAZkNmPmY9ZjxmP2Y6ZjlmOGY7ZjZmNWY0ZjdmMmYxZjBmM2YuZi5s+bvm44eN2j5s9bvW40eM2j5s8bvG4weP2jps7bu24seO2jps6bum4oeN2jps5buW4keM2jps4buG4geP2jZs3bt24ceO2jZs2btm4YeN2jZs1btW4UeM2jZs0btG4QeP2jJszbs24MeO2jJsybsm4IeN2jJsxbsW4EeM2jJswbsG4AeP2i5svbr248eK2i5subrm44eJ2i5stbrW40eI2i5ssbrG4weL2ipsrbq24seK2ipsqbqm4oeJ2ipspbqW4keI2ipsobqG4geL2iZsnbp24ceK2iZsmbpm4YeJ2iZslbpW4UeI2iZskbpG4QeL2iJsjbo24MeK2iJsi5t7CTyTxs2fJws8/FZHEIugpAAA=","debug_symbols":"fZBNCsMgEIXvMmsXMcFacpVSgjGTIIiK0UIJ3r0m5HeRrsaZ5/tmeBN02MahUaa3I9SvCVqvtFZDo60UQVmTp1MisLVN8Ih5BCc9u5zwaALUJmpN4CN0XD6NTpilBuGzWhBA0+Wagb3SOL8SOdzFvZVStpppRXc7u/rpvZ8xzlcA4+xxEOiFUP654FHtJ3D63AllmdI7d0Iqf0kNCqirNAO9Eq3GNck+GnkKNnzdpmzRO28ldtHjjFu0vOAH","file_map":{"22":{"source":"pub mod hash;\npub mod aes128;\npub mod array;\npub mod slice;\npub mod ecdsa_secp256k1;\npub mod ecdsa_secp256r1;\npub mod embedded_curve_ops;\npub mod field;\npub mod collections;\npub mod compat;\npub mod convert;\npub mod option;\npub mod string;\npub mod test;\npub mod cmp;\npub mod ops;\npub mod default;\npub mod prelude;\npub mod runtime;\npub mod meta;\npub mod append;\npub mod mem;\npub mod panic;\npub mod hint;\n\nuse convert::AsPrimitive;\n\n// Oracle calls are required to be wrapped in an unconstrained function\n// Thus, the only argument to the `println` oracle is expected to always be an ident\n#[oracle(print)]\nunconstrained fn print_oracle<T>(with_newline: bool, input: T) {}\n\nunconstrained fn print_unconstrained<T>(with_newline: bool, input: T) {\n print_oracle(with_newline, input);\n}\n\npub fn println<T>(input: T) {\n // Safety: a print statement cannot be constrained\n unsafe {\n print_unconstrained(true, input);\n }\n}\n\npub fn print<T>(input: T) {\n // Safety: a print statement cannot be constrained\n unsafe {\n print_unconstrained(false, input);\n }\n}\n\npub fn verify_proof<let N: u32, let M: u32, let K: u32>(\n verification_key: [Field; N],\n proof: [Field; M],\n public_inputs: [Field; K],\n key_hash: Field,\n) {\n verify_proof_internal(verification_key, proof, public_inputs, key_hash, 0);\n}\n\npub fn verify_proof_with_type<let N: u32, let M: u32, let K: u32>(\n verification_key: [Field; N],\n proof: [Field; M],\n public_inputs: [Field; K],\n key_hash: Field,\n proof_type: u32,\n) {\n if !crate::runtime::is_unconstrained() {\n crate::assert_constant(proof_type);\n }\n verify_proof_internal(verification_key, proof, public_inputs, key_hash, proof_type);\n}\n\n#[foreign(recursive_aggregation)]\nfn verify_proof_internal<let N: u32, let M: u32, let K: u32>(\n verification_key: [Field; N],\n proof: [Field; M],\n public_inputs: [Field; K],\n key_hash: Field,\n proof_type: u32,\n) {}\n\n// Asserts that the given value is known at compile-time.\n// Useful for debugging for-loop bounds.\n#[builtin(assert_constant)]\npub fn assert_constant<T>(x: T) {}\n\n// Asserts that the given value is both true and known at compile-time.\n// The message can be a string, a format string, or any value, as long as it is known at compile-time\n#[builtin(static_assert)]\npub fn static_assert<T>(predicate: bool, message: T) {}\n\n#[deprecated(\"wrapping operations should be done with the Wrapping traits. E.g: x.wrapping_add(y)\")]\npub fn wrapping_add<T>(x: T, y: T) -> T\nwhere\n T: AsPrimitive<Field>,\n Field: AsPrimitive<T>,\n{\n AsPrimitive::as_(x.as_() + y.as_())\n}\n#[deprecated(\"wrapping operations should be done with the Wrapping traits. E.g: x.wrapping_sub(y)\")]\npub fn wrapping_sub<T>(x: T, y: T) -> T\nwhere\n T: AsPrimitive<Field>,\n Field: AsPrimitive<T>,\n{\n //340282366920938463463374607431768211456 is 2^128, it is used to avoid underflow\n AsPrimitive::as_(x.as_() + 340282366920938463463374607431768211456 - y.as_())\n}\n#[deprecated(\"wrapping operations should be done with the Wrapping traits. E.g: x.wrapping_mul(y)\")]\npub fn wrapping_mul<T>(x: T, y: T) -> T\nwhere\n T: AsPrimitive<Field>,\n Field: AsPrimitive<T>,\n{\n AsPrimitive::as_(x.as_() * y.as_())\n}\n\n#[builtin(as_witness)]\npub fn as_witness(x: Field) {}\n\nmod tests {\n use super::ops::arith::WrappingMul;\n\n #[test(should_fail_with = \"custom message\")]\n fn test_static_assert_custom_message() {\n super::static_assert(1 == 2, \"custom message\");\n }\n\n #[test]\n fn test_wrapping_mul() {\n let zero: u128 = 0;\n let one: u128 = 1;\n let two_pow_64: u128 = 0x10000000000000000;\n let u128_max: u128 = 0xffffffffffffffffffffffffffffffff;\n\n // 1*0==0\n assert_eq(zero, zero.wrapping_mul(one));\n\n // 0*1==0\n assert_eq(zero, one.wrapping_mul(zero));\n\n // 1*1==1\n assert_eq(one, one.wrapping_mul(one));\n\n // 0 * ( 1 << 64 ) == 0\n assert_eq(zero, zero.wrapping_mul(two_pow_64));\n\n // ( 1 << 64 ) * 0 == 0\n assert_eq(zero, two_pow_64.wrapping_mul(zero));\n\n // 1 * ( 1 << 64 ) == 1 << 64\n assert_eq(two_pow_64, two_pow_64.wrapping_mul(one));\n\n // ( 1 << 64 ) * 1 == 1 << 64\n assert_eq(two_pow_64, one.wrapping_mul(two_pow_64));\n\n // ( 1 << 64 ) * ( 1 << 64 ) == 1 << 64\n assert_eq(zero, two_pow_64.wrapping_mul(two_pow_64));\n // -1 * -1 == 1\n assert_eq(one, u128_max.wrapping_mul(u128_max));\n }\n}\n","path":"std/lib.nr"},"50":{"source":"use dep::mock_types::{RollupPublicInputs, TubeData};\n\nfn main(tube_data: TubeData) -> pub RollupPublicInputs {\n tube_data.verify();\n RollupPublicInputs::new(1)\n}\n","path":"/home/aztec-dev/aztec-packages/noir-projects/mock-protocol-circuits/crates/mock-rollup-base-private/src/main.nr"},"51":{"source":"pub global MAX_COMMITMENTS_PER_CALL: u32 = 2;\npub global MAX_COMMITMENTS_PER_TX: u32 = 4;\npub global MAX_COMMITMENT_READ_REQUESTS_PER_CALL: u32 = 2;\npub global MAX_COMMITMENT_READ_REQUESTS_PER_TX: u32 = 4;\n\npub use protocol_types::{\n abis::avm_circuit_public_inputs::AvmCircuitPublicInputs,\n constants::{\n AVM_V2_PROOF_LENGTH_IN_FIELDS_PADDED, AVM_V2_VERIFICATION_KEY_LENGTH_IN_FIELDS_PADDED,\n CLIENT_IVC_VERIFICATION_KEY_LENGTH_IN_FIELDS, NESTED_RECURSIVE_ROLLUP_HONK_PROOF_LENGTH,\n PROOF_TYPE_AVM, PROOF_TYPE_OINK, PROOF_TYPE_PG, PROOF_TYPE_ROLLUP_HONK,\n PROOF_TYPE_ROOT_ROLLUP_HONK, ROLLUP_HONK_VERIFICATION_KEY_LENGTH_IN_FIELDS,\n TUBE_PROOF_LENGTH,\n },\n proof::verification_key::{RollupHonkVerificationKey, VerificationKey},\n traits::Serialize,\n};\n\npub struct TxRequest {\n pub number_of_calls: u32,\n}\n\npub struct AppPublicInputs {\n pub commitments: [Field; MAX_COMMITMENTS_PER_CALL],\n pub read_requests: [Field; MAX_COMMITMENT_READ_REQUESTS_PER_CALL],\n}\n\nimpl Default for AppPublicInputs {\n fn default() -> Self {\n Self {\n commitments: [0; MAX_COMMITMENTS_PER_CALL],\n read_requests: [0; MAX_COMMITMENT_READ_REQUESTS_PER_CALL],\n }\n }\n}\n\npub struct PrivateKernelPublicInputs {\n pub remaining_calls: u32,\n pub commitments: [Field; MAX_COMMITMENTS_PER_TX],\n pub read_requests: [Field; MAX_COMMITMENT_READ_REQUESTS_PER_TX],\n}\n\nimpl Default for PrivateKernelPublicInputs {\n fn default() -> Self {\n Self {\n remaining_calls: 0,\n commitments: [0; MAX_COMMITMENTS_PER_TX],\n read_requests: [0; MAX_COMMITMENT_READ_REQUESTS_PER_TX],\n }\n }\n}\n\npub struct PrivateKernelPublicInputsBuilder {\n pub remaining_calls: u32,\n pub commitments: BoundedVec<Field, MAX_COMMITMENTS_PER_TX>,\n pub read_requests: BoundedVec<Field, MAX_COMMITMENT_READ_REQUESTS_PER_TX>,\n}\n\nimpl PrivateKernelPublicInputsBuilder {\n pub fn from_tx(tx: TxRequest) -> Self {\n Self {\n remaining_calls: tx.number_of_calls,\n commitments: BoundedVec::new(),\n read_requests: BoundedVec::new(),\n }\n }\n\n pub fn from_previous_kernel(prev_kernel_public_inputs: PrivateKernelPublicInputs) -> Self {\n let mut builder = PrivateKernelPublicInputsBuilder {\n remaining_calls: prev_kernel_public_inputs.remaining_calls,\n commitments: BoundedVec::new(),\n read_requests: BoundedVec::new(),\n };\n for i in 0..MAX_COMMITMENTS_PER_TX {\n if prev_kernel_public_inputs.commitments[i] != 0 {\n builder.commitments.push(prev_kernel_public_inputs.commitments[i]);\n }\n }\n for i in 0..MAX_COMMITMENT_READ_REQUESTS_PER_TX {\n if prev_kernel_public_inputs.read_requests[i] != 0 {\n builder.read_requests.push(prev_kernel_public_inputs.read_requests[i]);\n }\n }\n builder\n }\n\n pub fn ingest_app_inputs(&mut self, app_inputs: AppPublicInputs) {\n for i in 0..MAX_COMMITMENTS_PER_CALL {\n if app_inputs.commitments[i] != 0 {\n self.commitments.push(app_inputs.commitments[i]);\n }\n }\n\n for i in 0..MAX_COMMITMENT_READ_REQUESTS_PER_CALL {\n if app_inputs.read_requests[i] != 0 {\n self.read_requests.push(app_inputs.read_requests[i]);\n }\n }\n\n self.remaining_calls -= 1;\n }\n\n pub fn finish(self) -> PrivateKernelPublicInputs {\n PrivateKernelPublicInputs {\n remaining_calls: self.remaining_calls,\n commitments: self.commitments.storage(),\n read_requests: self.read_requests.storage(),\n }\n }\n}\n\npub struct KernelPublicInputs {\n pub commitments: [Field; MAX_COMMITMENTS_PER_TX],\n}\n\nimpl Default for KernelPublicInputs {\n fn default() -> Self {\n Self { commitments: [0; MAX_COMMITMENTS_PER_TX] }\n }\n}\n\nimpl Serialize<MAX_COMMITMENTS_PER_TX> for KernelPublicInputs {\n fn serialize(self) -> [Field; MAX_COMMITMENTS_PER_TX] {\n self.commitments\n }\n}\n\npub struct RollupPublicInputs {\n accumulated: u32,\n}\n\nimpl RollupPublicInputs {\n pub fn new(accumulated: u32) -> Self {\n Self { accumulated }\n }\n\n pub fn merge(self, other: Self) -> Self {\n Self { accumulated: self.accumulated + other.accumulated }\n }\n}\n\nimpl Serialize<1> for RollupPublicInputs {\n fn serialize(self) -> [Field; 1] {\n [self.accumulated as Field]\n }\n}\n\npub struct PreviousRollupData {\n base_or_merge_public_inputs: RollupPublicInputs,\n proof: [Field; NESTED_RECURSIVE_ROLLUP_HONK_PROOF_LENGTH],\n vk: RollupHonkVerificationKey,\n}\n\nimpl PreviousRollupData {\n pub fn verify(self, is_root: bool) {\n let inputs = self.base_or_merge_public_inputs.serialize();\n\n std::verify_proof_with_type(\n self.vk.key,\n self.proof,\n inputs,\n self.vk.hash,\n if is_root {\n PROOF_TYPE_ROOT_ROLLUP_HONK\n } else {\n PROOF_TYPE_ROLLUP_HONK\n },\n );\n }\n\n pub fn public_inputs(self) -> RollupPublicInputs {\n self.base_or_merge_public_inputs\n }\n}\n\npub struct TubeData {\n pub public_inputs: KernelPublicInputs,\n pub proof: [Field; TUBE_PROOF_LENGTH],\n pub vk_data: VerificationKey<ROLLUP_HONK_VERIFICATION_KEY_LENGTH_IN_FIELDS>,\n}\n\nimpl TubeData {\n pub fn verify(self) {\n let inputs = KernelPublicInputs::serialize(self.public_inputs);\n std::verify_proof_with_type(\n self.vk_data.key,\n self.proof,\n inputs,\n self.vk_data.hash,\n PROOF_TYPE_ROLLUP_HONK,\n );\n }\n}\n","path":"/home/aztec-dev/aztec-packages/noir-projects/mock-protocol-circuits/crates/mock-types/src/lib.nr"}},"names":["main"],"brillig_names":[]}
|
|
1
|
+
{"noir_version":"1.0.0-beta.7+0000000000000000000000000000000000000000","hash":"4153773276216647373","abi":{"parameters":[{"name":"tube_data","type":{"kind":"struct","path":"mock_types::TubeData","fields":[{"name":"public_inputs","type":{"kind":"struct","path":"mock_types::KernelPublicInputs","fields":[{"name":"commitments","type":{"kind":"array","length":4,"type":{"kind":"field"}}}]}},{"name":"proof","type":{"kind":"array","length":535,"type":{"kind":"field"}}},{"name":"vk_data","type":{"kind":"struct","path":"types::proof::verification_key::VerificationKey","fields":[{"name":"key","type":{"kind":"array","length":113,"type":{"kind":"field"}}},{"name":"hash","type":{"kind":"field"}}]}}]},"visibility":"private"}],"return_type":{"abi_type":{"kind":"struct","path":"mock_types::RollupPublicInputs","fields":[{"name":"accumulated","type":{"kind":"integer","sign":"unsigned","width":32}}]},"visibility":"public"},"error_types":{}},"bytecode":"H4sIAAAAAAAA/6XaZXCUZxRA4W+Du7sFd8hmIxs0uLt7CCS4uwf3ugul7u5Gqbu7Ueru3iLl9NtMD7+7M5SnZSbTMFN673lvJAg/e5OCICnhyIkfZU78WKS/r3PiF48lXFeuJ9eXG8jJckO5kdxYbiI3lZvJzeUWcku5ldxabiO3ldvJ7eUUOSqnyjE5TU6XM+RMOS5nyR3kjnInubPcRe4qZ8vd5O5yD7mn3EvuLfeR+8r95P7yAHmgPEgeLA+Rh8rD5OHyCHmkPEoeLY+Rx8rj5PHyBHmiPEmeLE+Rc+Spcq48TZ4u58n58gx5pjxLni3PkefK8+T58gJ5obxIXiwvkZfKy+Tl8gp5pbxKXi2vkdfK6+T18ga5QN4ob5I3y1vkrfI2ebu8Q94p75J3J1wj8Ycs/6xo8N+vF5OLyyXkknIpubRcRi4rl5PLyxXkinIlubJcRa4qV5OryzXkmnItubZcR64r15Pryw3kZLmh3EhuLDeRm8rN5OZyC7ml3EpuLbeR28rt5PZyihyVU+WYnCanyxlyphyXs+QOcke5k9xZ7iJ3lbPlbnJ3uYfcU+4l95b7yH3lfnJ/eYA8UB4kD5aHyEPlYfJweYQ8Uh4lj5bHyGPlcfJ4eYI8UZ4kT5anyDnyVDlXniZPl/PkfHmGPFOeJc+W58hz5XnyfHmBvFBeJC+Wl8hL5WXycnmFvFJeJa+W18hr5XXyenmDXCBvlDfJm+Ut8lZ5m7xd3iHvlHfJu+U98l75FPlU+TT5dPkM+Uz5LPls+Rz5XPk8+Xz5AvlC+SL5YnmffIm8X75Uvky+XL5CvlK+Sr5avka+Vr5Ovl6+Qb5Rvkm+Wb5FvlW+Tb5dvkO+U75Lvlu+R75Xvk++X35AflA+ID8kH5Qflh+RH5Ufkx+Xn5CflJ+Sn5afkZ+Vn5Ofl1+QX5Rfkl+WX5FflV+TX5ffkN+U35Lflt+R35Xfk9+XD8kfyIflD+WP5I/lT+RP5c/kz+Uv5C/lr+Sv5W/kb+Xv5O/lH+Qf5Z/kn+Vf5F/l3+Tf5T/kP+W/5L/lI/JR+Zh8XOYvhY7ISXIRuahcTC4ul5BLyqXk0nIZuaxcTi4vV5ArypXkynIVuapcTa4u15BryrXk2nIdua5cT64vN5CT5YZyI7mx3ERuKjeTm8st5JZyK7m13EZuK7eT28spclROlWNympwuZ8iZclzOkjvIHeVOcme5i9xVzpa7yd3lHnJPuZfcW+4j95X7yf3lAfJAeZA8WB4iD5WHycPlEfJIeZQ8Wh4jj5XHyePlCfJEeZI8WZ4i58hT5Vx5mjxdzpPz5RnyTHmWPFueI8+V58nz5QXyQnmRvFheIi+Vl8nL5RXySnmVvFpeI6+V18nr5Q1ygbxR3iRvlrfIW+Vt8nZ5h7xT3iXvlvfIe+VT5FPl0+TT5TPkM+Wz5LPlc+Rz5fPk8+UL5Avli+SL5X3yJfJ++VL5Mvly+Qr5Svkq+Wr5Gvla+Tr5evkG+Ub5Jvlm+Rb5Vvk2+Xb5DvlO+S75bvke+V75Pvl++QH5QfmA/JB8UH5YfkR+VH5Mflx+Qn5Sfkp+Wn5GflZ+Tn5efkF+UX5Jfll+RX5Vfk1+XX5DflN+S35bfkd+V35Pfl8+JH8gH5Y/lD+SP5Y/kT+VP5M/l7+Qv5S/kr+Wv5G/lb+Tv5d/kH+Uf5J/ln+Rf5V/k3+X/5D/lP+S/5aPyEflY/JxOVDvj8hJchG5qFxMLi6XkEvKpeTSchm5rFxOLi9XkCvKleTKchW5qlxNri7XkGvKteTaCfMeEhT+Xgb6vZST5CLynsTXKBac/Cn8WtmJn1P+3yfKO3nh14qlZKSl5WWm5kVj0akpqVm58fSUtPTcjHg0Hk2Pp09PjcdiefG0eGZWblZmSlY0LZYXzU/PiuUnvlhE3/PepJP/nZMS31/RxPfEmxBvQbwB8fbDmw9vPbzx8LbDmw5vObzh8HbDmw1vNbzR8DbDmwxvMbzB8PbCmwtvLbyx8LZSPwjfUpKD8O2ENxPeSngj4W2ENxHeQngD4e2DNw/eOnjj4G2DNw3eMnjD4O2CNwveKnij4G2CNwneIniD4O2BNwfeGnhj4G2hSxC+JWQH4dsBbwa8FfBGwNsAbwK8BfAGQPun+dP6afy0fZo+LZ+GT7un2dPqafS0eZo8LZ4GT3unudPaaey09clB2NJzgrCd08xp5TRy2jhNnBZOA6d907xp3TRu2jZNm5ZNw6Zd06xp1TRq2jRNmhZNg6Y905xpzTRm2vL6IGzJBUHYjmnGtGIaMW2YJkwLpgHTfmm+tF4aL22XpkvLpeHSbmm2tFoaLW2WJkuLpcHSXmmutFYaK211XxC21P1B2E5pprRSGiltlCZKC6WB0j5pnrROGidtk6ZJy6Rh0i5plrRKGiVtkiZJi6RB0h5pjrRGGiNt8UAQtsSDQdgOaYa0QhohbZAmSAukAdL+aH60PhofbY+mR8uj4dHuaHa0OhodbY4mR4ujwdHeaG60Nhobbe1QELa0w0HYzmhmtDIaGW2MJkYLo4HRvmhetC4aF22LpkXLomHRrmhWtCoaFW2KJkWLokHRnmhOtCYaU2FboiXxHz/tiGZEK6IR0YZoQrQgGhDth+ZD66Hx0HZoOrQcGg7thmZDq6HR0GZoMrQYGgztheZCa6Gx0FZoKrSU5EjYTmgmtBIaCW2EJkILoYHQPmgetA4aB22DpkHL4A812gXNglZBo6BN0CRoETQI2gPNgdZAY6At0BRoCdmRsB3QDGgFNALaAE2AFkADYPdn52fXZ8dnt2enZ5dnh2d3Z2dnV2dHZzdnJ2cXZwdn92bnZtdmx2a3Zqdml86JhLszOzO7MjsyuzE7MbswOzC7Lzsvuy47LrstOy27LDssuys7K7sqOyq7KTspuyg7KLsnOye7JjsmuyU7JbtkQSTcHdkZ2RXZEdkN2QnZBdkB2f3Y+dj12PHY7djp2OXY4djd2NnY1djR2M3YydjF2MHYvdi52LXYsdit2KnYpfZHwt2JnYldiR2J3YidiF2IHYjdh52HXYcdh92GnYZdhh2G3YWdhV2FHYXdhJ2EXYQdhN2DnYNdgx2D3YKdgl3iYCTcHdgZ2BXYEdgN2AnYBdgBmP2Z+Zn1mfGZ7ZnpmeWZ4ZndmdmZ1ZnRmc2ZyZnFmcGZvZm5mbWZsZmtmamZpQ9HwtmZmZlZmRmZ2ZiZmFmYGZjZl5mXWZcZl9mWmZZZlhmW2ZWZlVmVGZXZlJmUWZQZlNmTmZNZkxnz39kyEs6S/I+f2ZGZkVmRGZHZkJmQWZAZkNmPmY9ZjxmP2Y6ZjlmOGY7ZjZmNWY0ZjdmMmYxZjBmM2YuZi5s+bvm44eN2j5s9bvW40eM2j5s8bvG4weP2jps7bu24seO2jps6bum4oeN2jps5buW4keM2jps4buG4geP2jZs3bt24ceO2jZs2btm4YeN2jZs1btW4UeM2jZs0btG4QeP2jJszbs24MeO2jJsybsm4IeN2jJsxbsW4EeM2jJswbsG4AeP2i5svbr248eK2i5subrm44eJ2i5stbrW40eI2i5ssbrG4weL2ipsrbq24seK2ipsqbqm4oeJ2ipspbqW4keI2ipsobqG4geL2iZsnbp24ceK2iZsmbpm4YeJ2iZslbpW4UeI2iZskbpG4QeL2iJsjbo24MeK2iJsi5t7CTyTxs2fJws8/FZHEIugpAAA=","debug_symbols":"fZBNDoMgEIXvMmsXIkFbr9I0BnE0JAQIQpPGcPei8XdhV8PM430zeRN02Iahkbo3I9SvCVonlZJDo4zgXhqdplPMYGsb7xDTCE56clnuUHuodVAqgw9XYfk0Wq6X6rlLap4B6i7VBOylwvkVs8Od31sJYauZULLb2dVP7v2MPqsVwFhVHgRyIRR/LijpfkJFHjuhKGJ8p44L6S6pQQ41jTPQSd4qXJPsgxanYP3XbsoWvXVGYBcczrhFSwt+","file_map":{"22":{"source":"pub mod hash;\npub mod aes128;\npub mod array;\npub mod slice;\npub mod ecdsa_secp256k1;\npub mod ecdsa_secp256r1;\npub mod embedded_curve_ops;\npub mod field;\npub mod collections;\npub mod compat;\npub mod convert;\npub mod option;\npub mod string;\npub mod test;\npub mod cmp;\npub mod ops;\npub mod default;\npub mod prelude;\npub mod runtime;\npub mod meta;\npub mod append;\npub mod mem;\npub mod panic;\npub mod hint;\n\nuse convert::AsPrimitive;\n\n// Oracle calls are required to be wrapped in an unconstrained function\n// Thus, the only argument to the `println` oracle is expected to always be an ident\n#[oracle(print)]\nunconstrained fn print_oracle<T>(with_newline: bool, input: T) {}\n\nunconstrained fn print_unconstrained<T>(with_newline: bool, input: T) {\n print_oracle(with_newline, input);\n}\n\npub fn println<T>(input: T) {\n // Safety: a print statement cannot be constrained\n unsafe {\n print_unconstrained(true, input);\n }\n}\n\npub fn print<T>(input: T) {\n // Safety: a print statement cannot be constrained\n unsafe {\n print_unconstrained(false, input);\n }\n}\n\npub fn verify_proof<let N: u32, let M: u32, let K: u32>(\n verification_key: [Field; N],\n proof: [Field; M],\n public_inputs: [Field; K],\n key_hash: Field,\n) {\n verify_proof_internal(verification_key, proof, public_inputs, key_hash, 0);\n}\n\npub fn verify_proof_with_type<let N: u32, let M: u32, let K: u32>(\n verification_key: [Field; N],\n proof: [Field; M],\n public_inputs: [Field; K],\n key_hash: Field,\n proof_type: u32,\n) {\n if !crate::runtime::is_unconstrained() {\n crate::assert_constant(proof_type);\n }\n verify_proof_internal(verification_key, proof, public_inputs, key_hash, proof_type);\n}\n\n#[foreign(recursive_aggregation)]\nfn verify_proof_internal<let N: u32, let M: u32, let K: u32>(\n verification_key: [Field; N],\n proof: [Field; M],\n public_inputs: [Field; K],\n key_hash: Field,\n proof_type: u32,\n) {}\n\n// Asserts that the given value is known at compile-time.\n// Useful for debugging for-loop bounds.\n#[builtin(assert_constant)]\npub fn assert_constant<T>(x: T) {}\n\n// Asserts that the given value is both true and known at compile-time.\n// The message can be a string, a format string, or any value, as long as it is known at compile-time\n#[builtin(static_assert)]\npub fn static_assert<T>(predicate: bool, message: T) {}\n\n#[deprecated(\"wrapping operations should be done with the Wrapping traits. E.g: x.wrapping_add(y)\")]\npub fn wrapping_add<T>(x: T, y: T) -> T\nwhere\n T: AsPrimitive<Field>,\n Field: AsPrimitive<T>,\n{\n AsPrimitive::as_(x.as_() + y.as_())\n}\n#[deprecated(\"wrapping operations should be done with the Wrapping traits. E.g: x.wrapping_sub(y)\")]\npub fn wrapping_sub<T>(x: T, y: T) -> T\nwhere\n T: AsPrimitive<Field>,\n Field: AsPrimitive<T>,\n{\n //340282366920938463463374607431768211456 is 2^128, it is used to avoid underflow\n AsPrimitive::as_(x.as_() + 340282366920938463463374607431768211456 - y.as_())\n}\n#[deprecated(\"wrapping operations should be done with the Wrapping traits. E.g: x.wrapping_mul(y)\")]\npub fn wrapping_mul<T>(x: T, y: T) -> T\nwhere\n T: AsPrimitive<Field>,\n Field: AsPrimitive<T>,\n{\n AsPrimitive::as_(x.as_() * y.as_())\n}\n\n#[builtin(as_witness)]\npub fn as_witness(x: Field) {}\n\nmod tests {\n use super::ops::arith::WrappingMul;\n\n #[test(should_fail_with = \"custom message\")]\n fn test_static_assert_custom_message() {\n super::static_assert(1 == 2, \"custom message\");\n }\n\n #[test]\n fn test_wrapping_mul() {\n let zero: u128 = 0;\n let one: u128 = 1;\n let two_pow_64: u128 = 0x10000000000000000;\n let u128_max: u128 = 0xffffffffffffffffffffffffffffffff;\n\n // 1*0==0\n assert_eq(zero, zero.wrapping_mul(one));\n\n // 0*1==0\n assert_eq(zero, one.wrapping_mul(zero));\n\n // 1*1==1\n assert_eq(one, one.wrapping_mul(one));\n\n // 0 * ( 1 << 64 ) == 0\n assert_eq(zero, zero.wrapping_mul(two_pow_64));\n\n // ( 1 << 64 ) * 0 == 0\n assert_eq(zero, two_pow_64.wrapping_mul(zero));\n\n // 1 * ( 1 << 64 ) == 1 << 64\n assert_eq(two_pow_64, two_pow_64.wrapping_mul(one));\n\n // ( 1 << 64 ) * 1 == 1 << 64\n assert_eq(two_pow_64, one.wrapping_mul(two_pow_64));\n\n // ( 1 << 64 ) * ( 1 << 64 ) == 1 << 64\n assert_eq(zero, two_pow_64.wrapping_mul(two_pow_64));\n // -1 * -1 == 1\n assert_eq(one, u128_max.wrapping_mul(u128_max));\n }\n}\n","path":"std/lib.nr"},"50":{"source":"use dep::mock_types::{RollupPublicInputs, TubeData};\n\nfn main(tube_data: TubeData) -> pub RollupPublicInputs {\n tube_data.verify();\n RollupPublicInputs::new(1)\n}\n","path":"/home/aztec-dev/aztec-packages/noir-projects/mock-protocol-circuits/crates/mock-rollup-base-private/src/main.nr"},"51":{"source":"pub global MAX_COMMITMENTS_PER_CALL: u32 = 2;\npub global MAX_COMMITMENTS_PER_TX: u32 = 4;\npub global MAX_COMMITMENT_READ_REQUESTS_PER_CALL: u32 = 2;\npub global MAX_COMMITMENT_READ_REQUESTS_PER_TX: u32 = 4;\n\npub use protocol_types::{\n constants::{\n CLIENT_IVC_VERIFICATION_KEY_LENGTH_IN_FIELDS, NESTED_RECURSIVE_ROLLUP_HONK_PROOF_LENGTH,\n PROOF_TYPE_OINK, PROOF_TYPE_PG, PROOF_TYPE_ROLLUP_HONK, PROOF_TYPE_ROOT_ROLLUP_HONK,\n ROLLUP_HONK_VERIFICATION_KEY_LENGTH_IN_FIELDS, TUBE_PROOF_LENGTH,\n },\n proof::verification_key::{RollupHonkVerificationKey, VerificationKey},\n traits::Serialize,\n};\n\npub struct TxRequest {\n pub number_of_calls: u32,\n}\n\npub struct AppPublicInputs {\n pub commitments: [Field; MAX_COMMITMENTS_PER_CALL],\n pub read_requests: [Field; MAX_COMMITMENT_READ_REQUESTS_PER_CALL],\n}\n\nimpl Default for AppPublicInputs {\n fn default() -> Self {\n Self {\n commitments: [0; MAX_COMMITMENTS_PER_CALL],\n read_requests: [0; MAX_COMMITMENT_READ_REQUESTS_PER_CALL],\n }\n }\n}\n\npub struct PrivateKernelPublicInputs {\n pub remaining_calls: u32,\n pub commitments: [Field; MAX_COMMITMENTS_PER_TX],\n pub read_requests: [Field; MAX_COMMITMENT_READ_REQUESTS_PER_TX],\n}\n\nimpl Default for PrivateKernelPublicInputs {\n fn default() -> Self {\n Self {\n remaining_calls: 0,\n commitments: [0; MAX_COMMITMENTS_PER_TX],\n read_requests: [0; MAX_COMMITMENT_READ_REQUESTS_PER_TX],\n }\n }\n}\n\npub struct PrivateKernelPublicInputsBuilder {\n pub remaining_calls: u32,\n pub commitments: BoundedVec<Field, MAX_COMMITMENTS_PER_TX>,\n pub read_requests: BoundedVec<Field, MAX_COMMITMENT_READ_REQUESTS_PER_TX>,\n}\n\nimpl PrivateKernelPublicInputsBuilder {\n pub fn from_tx(tx: TxRequest) -> Self {\n Self {\n remaining_calls: tx.number_of_calls,\n commitments: BoundedVec::new(),\n read_requests: BoundedVec::new(),\n }\n }\n\n pub fn from_previous_kernel(prev_kernel_public_inputs: PrivateKernelPublicInputs) -> Self {\n let mut builder = PrivateKernelPublicInputsBuilder {\n remaining_calls: prev_kernel_public_inputs.remaining_calls,\n commitments: BoundedVec::new(),\n read_requests: BoundedVec::new(),\n };\n for i in 0..MAX_COMMITMENTS_PER_TX {\n if prev_kernel_public_inputs.commitments[i] != 0 {\n builder.commitments.push(prev_kernel_public_inputs.commitments[i]);\n }\n }\n for i in 0..MAX_COMMITMENT_READ_REQUESTS_PER_TX {\n if prev_kernel_public_inputs.read_requests[i] != 0 {\n builder.read_requests.push(prev_kernel_public_inputs.read_requests[i]);\n }\n }\n builder\n }\n\n pub fn ingest_app_inputs(&mut self, app_inputs: AppPublicInputs) {\n for i in 0..MAX_COMMITMENTS_PER_CALL {\n if app_inputs.commitments[i] != 0 {\n self.commitments.push(app_inputs.commitments[i]);\n }\n }\n\n for i in 0..MAX_COMMITMENT_READ_REQUESTS_PER_CALL {\n if app_inputs.read_requests[i] != 0 {\n self.read_requests.push(app_inputs.read_requests[i]);\n }\n }\n\n self.remaining_calls -= 1;\n }\n\n pub fn finish(self) -> PrivateKernelPublicInputs {\n PrivateKernelPublicInputs {\n remaining_calls: self.remaining_calls,\n commitments: self.commitments.storage(),\n read_requests: self.read_requests.storage(),\n }\n }\n}\n\npub struct KernelPublicInputs {\n pub commitments: [Field; MAX_COMMITMENTS_PER_TX],\n}\n\nimpl Default for KernelPublicInputs {\n fn default() -> Self {\n Self { commitments: [0; MAX_COMMITMENTS_PER_TX] }\n }\n}\n\nimpl Serialize<MAX_COMMITMENTS_PER_TX> for KernelPublicInputs {\n fn serialize(self) -> [Field; MAX_COMMITMENTS_PER_TX] {\n self.commitments\n }\n}\n\npub struct RollupPublicInputs {\n accumulated: u32,\n}\n\nimpl RollupPublicInputs {\n pub fn new(accumulated: u32) -> Self {\n Self { accumulated }\n }\n\n pub fn merge(self, other: Self) -> Self {\n Self { accumulated: self.accumulated + other.accumulated }\n }\n}\n\nimpl Serialize<1> for RollupPublicInputs {\n fn serialize(self) -> [Field; 1] {\n [self.accumulated as Field]\n }\n}\n\npub struct PreviousRollupData {\n base_or_merge_public_inputs: RollupPublicInputs,\n proof: [Field; NESTED_RECURSIVE_ROLLUP_HONK_PROOF_LENGTH],\n vk: RollupHonkVerificationKey,\n}\n\nimpl PreviousRollupData {\n pub fn verify(self, is_root: bool) {\n let inputs = self.base_or_merge_public_inputs.serialize();\n\n std::verify_proof_with_type(\n self.vk.key,\n self.proof,\n inputs,\n self.vk.hash,\n if is_root {\n PROOF_TYPE_ROOT_ROLLUP_HONK\n } else {\n PROOF_TYPE_ROLLUP_HONK\n },\n );\n }\n\n pub fn public_inputs(self) -> RollupPublicInputs {\n self.base_or_merge_public_inputs\n }\n}\n\npub struct TubeData {\n pub public_inputs: KernelPublicInputs,\n pub proof: [Field; TUBE_PROOF_LENGTH],\n pub vk_data: VerificationKey<ROLLUP_HONK_VERIFICATION_KEY_LENGTH_IN_FIELDS>,\n}\n\nimpl TubeData {\n pub fn verify(self) {\n let inputs = KernelPublicInputs::serialize(self.public_inputs);\n std::verify_proof_with_type(\n self.vk_data.key,\n self.proof,\n inputs,\n self.vk_data.hash,\n PROOF_TYPE_ROLLUP_HONK,\n );\n }\n}\n","path":"/home/aztec-dev/aztec-packages/noir-projects/mock-protocol-circuits/crates/mock-types/src/lib.nr"}},"names":["main"],"brillig_names":[]}
|