# Binius notes

## Modern SNARK landscape


- STARKS are bandwidth boud meaning that they become more computationally heavy when moving data into FPGA is heavy.






- d is the degree of the field extension.
- add = xor
- in the classical case for multiply
- we have univariate quotient ring, we start with polynomials of F_2, quotient this by something irreducible like of d.
- so the lements of ring are polynomials of degree 127 or less. And these bits are the coeff of polynomials.
- TO multiply two, we multiplication inside this ring, as binary polynomials and then reduce modulo $X^{128}+{----}$

- New way for multiply



- these X are rings





- start profgressing to further layers

- gng to multilinear poly, which are in a giant single column of bits lets say and eval that poly at diff points