Drops n u4 (1 element) elements of the stack

dmul

Step 2 given public keys and the partial scripts generated in api_generate_partial_script() it generates the complete disprove scripts

decode signature to assertion mirror of get_signature_from_assertion

Utility function to hash two nodes together

check whether a tuple coefficient (alpha, -bias) of a chord line is satisfied with expected points T and Q (both are affine cooordinates) two aspects:

Maximum value of a digit

Returns the transaction id, in big-endian byte order. One must be careful when dealing with Bitcoin transaction ids, as they are little-endian in the

Zip the top two u{16N} elements input: a0 ... a{N-1} b0 ... b{N-1} output: a0 b0 ... ... a{N-1} b{N-1}

TODO: replace with actual implementation

wots sign byte array using secrets mirror of get_assertions_from_signature

input: f 12 elements p.x 1 element p.y 1 element output: new f 12 elements

Use this function to populate taproot input witness for scripts containing any logic.

Serialize StateObject to byte array so that it can be wots-signed

Adds the given constant numbers and u32 variables. Variables in `to_copy` are copied and the original remains on the stack. Variables in `to_move` ar

Pushes left and right shift tables

Step 1 The function takes public parameters (here verifying key) and generates partial script partial script is essentially disprove script minus the

Assumes (1 + f) is valid Fp12 i.e. f != Fq6::ZERO power is in the range (0, 1, 2)

TODO: Needs to be updated for production environment.

TODO: Implement selecting a block that marks the start of a superblock measurement period that lasts for the period ∆C (e.g. 2000 blocks), during wh

check whether a tuple coefficient (alpha, -bias) of a tangent line is satisfied with expected point T (affine) two aspects: 1. alpha * (2 * T.y) = 3 *

Merges `data` into `self.data`. # Arguments `data` - Must be valid data verified via `BitVMClient::validate_data()` function

Addition of numbers consisting of nibble_count u4's in the parameter bases locations, without the table

Does bitwise operation with bases.len() elements at the top of the stack, both consisting of nibble_count u4's and at the positions of the bases vecto

Calculates n'th right shift of the top u4 element with both tables

Step 4 validate signed assertions returns index of disprove script generated in Step 2 and the witness required to execute this Disprove Script incase

Calculates bitwise XOR of two nibbles (x_{nibble_x} and y_{nibble_y}), each given by their u32 variable and the index of their nibble, consumes the ni

allows for aggregating multiple inputs and one refund output

Appends a new leaf to the MMR.

we can use mock_vk and mock_proof here because generating bitcommitments only requires knowledge of how the chunks are connected and the public keys t

Returns a script that computes the BLAKE3 hash of the message on the stack. The script processes compact message blocks and only unpacks them when ne

Finding C refer from Algorithm 5 of "On Proving Pairings"(https://eprint.iacr.org/2024/640.pdf)

Helper function to perform line function evaluation in affine coordinates

Executing a script on stack without `MAX_STACK_SIZE` limit is only for testing purposes \ Don't use in production without the stack limit (i.e. `stack

Generates a proof for a given index. Returns the leaf as well.

add two points T and Q x' = alpha^2 - T.x - Q.x y' = -bias - alpha * x' input on stack: T.x (2 elements) Q.x (2 elements) input of parameters: c3: a

Stack: [q] q /in G2Affine compute q' = (q.x*beta_22, q.y)