zkevm_circuits 0.153.12

use super::*;

pub mod block_header;
use self::block_header::*;

pub mod input;
use self::input::*;

pub mod auxiliary;
pub use auxiliary as aux;

use boojum::cs::traits::cs::ConstraintSystem;
use boojum::field::SmallField;

use boojum::gadgets::recursion::allocated_proof::AllocatedProof;
use boojum::gadgets::recursion::allocated_vk::AllocatedVerificationKey;

use boojum::gadgets::traits::witnessable::WitnessHookable;
use boojum::gadgets::u32::UInt32;
use boojum::gadgets::u8::UInt8;
use boojum::gadgets::{
    boolean::Boolean,
    queue::*,
    traits::{allocatable::*, selectable::Selectable},
};

use crate::base_structures::decommit_query::DecommitQuery;
use crate::base_structures::decommit_query::DecommitQueue;
use crate::base_structures::memory_query::MemoryQuery;
use crate::base_structures::memory_query::MemoryQueue;

use crate::base_structures::recursion_query::*;
use crate::demux_log_queue::DemuxOutput;
use crate::fsm_input_output::circuit_inputs::INPUT_OUTPUT_COMMITMENT_LENGTH;
use crate::linear_hasher::input::LinearHasherOutputData;
use crate::main_vm::opcodes::normalize_bytecode_hash_for_decommit;
use crate::recursion::recursion_tip::input::RecursionTipInput;
use crate::recursion::recursion_tip::input::RECURSION_TIP_ARITY;
use crate::recursion::VK_COMMITMENT_LENGTH;
use crate::scheduler::auxiliary::NUM_CIRCUIT_TYPES_TO_SCHEDULE;
use crate::utils::is_equal_queue_state;
use boojum::gadgets::num::Num;
use boojum::gadgets::recursion::recursive_tree_hasher::RecursiveTreeHasher;

use crate::base_structures::precompile_input_outputs::*;
use crate::recursion::NUM_BASE_LAYER_CIRCUITS;
use boojum::algebraic_props::round_function::AlgebraicRoundFunction;
use boojum::cs::implementations::prover::ProofConfig;
use boojum::cs::implementations::verifier::VerificationKeyCircuitGeometry;
use boojum::cs::oracle::TreeHasher;
use boojum::cs::traits::circuit::*;
use boojum::field::FieldExtension;
use boojum::gadgets::keccak256;
use boojum::gadgets::recursion::circuit_pow::RecursivePoWRunner;
use boojum::gadgets::recursion::recursive_transcript::*;
use boojum::gadgets::recursion::recursive_tree_hasher::*;
use boojum::gadgets::traits::round_function::CircuitRoundFunction;
use std::collections::HashMap;

use crate::base_structures::vm_state::*;
use crate::boojum::cs::implementations::verifier::VerificationKey;
use crate::code_unpacker_sha256::input::*;
use crate::demux_log_queue::input::*;
use crate::eip_4844::input::*;
use crate::fsm_input_output::circuit_inputs::main_vm::*;
use crate::fsm_input_output::*;
use crate::log_sorter::input::*;
use crate::ram_permutation::input::*;
use crate::recursion::leaf_layer::input::*;
use crate::scheduler::auxiliary::*;
use crate::sort_decommittment_requests::input::*;
use crate::storage_application::input::*;
use crate::storage_validity_by_grand_product::input::*;

pub const SCHEDULER_TIMESTAMP: u32 = 1;
pub const NUM_SCHEDULER_PUBLIC_INPUTS: usize = 4;
pub const LEAF_LAYER_PARAMETERS_COMMITMENT_LENGTH: usize = 4;
pub const QUEUE_FINAL_STATE_COMMITMENT_LENGTH: usize = 4;
pub const NUM_CIRCUITS_FOR_VARIABLE_SCHEDULING: usize = NUM_CIRCUIT_TYPES_TO_SCHEDULE - 1;
pub const NUM_RECURSION_TIPS_USED: usize = 1;

pub const SEQUENCE_OF_CIRCUIT_TYPES: [BaseLayerCircuitType; NUM_CIRCUITS_FOR_VARIABLE_SCHEDULING] = [
    BaseLayerCircuitType::VM,
    BaseLayerCircuitType::DecommitmentsFilter,
    BaseLayerCircuitType::Decommiter,
    BaseLayerCircuitType::LogDemultiplexer,
    BaseLayerCircuitType::KeccakPrecompile,
    BaseLayerCircuitType::Sha256Precompile,
    BaseLayerCircuitType::EcrecoverPrecompile,
    BaseLayerCircuitType::RamValidation,
    BaseLayerCircuitType::StorageFilter,
    BaseLayerCircuitType::StorageApplicator,
    BaseLayerCircuitType::EventsRevertsFilter,
    BaseLayerCircuitType::L1MessagesRevertsFilter,
    BaseLayerCircuitType::L1MessagesHasher,
    BaseLayerCircuitType::TransientStorageChecker,
    BaseLayerCircuitType::Secp256r1Verify,
    BaseLayerCircuitType::ModexpPrecompile,
    BaseLayerCircuitType::ECAddPrecompile,
    BaseLayerCircuitType::ECMulPrecompile,
    BaseLayerCircuitType::ECPairingPrecompile,
];

#[derive(Derivative, serde::Serialize, serde::Deserialize)]
#[derivative(Clone, Debug)]
#[serde(bound = "H::Output: serde::Serialize + serde::de::DeserializeOwned")]
pub struct SchedulerConfig<F: SmallField, H: TreeHasher<F>, EXT: FieldExtension<2, BaseField = F>> {
    pub proof_config: ProofConfig,
    pub vk_fixed_parameters: VerificationKeyCircuitGeometry,
    #[derivative(Debug = "ignore")]
    pub recursion_tip_vk: VerificationKey<F, H>,
    #[derivative(Debug = "ignore")]
    pub node_layer_vk: VerificationKey<F, H>,
    #[derivative(Debug = "ignore")]
    pub leaf_layer_parameters: [RecursionLeafParametersWitness<F>; NUM_BASE_LAYER_CIRCUITS],
    pub capacity: usize,
    pub _marker: std::marker::PhantomData<(F, H, EXT)>,
}

pub fn scheduler_function<
    F: SmallField,
    CS: ConstraintSystem<F> + 'static,
    R: CircuitRoundFunction<F, 8, 12, 4> + AlgebraicRoundFunction<F, 8, 12, 4>,
    H: RecursiveTreeHasher<F, Num<F>>,
    EXT: FieldExtension<2, BaseField = F>,
    TR: RecursiveTranscript<
        F,
        CompatibleCap = <H::NonCircuitSimulator as TreeHasher<F>>::Output,
        CircuitReflection = CTR,
    >,
    CTR: CircuitTranscript<
        F,
        CircuitCompatibleCap = <H as CircuitTreeHasher<F, Num<F>>>::CircuitOutput,
        TransciptParameters = TR::TransciptParameters,
    >,
    POW: RecursivePoWRunner<F>,
    const USE_4844: bool,
