S

Sparta(0)

SuperSpartan IOP written in Rust

The problem Sparta(0) solves

SuperSpartan is a Polynomial Interactive Oracle Proof(IOP) for the Customized Constraint System(CCS). This IOP uses the sum-check algorithm to prove that a CCS relation holds.

Using SuperSparta presents many benefits:

  • CCS is a flexible generalization of R1CS which can simultaneously capture R1CS, Plonkish, and AIR
  • Sum-check is a highly efficient IOP with minimal prover overhead
  • SuperSpartan is the central building block for more complex recursive proof systems

Challenges we ran into

  • Implementing multivariate polynomials
  • Converting initial constraints to CCS relations
  • Implementing sum-check IOP
  • Implementing sum-check prover
  • Implementing sum-check verifier
  • BASIC RUST PROGRAMMING

Tracks Applied (2)

Prizes for Top 3, Hackers' Choice & Chewing Glass

This project implements a novel Polynomial IOP which is at the cutting edge of modern proof systems. Building this IOP ...Read More

Sumcheck

We implemented multivariate sum-check using the Pluto Ronkathon library as well as a multivariate polynomial library. (P...Read More

Pluto

Discussion