# Starky Assignment

This is a standard assignment for "base starky competence".

### Goal

Implement the Euclidean Algorithm in starky to prove that a claimed GCD of two field elements is, in fact, the GCD.

### Requirements

You may lay out the trace however you like, as long as it simulates the euclidean algorithm to prove the following:
* public inputs: a, b, and c, where
* a and b, and c are field elements
* c is the claimed gcd(a, b)
* statement: c is, in fact, the gcd(a, b)

Otherwise:
* You must write a few tests. Enough to be convinced it's correct.
* "submit" it as a public github repo, and simply send the link to us when you're done.

### Helpful links / examples

* starky in the plonky2 repo: https://hackmd.io/@AM1rM_r3QQKcrDYqdQcndA/rJKgu2ebi
* example fibonacci STARK implementation: https://github.com/mir-protocol/plonky2/blob/main/starky/src/fibonacci_stark.rs