fix: remove insecure dummy round derivation from sumcheck and shplemini by iakovenkos · Pull Request #13488 · AztecProtocol/aztec-packages

iakovenkos · 2025-04-11T14:40:33Z

Remove all insecure dummy round derivations from Sumcheck and Shplemini.
Achieved by using padding_indicator_array introduced in #13417 that takes witness log_circuit_size as an argument, which getting range constrained and constrained to be the log of circuit_size by means of a method constrain_log_circuit_size introduced in this PR.
As a result, UltraRecursiveVerifier is no longer using unconstrained witnesses related to the padding.

I incorporated some changes into AVM recursive verifier, but it's still insecure due to an mle evaluation for public inputs that requires log_circuit_size.

…dicator-padding-array-instead-of-dummy-bools

…dummy-bools

iakovenkos · 2025-04-22T14:59:56Z

barretenberg/cpp/src/barretenberg/stdlib_circuit_builders/ultra_recursive_flavor.hpp

            size_t num_frs_read = 0;

            this->circuit_size = deserialize_from_frs<FF>(builder, elements, num_frs_read);
+            this->log_circuit_size =


to make recursive verifier circuit constant, log_circuit_size must be a witness

iakovenkos · 2025-04-22T15:00:52Z

barretenberg/cpp/src/barretenberg/sumcheck/sumcheck.hpp

+
+    // Recursive Verifiers without padding use the fixed log of the circuit size to determine the number of sumcheck
+    // rounds. Recursive Verifiers **with padding** are not permitted to use multivariate_d.
+    explicit SumcheckVerifier(std::shared_ptr<Transcript> transcript, FF target_sum = 0)


Prevent misuse of multivariate_d

…dummy-bools

iakovenkos · 2025-04-22T15:08:52Z

barretenberg/cpp/src/barretenberg/commitment_schemes/gemini/gemini.hpp

            Fr eval_pos = ((challenge_power * eval_pos_prev * 2) - eval_neg * (challenge_power * (Fr(1) - u) - u));
            // Divide by the denominator
            eval_pos *= (challenge_power * (Fr(1) - u) + u).invert();
-            if constexpr (use_padding) {


split this method into two, this one uses real log_n which is ok in native context and when log_n is a constexpr integer as in ECCVM and Translator, the method below handles padding in stdlib_context. seems cleaner this way

iakovenkos · 2025-04-22T15:16:53Z

barretenberg/cpp/src/barretenberg/stdlib/honk_verifier/ultra_recursive_verifier.cpp

-    // TODO(https://github.com/AztecProtocol/barretenberg/issues/1283): Suspicious get_value().
-    const size_t log_circuit_size = numeric::get_msb(static_cast<uint32_t>(key->circuit_size.get_value()));
-    Sumcheck sumcheck(log_circuit_size, transcript);
+


so, finally

we don't use integer log_circuit_size inside Ultra Recursive Verifier

the indicators used to pad proofs are computed from witness log_circuit_size

log_circuit_size is constrained to be the log of circuit_size. seems we don't need to change the VK structure at all.

ledwards2225

The overall logic looks good to me, but I don't think large-scale duplication of methods in gemini/shplemini is the right thing. I understand your instinct to avoid even more complicated conditional logic in those methods but I think overloads with duplication are only appropriate when the differences in logic are substantial and clearly implied by the difference in the function signature. Here the differences are minor and subtle. I see three possible options. (1) Simply maintain the original methods with some additional conditional complexity. (2) Find a way to remove the large amount of duplication by breaking some logic into smaller methods (not clear this is a great option here). Or (3): Perhaps we can simply use the indicator_array approach everywhere, even though it's not strictly needed in the VMs etc. It seems like the number of additional gates is very minor. If this leads to the clearest code then the small hit could be worth it.

Happy to discuss all of this further!

ledwards2225 · 2025-04-22T19:46:47Z

barretenberg/cpp/src/barretenberg/commitment_schemes/shplonk/shplemini.hpp

        return { commitments, scalars, shplonk_evaluation_challenge };
    };

