Skip to content
HACKSTIR

HACKSTIR

Golang Implementation of STIR: Reed–Solomon Proximity Testing with Fewer Queries

46
Built at ZK Hack Kraków

Created on 19th May 2024

•

HACKSTIR

HACKSTIR

Golang Implementation of STIR: Reed–Solomon Proximity Testing with Fewer Queries

Carousel Gallery Item: 1

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

Tracks Applied (1)

Prizes for Finalists, Hackers' Choice & Chewing Glass

Our team built a GO implementation of the STIR protocol. STIR is an interactive oracle proof of proximity (IOPP). You c...Read More

Technologies used

Git

Golang

Rust

FFT

Arkworks

FRI

gnark-crypto

Cheer Project

Cheering for a project means supporting a project you like with as little as 0.0025 ETH. Right now, you can Cheer using ETH on Arbitrum, Optimism and Base.

Discussion

Builders also viewed

See more projects on Devfolio