sumcheck_pg_recursion_constraint.test.cpp

Go to the documentation of this file.

#include "acir_format.hpp"
#include "acir_format_mocks.hpp"
#include "barretenberg/bbapi/bbapi_shared.hpp"
#include "barretenberg/client_ivc/sumcheck_client_ivc.hpp"
#include "barretenberg/dsl/acir_format/mock_verifier_inputs.hpp"
#include "barretenberg/dsl/acir_format/pg_recursion_constraint.hpp"
#include "barretenberg/goblin/mock_circuits.hpp"
#include "barretenberg/ultra_honk/prover_instance.hpp"
#include "barretenberg/ultra_honk/ultra_prover.hpp"
#include "barretenberg/ultra_honk/ultra_verifier.hpp"
#include "honk_recursion_constraint.hpp"
#include "proof_surgeon.hpp"
 
#include <gtest/gtest.h>
#include <vector>
 
using namespace acir_format;
using namespace bb;
 
class SumcheckIvcRecursionConstraintTest : public ::testing::Test {
 
  public:
    using Builder = MegaCircuitBuilder;
    using Flavor = MegaFlavor;
    using VerificationKey = MegaFlavor::VerificationKey;
    using FF = Flavor::FF;
    using VerifierInputs = SumcheckClientIVC::VerifierInputs;
    using QUEUE_TYPE = SumcheckClientIVC::QUEUE_TYPE;
    using VerificationQueue = SumcheckClientIVC::VerificationQueue;
    using ArithmeticConstraint = AcirFormat::PolyTripleConstraint;
    using PairingPoints = SumcheckClientIVC::PairingPoints;
 
    static constexpr size_t NUM_TRAILING_KERNELS = 3; // reset, tail, hiding
 
    static Builder construct_mock_app_circuit(const std::shared_ptr<SumcheckClientIVC>& ivc)
    {
        Builder circuit{ ivc->goblin.op_queue };
        GoblinMockCircuits::add_some_ecc_op_gates(circuit);
        MockCircuits::add_arithmetic_gates(circuit);
        PairingPoints::add_default_to_public_inputs(circuit);
        return circuit;
    }
 
    static std::shared_ptr<VerificationKey> get_verification_key(Builder& builder_in)
    {
        // This is a workaround to ensure that the circuit is finalized before we create the verification key
        // In practice, this should not be needed as the circuit will be finalized when it is accumulated into the IVC
        // but this is a workaround for the test setup.
        // Create a copy of the input circuit
        MegaCircuitBuilder_<bb::fr> builder{ builder_in };
 
        // Deepcopy the opqueue to avoid modifying the original one
        builder.op_queue = std::make_shared<ECCOpQueue>(*builder.op_queue);
        std::shared_ptr<SumcheckClientIVC::ProverInstance> prover_instance =
            std::make_shared<SumcheckClientIVC::ProverInstance>(builder);
        std::shared_ptr<VerificationKey> vk = std::make_shared<VerificationKey>(prover_instance->get_precomputed());
        return vk;
    }
 
    static void construct_and_accumulate_trailing_kernels(const std::shared_ptr<SumcheckClientIVC>& ivc)
    {
 
        // Reset kernel
        EXPECT_EQ(ivc->verification_queue.size(), 1);
        EXPECT_EQ(ivc->verification_queue[0].type, QUEUE_TYPE::PG);
        construct_and_accumulate_mock_kernel(ivc);
 
        // Tail kernel
        EXPECT_EQ(ivc->verification_queue.size(), 1);
        EXPECT_EQ(ivc->verification_queue[0].type, QUEUE_TYPE::PG_TAIL);
        construct_and_accumulate_mock_kernel(ivc);
 
        // Hiding kernel
        EXPECT_EQ(ivc->verification_queue.size(), 1);
        EXPECT_EQ(ivc->verification_queue[0].type, QUEUE_TYPE::PG_FINAL);
        construct_and_accumulate_mock_kernel(ivc);
    }
 