+    /**


I'm not opposed to duplicating some logic if it makes things more clear but I'm not sure that's the case here. (The same applies for compute_fold_pos_evaluations). The differences are subtle and are not made clear by the difference in signature. For example the second overload doesn't deal with the interleaving stuff but its not clear why that is unless you know that interleaving is only used in the Translator and that the Translator only needs the non-padding method. I think this ~90% duplication makes it hard to tell which discrepancies are intended and which are not - I don't think this approach is the way to go.

ledwards2225 · 2025-04-22T19:49:37Z

barretenberg/cpp/src/barretenberg/polynomials/gate_separator.hpp

     * @brief Evaluate  \f$ ((1−X_{i}) + X_{i}\cdot \beta_{i})\f$ at the challenge point \f$ X_{i}=u_{i} \f$.
     */
-    template <typename Bool> FF univariate_eval(const FF& challenge, const Bool& dummy_round) const
+    FF univariate_eval(const FF& challenge, const FF& indicator) const


Can you add @param comments here and below that specify what indicator is?

ledwards2225 · 2025-04-22T19:52:01Z

barretenberg/cpp/src/barretenberg/stdlib/honk_verifier/ultra_recursive_verifier.test.cpp


        auto [blocks_10, verification_key_10] = get_blocks(10);
-        auto [blocks_11, verification_key_11] = get_blocks(11);
+        auto [blocks_11, verification_key_11] = get_blocks(14);


not sure if this change was intentional but we should update the naming if so

the test was broken as it would produce the circuits of the same size (8192), now they are different

ledwards2225 · 2025-04-22T20:01:23Z

barretenberg/cpp/src/barretenberg/sumcheck/sumcheck_round.hpp

        FF total_sum =
-            FF::conditional_assign(dummy_round, target_total_sum, univariate.value_at(0) + univariate.value_at(1));
+            (FF(1) - indicator) * target_total_sum + indicator * (univariate.value_at(0) + univariate.value_at(1));
        // TODO(#673): Conditionals like this can go away once native verification is is just recursive verification


I suppose this TODO can be removed

ledwards2225 · 2025-04-22T20:01:52Z

barretenberg/cpp/src/barretenberg/sumcheck/sumcheck_round.hpp

@@ -656,13 +654,12 @@ template <typename Flavor> class SumcheckVerifierRound {
     * @param round_challenge \f$ u_i\f$
     *


Can you add indicator to these docs

…dummy-bools

iakovenkos · 2025-04-23T18:05:19Z

barretenberg/cpp/src/barretenberg/sumcheck/sumcheck.hpp

-        // Pad gate challenges for Protogalaxy DeciderVerifier
+        // Pad gate challenges for Protogalaxy DeciderVerifier and AVM
        if constexpr (Flavor::USE_PADDING) {
            round.pad_gate_challenges(gate_challenges);


I'll remove this in a follow-up

iakovenkos · 2025-04-23T18:06:10Z

barretenberg/cpp/src/barretenberg/sumcheck/sumcheck.hpp

-            // The recursive logic differs from the native one because of a hack making Sumcheck circuits in
-            // Ultra, Mega, and their derivatives constant. Note that there's no artificial padding in
-            // Translator
-            if constexpr (IsRecursiveFlavor<Flavor> && Flavor::USE_PADDING) {


this condition is gone, now it's uniform for stdlib and native, as we're using padding_indicator_array everywhere

iakovenkos · 2025-04-23T18:17:28Z

barretenberg/cpp/src/barretenberg/stdlib/eccvm_verifier/eccvm_recursive_verifier.cpp

        .shifted = ClaimBatch{ commitments.get_to_be_shifted(), sumcheck_output.claimed_evaluations.get_shifted() }
    };
+
+    FF one{ 1 };


ECCVM Verifier uses a different Sumcheck verify method (the round univariates are committed), therefore, I didn't need to include padding_indicator_array in that method. To mock this array for Shplemini, we don't need any tricky methods, as the circuit size is a constexpr.

iakovenkos · 2025-04-23T18:18:46Z

...tenberg/cpp/src/barretenberg/stdlib/translator_vm_verifier/translator_recursive_verifier.cpp

+    one.convert_constant_to_fixed_witness(builder);
+
+    std::array<FF, TranslatorFlavor::CONST_TRANSLATOR_LOG_N> padding_indicator_array;
+    std::ranges::fill(padding_indicator_array, one);


To mock this array for Shplemini and Sumcheck, we don't need any tricky methods, as Translator circuit size is a constexpr

ledwards2225

What an improvement! Very glad we iterated on this. Thanks for your efforts. Just some minor comments to consider in a follow on

ledwards2225 · 2025-04-23T19:54:17Z

...g/cpp/src/barretenberg/stdlib/primitives/padding_indicator_array/padding_indicator_array.hpp

+ * @param n expected = 2^(log_n)
+ */
+template <typename Fr, size_t virtual_log_n>
+static void constrain_log_circuit_size(const std::array<Fr, virtual_log_n>& padding_indicator_array, const Fr& n)


ledwards2225 · 2025-04-23T19:56:11Z

.../src/barretenberg/stdlib/primitives/padding_indicator_array/padding_indicator_array.test.cpp

            Fr zero = Fr::from_witness(&builder, 0);

-            [[maybe_unused]] auto result = compute_padding_indicator_array<Fr, Builder, domain_size>(zero);
+            [[maybe_unused]] auto result = compute_padding_indicator_array<Curve, domain_size>(zero);


FWIW you could just remove the return value on these calls since the method isnt marked no_discard

ledwards2225 · 2025-04-23T20:00:11Z

.../src/barretenberg/stdlib/primitives/padding_indicator_array/padding_indicator_array.test.cpp

+            EXPECT_TRUE((sum_of_indicators == x).get_value());
+            // Check the correctness of the circuit
+            EXPECT_TRUE(CircuitChecker::check(builder));
+            // Create a witness = 2^idx


Suggested change

// Create a witness = 2^idx

// Create a witness = 2^idx + 1

ledwards2225 · 2025-04-23T20:15:13Z

barretenberg/cpp/src/barretenberg/sumcheck/sumcheck.hpp

                                  RelationSeparator alpha,
-                                  std::vector<FF>& gate_challenges)
+                                  std::vector<FF>& gate_challenges,
+                                  const std::array<FF, virtual_log_n>& padding_indicator_array = {})


