chore: add back file and update it

stdlib/asm/crypto/stark/mod.masm

@@ -0,0 +1,27 @@
+use.std::crypto::stark::verifier
+
+#!   Verify a STARK proof attesting to the correct execution of a program in the Miden VM.
+#!   The following simplifying assumptions are currently made:
+#!   - The blowup is set to 8.
+#!   - The maximal allowed degree of the remainder polynomial is 7.
+#!   - The public inputs are composed of the input and output stacks, of fixed size equal to 16.
+#!   - There are two trace segments, main and auxiliary. It is assumed that the main trace segment
+#!   is 70 columns wide while the auxiliary trace segment is 7 columns wide.
+#!   - The OOD evaluation frame is composed of two interleaved rows, current and next, each composed
+#!    of 70 elements representing the main trace portion and 7 elements for the auxiliary trace one.
+#!   - To boost soundness, the protocol is run on a quadratic extension field and this means that
+#!    the OOD evaluation frame is composed of elements in a quadratic extension field i.e. tuples.
+#!    Similarly, elements of the auxiliary trace are quadratic extension field elements. The random
+#!    values for computing random linear combinations are also in this extension field.
+#!   - The following procedure makes use of global memory address beyond 3 * 2^30 and these are
+#!    defined in `constants.masm`.
+#!
+#! Input: [log(trace_length), num_queries, log(blowup), grinding, ...]
+#! Output: [...]
+#!
+#! Cycles:
+#!  1- Remainder codeword size 32:
+#!   5013 + num_queries * (40 + num_fri_layers * 76 + 26 + 445) + 83 * num_fri_layers + 10 * log(trace_length) + 1633
+#!  2- Remainder codeword size 64:
+#!   5013 + num_queries * (40 + num_fri_layers * 76 + 26 + 445) + 83 * num_fri_layers + 10 * log(trace_length) + 3109
+export.verifier::verify