    static UltraCircuitBuilder create_inner_circuit(size_t log_num_gates = 10)
    {
        using InnerPairingPoints = bb::stdlib::recursion::PairingPoints<UltraCircuitBuilder>;
 
        UltraCircuitBuilder builder;
 
        // Create 2^log_n many add gates based on input log num gates
        const size_t num_gates = (1 << log_num_gates);
        for (size_t i = 0; i < num_gates; ++i) {
            fr a = fr::random_element();
            uint32_t a_idx = builder.add_variable(a);
 
            fr b = fr::random_element();
            fr c = fr::random_element();
            fr d = a + b + c;
            uint32_t b_idx = builder.add_variable(b);
            uint32_t c_idx = builder.add_variable(c);
            uint32_t d_idx = builder.add_variable(d);
 
            builder.create_big_add_gate({ a_idx, b_idx, c_idx, d_idx, fr(1), fr(1), fr(1), fr(-1), fr(0) });
        }
 
        InnerPairingPoints::add_default_to_public_inputs(builder);
        return builder;
    }
 
    static Builder construct_mock_UH_recursion_app_circuit(const std::shared_ptr<SumcheckClientIVC>& ivc,
                                                           const bool tamper_vk)
    {
        AcirProgram program;
        std::vector<RecursionConstraint> recursion_constraints;
 
        Builder circuit{ ivc->goblin.op_queue };
        GoblinMockCircuits::add_some_ecc_op_gates(circuit);
        MockCircuits::add_arithmetic_gates(circuit);
 
        {
            using RecursiveFlavor = UltraRecursiveFlavor_<Builder>;
            using VerifierOutput = bb::stdlib::recursion::honk::UltraRecursiveVerifierOutput<Builder>;
            using StdlibProof = bb::stdlib::Proof<Builder>;
            using StdlibIO = bb::stdlib::recursion::honk::DefaultIO<Builder>;
 
            // Create an arbitrary inner circuit
            auto inner_circuit = create_inner_circuit();
 
            // Compute native verification key
            auto prover_instance = std::make_shared<ProverInstance_<UltraFlavor>>(inner_circuit);
            auto honk_vk = std::make_shared<UltraFlavor::VerificationKey>(prover_instance->get_precomputed());
            UltraProver prover(prover_instance, honk_vk); // A prerequisite for computing VK
            auto inner_proof = prover.construct_proof();
 
            if (tamper_vk) {
                honk_vk->q_l = g1::one;
                UltraVerifier_<UltraFlavor> verifier(honk_vk);
                EXPECT_FALSE(verifier.template verify_proof<DefaultIO>(inner_proof).result);
            }
            // Instantiate the recursive verifier using the native verification key
            auto stdlib_vk_and_hash = std::make_shared<RecursiveFlavor::VKAndHash>(circuit, honk_vk);
            stdlib::recursion::honk::UltraRecursiveVerifier_<RecursiveFlavor> verifier(&circuit, stdlib_vk_and_hash);
 
            StdlibProof stdlib_inner_proof(circuit, inner_proof);
            VerifierOutput output = verifier.template verify_proof<StdlibIO>(stdlib_inner_proof);
 
            // IO
            StdlibIO inputs;
            inputs.pairing_inputs = output.points_accumulator;
            inputs.set_public(); // propagate resulting pairing points on the public inputs
        }
 
        return circuit;
    }
 
    static RecursionConstraint create_recursion_constraint(const VerifierInputs& input, SlabVector<FF>& witness)
    {
        // Assemble simple vectors of witnesses for vkey and proof
        std::vector<FF> key_witnesses = input.honk_vk->to_field_elements();
        FF key_hash_witness = input.honk_vk->hash();
        std::vector<FF> proof_witnesses = input.proof; // proof contains the public inputs at this stage
 
        // Construct witness indices for each component in the constraint; populate the witness array
        auto [key_indices, key_hash_index, proof_indices, public_inputs_indices] =
            ProofSurgeon<FF>::populate_recursion_witness_data(
                witness, proof_witnesses, key_witnesses, key_hash_witness, /*num_public_inputs_to_extract=*/0);
 
        // The proof type can be either Oink or PG or PG_FINAL
        PROOF_TYPE proof_type;
        switch (input.type) {
        case QUEUE_TYPE::OINK:
            proof_type = OINK;
            break;
        case QUEUE_TYPE::PG:
            proof_type = PG;
            break;
        case QUEUE_TYPE::PG_FINAL:
            proof_type = PG_FINAL;
            break;
        case QUEUE_TYPE::PG_TAIL:
            proof_type = PG_TAIL;
            break;
        default:
            throw std::runtime_error("Invalid proof type");
        }
 
        return RecursionConstraint{
            .key = key_indices,
            .proof = {}, // the proof witness indices are not needed in an ivc recursion constraint
            .public_inputs = public_inputs_indices,
            .key_hash = key_hash_index,
            .proof_type = proof_type,
        };
    }
 
