Expand description
§halo2-axiom
This is a fork of https://github.com/privacy-scaling-explorations/halo2, which is itself a fork of ZCash’s “halo2_proofs” crate. This fork uses the KZG polynomial commitment scheme for the proving backend. Publishing this crate for better versioning in Axiom’s production usage.
Re-exports§
pub use halo2curves;
Modules§
- arithmetic
- This module provides common utilities, traits and structures for group, field and polynomial arithmetic.
- circuit
- Traits and structs for implementing circuit components.
- dev
- Tools for developing circuits.
- fft
- This is a module for dispatching between different FFT implementations at runtime based on environment variable
FFT. - plonk
- 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.
- poly
- 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.
- transcript
- This module contains utilities and traits for dealing with Fiat-Shamir transcripts.
Enums§
- Serde
Format - This enum specifies how various types are serialized and deserialized.