The problem HACKSTIR solves

People can use it as an interactive oracle proof of proximity (IOPP) for Reed-Solomon codes that achieves the best known query complexity of any concretely efficient IOPP for this problem which leads to improvement in argument size with similar prover and verifier running times.

Challenges we ran into

Challenges we ran into:

1. Domain operations with Gnark crypto. Figuring out how to scale and shift domains with their api.

2. Polynomial interpolation and calculating vanishing polynomial

3. Checking correctness of equations