    static AcirProgram construct_mock_kernel_program(const VerificationQueue& verification_queue)
    {
        AcirProgram program;
 
        // Construct recursion constraints based on the ivc verification queue; populate the witness along the way
        std::vector<RecursionConstraint> pg_recursion_constraints;
        pg_recursion_constraints.reserve(verification_queue.size());
        for (const auto& queue_entry : verification_queue) {
            pg_recursion_constraints.push_back(create_recursion_constraint(queue_entry, program.witness));
        }
 
        // Construct a constraint system containing the business logic and ivc recursion constraints
        program.constraints.varnum = static_cast<uint32_t>(program.witness.size());
        program.constraints.num_acir_opcodes = static_cast<uint32_t>(pg_recursion_constraints.size());
        program.constraints.pg_recursion_constraints = pg_recursion_constraints;
        program.constraints.original_opcode_indices = create_empty_original_opcode_indices();
        mock_opcode_indices(program.constraints);
 
        return program;
    }
 
    static void construct_and_accumulate_mock_kernel(std::shared_ptr<SumcheckClientIVC> ivc)
    {
        // construct a mock kernel program (acir) from the ivc verification queue
        const ProgramMetadata metadata{ ivc };
        AcirProgram mock_kernel_program = construct_mock_kernel_program(ivc->verification_queue);
        auto kernel = acir_format::create_circuit<Builder>(mock_kernel_program, metadata);
        auto kernel_vk = get_kernel_vk_from_circuit(kernel);
        ivc->accumulate(kernel, kernel_vk);
    }
 
    static void construct_and_accumulate_mock_app(std::shared_ptr<SumcheckClientIVC> ivc)
    {
        // construct a mock kernel program (acir) from the ivc verification queue
        auto app_circuit = construct_mock_app_circuit(ivc);
        ivc->accumulate(app_circuit, get_verification_key(app_circuit));
    }
 
    static std::shared_ptr<SumcheckClientIVC::MegaVerificationKey> construct_kernel_vk_from_acir_program(
        AcirProgram& program)
    {
        // Create kernel circuit from the kernel program
        Builder kernel = acir_format::create_circuit<Builder>(program);
 
        // Manually construct the VK for the kernel circuit
        auto prover_instance = std::make_shared<SumcheckClientIVC::ProverInstance>(kernel);
        auto verification_key =
            std::make_shared<SumcheckClientIVC::MegaVerificationKey>(prover_instance->get_precomputed());
        return verification_key;
    }
 
    static std::shared_ptr<SumcheckClientIVC::MegaVerificationKey> get_kernel_vk_from_circuit(Builder& kernel)
    {
        auto prover_instance = std::make_shared<SumcheckClientIVC::ProverInstance>(kernel);
        auto verification_key =
            std::make_shared<SumcheckClientIVC::MegaVerificationKey>(prover_instance->get_precomputed());
        return verification_key;
    }
 
  protected:
    void SetUp() override
    {
        bb::srs::init_file_crs_factory(bb::srs::bb_crs_path());
        // Set the global flag to use SumcheckClientIVC
        bb::bbapi::USE_SUMCHECK_IVC = true;
    }
    void TearDown() override
    {
        // Reset the flag after tests
        bb::bbapi::USE_SUMCHECK_IVC = false;
    }
};
 
TEST_F(SumcheckIvcRecursionConstraintTest, MockMergeProofSize)
{
    Goblin::MergeProof merge_proof = create_mock_merge_proof();
    EXPECT_EQ(merge_proof.size(), MERGE_PROOF_SIZE);
}
 
TEST_F(SumcheckIvcRecursionConstraintTest, AccumulateSingleApp)
{
    auto ivc = std::make_shared<SumcheckClientIVC>(/*num_circuits=*/5 /* app, kernel, reset, tail, hiding */);
 
    // construct a mock app_circuit
    construct_and_accumulate_mock_app(ivc);
 
    // Construct kernel consisting only of the kernel completion logic
    construct_and_accumulate_mock_kernel(ivc);
 
    // add the trailing kernels
    construct_and_accumulate_trailing_kernels(ivc);
 
    auto proof = ivc->prove();
    EXPECT_TRUE(SumcheckClientIVC::verify(proof, ivc->get_vk()));
}
 
