Allocates a new dictionary. Internally a rust hashmap: HashMap<[u8; 32], NonNull<()>
Frees the dictionary.
Compute the total gas refund for the dictionary at squash time.
Gets the value for a given key, the returned pointer is null if not found.
Increments the access count.
Inserts the provided key value. Returning the old one or nullptr if there was none.
Returns a array over the values of the dict, used for deep cloning.
Based on cairo-lang-runner
’s implementation.
Compute ec_point_from_x_nz(x)
and store it.
Compute ec_point_try_new_nz(x)
.
Compute ec_state_add(state, point)
and store the state back.
Compute ec_state_add_mul(state, scalar, point)
and store the state back.
Compute ec_state_init()
and store the state back.
Compute ec_state_try_finalize_nz(state)
and store the result.
Compute hades_permutation(op0, op1, op2)
and replace the operands with the results.
Compute pedersen(lhs, rhs)
and store it into dst
.