Refactor FRI implementation

[andrewmilson]

This change is 

[andrewmilson]

• Optimize decommiting last FRI layer using univariate FFT #133 : 2 dependent PRs (#152 , #153 )
• Add verifier #127
• Compute FRI quotients #118
• Add CanonicCoset #117
• Add unreduced field arithmetic #116
• Refactor FRI implementation #115 👈
• Refactor Coset with CirclePointIndex #114
• Add formatting to scarb.toml #113
• Update to latest Cairo version #112
• main

This stack of pull requests is managed by Graphite. Learn more about stacking.

Join @andrewmilson and the rest of your teammates on Graphite

[Alon-Ti]

Reviewed 10 of 10 files at r1, all commit messages.
Reviewable status: all files reviewed, 1 unresolved discussion (waiting on @andrewmilson and @shaharsamocha7)

---

stwo_cairo_verifier/src/utils.cairo line 53 at r1 (raw file):

    /// Sorts an array in ascending order. Uses quicksort algorithm.
    fn sort_ascending<+PartialOrd<T>>(self: Array<T>) -> Array<T> {

Doesn't Cairo1 have O(n) sort for PartialOrd?

[andrewmilson]

Reviewable status: all files reviewed, 1 unresolved discussion (waiting on @Alon-Ti and @shaharsamocha7)

---

stwo_cairo_verifier/src/utils.cairo line 53 at r1 (raw file):

Previously, Alon-Ti wrote…

Doesn't Cairo1 have O(n) sort for PartialOrd?

Unfortunately not it seems.

[Alon-Ti]

Reviewable status: complete! all files reviewed, all discussions resolved (waiting on @shaharsamocha7)