TEST_F(SumcheckIvcRecursionConstraintTest, AccumulateTwoApps)
{
    // 4 ciruits and the tail kernel
    auto ivc = std::make_shared<SumcheckClientIVC>(/*num_circuits=*/7);
 
    // construct a mock app_circuit
    construct_and_accumulate_mock_app(ivc);
 
    const ProgramMetadata metadata{ ivc };
 
    // Construct kernel_0; consists of a single oink recursive verification for app (plus databus/merge logic)
    construct_and_accumulate_mock_kernel(ivc);
 
    // construct a mock app_circuit
    construct_and_accumulate_mock_app(ivc);
 
    // Construct and accumulate another Kernel circuit
    construct_and_accumulate_mock_kernel(ivc);
 
    // Accumulate the trailing kernels
    construct_and_accumulate_trailing_kernels(ivc);
 
    auto proof = ivc->prove();
    EXPECT_TRUE(SumcheckClientIVC::verify(proof, ivc->get_vk()));
}
 
// Test generation of "init" kernel VK via dummy IVC data
TEST_F(SumcheckIvcRecursionConstraintTest, GenerateInitKernelVKFromConstraints)
{
    // First, construct the kernel VK by running the full IVC (accumulate one app and one kernel)
    std::shared_ptr<MegaFlavor::VerificationKey> expected_kernel_vk;
    {
        auto ivc = std::make_shared<SumcheckClientIVC>(/*num_circuits=*/5);
 
        // Construct and accumulate mock app_circuit
        construct_and_accumulate_mock_app(ivc);
 
        // Construct and accumulate kernel consisting only of the kernel completion logic
        construct_and_accumulate_mock_kernel(ivc);
        expected_kernel_vk = ivc->verification_queue.back().honk_vk;
    }
 
    // Now, construct the kernel VK by mocking the post app accumulation state of the IVC
    std::shared_ptr<MegaFlavor::VerificationKey> kernel_vk;
    {
        auto ivc = std::make_shared<SumcheckClientIVC>(/*num_circuits=*/5);
 
        // Construct kernel consisting only of the kernel completion logic
        acir_format::mock_sumcheck_ivc_accumulation(ivc, SumcheckClientIVC::QUEUE_TYPE::OINK, /*is_kernel=*/false);
        AcirProgram program = construct_mock_kernel_program(ivc->verification_queue);
        program.witness = {}; // remove the witness to mimick VK construction context
 
        kernel_vk = construct_kernel_vk_from_acir_program(program);
    }
 
    // Compare the VK constructed via running the IVc with the one constructed via mocking
    EXPECT_EQ(*kernel_vk.get(), *expected_kernel_vk.get());
}
 
// Test generation of "reset" kernel VK via dummy IVC data
TEST_F(SumcheckIvcRecursionConstraintTest, GenerateResetKernelVKFromConstraints)
{
    // First, construct the kernel VK by running the full IVC (accumulate one app and one kernel)
    std::shared_ptr<MegaFlavor::VerificationKey> expected_kernel_vk;
    {
        auto ivc = std::make_shared<SumcheckClientIVC>(/*num_circuits=*/5);
 
        const ProgramMetadata metadata{ ivc };
 
        // Construct and accumulate mock app_circuit
        construct_and_accumulate_mock_app(ivc);
 
        // Construct and accumulate a mock INIT kernel (oink recursion for app accumulation)
        construct_and_accumulate_mock_kernel(ivc);
        EXPECT_TRUE(ivc->verification_queue.size() == 1);
        EXPECT_TRUE(ivc->verification_queue[0].type == bb::SumcheckClientIVC::QUEUE_TYPE::PG);
 
        // Construct and accumulate a mock RESET kernel (PG recursion for kernel accumulation)
        construct_and_accumulate_mock_kernel(ivc);
        expected_kernel_vk = ivc->verification_queue.back().honk_vk;
    }
 
    // Now, construct the kernel VK by mocking the IVC state prior to kernel construction
    std::shared_ptr<MegaFlavor::VerificationKey> kernel_vk;
    {
        auto ivc = std::make_shared<SumcheckClientIVC>(/*num_circuits=*/5);
 
        // Construct kernel consisting only of the kernel completion logic
        acir_format::mock_sumcheck_ivc_accumulation(ivc, SumcheckClientIVC::QUEUE_TYPE::PG, /*is_kernel=*/true);
        AcirProgram program = construct_mock_kernel_program(ivc->verification_queue);
        program.witness = {}; // remove the witness to mimick VK construction context
        kernel_vk = construct_kernel_vk_from_acir_program(program);
    }
 
    // Compare the VK constructed via running the IVc with the one constructed via mocking
    EXPECT_EQ(*kernel_vk.get(), *expected_kernel_vk.get());
}
 
