Increment the gate count by the specified amount

* Saves a single transaction state for a specific account. * Does not save blob data (see saveBlobs). * @param account - The sender account addr

* Starts a new checkpoint. * @param checkpointIndex - The index of the checkpoint in the epoch. * @param constants - The constants for this chec

* Store a private event log. * @param eventSelector - The event selector of the event. * @param randomness - The randomness used for the event c

* Create a Blob from an array of fields. * * @dev This method pads 0s to the data, extending it to the size of a full blob. * * @param fie

Fetches the given blob sidecars by block hash and blob hashes.

* Get the actions the proposer should take for slashing. * @param slotNumber - The current slot number * @returns The actions to take

Create a random point based on InputType

* Read an array of a fixed size field array. * * @param size - The fixed number of fields in the array. * @returns An array of fields.

* Attempts to add a block proposal to the pool. * * This method performs validation and addition in a single call: * - Checks if the proposal

* Retrieves a collection of checkpoints. * @param checkpointNumber The first checkpoint to be retrieved. * @param limit The number of checkpoint

* Gets a handle that allows reading the latest committed state

* Returns the last (highest) finalized index for a given secret. * @param secret - The secret to get the last finalized index for. * @returns Th

Returns all pending offenses

* Returns all indices which are set to true *

Gets a random bigfield element that may be either circuit-witness or cirucit-constant

* Sets up mocks for the hash computation methods to return specific test hashes. * This allows us to test validation logic without recomputing hash

Get the current number of gates in the circuit

* @brief Saves witness data when a bug is found during verification * @param instruction_name Name of the instruction being tested * @param circuit

* @brief Assert the membership of the current leaf value (same logic as assert_membership()). * Write the new leaf value in the tree, i.e., compute t

* Check if a duty can be performed and acquire the lock if so. * * This method uses an atomic insert-or-get operation. * It will: * 1. Try

* Creates a new meter * @param name - The name of the meter.

* Reads a specified number of bytes from the buffer and returns a new Buffer containing those bytes. * Advances the reader's index by the number of

* Gets the peer responsible for handling a specific request index. * If the primary peer has previously failed for this index, tries other peers.

* Checks if a transaction is soft-deleted (either prune-based or slot-based).

* @brief Process bytecode decomposition events and populate the relevant columns in the trace. * Corresponds to bc_decomposition.pil. * * This tr

* Returns an execution request that represents this operation. * @param options - An optional object containing additional configuration for the re

Iterator support for range-based for (required by Codec)

* Returns the current root of the tree.

* @brief Default implementation does nothing */