SplitOutputMidLowHigh hint assigns to `ids.output1_low` the remainder of the division of `ids.output1` variable by 256 ** 7 and uses its quotient as a

compares the memory value match an expected value at the given segment and offset

AssertNotEqual hint asserts that two given values are not equal `newAssertNotEqualHint` takes 2 operanders as arguments - `a` and `b` are the values

SignedDivRem hint computes a signed division and modulus operation on a given value, ensuring the quotient is within a specified range `newSignedDivR

UnsignedDivRem hint computes an unsigned division and modulus operation on a given dividend and divisor `newUnsignedDivRemHinter` takes 4 operanders

FeltLe implements `a <= b` felt comparison.

FeltLt implements `a < b` felt comparison.

It creates a new segment which will hold dictionary values. It links this segment with the current dictionary and returns the address that points to t

Given an address returns the memory value at that position, without modifying it in any way. Errors if peeking from an unallocated segment

utility to create segments easier

creates a default segment with any given data. nil value represents unknown values

FindElement hint finds element in the array by given key. It either returns element at index provided by __find_element_index or searches for the key

IsNNOutOfRange hint checks if the negation of a value minus one is non-negative within a specific range `newIsNNOutOfRangeHint` takes 1 operander as

IsPositive hint checks if a value is positive within a specific range and prime context `newIsPositiveHint` takes 2 operanders as arguments - `value`

RecoverY hint Recovers the y coordinate of a point on the elliptic curve y^2 = x^3 + alpha * x + beta (mod field_prime) of a given x coordinate. `new

Uint256UnsignedDivRem hint computes the division and modulus operations on `uint256` variables, combining the `high` and `low` parts of the dividend a

Given a CASM program it returns its encoded bytecode and a total size of processed instructions

Increase a segment allocated space. Panics if the new size is smaller

It returns the smallest key in the key list

Creates a new Runner of a Cairo Zero program

Assert250bits hint asserts that a value is within the range of 250 bits `newAssert250bitsHint` takes 3 operanders as arguments - `value` is the value

BigIntToUint256 hint guesses the low part of the `x` uint256 variable `newBigIntToUint256Hint` takes 2 operanders as arguments - `low` is the variabl

EcDoubleAssignNewX hint computes a new x-coordinate for a point being doubled on an elliptic curve `newEcDoubleAssignNewXHint` takes 2 operanders as

FastEcAddAssignNewX hint computes a new x-coordinate for fast elliptic curve addition `newFastEcAddAssignNewXHint` takes 3 operanders as arguments -

Reduce hint reduces a packed value modulo the SECP256K1 prime `newReduceHint` takes 1 operander as argument - `x` is the packed value to be reduced

SplitInput12 hint assigns to `ids.high12` and `ids.low12` variables the quotient and remainder of the division of the value at memory address `ids.inp

SplitInput15 hint assigns to `ids.high15` and `ids.low15` variables the quotient and remainder of the division of the value at memory address `ids.inp

SplitInput3 hint assigns to `ids.high3` and `ids.low3` variables the quotient and remainder of the division of the value at memory address `ids.inputs

SplitInput6 hint assigns to `ids.high6` and `ids.low6` variables the quotient and remainder of the division of the value at memory address `ids.inputs

SplitInput9 hint assigns to `ids.high9` and `ids.low9` variables the quotient and remainder of the division of the value at memory address `ids.inputs

SplitNBytes hint assigns to `ids.n_words_to_copy` and `ids.n_bytes_left` variables the quotient and remainder of the division of `ids.n_bytes` variabl

SquashDict hint as part of the larger dict_squash cairo function does data validation and writes to scope a set of variables which indicate the larges

UnsafeKeccakFinalize computes keccak hash of the data in memory without validity enforcement and writes the result in the `low` and `high` memory cell

UsortBody hint sorts the input array of field elements. The sorting results in generation of output array without duplicates and multiplicities array,

Gets the memory value at certain key

Works the same as `Read` but `MemoryValue` is converted to `Element` first

returns the real length that a segment has

AssertLtFelt hint asserts that one value is strictly less than another within a finite field `newAssertLtFeltHint` takes 2 operanders as arguments -

DivModNPackedDivmodV1 hint caculates the division modulo N for packed values `newDivModNPackedDivmodV1Hint` takes 2 operanders as arguments - `a` is

EcDoubleSlopeV1 hint computes the slope for doubling a point on an elliptic curve `newEcDoubleSlopeV1Hint` takes 1 operander as argument - `point` is

GetFeltBitLength hint assigns to `bit_length` the bit length of `x` variable `newGetFeltBitLengthHint` takes 2 operanders as arguments - `x` is a fel

IsZeroDivMod hint computes the division modulo SECP_P prime for a given packed value `newIsZeroDivModHint` doesn't take any operander as argument `n

IsZeroPack hint computes packed value modulo SECP_P prime `newIsZeroPackHint` takes 1 operander as argument - `x` is the value that will be packed an

SplitIntHint hint splits an integer in limbs based on a base and asserts that each limb is within a certain range `newSplitIntHint` takes 4 operander

SplitOutput0 hint splits `output0` into `output0_low` (16 bytes) and `output0_high` (9 bytes) `newSplitOutput0Hint` takes 3 operanders as arguments -

Sqrt hint computes the square root of a given value, ensuring it falls within a specific range `newSqrtHint` takes 2 operanders as arguments - `root`

SquashDictInnerUsedAccessesAssert hint checks that `n_used_accesses` Cairo local variable is equal to the number of used accesses for a key during dic

Uint128Add hint computes the result of the sum of parts of two `uint128` variables(`a` & `b`) and checks for overflow `newUint128AddHint` takes 3 ope

Uint128Sqrt hint computes the result of the sum of parts of two `uint128` variables(`a` & `b`) and checks for overflow `newUint128AddHint` takes 3 op

Uint256Add hint computes the sum of the `low` and `high` parts of two `uint256` variables and checks for overflow `newUint256AddHint` takes 4 operand

Uint256Sqrt hint computes the square root of a given value, ensuring it falls within a specific range, i.e., `0 <= result < 2 ** 128` `newUint256Sqrt

UnsafeKeccak computes keccak hash of the data in memory without validity enforcement and writes the result in the `low` and `high` memory cells `newU

UsortVerifyMultiplicityBody hint extracts a specific value of the sorted output with `pop`, updating indices for the verification of the next value `

Given a value, writes its n_words to memory, starting at address = addr.

It crates a new memory address with the modified offset

Given a memory address, it looks for the right dictionary using the segment index. If no segment is associated with the given segment index, it errors

todo(rodro): can the amount of segments be known before hand?

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