>(
    cs: &mut CS,
    mut witness: SchedulerCircuitInstanceWitness<F, H, EXT>,
    round_function: &R,
    config: SchedulerConfig<F, H::NonCircuitSimulator, EXT>,
    verifier_builder: Box<dyn ErasedBuilderForRecursiveVerifier<F, EXT, CS>>,
    transcript_params: TR::TransciptParameters,
) where
    [(); <RecursionQuery<F> as CSAllocatableExt<F>>::INTERNAL_STRUCT_LEN]:,
    [(); <MemoryQuery<F> as CSAllocatableExt<F>>::INTERNAL_STRUCT_LEN]:,
    [(); <DecommitQuery<F> as CSAllocatableExt<F>>::INTERNAL_STRUCT_LEN]:,
{
    assert!(NUM_RECURSION_TIPS_USED * RECURSION_TIP_ARITY >= NUM_CIRCUIT_TYPES_TO_SCHEDULE);

    let prev_block_data = BlockPassthroughData::allocate(cs, witness.prev_block_data.clone());
    let block_meta_parameters =
        BlockMetaParameters::allocate(cs, witness.block_meta_parameters.clone());

    let boolean_false = Boolean::allocated_constant(cs, false);
    let boolean_true = Boolean::allocated_constant(cs, true);
    let zero_u8 = UInt8::zero(cs);

    Boolean::enforce_equal(
        cs,
        &block_meta_parameters.zkporter_is_available,
        &boolean_false,
    );

    // create initial queues
    let bootloader_heap_memory_state =
        QueueTailState::allocate(cs, witness.bootloader_heap_memory_state.clone());

    let mut initial_memory_queue_state = MemoryQueue::<F, R>::empty(cs);
    initial_memory_queue_state.tail = bootloader_heap_memory_state.tail;
    initial_memory_queue_state.length = bootloader_heap_memory_state.length;

    let mut decommittments_queue = DecommitQueue::<F, R>::empty(cs);
    let mut bootloader_code_hash = block_meta_parameters.bootloader_code_hash;
    normalize_bytecode_hash_for_decommit(cs, &mut bootloader_code_hash);
    let bootloader_code_page =
        UInt32::allocated_constant(cs, zkevm_opcode_defs::BOOTLOADER_CODE_PAGE);
    let scheduler_timestamp = UInt32::allocated_constant(cs, SCHEDULER_TIMESTAMP);
    let bootloader_decommittment_query = crate::base_structures::decommit_query::DecommitQuery {
        code_hash: bootloader_code_hash,
        page: bootloader_code_page,
        is_first: boolean_true,
        timestamp: scheduler_timestamp,
    };

    let _ = decommittments_queue.push(cs, bootloader_decommittment_query, boolean_true);

    // create all the intermediate output data in uncommitted form to later check for equality

    let vm_end_of_execution_observable_output =
        VmOutputData::allocate(cs, witness.vm_end_of_execution_observable_output.clone());

    let decommits_sorter_observable_output = CodeDecommittmentsDeduplicatorOutputData::allocate(
        cs,
        witness.decommits_sorter_observable_output.clone(),
    );

    let code_decommitter_observable_output =
        CodeDecommitterOutputData::allocate(cs, witness.code_decommitter_observable_output.clone());

    let log_demuxer_observable_output =
        LogDemuxerOutputData::allocate(cs, witness.log_demuxer_observable_output.clone());

    let keccak256_observable_output =
        PrecompileFunctionOutputData::allocate(cs, witness.keccak256_observable_output.clone());

    let sha256_observable_output =
        PrecompileFunctionOutputData::allocate(cs, witness.sha256_observable_output.clone());

    let ecrecover_observable_output =
        PrecompileFunctionOutputData::allocate(cs, witness.ecrecover_observable_output.clone());

    let secp256r1_verify_observable_output = PrecompileFunctionOutputData::allocate(
        cs,
        witness.secp256r1_verify_observable_output.clone(),
    );

    let modexp_observable_output =
        PrecompileFunctionOutputData::allocate(cs, witness.modexp_observable_output.clone());

    let ecadd_observable_output =
        PrecompileFunctionOutputData::allocate(cs, witness.ecadd_observable_output.clone());

    let ecmul_observable_output =
        PrecompileFunctionOutputData::allocate(cs, witness.ecmul_observable_output.clone());

    let ecpairing_observable_output =
        PrecompileFunctionOutputData::allocate(cs, witness.ecpairing_observable_output.clone());

    let storage_sorter_observable_output = StorageDeduplicatorOutputData::allocate(
        cs,
        witness.storage_sorter_observable_output.clone(),
    );

    let storage_application_observable_output = StorageApplicationOutputData::allocate(
        cs,
        witness.storage_application_observable_output.clone(),
    );

    let events_sorter_observable_output =
        EventsDeduplicatorOutputData::allocate(cs, witness.events_sorter_observable_output.clone());

    let l1messages_sorter_observable_output = EventsDeduplicatorOutputData::allocate(
        cs,
        witness.l1messages_sorter_observable_output.clone(),
    );

    let l1messages_linear_hasher_observable_output =
        LinearHasherOutputData::allocate(cs, witness.l1messages_linear_hasher_observable_output);

    // auxilary intermediate states
    let rollup_storage_sorter_intermediate_queue_state = QueueTailState::allocate(
        cs,
        witness
            .rollup_storage_sorter_intermediate_queue_state
            .clone(),
    );

    let events_sorter_intermediate_queue_state =
        QueueTailState::allocate(cs, witness.events_sorter_intermediate_queue_state.clone());

    let l1messages_sorter_intermediate_queue_state = QueueTailState::allocate(
        cs,
        witness.l1messages_sorter_intermediate_queue_state.clone(),
    );

    let transient_storage_sorter_intermediate_queue_state = QueueTailState::allocate(
        cs,
        witness
            .transient_storage_sorter_intermediate_queue_state
            .clone(),
    );

    // final VM storage log state for our construction
    let storage_log_tail = <[Num<F>; QUEUE_STATE_WIDTH]>::allocate(cs, witness.storage_log_tail);

    // form the VM input
    let global_context = GlobalContext {
        zkporter_is_available: block_meta_parameters.zkporter_is_available,
        default_aa_code_hash: block_meta_parameters.default_aa_code_hash,
        evm_emulator_code_hash: block_meta_parameters.evm_emulator_code_hash,
    };

    // we can form all the observable inputs already as those are just functions of observable outputs

    let vm_observable_input = VmInputData {
        rollback_queue_tail_for_block: storage_log_tail,
        memory_queue_initial_state: initial_memory_queue_state.into_state().tail,
        decommitment_queue_initial_state: decommittments_queue.into_state().tail,
        per_block_context: global_context,
    };
    let vm_observable_input_commitment =
        commit_variable_length_encodable_item(cs, &vm_observable_input, round_function);
    let vm_observable_output_commitment = commit_variable_length_encodable_item(
        cs,
        &vm_end_of_execution_observable_output,
        round_function,
    );

    let mut decommittments_sorted_queue_state = QueueState::empty(cs);
    decommittments_sorted_queue_state.tail = QueueTailState::allocate(
        cs,
        witness.decommits_sorter_intermediate_queue_state.clone(),
    );

    let decommittments_sorter_circuit_input = CodeDecommittmentsDeduplicatorInputData {
        initial_queue_state: vm_end_of_execution_observable_output.decommitment_queue_final_state,
        sorted_queue_initial_state: decommittments_sorted_queue_state,
    };
    let decommittments_sorter_circuit_input_commitment = commit_variable_length_encodable_item(
        cs,
        &decommittments_sorter_circuit_input,
        round_function,
    );
    let decommittments_sorter_observable_output_commitment = commit_variable_length_encodable_item(
        cs,
        &decommits_sorter_observable_output,
        round_function,
    );

    // code decommiments:
    let code_decommitter_circuit_input = CodeDecommitterInputData {
        memory_queue_initial_state: vm_end_of_execution_observable_output.memory_queue_final_state,
        sorted_requests_queue_initial_state: decommits_sorter_observable_output.final_queue_state,
    };
    let code_decommitter_circuit_input_commitment =
        commit_variable_length_encodable_item(cs, &code_decommitter_circuit_input, round_function);
    let code_decommitter_observable_output_commitment = commit_variable_length_encodable_item(
        cs,
        &code_decommitter_observable_output,
        round_function,
    );

    // log demultiplexer
    let log_demux_circuit_input = LogDemuxerInputData {
        initial_log_queue_state: vm_end_of_execution_observable_output.log_queue_final_state,
    };
    let log_demux_circuit_input_commitment =
        commit_variable_length_encodable_item(cs, &log_demux_circuit_input, round_function);
    let log_demuxer_observable_output_commitment =
        commit_variable_length_encodable_item(cs, &log_demuxer_observable_output, round_function);

    // all intermediate queues for sorters
    let keccak256_access_queue_state =
        log_demuxer_observable_output.output_queue_states[DemuxOutput::Keccak as usize];
    let sha256_access_queue_state =
        log_demuxer_observable_output.output_queue_states[DemuxOutput::Sha256 as usize];
    let ecrecover_access_queue_state =
        log_demuxer_observable_output.output_queue_states[DemuxOutput::ECRecover as usize];
    let secp256r1_verify_access_queue_state =
        log_demuxer_observable_output.output_queue_states[DemuxOutput::Secp256r1Verify as usize];
    let modexp_access_queue_state =
        log_demuxer_observable_output.output_queue_states[DemuxOutput::Modexp as usize];
    let ecadd_access_queue_state =
        log_demuxer_observable_output.output_queue_states[DemuxOutput::ECAdd as usize];
    let ecmul_access_queue_state =
        log_demuxer_observable_output.output_queue_states[DemuxOutput::ECMul as usize];
    let ecpairing_access_queue_state =
        log_demuxer_observable_output.output_queue_states[DemuxOutput::ECPairing as usize];

    // precompiles: keccak, sha256, ecrecover, modexp, ecadd, ecmul and ecpairing
    let (keccak_circuit_observable_input_commitment, keccak_circuit_observable_output_commitment) =
        compute_precompile_commitment(
            cs,
            &keccak256_access_queue_state,
            &code_decommitter_observable_output.memory_queue_final_state,
            &keccak256_observable_output.final_memory_state,
            round_function,
        );
    let (sha256_circuit_observable_input_commitment, sha256_circuit_observable_output_commitment) =
        compute_precompile_commitment(
            cs,
            &sha256_access_queue_state,
            &keccak256_observable_output.final_memory_state,
            &sha256_observable_output.final_memory_state,
            round_function,
        );
    let (
        ecrecover_circuit_observable_input_commitment,
        ecrecover_circuit_observable_output_commitment,
    ) = compute_precompile_commitment(
        cs,
        &ecrecover_access_queue_state,
        &sha256_observable_output.final_memory_state,
        &ecrecover_observable_output.final_memory_state,
        round_function,
    );
    let (
        secp256r1_verify_circuit_observable_input_commitment,
        secp256r1_verify_circuit_observable_output_commitment,
    ) = compute_precompile_commitment(
        cs,
        &secp256r1_verify_access_queue_state,
        &ecrecover_observable_output.final_memory_state,
        &secp256r1_verify_observable_output.final_memory_state,
        round_function,
    );
    let (modexp_circuit_observable_input_commitment, modexp_circuit_observable_output_commitment) =
        compute_precompile_commitment(
            cs,
            &modexp_access_queue_state,
            &secp256r1_verify_observable_output.final_memory_state,
            &modexp_observable_output.final_memory_state,
            round_function,
        );
    let (ecadd_circuit_observable_input_commitment, ecadd_circuit_observable_output_commitment) =
        compute_precompile_commitment(
            cs,
            &ecadd_access_queue_state,
            &modexp_observable_output.final_memory_state,
            &ecadd_observable_output.final_memory_state,
            round_function,
        );
    let (ecmul_circuit_observable_input_commitment, ecmul_circuit_observable_output_commitment) =
        compute_precompile_commitment(
            cs,
            &ecmul_access_queue_state,
            &ecadd_observable_output.final_memory_state,
            &ecmul_observable_output.final_memory_state,
            round_function,
        );
    let (
        ecpairing_circuit_observable_input_commitment,
        ecpairing_circuit_observable_output_commitment,
    ) = compute_precompile_commitment(
        cs,
        &ecpairing_access_queue_state,
        &ecmul_observable_output.final_memory_state,
        &ecpairing_observable_output.final_memory_state,
        round_function,
    );

    // ram permutation and validation
    // NBL this circuit is terminal - it has no actual output

    let mut ram_sorted_queue_state = QueueState::empty(cs);
    ram_sorted_queue_state.tail =
        QueueTailState::allocate(cs, witness.ram_sorted_queue_state.clone());

    let ram_validation_circuit_input = RamPermutationInputData {
        unsorted_queue_initial_state: ecpairing_observable_output.final_memory_state,
        sorted_queue_initial_state: ram_sorted_queue_state,
        non_deterministic_bootloader_memory_snapshot_length: bootloader_heap_memory_state.length,
    };
    let ram_validation_circuit_input_commitment =
        commit_variable_length_encodable_item(cs, &ram_validation_circuit_input, round_function);

    let events_access_queue_state =
        log_demuxer_observable_output.output_queue_states[DemuxOutput::Events as usize];
    let l1messages_access_queue_state =
        log_demuxer_observable_output.output_queue_states[DemuxOutput::L2ToL1Messages as usize];
    let transient_storage_access_queue_state =
        log_demuxer_observable_output.output_queue_states[DemuxOutput::TransientStorage as usize];

    // events reverts filter and merkelization
    let (events_filter_input_com, events_filter_output_com) = compute_filter_circuit_commitment(
        cs,
        &events_access_queue_state,
        &events_sorter_intermediate_queue_state,
        &events_sorter_observable_output.final_queue_state,
        round_function,
    );

    // let (events_merkelizer_input_com, events_merkelizer_output_com) = compute_merkelization_circuit_commitment(
    //     cs,
    //     &filtered_events_queue_state,
    //     &events_linear_hash_as_bytes32,
    //     &events_root_as_bytes32,
    //     round_function
    // );

    // l1 messages reverts filter and merkelization
    let (l1_messages_filter_input_com, l1_messages_filter_output_com) =
        compute_filter_circuit_commitment(
            cs,
            &l1messages_access_queue_state,
            &l1messages_sorter_intermediate_queue_state,
            &l1messages_sorter_observable_output.final_queue_state,
            round_function,
        );

    let (l1_messages_hasher_input_com, l1_messages_hasher_output_com) =
        compute_hasher_circuit_commitment(
            cs,
            &l1messages_sorter_observable_output.final_queue_state,
            &l1messages_linear_hasher_observable_output.keccak256_hash,
            round_function,
        );

    // transient storage is independent of shards

    let (transient_storage_checker_input_com, transient_storage_checker_output_com) =
        compute_transient_storage_checker_circuit_commitment(
            cs,
            &transient_storage_access_queue_state,
            &transient_storage_sorter_intermediate_queue_state,
            round_function,
        );

    // and persistent storage is processed for rollup part only

    const NUM_PROCESSABLE_SHARDS: usize = 1;

    let zero_num = Num::zero(cs);
    let empty_input_output_commitment = [zero_num; CLOSED_FORM_COMMITTMENT_LENGTH];

    let mut storage_filter_input_commitments =
        [empty_input_output_commitment; NUM_PROCESSABLE_SHARDS];
    let mut storage_filter_output_commitments =
        [empty_input_output_commitment; NUM_PROCESSABLE_SHARDS];
    let mut storage_applicator_input_commitments =
        [empty_input_output_commitment; NUM_PROCESSABLE_SHARDS];
    let mut storage_applicator_output_commitments =
        [empty_input_output_commitment; NUM_PROCESSABLE_SHARDS];

    let rollup_storage_access_queue_state =
        log_demuxer_observable_output.output_queue_states[DemuxOutput::RollupStorage as usize];

    let storage_queues_state = [rollup_storage_access_queue_state];

    let filtered_storage_queues_state = [storage_sorter_observable_output.final_sorted_queue_state];

    let initial_enumeration_counters = [prev_block_data.per_shard_states[0].enumeration_counter];

    let initial_state_roots = [prev_block_data.per_shard_states[0].state_root];

    let final_enumeration_counters =
        [storage_application_observable_output.new_next_enumeration_counter];

    let final_state_roots = [storage_application_observable_output.new_root_hash];

    let storage_intermediate_sorted_queue_state = [rollup_storage_sorter_intermediate_queue_state];

    let storage_diffs_for_compression =
        [storage_application_observable_output.state_diffs_keccak256_hash];

    assert_eq!(NUM_PROCESSABLE_SHARDS, 1); // no support of porter as of yet

    for shard_id in 0..NUM_PROCESSABLE_SHARDS {
        assert!(shard_id <= u8::MAX as usize);

        let shard_id_uint8 = UInt8::allocated_constant(cs, shard_id as u8);
        // storage acesses filter
        let (storage_filter_input_com, storage_filter_output_com) =
            compute_storage_sorter_circuit_commitment(
                cs,
                shard_id_uint8,
                &storage_queues_state[shard_id],
                &storage_intermediate_sorted_queue_state[shard_id],
                &filtered_storage_queues_state[shard_id],
                round_function,
            );
        storage_filter_input_commitments[shard_id] = storage_filter_input_com;
        storage_filter_output_commitments[shard_id] = storage_filter_output_com;

        // storage applicator for rollup subtree (porter subtree is shut down globally currently)
        let (storage_applicator_input_com, storage_applicator_output_com) =
            compute_storage_applicator_circuit_commitment(
                cs,
                &filtered_storage_queues_state[shard_id],
                &initial_state_roots[shard_id],
                &initial_enumeration_counters[shard_id],
                &final_state_roots[shard_id],
                &final_enumeration_counters[shard_id],
                &storage_diffs_for_compression[shard_id],
                shard_id as u8,
                round_function,
            );
        storage_applicator_input_commitments[shard_id] = storage_applicator_input_com;
        storage_applicator_output_commitments[shard_id] = storage_applicator_output_com;
    }

    // now we can run all the cirucits in sequence

    // now let's map it for convenience, and later on walk over it

    let input_commitments_as_map =
        HashMap::<BaseLayerCircuitType, [Num<F>; CLOSED_FORM_COMMITTMENT_LENGTH]>::from_iter(
            [
                (BaseLayerCircuitType::VM, vm_observable_input_commitment),
                (
                    BaseLayerCircuitType::DecommitmentsFilter,
                    decommittments_sorter_circuit_input_commitment,
                ),
                (
                    BaseLayerCircuitType::Decommiter,
                    code_decommitter_circuit_input_commitment,
                ),
                (
                    BaseLayerCircuitType::LogDemultiplexer,
                    log_demux_circuit_input_commitment,
                ),
                (
                    BaseLayerCircuitType::KeccakPrecompile,
                    keccak_circuit_observable_input_commitment,
                ),
                (
                    BaseLayerCircuitType::Sha256Precompile,
                    sha256_circuit_observable_input_commitment,
                ),
                (
                    BaseLayerCircuitType::EcrecoverPrecompile,
                    ecrecover_circuit_observable_input_commitment,
                ),
                (
                    BaseLayerCircuitType::ModexpPrecompile,
                    modexp_circuit_observable_input_commitment,
                ),
                (
                    BaseLayerCircuitType::ECAddPrecompile,
                    ecadd_circuit_observable_input_commitment,
                ),
                (
                    BaseLayerCircuitType::ECMulPrecompile,
                    ecmul_circuit_observable_input_commitment,
                ),
                (
                    BaseLayerCircuitType::ECPairingPrecompile,
                    ecpairing_circuit_observable_input_commitment,
                ),
                (
                    BaseLayerCircuitType::RamValidation,
                    ram_validation_circuit_input_commitment,
                ),
                (
                    BaseLayerCircuitType::EventsRevertsFilter,
                    events_filter_input_com,
                ),
                (
                    BaseLayerCircuitType::L1MessagesRevertsFilter,
                    l1_messages_filter_input_com,
                ),
                (
                    BaseLayerCircuitType::StorageFilter,
                    storage_filter_input_commitments[0],
                ),
                (
                    BaseLayerCircuitType::StorageApplicator,
                    storage_applicator_input_commitments[0],
                ),
                (
                    BaseLayerCircuitType::L1MessagesHasher,
                    l1_messages_hasher_input_com,
                ),
                (
                    BaseLayerCircuitType::TransientStorageChecker,
                    transient_storage_checker_input_com,
                ),
                (
                    BaseLayerCircuitType::Secp256r1Verify,
                    secp256r1_verify_circuit_observable_input_commitment,
                ),
            ]
            .into_iter(),
        );

    let output_commitments_as_map =
        HashMap::<BaseLayerCircuitType, [Num<F>; CLOSED_FORM_COMMITTMENT_LENGTH]>::from_iter(
            [
                (BaseLayerCircuitType::VM, vm_observable_output_commitment),
                (
                    BaseLayerCircuitType::DecommitmentsFilter,
                    decommittments_sorter_observable_output_commitment,
                ),
                (
                    BaseLayerCircuitType::Decommiter,
                    code_decommitter_observable_output_commitment,
                ),
                (
                    BaseLayerCircuitType::LogDemultiplexer,
                    log_demuxer_observable_output_commitment,
                ),
                (
                    BaseLayerCircuitType::KeccakPrecompile,
                    keccak_circuit_observable_output_commitment,
                ),
                (
                    BaseLayerCircuitType::Sha256Precompile,
                    sha256_circuit_observable_output_commitment,
                ),
                (
                    BaseLayerCircuitType::EcrecoverPrecompile,
                    ecrecover_circuit_observable_output_commitment,
                ),
                (
                    BaseLayerCircuitType::ModexpPrecompile,
                    modexp_circuit_observable_output_commitment,
                ),
                (
                    BaseLayerCircuitType::ECAddPrecompile,
                    ecadd_circuit_observable_output_commitment,
                ),
                (
                    BaseLayerCircuitType::ECMulPrecompile,
                    ecmul_circuit_observable_output_commitment,
                ),
                (
                    BaseLayerCircuitType::ECPairingPrecompile,
                    ecpairing_circuit_observable_output_commitment,
                ),
                (
                    BaseLayerCircuitType::RamValidation,
                    [zero_num; CLOSED_FORM_COMMITTMENT_LENGTH], // formally set here
                ),
                (
                    BaseLayerCircuitType::EventsRevertsFilter,
                    events_filter_output_com,
                ),
                (
                    BaseLayerCircuitType::L1MessagesRevertsFilter,
                    l1_messages_filter_output_com,
                ),
                (
                    BaseLayerCircuitType::StorageFilter,
                    storage_filter_output_commitments[0],
                ),
                (
                    BaseLayerCircuitType::StorageApplicator,
                    storage_applicator_output_commitments[0],
                ),
                (
                    BaseLayerCircuitType::L1MessagesHasher,
                    l1_messages_hasher_output_com,
                ),
                (
                    BaseLayerCircuitType::TransientStorageChecker,
                    transient_storage_checker_output_com,
                ),
                (
                    BaseLayerCircuitType::Secp256r1Verify,
                    secp256r1_verify_circuit_observable_output_commitment,
                ),
            ]
            .into_iter(),
        );

    assert_eq!(
        input_commitments_as_map.len(),
        NUM_CIRCUITS_FOR_VARIABLE_SCHEDULING
    );
    assert_eq!(
        output_commitments_as_map.len(),
        NUM_CIRCUITS_FOR_VARIABLE_SCHEDULING
    );

    // self-check
    for pair in SEQUENCE_OF_CIRCUIT_TYPES.windows(2) {
        assert_eq!((pair[0] as u8) + 1, pair[1] as u8);
    }

    // we can potentially skip some circuits
    let mut skip_flags = [None; NUM_CIRCUITS_FOR_VARIABLE_SCHEDULING];
    // we can skip everything except VM
    // and if we skip, then we should ensure some invariants over outputs!

    // decommits sorter must output empty queue
    {
        let should_skip = decommittments_sorter_circuit_input
            .initial_queue_state
            .tail
            .length
            .is_zero(cs);

        let output_queue_is_empty = decommits_sorter_observable_output
            .final_queue_state
            .tail
            .length
            .is_zero(cs);
        output_queue_is_empty.conditionally_enforce_true(cs, should_skip);

        skip_flags[(BaseLayerCircuitType::DecommitmentsFilter as u8 as usize) - 1] =
            Some(should_skip);
    }

    // decommitter should produce the same memory sequence
    {
        let should_skip = code_decommitter_circuit_input
            .sorted_requests_queue_initial_state
            .tail
            .length
            .is_zero(cs);

        let input_state = code_decommitter_circuit_input.memory_queue_initial_state;
        let output_state = code_decommitter_observable_output.memory_queue_final_state;

        let same_state = is_equal_queue_state(cs, &input_state, &output_state);
        same_state.conditionally_enforce_true(cs, should_skip);

        skip_flags[(BaseLayerCircuitType::Decommiter as u8 as usize) - 1] = Some(should_skip);
    }

    // demux must produce empty outputs
    {
        let should_skip = log_demux_circuit_input
            .initial_log_queue_state
            .tail
            .length
            .is_zero(cs);

        for subqueue in log_demuxer_observable_output
            .output_queue_states
            .into_iter()
        {
            let output_queue_is_empty = subqueue.tail.length.is_zero(cs);
            output_queue_is_empty.conditionally_enforce_true(cs, should_skip);
        }

        skip_flags[(BaseLayerCircuitType::LogDemultiplexer as u8 as usize) - 1] = Some(should_skip);
    }

    // keccak, sha256, ecrecover, modexp, ecadd, ecmul and ecpairing must not modify memory
    {
        let should_skip = keccak256_access_queue_state.tail.length.is_zero(cs);

        let input_state = code_decommitter_observable_output.memory_queue_final_state;
        let output_state = keccak256_observable_output.final_memory_state;

        let same_state = is_equal_queue_state(cs, &input_state, &output_state);
        same_state.conditionally_enforce_true(cs, should_skip);

        skip_flags[(BaseLayerCircuitType::KeccakPrecompile as u8 as usize) - 1] = Some(should_skip);
    }
    {
        let should_skip = sha256_access_queue_state.tail.length.is_zero(cs);

        let input_state = keccak256_observable_output.final_memory_state;
        let output_state = sha256_observable_output.final_memory_state;

        let same_state = is_equal_queue_state(cs, &input_state, &output_state);
        same_state.conditionally_enforce_true(cs, should_skip);

        skip_flags[(BaseLayerCircuitType::Sha256Precompile as u8 as usize) - 1] = Some(should_skip);
    }
    {
        let should_skip = ecrecover_access_queue_state.tail.length.is_zero(cs);

        let input_state = sha256_observable_output.final_memory_state;
        let output_state = ecrecover_observable_output.final_memory_state;

        let same_state = is_equal_queue_state(cs, &input_state, &output_state);
        same_state.conditionally_enforce_true(cs, should_skip);

        skip_flags[(BaseLayerCircuitType::EcrecoverPrecompile as u8 as usize) - 1] =
            Some(should_skip);
    }
    {
        let should_skip = secp256r1_verify_access_queue_state.tail.length.is_zero(cs);

        let input_state = ecrecover_observable_output.final_memory_state;
        let output_state = secp256r1_verify_observable_output.final_memory_state;

        let same_state = is_equal_queue_state(cs, &input_state, &output_state);
        same_state.conditionally_enforce_true(cs, should_skip);

        skip_flags[(BaseLayerCircuitType::Secp256r1Verify as u8 as usize) - 1] = Some(should_skip);
    }
    {
        let should_skip = modexp_access_queue_state.tail.length.is_zero(cs);

        let input_state = secp256r1_verify_observable_output.final_memory_state;
        let output_state = modexp_observable_output.final_memory_state;

        let same_state = is_equal_queue_state(cs, &input_state, &output_state);
        same_state.conditionally_enforce_true(cs, should_skip);

        skip_flags[(BaseLayerCircuitType::ModexpPrecompile as u8 as usize) - 1] = Some(should_skip);
    }
    {
        let should_skip = ecadd_access_queue_state.tail.length.is_zero(cs);

        let input_state = modexp_observable_output.final_memory_state;
        let output_state = ecadd_observable_output.final_memory_state;

        let same_state = is_equal_queue_state(cs, &input_state, &output_state);
        same_state.conditionally_enforce_true(cs, should_skip);

        skip_flags[(BaseLayerCircuitType::ECAddPrecompile as u8 as usize) - 1] = Some(should_skip);
    }
    {
        let should_skip = ecmul_access_queue_state.tail.length.is_zero(cs);

        let input_state = ecadd_observable_output.final_memory_state;
        let output_state = ecmul_observable_output.final_memory_state;

        let same_state = is_equal_queue_state(cs, &input_state, &output_state);
        same_state.conditionally_enforce_true(cs, should_skip);

        skip_flags[(BaseLayerCircuitType::ECMulPrecompile as u8 as usize) - 1] = Some(should_skip);
    }
    {
        let should_skip = ecpairing_access_queue_state.tail.length.is_zero(cs);

        let input_state = ecmul_observable_output.final_memory_state;
        let output_state = ecpairing_observable_output.final_memory_state;

        let same_state = is_equal_queue_state(cs, &input_state, &output_state);
        same_state.conditionally_enforce_true(cs, should_skip);

        skip_flags[(BaseLayerCircuitType::ECPairingPrecompile as u8 as usize) - 1] =
            Some(should_skip);
    }

    // well, in the very unlikely case of no RAM requests (that is unreachable because VM always starts) we just skip it as is
    skip_flags[(BaseLayerCircuitType::RamValidation as u8 as usize) - 1] = Some(
        ram_validation_circuit_input
            .unsorted_queue_initial_state
            .tail
            .length
            .is_zero(cs),
    );
    // storage filter must produce an empty output
    {
        let should_skip = storage_queues_state[0].tail.length.is_zero(cs);

        let output_queue_is_empty = filtered_storage_queues_state[0].tail.length.is_zero(cs);
        output_queue_is_empty.conditionally_enforce_true(cs, should_skip);

        skip_flags[(BaseLayerCircuitType::StorageFilter as u8 as usize) - 1] = Some(should_skip);
    }
    // storage application must leave root untouched
    {
        let should_skip = filtered_storage_queues_state[0].tail.length.is_zero(cs);

        let initial_root = initial_state_roots[0];
        let initial_enumeration_counter = initial_enumeration_counters[0];
        let final_root = final_state_roots[0];
        let final_enumeration_counter = final_enumeration_counters[0];

        let diffs_hash = storage_diffs_for_compression[0];

        let root_parts_are_equal: [Boolean<F>; 32] =
            std::array::from_fn(|i| UInt8::equals(cs, &initial_root[i], &final_root[i]));
        let roots_are_equal = Boolean::multi_and(cs, &root_parts_are_equal);

        let enumeration_counters_are_equal_low = UInt32::equals(
            cs,
            &initial_enumeration_counter[0],
            &final_enumeration_counter[0],
        );
        let enumeration_counters_are_equal_high = UInt32::equals(
            cs,
            &initial_enumeration_counter[1],
            &final_enumeration_counter[1],
        );

        let diffs_parts_are_zero: [Boolean<F>; 32] = diffs_hash.map(|el| el.is_zero(cs));
        let diffs_hash_is_zero = Boolean::multi_and(cs, &diffs_parts_are_zero);

        let root_is_unchanged = Boolean::multi_and(
            cs,
            &[
                roots_are_equal,
                enumeration_counters_are_equal_low,
                enumeration_counters_are_equal_high,
                diffs_hash_is_zero,
            ],
        );
        root_is_unchanged.conditionally_enforce_true(cs, should_skip);

        skip_flags[(BaseLayerCircuitType::StorageApplicator as u8 as usize) - 1] =
            Some(should_skip);
    }
    // events and l2 to l1 messages filters should produce empty output
    {
        let should_skip = events_access_queue_state.tail.length.is_zero(cs);

        let output_queue_is_empty = events_sorter_observable_output
            .final_queue_state
            .tail
            .length
            .is_zero(cs);
        output_queue_is_empty.conditionally_enforce_true(cs, should_skip);

        skip_flags[(BaseLayerCircuitType::EventsRevertsFilter as u8 as usize) - 1] =
            Some(should_skip);
    }
    {
        let should_skip = l1messages_access_queue_state.tail.length.is_zero(cs);

        let output_queue_is_empty = l1messages_sorter_observable_output
            .final_queue_state
            .tail
            .length
            .is_zero(cs);
        output_queue_is_empty.conditionally_enforce_true(cs, should_skip);

        skip_flags[(BaseLayerCircuitType::L1MessagesRevertsFilter as u8 as usize) - 1] =
            Some(should_skip);
    }
    // transient storage doesn't produce an output
    {
        let should_skip = transient_storage_access_queue_state.tail.length.is_zero(cs);
        skip_flags[(BaseLayerCircuitType::TransientStorageChecker as u8 as usize) - 1] =
            Some(should_skip);
    }
    // L2 to L1 linear hasher
    {
        let empty_hash = {
            use zkevm_opcode_defs::sha3::*;

            let mut result = [0u8; 32];
            let digest = Keccak256::digest(&[]);
            result.copy_from_slice(digest.as_slice());

            result.map(|el| UInt8::allocated_constant(cs, el))
        };

        let should_skip = l1messages_access_queue_state.tail.length.is_zero(cs);

        // if nothing to hash, we expect empty hash
        for (a, b) in l1messages_linear_hasher_observable_output
            .keccak256_hash
            .iter()
            .zip(empty_hash.iter())
        {
            Num::conditionally_enforce_equal(
                cs,
                should_skip,
                &Num::from_variable(a.get_variable()),
                &Num::from_variable(b.get_variable()),
            );
        }

        skip_flags[(BaseLayerCircuitType::L1MessagesHasher as u8 as usize) - 1] = Some(should_skip);
    }

    if crate::config::CIRCUIT_VERSOBE {
        for (idx, el) in skip_flags.iter().enumerate() {
            if let Some(el) = el {
                let circuit_type = BaseLayerCircuitType::from_numeric_value((idx + 1) as u8);
                println!("Skip for {:?} = {:?}", circuit_type, el.witness_hook(cs)());
            }
        }
    }

    // now we just walk one by one

    let mut execution_stage_bitmask = [boolean_false; NUM_CIRCUITS_FOR_VARIABLE_SCHEDULING];
    execution_stage_bitmask[0] = boolean_true; // VM

    assert_eq!(
        SEQUENCE_OF_CIRCUIT_TYPES.len(),
        execution_stage_bitmask.len()
    );

    let mut execution_flag = boolean_true;
    let mut previous_completion_flag = boolean_true;

    let empty_recursive_queue_state_tail = QueueTailState::empty(cs);
    let mut recursive_queue_state_tails =
        [empty_recursive_queue_state_tail; NUM_CIRCUITS_FOR_VARIABLE_SCHEDULING];

    let mut hidden_fsm_input_to_use = [zero_num; CLOSED_FORM_COMMITTMENT_LENGTH];

    for _idx in 0..config.capacity {
        let mut next_mask = [boolean_false; NUM_CIRCUITS_FOR_VARIABLE_SCHEDULING];

        let closed_form_input_witness = witness
            .per_circuit_closed_form_inputs
            .pop_front()
            .unwrap_or(ClosedFormInputCompactForm::placeholder_witness());
        let closed_form_input = ClosedFormInputCompactForm::allocate(cs, closed_form_input_witness);

        // we believe that prover gives us valid compact forms,
        // so we check equality
        let start_of_next_when_previous_is_finished =
            Boolean::equals(cs, &closed_form_input.start_flag, &previous_completion_flag);
        start_of_next_when_previous_is_finished.conditionally_enforce_true(cs, execution_flag);

        let mut computed_applicability_flags =
            [boolean_false; NUM_CIRCUITS_FOR_VARIABLE_SCHEDULING];
        let mut circuit_type_to_use = Num::zero(cs);

        for (idx, ((circuit_type, stage_flag), skip_flag)) in SEQUENCE_OF_CIRCUIT_TYPES
            .iter()
            .zip(execution_stage_bitmask.iter())
            .zip(skip_flags.iter())
            .enumerate()
        {
            let sample_circuit_commitment = input_commitments_as_map
                .get(circuit_type)
                .cloned()
                .expect(&format!(
                    "circuit input commitment for type {:?}",
                    circuit_type
                ));
            // .unwrap_or([zero_num; CLOSED_FORM_COMMITTMENT_LENGTH]);

            let validate = if let Some(skip_flag) = skip_flag {
                let not_skip = skip_flag.negated(cs); // this is memoized
                Boolean::multi_and(cs, &[*stage_flag, execution_flag, not_skip])
            } else {
                Boolean::multi_and(cs, &[*stage_flag, execution_flag])
            };

            let validate_observable_input = validate; // input commitment is ALWAYS the same for all the circuits of some type
            if crate::config::CIRCUIT_VERSOBE {
                if validate_observable_input.witness_hook(cs)().unwrap_or(false) {
                    println!("Validating input for circuit type {:?}", circuit_type);
                    assert_eq!(
                        closed_form_input
                            .observable_input_committment
                            .witness_hook(cs)()
                        .unwrap(),
                        sample_circuit_commitment.witness_hook(cs)().unwrap(),
                    )
                }
            }
            conditionally_enforce_circuit_commitment(
                cs,
                validate_observable_input,
                &closed_form_input.observable_input_committment,
                &sample_circuit_commitment,
            );

            let validate_observable_output = if let Some(skip_flag) = skip_flag {
                let not_skip = skip_flag.negated(cs); // this is memoized
                Boolean::multi_and(
                    cs,
                    &[closed_form_input.completion_flag, not_skip, *stage_flag],
                )
            } else {
                Boolean::multi_and(cs, &[closed_form_input.completion_flag, *stage_flag])
            };

            let sample_circuit_commitment = output_commitments_as_map
                .get(circuit_type)
                .cloned()
                .expect(&format!(
                    "circuit output commitment for type {:?}",
                    circuit_type
                ));
            // .unwrap_or([zero_num; CLOSED_FORM_COMMITTMENT_LENGTH]);

            if crate::config::CIRCUIT_VERSOBE {
                if validate_observable_output.witness_hook(cs)().unwrap_or(false) {
                    println!("Validating output for circuit type {:?}", circuit_type);
                    assert_eq!(
                        closed_form_input
                            .observable_output_committment
                            .witness_hook(cs)()
                        .unwrap(),
                        sample_circuit_commitment.witness_hook(cs)().unwrap(),
                    )
                }
            }

            conditionally_enforce_circuit_commitment(
                cs,
                validate_observable_output,
                &closed_form_input.observable_output_committment,
                &sample_circuit_commitment,
            );

            let should_start_next = if let Some(skip_flag) = skip_flag {
                Boolean::multi_or(cs, &[closed_form_input.completion_flag, *skip_flag])
            } else {
                closed_form_input.completion_flag
            };

            let stage_just_finished =
                Boolean::multi_and(cs, &[should_start_next, execution_flag, *stage_flag]);
            if crate::config::CIRCUIT_VERSOBE {
                if stage_just_finished.witness_hook(cs)().unwrap_or(false) {
                    println!("Finished {:?} circuit type", circuit_type);
                }
            }
            next_mask[idx] = stage_just_finished;

            let circuit_type = UInt8::allocated_constant(cs, *circuit_type as u8).into_num();

            circuit_type_to_use =
                Num::conditionally_select(cs, validate, &circuit_type, &circuit_type_to_use);

            computed_applicability_flags[idx] = validate;
        }

        // now we can use a proper circuit type and manyally add it into single queue
        let mut tail_to_use = QueueTailState::empty(cs);
        for (_idx, (flag, state)) in computed_applicability_flags
            .iter()
            .zip(recursive_queue_state_tails.iter())
            .enumerate()
        {
            tail_to_use = conditionally_select_queue_tail(cs, *flag, &state, &tail_to_use);
        }

        let push_to_any = Boolean::multi_or(cs, &computed_applicability_flags);

        // for any circuit that is NOT start, but is added to recursion queue we validate that previous hidden FSM output
        // is given to this circuit as hidden FSM input

        // NOTE: we use `start_flag` from witness because we validated it's logic in the lines around
        // `start_of_next_when_previous_is_finished` above, so it correctly represents continuation

        let continue_same_type = closed_form_input.start_flag.negated(cs);
        let validate_hidden_input = Boolean::multi_and(cs, &[push_to_any, continue_same_type]);
        conditionally_enforce_circuit_commitment(
            cs,
            validate_hidden_input,
            &closed_form_input.hidden_fsm_input_committment,
            &hidden_fsm_input_to_use,
        );

        // and here we can just update it for the next step
        hidden_fsm_input_to_use = closed_form_input.hidden_fsm_output_committment;

        let closed_form_input_comm =
            commit_variable_length_encodable_item(cs, &closed_form_input, round_function);
        let query = RecursionQuery {
            circuit_type: circuit_type_to_use,
            input_commitment: closed_form_input_comm,
        };
        // push
        let mut tmp_queue = RecursionQueue::<F, R>::empty(cs);
        tmp_queue.tail = tail_to_use.tail;
        tmp_queue.length = tail_to_use.length;

        let _ = tmp_queue.push(cs, query, push_to_any);
        let tail_to_use_for_update = tmp_queue.into_state().tail;

        for (_idx, (flag, state)) in computed_applicability_flags
            .iter()
            .zip(recursive_queue_state_tails.iter_mut())
            .enumerate()
        {
            // if flag.witness_hook(cs)().unwrap_or(false) {
            //     let circuit_type = BaseLayerCircuitType::from_numeric_value((_idx+1) as u8);
            //     println!(
            //         "Pushing for circuit type {:?}, old state = {:?}, new state = {:?}",
            //         circuit_type,
            //         state.witness_hook(cs)(),
            //         tail_to_use_for_update.witness_hook(cs)(),
            //     );
            // }
            *state = conditionally_select_queue_tail(cs, *flag, &tail_to_use_for_update, &*state);
        }

        previous_completion_flag = Boolean::multi_or(cs, &next_mask);
        // for the next stage we do shifted AND
        let mut tmp = [boolean_false; NUM_CIRCUITS_FOR_VARIABLE_SCHEDULING];
        // note skip(1)
        for (idx, start_next) in next_mask.iter().enumerate() {
            let finished_this_stage = *start_next;
            let not_finished = finished_this_stage.negated(cs);
            let proceed_current =
                Boolean::multi_and(cs, &[execution_stage_bitmask[idx], not_finished]);
            // update
            let start_as_next = tmp[idx];
            let do_this_stage = Boolean::multi_or(cs, &[start_as_next, proceed_current]);
            execution_stage_bitmask[idx] = do_this_stage;
            if idx + 1 < NUM_CIRCUITS_FOR_VARIABLE_SCHEDULING {
                tmp[idx + 1] = finished_this_stage;
            }
        }

        // and check if we are done
        let just_finished = *next_mask.last().unwrap();
        let should_continue = just_finished.negated(cs);

        execution_flag = Boolean::multi_and(cs, &[execution_flag, should_continue]);
    }

    // so we are done!
    Boolean::enforce_equal(cs, &execution_flag, &boolean_false);

    // NOTE: values below are allocated constant, so their values end up in
    // scheduler setup -> verification key
    let leaf_layer_parameters = config
        .leaf_layer_parameters
        .clone()
        .map(|el| RecursionLeafParameters::allocated_constant(cs, el));

    let leaf_layer_parameters_commitment: [_; LEAF_LAYER_PARAMETERS_COMMITMENT_LENGTH] =
        commit_variable_length_encodable_item(cs, &leaf_layer_parameters, round_function);

    let node_layer_vk =
        AllocatedVerificationKey::<F, H>::allocate_constant(cs, config.node_layer_vk.clone());
    let node_layer_vk_commitment: [_; VK_COMMITMENT_LENGTH] =
        commit_variable_length_encodable_item(cs, &node_layer_vk, round_function);

    let recursion_tip_verification_key =
        AllocatedVerificationKey::<F, H>::allocate_constant(cs, config.recursion_tip_vk.clone());

    if crate::config::CIRCUIT_VERSOBE {
        dbg!(leaf_layer_parameters_commitment.witness_hook(cs)());
        dbg!(node_layer_vk_commitment.witness_hook(cs)());
    }

    // now form a queue for 4844

    let mut eip4844_recursion_queue = RecursionQueue::<F, R>::empty(cs);

    let (eip4844_linear_hashes, eip4844_output_commitment_hashes) = if USE_4844 {
        // eip4844 circuit
        let eip4844_circuit_type = Num::allocated_constant(
            cs,
            F::from_u64_unchecked(BaseLayerCircuitType::EIP4844Repack as u8 as u64),
        );

        let mut eip4844_linear_hashes = [[zero_u8; 32]; MAX_4844_BLOBS_PER_BLOCK];
        let mut eip4844_output_commitment_hashes = [[zero_u8; 32]; MAX_4844_BLOBS_PER_BLOCK];
        for i in 0..MAX_4844_BLOBS_PER_BLOCK {
            let observable_output_data_witness = witness.eip4844_witnesses[i]
                .as_ref()
                .cloned()
                .unwrap_or(EIP4844OutputData::placeholder_witness());
            let observable_output_data =
                EIP4844OutputData::allocate(cs, observable_output_data_witness);
            let zeroes = observable_output_data.linear_hash.map(|el| el.is_zero(cs));
            let skip_verification = Boolean::multi_and(cs, &zeroes);
            let should_verify = skip_verification.negated(cs);
            let structured_input = EIP4844InputOutput {
                start_flag: boolean_true,
                completion_flag: boolean_true,
                observable_input: (),
                observable_output: observable_output_data,
                hidden_fsm_input: (),
                hidden_fsm_output: (),
            };

            let closed_form_input =
                ClosedFormInputCompactForm::from_full_form(cs, &structured_input, round_function);
            let input_commitment =
                commit_variable_length_encodable_item(cs, &closed_form_input, round_function);
            // add to the queue
            let recursion_query = RecursionQuery {
                circuit_type: eip4844_circuit_type,
                input_commitment,
            };

            let _ = eip4844_recursion_queue.push(cs, recursion_query, should_verify);

            eip4844_linear_hashes[i] = observable_output_data.linear_hash;
            eip4844_output_commitment_hashes[i] = observable_output_data.output_hash;
        }

        (eip4844_linear_hashes, eip4844_output_commitment_hashes)
    } else {
        (
            [[zero_u8; 32]; MAX_4844_BLOBS_PER_BLOCK],
            [[zero_u8; 32]; MAX_4844_BLOBS_PER_BLOCK],
        )
    };

    let eip4844_recursion_queue_state = eip4844_recursion_queue.into_state().tail;

    let mut proof_witnesses = witness.proof_witnesses;

    assert_eq!(
        config.vk_fixed_parameters.parameters,
        verifier_builder.geometry()
    );

    let verifier = verifier_builder.create_recursive_verifier(cs);

    {
        assert_eq!(
            SEQUENCE_OF_CIRCUIT_TYPES.len(),
            recursive_queue_state_tails.len()
        );
        let it = SEQUENCE_OF_CIRCUIT_TYPES
            .into_iter()
            .zip(recursive_queue_state_tails.into_iter());

        let it = it.chain(std::iter::once((
            BaseLayerCircuitType::EIP4844Repack,
            eip4844_recursion_queue_state,
        )));

        let mut it = it.enumerate();

        for _ in 0..NUM_RECURSION_TIPS_USED {
            // NOTE: even though node/leaf circuits are defined over witness-provided (input-linked)
            // verification keys, here we EXPECT to have specific CONSTANT verificaion parameters
            let mut recursion_tip_input = RecursionTipInput::placeholder(cs);
            recursion_tip_input.leaf_layer_parameters = leaf_layer_parameters;
            recursion_tip_input.node_layer_vk_commitment = node_layer_vk_commitment;

            for (circuit_type_dst, state_dst) in recursion_tip_input
                .branch_circuit_type_set
                .iter_mut()
                .zip(recursion_tip_input.queue_set.iter_mut())
            {
                if let Some((_idx, (circuit_type, state))) = it.next() {
                    let circuit_type = UInt8::allocated_constant(cs, circuit_type as u8).into_num();
                    *circuit_type_dst = circuit_type;
                    let mut queue_state = QueueState::empty(cs);
                    queue_state.tail = state;
                    *state_dst = queue_state;
                }
            }

            if crate::config::CIRCUIT_VERSOBE {
                dbg!(recursion_tip_input.witness_hook(cs)());
            }

            let expected_input_commitment: [_; INPUT_OUTPUT_COMMITMENT_LENGTH] =
                commit_variable_length_encodable_item(cs, &recursion_tip_input, round_function);

            let proof_witness = proof_witnesses.pop_front();

            let proof = AllocatedProof::allocate_from_witness(
                cs,
                proof_witness,
                &verifier,
                &config.vk_fixed_parameters,
                &config.proof_config,
            );

            let (is_valid, inputs) = verifier.verify::<H, TR, CTR, POW>(
                cs,
                transcript_params.clone(),
                &proof,
                &config.vk_fixed_parameters,
                &config.proof_config,
                &recursion_tip_verification_key,
            );

            Boolean::enforce_equal(cs, &is_valid, &boolean_true);
            assert_eq!(inputs.len(), expected_input_commitment.len());

            for (a, b) in inputs.iter().zip(expected_input_commitment.iter()) {
                Num::enforce_equal(cs, a, b);
            }
        }
    }

    // now we can collapse queues
    let bootloader_heap_snapshot: [_; QUEUE_FINAL_STATE_COMMITMENT_LENGTH] =
        finalize_queue_state(cs, &bootloader_heap_memory_state, round_function);

    let events_snapshot: [_; QUEUE_FINAL_STATE_COMMITMENT_LENGTH] = finalize_queue_state(
        cs,
        &events_sorter_observable_output.final_queue_state.tail,
        round_function,
    );

    // Form a public block header
    let mut this_block_data = prev_block_data.clone();

    for ((dst, counter), root) in this_block_data
        .per_shard_states
        .iter_mut()
        .zip(final_enumeration_counters.iter())
        .zip(final_state_roots.iter())
    {
        dst.enumeration_counter = *counter;
        dst.state_root = *root;
    }

    let mut bootloader_heap_initial_content = [zero_u8; 32];
    for (dst, src) in bootloader_heap_initial_content
        .array_chunks_mut::<8>()
        .zip(bootloader_heap_snapshot.iter())
    {
        let le_bytes = src.constraint_bit_length_as_bytes(cs, 64);
        dst.copy_from_slice(&le_bytes[..]);
        dst.reverse();
    }

    let mut events_queue_state = [zero_u8; 32];
    for (dst, src) in events_queue_state
        .array_chunks_mut::<8>()
        .zip(events_snapshot.iter())
    {
        let le_bytes = src.constraint_bit_length_as_bytes(cs, 64);
        dst.copy_from_slice(&le_bytes[..]);
        dst.reverse();
    }

    let aux_data = BlockAuxilaryOutput {
        rollup_state_diff_for_compression: storage_application_observable_output
            .state_diffs_keccak256_hash,
        bootloader_heap_initial_content,
        events_queue_state,
        l1_messages_linear_hash: l1messages_linear_hasher_observable_output.keccak256_hash,
        eip4844_linear_hashes: eip4844_linear_hashes,
        eip4844_output_commitment_hashes: eip4844_output_commitment_hashes,
    };

    let block_content_header = BlockContentHeader {
        block_data: this_block_data,
        block_meta: block_meta_parameters,
        auxilary_output: aux_data,
    };

    let (this_block_content_hash, _) = block_content_header.clone().into_formal_block_hash(cs);

    // we are done with this block, process the previous one
    let previous_block_passthrough_data = prev_block_data.into_flattened_bytes(cs);
    let previous_block_passthrough_hash =
        keccak256::keccak256(cs, &previous_block_passthrough_data);

    let previous_block_meta_hash = <[UInt8<F>; 32]>::allocate(cs, witness.previous_block_meta_hash);
    let previous_block_aux_hash = <[UInt8<F>; 32]>::allocate(cs, witness.previous_block_aux_hash);

    let previous_block_content_hash = BlockContentHeader::formal_block_hash_from_partial_hashes(
        cs,
        previous_block_passthrough_hash,
        previous_block_meta_hash,
        previous_block_aux_hash,
    );

    // form full block hash, it's just a hash of concatenation of previous and new full content hashes
    let mut flattened_public_input = vec![];
    flattened_public_input.extend(previous_block_content_hash);
    flattened_public_input.extend(this_block_content_hash);

    let input_keccak_hash = keccak256::keccak256(cs, &flattened_public_input);
    let take_by = F::CAPACITY_BITS / 8;

    for chunk in input_keccak_hash
        .chunks_exact(take_by)
        .take(NUM_SCHEDULER_PUBLIC_INPUTS)
    {
        let mut lc = Vec::with_capacity(chunk.len());
        // treat as BE
        for (idx, el) in chunk.iter().rev().enumerate() {
            lc.push((el.get_variable(), F::SHIFTS[idx * 8]));
        }
        let as_num = Num::linear_combination(cs, &lc);
        use boojum::cs::gates::PublicInputGate;
        let gate = PublicInputGate::new(as_num.get_variable());
        gate.add_to_cs(cs);
    }
}