run until the program counter equals the `pc` parameter

AssertNN hint asserts that a given value is non-negative within the range `0 <= value % PRIME < range-check builtin bound` `newAssertNNHint` takes 1

CompareKeccakFullRateInBytes hint compares a value to KECCAK_FULL_RATE_IN_BYTES constant, i.e., 136 `newCompareKeccakFullRateInBytesHint` takes 1 ope

DictSquashCopyDict hint prepares arguments for creating a new dictionary with `dict_new` by copying the existing one in the context of squashing `new

DivModSafeDiv hint computes a safe division in the context of the N constant `newDivModSafeDivHint` doesn't take any operander as argument `newDivMo

EcDoubleAssignNewYV1 hint computes a new y-coordinate when doubling a point on an elliptic curve This hint is ultimately used for either multiplying a

FastEcAddAssignNewY hint computes a new y-coordinate for fast elliptic curve addition of two different points This hint is ultimately used for either

GetPointFromX hint calculates the y-coordinate of a point on an elliptic curve for a given x-coordinate `newGetPointFromXHint` takes 2 operanders as

is250Bits hint checks whether an address is lower than 2**250 or not and it assigns 1 or 0 to `is_250` variable, respectively `newIs250Bits` takes 2

IsLeFelt hint determines if one value is less than or equal to another within a finite field `newIsLeFeltHint` takes 2 operanders as arguments - `a`

IsNN hint checks if a value is non-negative within the range `0 <= value % PRIME < range-check builtin bound` `newIsNNHint` takes 1 operander as arg

Sha256AndBlake2sInput hint writes 1 or 0 at `full_word` address, whether `n_bytes“ is greater than or equal to 4 or not `newSha256AndBlake2sInputHint

SignedPow hint asserts that the value of base is not zero `newSignedPowHint` takes 1 operander as argument - `base` is the value that will be checked

Split128 hint splits a field element value into two 128-bit values, low and high `newSplit128Hint` takes 3 operanders as arguments - `low` and `high`

Split64 hint splits a field element in the range [0, 2^192) to its low 64-bit and high 128-bit parts `newSplit64Hint` takes 3 operanders as arguments

SquashDictInnerCheckAccessIndex hint updates the access index during the dictionary squashing process `newSquashDictInnerCheckAccessIndexHint` takes

SquashDictInnerFirstIteration hint sets up the first iteration of a loop for dictionary squashing, extracting `current_access_index` from the `current

SquashDictInnerNextKey hint retrieves the next key for processing during dictionary squashing after checking that the array of keys is not empty `new

Uint256MulDivMod hint multiplies two `uint256` variables, divides the result by another `uint256` variable, and computes the quotient and the remainde

Uint256Sub hint computes the difference of two `uint256` variables in the field of integers modulo 2**256. Then it splits the result into `low` and `h

VerifyZero hint verifies that a packed value is zero modulo the secp256k1 prime and stores in memory the quotient of the modular division of the packe

compare two segments ignoring builtins

modifies a segment in place to reduce its real length to its effective lenth. It returns the same segment

* Hint that will call this function looks like this: "hints": { "6": [ { "accessible_scopes": [ "starkwa

Given a memory address and a incrementBy, it increments the freeOffset field of dictionary by it.

Little Endian way for Keccak256 KeccakAddU256LE appends the low and high 64-bit words of a U256 value to a keccak input.

KeccakF1600 applies the Keccak permutation to a 1600b-wide state represented as a slice of 25 uint64s.

It returns smallest index associated with the smallest key

Given a number returns its closest power of two bigger than the number

Works the same as `ReadFromAddress` but `MemoryValue` is converted to `MemoryAddress` first

It returns all segments in memory but relocated as a single segment Each element is a pointer to a field element, if the cell was not accessed, nil is

It returns all segment offsets and max memory used

This function converts a string to a uint256.Int by taking the byte representation

U128Split splits a uint128 (represented as a uint256.Int) into two uint64s.

Converts a byte slice into a uint256.Int

performs elliptic curve addition over two points. Assumes `x` ordinates are always different

Fills a value in the values table, if exactly one value is missing. Returns 1 on success or if all values are already known. Returns 0 if there is an

when there is an assertion with a substraction or division like : x = y - z the compiler treats it as y = x + z. This means that the VM knows the dstC

AssertNotZero hint asserts that a value is not zero `newAssertNotZeroHint` takes 1 operander as argument - `value` is the value that will be compared

BigIntPackDivMod hint divides two values modulo a prime number `newBigIntPackDivModHint` takes 3 operanders as arguments - `P` is the prime modulus -

BigIntSafeDiv hint safely divides two numbers and assigns the result based on a condition `newBigIntSafeDivHint` does not take any arguments `newBig

BlockPermutation hint executes the Keccak block permutation function to a segment of memory `newBlockPermutationHint` takes 1 operander as argument -

CairoKeccakFinalize writes the result of F1600 Keccak permutation padded by __keccak_state_size_felts__ zeros to consecutive memory cells, __block_siz

CompareBytesInWord hint compares a value to BYTES_IN_WORD constant, i.e., 8 `newCompareBytesInWordHint` takes 1 operander as argument - `nBytes` is t

ComputeSlopeV1 hint computes the slope between two points on the Secp256k1 elliptic curve `newComputeSlopeV1Hint` takes 2 operanders as arguments - `

DictUpdate hint updates the value of given key in a dictionary and asserts the previous value of the key in the dictionary before the update `newDict

GetHighLen hint calculates the highest bit length between `scalar_u.d2` and `scalar_v.d2`, subtracts 1 from the result, and assigns it to `ids.len_hi`

IsZeroNondet hint computes whether a value is zero or not `newIsZeroNondetHint` doesn't take any operander as argument `newIsZeroNondetHint` writes

NondetElementsOverX hint compares the offset difference between two memory address and writes 1 or 0 at `ap` memory address, depending on whether the

NormalizeAddress hint checks if given addr value is less than ADDR_BOUND or not and writes the result as 1 or 0 to is_small `newNormalizeAddressHint`

Pow hint calculates the least significant bit of the exponent of a number within a prime field `newPowHint` takes 2 operanders as arguments - `locs`

RandomEcPoint hint returns a random non-zero point on the STARK curve y^2 = x^3 + alpha * x + beta (mod field_prime). The point is created determinist

SplitFelt hint splits a finite field element into high and low components `newSplitFeltHint` takes 3 operanders as arguments - `low` and `high` are t

SplitIntAssertRange hint asserts that the value to split in `SplitInt` function is zero once there are no more limbs to create `newSplitIntAssertRang

SquashDictInnerAssertLenKeys hint asserts that the length of the `keys` descending list is zero during the squashing process `newSquashDictInnerAsser

SquashDictInnerContinueLoop hint determines if the loop should continue based on remaining access indices `newSquashDictInnerContinueLoopHint` takes

SquashDictInnerAssertLenKeys hint asserts the length of the current access indices for a given key is zero `current_access_indices` is a reversed orde