// Test generation of "tail" kernel VK via dummy IVC data
TEST_F(SumcheckIvcRecursionConstraintTest, GenerateTailKernelVKFromConstraints)
{
    // First, construct the kernel VK by running the full IVC (accumulate one app and one kernel)
    std::shared_ptr<MegaFlavor::VerificationKey> expected_kernel_vk;
    {
        auto ivc = std::make_shared<SumcheckClientIVC>(/*num_circuits=*/5);
 
        const ProgramMetadata metadata{ ivc };
 
        // Construct and accumulate mock app_circuit
        construct_and_accumulate_mock_app(ivc);
 
        // Construct and accumulate a mock INIT kernel (oink recursion for app accumulation)
        construct_and_accumulate_mock_kernel(ivc);
 
        // Construct and accumulate a mock RESET kernel (PG recursion for kernel accumulation)
        construct_and_accumulate_mock_kernel(ivc);
 
        // Construct and accumulate a mock TAIL kernel (PG recursion for kernel accumulation)
        EXPECT_TRUE(ivc->verification_queue.size() == 1);
        EXPECT_TRUE(ivc->verification_queue[0].type == bb::SumcheckClientIVC::QUEUE_TYPE::PG_TAIL);
        construct_and_accumulate_mock_kernel(ivc);
 
        expected_kernel_vk = ivc->verification_queue.back().honk_vk;
    }
 
    // Now, construct the kernel VK by mocking the IVC state prior to kernel construction
    std::shared_ptr<MegaFlavor::VerificationKey> kernel_vk;
    {
        auto ivc = std::make_shared<SumcheckClientIVC>(/*num_circuits=*/5);
 
        // Construct kernel consisting only of the kernel completion logic
        acir_format::mock_sumcheck_ivc_accumulation(ivc, SumcheckClientIVC::QUEUE_TYPE::PG_TAIL, /*is_kernel=*/true);
        AcirProgram program = construct_mock_kernel_program(ivc->verification_queue);
        program.witness = {}; // remove the witness to mimick VK construction context
 
        kernel_vk = construct_kernel_vk_from_acir_program(program);
    }
 
    // Compare the VK constructed via running the IVc with the one constructed via mocking
    EXPECT_EQ(*kernel_vk.get(), *expected_kernel_vk.get());
}
 
// Test generation of "inner" kernel VK via dummy IVC data
TEST_F(SumcheckIvcRecursionConstraintTest, GenerateInnerKernelVKFromConstraints)
{
    // First, construct the kernel VK by running the full IVC (accumulate one app and one kernel)
    std::shared_ptr<MegaFlavor::VerificationKey> expected_kernel_vk;
    {
        // we have to set the number of circuits one more than the number of circuits we're accumulating as otherwise
        // the last circuit will be seen as a tail
        auto ivc = std::make_shared<SumcheckClientIVC>(/*num_circuits=*/6);
 
        const ProgramMetadata metadata{ ivc };
 
        { // Construct and accumulate mock app_circuit
            construct_and_accumulate_mock_app(ivc);
        }
 
        // Construct and accumulate a mock INIT kernel (oink recursion for app accumulation)
        construct_and_accumulate_mock_kernel(ivc);
 
        { // Construct and accumulate a second mock app_circuit
            construct_and_accumulate_mock_app(ivc);
        }
 
        { // Construct and accumulate a mock INNER kernel (PG recursion for kernel accumulation)
            EXPECT_TRUE(ivc->verification_queue.size() == 2);
            EXPECT_TRUE(ivc->verification_queue[1].type == bb::SumcheckClientIVC::QUEUE_TYPE::PG);
            construct_and_accumulate_mock_kernel(ivc);
        }
 
        expected_kernel_vk = ivc->verification_queue.back().honk_vk;
    }
 
    // Now, construct the kernel VK by mocking the IVC state prior to kernel construction
    std::shared_ptr<MegaFlavor::VerificationKey> kernel_vk;
    {
        auto ivc = std::make_shared<SumcheckClientIVC>(/*num_circuits=*/4);
 
        // Construct kernel consisting only of the kernel completion logic
        acir_format::mock_sumcheck_ivc_accumulation(ivc, SumcheckClientIVC::QUEUE_TYPE::PG, /*is_kernel=*/true);
        acir_format::mock_sumcheck_ivc_accumulation(ivc, SumcheckClientIVC::QUEUE_TYPE::PG, /*is_kernel=*/false);
        AcirProgram program = construct_mock_kernel_program(ivc->verification_queue);
        program.witness = {}; // remove the witness to mimick VK construction context
 
        kernel_vk = construct_kernel_vk_from_acir_program(program);
    }
 
    // Compare the VK constructed via running the IVc with the one constructed via mocking
    EXPECT_EQ(*kernel_vk.get(), *expected_kernel_vk.get());
}
 
