- Circle STARKs
- Reed-Solomon codes over the circle group
- A note on the G-FFT
- ECFFT Part I, Part II
- Mersenne 31 Polynomial Arithmetic
- Really Complex Codes with Application to STARKs
- RPO-M31 and XHash-M31: Efficient Hash Functions for Circle STARKs
- Why I’m excited by Circle STARK and Stwo by Eli Ben Sasson
- Circle STARKs: Part I, Mersenne by ZKSECURITY
- An introduction to circle STARKs by LambdaClass
- Exploring circle STARKs by Vitalik Buterin
- Introduce to Circle Stark by Eigen Network
- Yet another circle STARK tutorial by Timofey Yaluhin
- Deep dive into Circle-STARKs FFT by Ignacio Hagopian
- The ECFFT algorithm
- ECFFT on the BN254 base field in Rust
- Applications of Riemann-Roch in cryptography
- Algebraic FFTs
- Fast Reed-Solomon IOP (FRI) Proximity Test
- Circle STARKs - Ulrich Habock
- STARK at Home: Uncovering the Math Behind Stwo, StarkWare's Lightning Fast Next-Gen Prover
- Eli Ben Sasson: Circle STARK and Favorite Open Problems
- My adventures building a circle STARK prover in (sort of) python - Vitalik Buterin
- Starkware - Stwo & Circle STARK: Next Gen Proving
- ZK11: Circle STARKs - Ulrich Haböck & Shahar Papini
- Ariel Gabizon - FFT's on the projective line and circle-STARKs
- Swastik Kopparty: FRI and STARKs via an Elliptic Curve Fast Fourier Transform (ECFFT)
- zkStudyClub: Elliptic Curve Fast Fourier Transform (ECFFT) by David Levit
- Implementing Bitcoin covenants and a Circle STARK verifier with OP_CAT by Weikeng Chen and Pingzhou Yuan