I think this default value {} can be removed now.

ledwards2225 · 2025-04-23T20:18:41Z

barretenberg/cpp/src/barretenberg/translator_vm/translator_verifier.cpp

    libra_commitments[0] = transcript->template receive_from_prover<Commitment>("Libra:concatenation_commitment");

-    auto sumcheck_output = sumcheck.verify(relation_parameters, alpha, gate_challenges);
+    std::array<FF, TranslatorFlavor::CONST_TRANSLATOR_LOG_N> padding_indicator_array;


Very minor but this pattern appears in a lot of places. Might be nice to just have a class PaddingIndicatorArray that can just be constructed with the right form in a one-liner

ledwards2225 · 2025-04-23T20:21:22Z

...g/cpp/src/barretenberg/stdlib/primitives/padding_indicator_array/padding_indicator_array.hpp

-template <typename Fr, typename Builder, size_t virtual_log_n>
-static std::array<Fr, virtual_log_n> compute_padding_indicator_array(const Fr& log_n)
+template <typename Curve, size_t virtual_log_n>
+static std::array<typename Curve::ScalarField, virtual_log_n> compute_padding_indicator_array(


Again not a blocking point but I think the more idiomatic pattern here would be to make this a class PaddingIndicatorArray with a constructor that contains this logic. Maybe the constructor even takes n and constrain_log_circuit_size (now a class method) gets called automatically under the hood so it can't be missed

🤖 I have created a new Aztec Packages release --- ## [0.86.0](v0.85.0...v0.86.0) (2025-04-24) ### ⚠ BREAKING CHANGES * Use combined p2p and http prover coordination ([#13760](#13760)) * use single extended viem client ([#13715](#13715)) * remove slice read from CALL ([#13729](#13729)) ### Features * `#[allow(dead_code)]` (noir-lang/noir#8066) ([366d980](366d980)) * add aztec-up amm test w/ proving & sponsoredfpc ([#13209](#13209)) ([f54c8a1](f54c8a1)) * Add Rollup to registry and produce blocks ([#13556](#13556)) ([9ed10d3](9ed10d3)) * adding devnet tests ([#12808](#12808)) ([7687a1f](7687a1f)) * audit tracking tooling ([#13639](#13639)) ([e50d8e0](e50d8e0)) * **avm:** fast entity indexing without macros ([#13737](#13737)) ([5c8a993](5c8a993)) * **avm:** quick n dirty memory trace ([#13659](#13659)) ([062c6a9](062c6a9)) * **avm:** support col arrays and add keccak cols ([#13711](#13711)) ([9c4345a](9c4345a)) * **avm:** tagged value type in C++ ([#13540](#13540)) ([b30b5b3](b30b5b3)) * avoid unnecessary zero check in brillig overflow check (noir-lang/noir#8109) ([366d980](366d980)) * **contracts:** static + snapshotted validator set ([#13046](#13046)) ([90033f2](90033f2)) * enable mempool limiter on devnet ([#13722](#13722)) ([36fb0a1](36fb0a1)) * exec opcode spec table ([#13594](#13594)) ([d4d503a](d4d503a)) * **experimental:** Implement separate `-Zownership` analysis for ownership pass (noir-lang/noir#7861) ([366d980](366d980)) * expose mempool limit through helm chart ([#13616](#13616)) ([822e8d9](822e8d9)) * Garaga UltraStarknet[Zk]Honk flavours ([#11489](#11489)) ([6bc34a1](6bc34a1)) * IPA claim as public component ([#13429](#13429)) ([1ce3c43](1ce3c43)) * no longer recompute vk's in CIVC proofs ([#13590](#13590)) ([66a61ba](66a61ba)) * **p2p:** add private peers ([#12585](#12585)) ([4264c8c](4264c8c)) * **p2p:** optional P2P_BROADCAST_PORT ([#13525](#13525)) ([f709fab](f709fab)) * Port callstack resolution from aztec to noirjs (noir-lang/noir#7642) ([366d980](366d980)) * Refactor IPA claim handling in acir format to support them for AVM ([#13547](#13547)) ([df73c05](df73c05)) * remove slice read from CALL ([#13729](#13729)) ([7e7eb85](7e7eb85)) * replace field divisions by constants with multiplication by inv… (noir-lang/noir#8053) ([366d980](366d980)) * report world state size on disk ([#13706](#13706)) ([0dd8a7e](0dd8a7e)) * skip inverting field elements with values +-1 in ACVM (noir-lang/noir#8049) ([44c1347](44c1347)) * SMT Verificaiton Module: Data Structures ([#13658](#13658)) ([2de3bc5](2de3bc5)) * SMT verification module updates ([#13551](#13551)) ([f02123d](f02123d)) * ssa fuzzer (noir-lang/noir#7641) ([366d980](366d980)) * Tighter timing on ACVM ([#13743](#13743)) ([45cd39b](45cd39b)) * track rewards and slots ([#13546](#13546)) ([489c6cf](489c6cf)) * Use combined p2p and http prover coordination ([#13760](#13760)) ([4d04e62](4d04e62)) * VK generation test for HonkRecursionConstraint ([#13637](#13637)) ([71e81ce](71e81ce)) ### Bug Fixes * **acir:** Check whether opcodes were laid down for non-equality check before fetching payload locations (noir-lang/noir#8133) ([366d980](366d980)) * add proper handling for `u128` in comptime interpreter (noir-lang/noir#8079) ([366d980](366d980)) * Add version to gossipsub protocol ([#13567](#13567)) ([8ce4829](8ce4829)) * allow keywords in function names in SSA parser (noir-lang/noir#8063) ([44c1347](44c1347)) * Allow more slack in AST calibration for CI (noir-lang/noir#8076) ([366d980](366d980)) * amm bot ([#13553](#13553)) ([6b93832](6b93832)), closes [#13544](#13544) * **avm:** cpp addressing ([#13652](#13652)) ([9d941b6](9d941b6)) * blob sink waits for reg address when needed ([#13628](#13628)) ([486a42a](486a42a)) * **brillig:** SliceRefCount reads from the appropriate pointer (noir-lang/noir#8148) ([366d980](366d980)) * Check against multiple aws profiles in build instance credentails ([#13421](#13421)) ([71a408a](71a408a)) * dependency cycles in public simulator - part 0 (sim -> context) ([#13678](#13678)) ([e00089f](e00089f)) * dependency cycles in public simulator - part 1 (errors/revertReason) ([#13679](#13679)) ([c75e365](c75e365)) * dependency cycles in public simulator part 2 (serializable bytecode) ([#13680](#13680)) ([5d3e24c](5d3e24c)) * discv5 test failure ([#13653](#13653)) ([58c143b](58c143b)) * **docs:** Make viewing (outdated) protocol specs work locally ([#13534](#13534)) ([694537d](694537d)) * Increase timeout for p2p integration test ([#13720](#13720)) ([c244b2e](c244b2e)) * mac bb --version ([#13690](#13690)) ([9f8b64f](9f8b64f)) * make translator use ultra rather than eccvm ops ([#13489](#13489)) ([53c070d](53c070d)) * more worker fixes ([#13759](#13759)) ([080485a](080485a)) * move helm lint to build ([#13532](#13532)) ([7768ff8](7768ff8)) * native ivc benches not publishing ([#13665](#13665)) ([7ab712d](7ab712d)) * no exports of simulator should depend on jest-mock-extended ([#13694](#13694)) ([65a9f33](65a9f33)) * only clear trailing zeros on logs ([#13727](#13727)) ([e392d7c](e392d7c)) * **p2p:** better batch connection sampling ([#13674](#13674)) ([9c1d9f1](9c1d9f1)) * **p2p:** reqresp types + batch request tx pool filtering ([#13666](#13666)) ([8e2a3c9](8e2a3c9)) * **parser:** error on missing let semicolon in trait (and others) (noir-lang/noir#8101) ([366d980](366d980)) * pass along coinbase ([#13560](#13560)) ([593f810](593f810)), closes [#13643](#13643) * prover-node start ([#13627](#13627)) ([5d87f7a](5d87f7a)) * quote numbers ([#13654](#13654)) ([f0d1ec1](f0d1ec1)) * remove all txs from a failed epoch ([#13771](#13771)) ([abc4623](abc4623)) * remove insecure dummy round derivation from sumcheck and shplemini ([#13488](#13488)) ([9a3bb46](9a3bb46)) * replace values in data_bus too (noir-lang/noir#8086) ([366d980](366d980)) * retry deploy npm ([#13691](#13691)) ([76cab3f](76cab3f)) * run yarn ([#13713](#13713)) ([0e51259](0e51259)) * squash nightly foundry warning ([#13640](#13640)) ([e21f9fd](e21f9fd)) * SSA pass print filter to include the count (noir-lang/noir#8074) ([366d980](366d980)) * **ssa:** Do not inline simple recursive functions (noir-lang/noir#8127) ([366d980](366d980)) * **ssa:** Do not unroll loop with break (noir-lang/noir#8090) ([366d980](366d980)) * **ssa:** Do not use inner else condition when collapsing IfElse based upon the then condition (noir-lang/noir#8040) ([44c1347](44c1347)) * **ssa:** fix possibility to `Field % Field` operaions in Brillig from SSA (noir-lang/noir#8105) ([366d980](366d980)) * **ssa:** Loop range with u1 (noir-lang/noir#8131) ([366d980](366d980)) * update metric name to avoid conflicts ([#13629](#13629)) ([70c58ab](70c58ab)), closes [#13626](#13626) * wasm memory benchmark ([#13573](#13573)) ([9a73c4a](9a73c4a)) * wrapping mul support for u128 (noir-lang/noir#7941) ([366d980](366d980)) ### Miscellaneous * Accept optional test path for emitting integration tests (noir-lang/noir#8062) ([366d980](366d980)) * Add `GITHUB_TOKEN` to more workflow steps (noir-lang/noir#8046) ([44c1347](44c1347)) * add a benchmark for opcodes which need a batchable inversion (noir-lang/noir#8110) ([366d980](366d980)) * add hacky faster bootstrap for bb-centric e2e flow ([#13587](#13587)) ([498d433](498d433)) * address some visibility warnings ([#13728](#13728)) ([35dec90](35dec90)) * **avm:** less codegen for lookups ([#13741](#13741)) ([ec468d9](ec468d9)) * **avm:** move interaction jobs to trace builders ([#13621](#13621)) ([caac1c9](caac1c9)) * bb.js non-inlined web workers ([#13736](#13736)) ([0e604a1](0e604a1)) * **bb:** debugging helpers ([#13584](#13584)) ([0ebb29e](0ebb29e)) * **bb:** Make goblin a proper source module ([#13580](#13580)) ([3048a14](3048a14)) * bespoke export for client native prover / PXE server store lazy load ([#13783](#13783)) ([640dd08](640dd08)) * Blob and archiver syncing improvements ([#13542](#13542)) ([629aa2a](629aa2a)), closes [#13530](#13530) * blob archive client factory code ([#13648](#13648)) ([7b16791](7b16791)) * bug list ([#13773](#13773)) ([c6d4fb8](c6d4fb8)) * bump axois ([#13453](#13453)) ([1c20920](1c20920)) * bump bb to 0.84.0 (noir-lang/noir#8047) ([44c1347](44c1347)) * bump bignum timeout (noir-lang/noir#8080) ([366d980](366d980)) * bump external pinned commits (noir-lang/noir#8045) ([44c1347](44c1347)) * **ci:** run non dependent bootstrap build steps in parallel ([#13454](#13454)) ([b17e18d](b17e18d)) * cleanup aztec up amm test ([#13754](#13754)) ([3d92afe](3d92afe)) * Cleanup scripts in package jsons in yarn-project ([#13527](#13527)) ([a296945](a296945)) * **contracts:** core/staking -> core/slashing ([#13748](#13748)) ([5d93a0e](5d93a0e)) * create module for array handling in acirgen (noir-lang/noir#8119) ([366d980](366d980)) * dashboards use ${data_source} variable ([#13613](#13613)) ([45533d9](45533d9)) * delete honk_recursion for building ACIR ([#13664](#13664)) ([ac95729](ac95729)) * delete Ultra Vanilla CIVC ([#13669](#13669)) ([ae578a2](ae578a2)) * delete zeromorph ([#13667](#13667)) ([c8acae0](c8acae0)) * Disable blobscan by default ([#13742](#13742)) ([c55088e](c55088e)) * **docs:** `aztec` and `aztec-wallet` cli reference updates ([#13692](#13692)) ([d11d154](d11d154)) * **docs:** add 0.85.0 docs ([#13578](#13578)) ([cf07358](cf07358)) * **docs:** add AND/XOR bug to bug list ([#13784](#13784)) ([797ae6d](797ae6d)) * **docs:** Add architecture docs (noir-lang/noir#7992) ([366d980](366d980)) * **docs:** adding redirects for node guide ([#13768](#13768)) ([e96e5bf](e96e5bf)) * **docs:** bugfix + deploy on master ([#13717](#13717)) ([010975a](010975a)) * **docs:** Fix some stuff on fees, rm confusing storage example ([#13501](#13501)) ([c00b20b](c00b20b)) * **docs:** Sequencer and Prover Guide ([#13433](#13433)) ([55b9a2b](55b9a2b)) * **docs:** update bb commands to match 0.84.0 (noir-lang/noir#8050) ([366d980](366d980)) * **docs:** Update docs bootrap to to include release ([#13615](#13615)) ([2154d5e](2154d5e)) * don't use `set_from_value_id` in `remove_if_else` (noir-lang/noir#8070) ([366d980](366d980)) * don't use `set_value_from_id` in `as_slice_length` (noir-lang/noir#8039) ([44c1347](44c1347)) * don't use `set_value_from_id` in `constant_folding` (noir-lang/noir#8091) ([366d980](366d980)) * don't use `set_value_from_id` in `loop_invariant` (noir-lang/noir#8085) ([366d980](366d980)) * don't use `set_value_from_id` in `remove_bit_shifts` (noir-lang/noir#8071) ([366d980](366d980)) * don't use `set_value_from_id` in `simplify_cfg` (noir-lang/noir#8072) ([366d980](366d980)) * **experimental:** Function::simple_optimization for SSA optimizations (noir-lang/noir#8102) ([366d980](366d980)) * Fetch rollup address using version as index ([#13620](#13620)) ([60e73f9](60e73f9)) * Fix license files ([#13695](#13695)) ([9931fb8](9931fb8)) * mempool limit ([#13735](#13735)) ([def1287](def1287)) * mint block rewards for 200K blocks at deployment ([#13537](#13537)) ([1a3a326](1a3a326)) * move check_circuit functionality from `TranslatorCircuitBuilder` into a `TranslatorCircuitChecker` ([#13761](#13761)) ([e4e7fca](e4e7fca)) * noir test flake addition ([#13663](#13663)) ([c302fdd](c302fdd)) * **noir-contracts:** update readme ([#13563](#13563)) ([42dfbbf](42dfbbf)) * **optimization:** Enable experimental ownership clone scheme by default (noir-lang/noir#8097) ([366d980](366d980)) * parse nop in SSA parser (noir-lang/noir#8141) ([366d980](366d980)) * ping luke instead of cody on bb benchmark regressions ([#13718](#13718)) ([2802f5a](2802f5a)) * playground improvements ([#13588](#13588)) ([4c3453b](4c3453b)) * **playground:** bump vite ([#13750](#13750)) ([7e72420](7e72420)) * Print `unsafe { ... }` around calls to Brillig from ACIR in AST (noir-lang/noir#8077) ([366d980](366d980)) * **public/avm:** from hints to the end of the world ([#13459](#13459)) ([a89de5d](a89de5d)) * redo typo PR by dizer-ti ([#13757](#13757)) ([075d3a8](075d3a8)) * release playground on s3. ([#13582](#13582)) ([2f9458a](2f9458a)) * **release:** give aztec release image sensible default entrypoint ([#13517](#13517)) ([a864c06](a864c06)) * remove circuit simulator ([#13689](#13689)) ([a00566c](a00566c)) * Remove code of the fake AVM recursive verifier ([#13614](#13614)) ([048dfed](048dfed)) * remove msm sorter ([#13668](#13668)) ([ff29d86](ff29d86)) * remove old terraform configs ([#13716](#13716)) ([49ac1db](49ac1db)), closes [#13651](#13651) * remove omit param from serialize derivation ([#13703](#13703)) ([6af5943](6af5943)) * remove pcs vk from vk ([#13638](#13638)) ([0e941ef](0e941ef)) * remove try_merge_only_changed_indices (noir-lang/noir#8142) ([366d980](366d980)) * replace relative paths to noir-protocol-circuits ([78c87b5](78c87b5)) * replace relative paths to noir-protocol-circuits ([4e53cd1](4e53cd1)) * replace relative paths to noir-protocol-circuits ([3a33c47](3a33c47)) * replace relative paths to noir-protocol-circuits ([eaaa85b](eaaa85b)) * replace relative paths to noir-protocol-circuits ([648a4fe](648a4fe)) * replace relative paths to noir-protocol-circuits ([b3f4745](b3f4745)) * replace relative paths to noir-protocol-circuits ([269b316](269b316)) * replace relative paths to noir-protocol-circuits ([1330efe](1330efe)) * replace relative paths to noir-protocol-circuits ([a739284](a739284)) * Sanity check block number from archiver before returning it ([#13631](#13631)) ([e459b2a](e459b2a)) * simpler `make_mutable` in `array_set` optimization (noir-lang/noir#8106) ([366d980](366d980)) * **spartan:** bump default kind resources ([#13747](#13747)) ([8ca828f](8ca828f)) * **ssa:** Additional unrolling and mem2reg passes (noir-lang/noir#8017) ([44c1347](44c1347)) * **ssa:** Remove IfElse pass basic SSA tests (noir-lang/noir#8058) ([44c1347](44c1347)) * **ssa:** Test terminator value constant folding and resolve cache for data bus (noir-lang/noir#8132) ([366d980](366d980)) * starknet feature flag ([#13681](#13681)) ([2b6c627](2b6c627)) * stop prover node swallowing start prover job errors ([#13676](#13676)) ([90c2b7b](90c2b7b)) * **test:** AST generation calibration test (noir-lang/noir#8054) ([44c1347](44c1347)) * update ACVM doc (noir-lang/noir#8004) ([366d980](366d980)) * Update docs snippet ([#13739](#13739)) ([7fb333a](7fb333a)) * update staking asset handler address ([#13566](#13566)) ([daa09f2](daa09f2)) * Updated contract addresses for alpha-testnet ([#13585](#13585)) ([9f0ff4a](9f0ff4a)) * Use chain monitor to sync system time in p2p tests ([#13632](#13632)) ([abbad4c](abbad4c)) * use public component key for pairing inputs ([#13705](#13705)) ([467166f](467166f)) * use PublicComponentKeys ([#13686](#13686)) ([68e4b6f](68e4b6f)) * use single extended viem client ([#13715](#13715)) ([cf637dc](cf637dc)) * validate block header hash in circuits ([#13094](#13094)) ([f19c182](f19c182)) * wasm proof verifying with native bb ([#13499](#13499)) ([1ad9249](1ad9249)) ### Documentation * fees tutorial ([#13357](#13357)) ([c580657](c580657)) * move snippets all versions ([#13650](#13650)) ([a2f5553](a2f5553)) * Update glossary & snippets ([#13661](#13661)) ([d55816d](d55816d)) --- This PR was generated with [Release Please](https://github.com/googleapis/release-please). See [documentation](https://github.com/googleapis/release-please#release-please). --------- Co-authored-by: AztecBot <tech@aztecprotocol.com>

iakovenkos added 21 commits April 8, 2025 12:13

create file/folder

11e848d

added indicator array computation method + test template

3d5de5a

fix build

44cb8c6

tests + rename

174e881

Merge branch 'master' into si/bit-by-bit-for-witness-circuit-sizes

4b15753

undo changes in UH recursive

3ce110d

fix build

1b4a34d

rename+docs

ff18da4

stray info

56b25b2

split shplemini into padding/non padding

c33a1b0

small fix for barycentric data to access inverted denominators

f99869b

fix doxygen

c2b45b7

fix build

239190f

Merge branch 'si/bit-by-bit-for-witness-circuit-sizes' into si/use-in…

ca593e0

…dicator-padding-array-instead-of-dummy-bools

integrating

8df3c22

fix off-by-one issue

aa4c0f9

Merge branch 'si/bit-by-bit-for-witness-circuit-sizes' into si/use-in…

0fbe409

…dicator-padding-array-instead-of-dummy-bools

sumcheck fine?

3613f19

Merge branch 'master' into si/bit-by-bit-for-witness-circuit-sizes

d58dbdd

Merge branch 'si/bit-by-bit-for-witness-circuit-sizes' into si/use-in…

a3fd9a6

…dicator-padding-array-instead-of-dummy-bools

dummy round removal

e0c1aaa

Base automatically changed from si/bit-by-bit-for-witness-circuit-sizes to master April 11, 2025 17:08

iakovenkos and others added 4 commits April 21, 2025 09:19

Merge branch 'master' into si/use-indicator-padding-array-instead-of-…

d079e10

…dummy-bools

better separation of padding and non-padding + simplifications

75877c2

docs + simplify sumcheck logic

ce290bc

Merge branch 'master' into si/use-indicator-padding-array-instead-of-…

dac6788

…dummy-bools

iakovenkos marked this pull request as ready for review April 21, 2025 15:23

iakovenkos requested review from IlyasRidhuan, fcarreiro and jeanmon as code owners April 21, 2025 15:23

fix AcirHonkRecursionConstraint tests

bacaae4

iakovenkos commented Apr 22, 2025

View reviewed changes

iakovenkos marked this pull request as ready for review April 22, 2025 15:02

Merge branch 'master' into si/use-indicator-padding-array-instead-of-…

266e165

…dummy-bools

iakovenkos commented Apr 22, 2025

View reviewed changes

iakovenkos requested a review from ledwards2225 April 22, 2025 17:03

iakovenkos changed the title ~~fix: remove insecure dummy round derivation~~ fix: remove insecure dummy round derivation from sumcheck and shplemini Apr 22, 2025

iakovenkos added the crypto cryptography label Apr 22, 2025

ledwards2225 requested changes Apr 22, 2025

View reviewed changes

iakovenkos added 4 commits April 23, 2025 08:37

template padding indicator array on curve to support native

b26a7e3

replace log_n with padding array everywhere, remove redundant code

5f317e1

more clean-up

6fa8d9c

Merge branch 'master' into si/use-indicator-padding-array-instead-of-…

d99580e

…dummy-bools

iakovenkos commented Apr 23, 2025

View reviewed changes

ledwards2225 approved these changes Apr 23, 2025

View reviewed changes

minor cleanup

cc0edd7

ledwards2225 enabled auto-merge April 23, 2025 21:05

ledwards2225 disabled auto-merge April 23, 2025 21:05

ledwards2225 enabled auto-merge April 23, 2025 21:05

ledwards2225 added this pull request to the merge queue Apr 23, 2025

Merged via the queue into master with commit 9a3bb46 Apr 23, 2025
7 checks passed

ledwards2225 deleted the si/use-indicator-padding-array-instead-of-dummy-bools branch April 23, 2025 22:29

AztecBot mentioned this pull request Apr 23, 2025

chore(master): release 0.86.0 #13579

Merged

		@@ -656,13 +654,12 @@ template <typename Flavor> class SumcheckVerifierRound {
		* @param round_challenge \f$ u_i\f$
		*

Conversation

iakovenkos commented Apr 11, 2025 • edited Loading Uh oh! There was an error while loading. Please reload this page.

Uh oh!

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

ledwards2225 left a comment • edited Loading Uh oh! There was an error while loading. Please reload this page.

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

ledwards2225 left a comment

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Uh oh!

Reviewers

Assignees

Labels

Projects

Milestone

Development

Uh oh!

2 participants

iakovenkos commented Apr 11, 2025 •

edited

Loading

ledwards2225 left a comment •

edited

Loading