// Test generation of "hiding" kernel VK via dummy IVC data
TEST_F(SumcheckIvcRecursionConstraintTest, GenerateHidingKernelVKFromConstraints)
{
    // First, construct the kernel VK by running the full IVC
    std::shared_ptr<MegaFlavor::VerificationKey> expected_hiding_kernel_vk;
    {
        auto ivc = std::make_shared<SumcheckClientIVC>(/*num_circuits=*/5);
        const ProgramMetadata metadata{ ivc };
 
        {
            // Construct and accumulate mock app_circuit
            construct_and_accumulate_mock_app(ivc);
        }
 
        {
            // Construct and accumulate a mock INIT kernel (oink recursion for app accumulation)
            construct_and_accumulate_mock_kernel(ivc);
        }
 
        construct_and_accumulate_trailing_kernels(ivc);
 
        // The single entry in the verification queue corresponds to the hiding kernel
        expected_hiding_kernel_vk = ivc->verification_queue[0].honk_vk;
    }
 
    // Now, construct the kernel VK by mocking the IVC state prior to kernel construction
    std::shared_ptr<MegaFlavor::VerificationKey> kernel_vk;
    {
        // mock IVC accumulation increases the num_circuits_accumualted, hence we need to assume the tail kernel has
        // been accumulated
        auto ivc = std::make_shared<SumcheckClientIVC>(/*num_circuits=*/5);
        // construct a mock tail kernel
        acir_format::mock_sumcheck_ivc_accumulation(ivc,
                                                    SumcheckClientIVC::QUEUE_TYPE::PG_FINAL,
                                                    /*is_kernel=*/true);
        AcirProgram program = construct_mock_kernel_program(ivc->verification_queue);
        program.witness = {}; // remove the witness to mimick VK construction context
        kernel_vk = construct_kernel_vk_from_acir_program(program);
    }
 
    // Compare the VK constructed via running the IVc with the one constructed via mocking
    EXPECT_EQ(*kernel_vk.get(), *expected_hiding_kernel_vk.get());
}
 
TEST_F(SumcheckIvcRecursionConstraintTest, RecursiveVerifierAppCircuit)
{
    auto ivc = std::make_shared<SumcheckClientIVC>(/*num_circuits*/ 5);
 
    // construct a mock app_circuit with an UH recursion call
    Builder app_circuit = construct_mock_UH_recursion_app_circuit(ivc, /*tamper_vk=*/false);
 
    // Complete instance and generate an oink proof
    ivc->accumulate(app_circuit, get_verification_key(app_circuit));
 
    // Construct kernel consisting only of the kernel completion logic
    construct_and_accumulate_mock_kernel(ivc);
 
    construct_and_accumulate_trailing_kernels(ivc);
 
    auto proof = ivc->prove();
    EXPECT_TRUE(SumcheckClientIVC::verify(proof, ivc->get_vk()));
}
 
TEST_F(SumcheckIvcRecursionConstraintTest, RecursiveVerifierAppCircuitFailure)
{
    BB_DISABLE_ASSERTS(); // Disable assert in PG prover
 
    auto ivc = std::make_shared<SumcheckClientIVC>(/*num_circuits*/ 5);
 
    // construct and accumulate mock app_circuit that has bad pairing point object
    Builder app_circuit = construct_mock_UH_recursion_app_circuit(ivc, /*tamper_vk=*/true);
    ivc->accumulate(app_circuit, get_verification_key(app_circuit));
 
    // Construct kernel consisting only of the kernel completion logic
    construct_and_accumulate_mock_kernel(ivc);
 
    // add the trailing kernels
    construct_and_accumulate_trailing_kernels(ivc);
 
    // We expect the CIVC proof to fail due to the app with a failed UH recursive verification
    auto proof = ivc->prove();
    EXPECT_FALSE(SumcheckClientIVC::verify(proof, ivc->get_vk()));
}