Crate halo2_proofs

source ·
Expand description



  • This module provides common utilities, traits and structures for group, field and polynomial arithmetic.
  • Traits and structs for implementing circuit components.
  • Tools for developing circuits.
  • This module provides an implementation of a variant of (Turbo)PLONK that is designed specifically for the polynomial commitment scheme described in the Halo paper.
  • Contains utilities for performing arithmetic over univariate polynomials in various forms, including computing commitments to them and provably opening the committed polynomials at arbitrary points.
  • This module contains utilities and traits for dealing with Fiat-Shamir transcripts.