Plonkish is a high-performance implementation of the HyperPlonk zero-knowledge proof system with Zeromorph shift optimization. This repository focuses on zero-knowledge proof systems, specifically optimizing the shift operations in HyperPlonk using the Zeromorph approach to reduce exponential costs to just one additional commitment.

# Clone the repository
git clone https://github.com/Noi1r/plonkish.git
cd plonkish

# Build the project
cargo build --release

# Run tests
cargo test --release

• Features
• Installation
• Usage
• Documentation
• Architecture
• Benchmarks
• Contributing
• License

• HyperPlonk Implementation: Complete implementation of the HyperPlonk proving system
• Zeromorph PCS: Advanced polynomial commitment scheme with shift support
• Shift Optimization: Reduces exponential shift costs to a single additional commitment
• Anemoi Hash Integration: Efficient hash function implementation for Merkle trees

• Rust: Version 1.82 or higher
• System Requirements:
  • Memory: 8GB RAM minimum (16GB recommended)
  • Storage: 2GB free space
  • OS: Linux, macOS, or Windows

curl --proto '=https' --tlsv1.2 -sSf https://sh.rustup.rs | sh
source ~/.cargo/env

# Clone the repository
git clone https://github.com/Noi1r/plonkish.git
cd plonkish

# Build in release mode (recommended)
cargo build --release

# Or build in development mode
cargo build

use plonkish_backend::{
    backend::{PlonkishBackend, hyperplonk::HyperPlonk},
    pcs::multilinear::Zeromorph,
    util::transcript::Keccak256Transcript,
};
use halo2_curves::bn256::Bn256;

// Initialize the proving system
type ProofSystem = HyperPlonk<Zeromorph<UnivariateKzg<Bn256>>>;

let circuit = create_circuit();
let circuit_info = circuit.circuit_info().unwrap();
let instances = circuit.instances();

// Setup phase
let param = ProofSystem::setup(&circuit_info, &mut rng)?;
let (prover_param, verifier_param) = ProofSystem::preprocess(&param, &circuit_info)?;

// Proving phase
let proof = sample(system, k, || {
        let mut transcript = Keccak256Transcript::default();
        ProofSystem::prove(&prover_param, &circuit, &mut transcript, &mut rng).unwrap();
        transcript.into_proof()
    });

// Verification phase
let accept = {
        let mut transcript = Keccak256Transcript::from_proof((), proof.as_slice());
        ProofSystem::verify(&verifier_param, instances, &mut transcript, std_rng()).is_ok()
    };
assert!(accept);

use plonkish_backend::backend::hyperplonk::util::merkle::*;

// Create a Merkle membership proof circuit
let (circuit_info, circuit) = merkle_membership_proof_circuit::<Fr, Lexical>(
    num_vars,
    &proof_nodes,
    &positions,
    &leaf_value,
    &root_hash,
    rng
);

use plonkish_backend::backend::hyperplonk::util::anemoi::*;

// Create an Anemoi hash circuit
let (circuit_info, circuit) = rand_anemoi_hash_circuit_with_flatten::<Fr, Lexical>(
    preprocess_rng,
    witness_rng
);

# Run specific test with output
cargo test --release --package plonkish_backend --lib -- backend::hyperplonk::test::merkle_membership_proof_zeromorph_kzg --exact --show-output 

# Run all tests
cargo test --release

# Release build
cargo build --release

1. Backend Layer (plonkish_backend/src/backend/)

   • PlonkishBackend trait: Core interface for proof systems
   • HyperPlonk: Main implementation with shift support via prove_with_shift() and verify_with_shift()
   • Preprocessor, Prover, and Verifier modules

2. Polynomial Commitment Schemes (plonkish_backend/src/pcs/)

   • PolynomialCommitmentScheme trait with shift extensions (open_shift, verify_shifted_evaluation)
   • Zeromorph: Primary PCS implementation supporting shifts
   • Univariate KZG: Underlying commitment scheme

3. Frontend Layer (plonkish_backend/src/frontend/)

   • Halo2 frontend integration (feature-gated)
   • Circuit abstraction via PlonkishCircuit trait

4. Polynomial Representations (plonkish_backend/src/poly/)

   • MultilinearPolynomial: Main polynomial type
   • UnivariatePolynomial: For KZG operations
   • Rotation evaluation support in poly/multilinear.rs

5. Utilities (plonkish_backend/src/util/)

   • Arithmetic operations (FFT, MSM)
   • Expression evaluation and rotation handling
   • Transcript management
   • Parallel processing utilities

The repository's main contribution is the shift optimization:

• Problem: Original HyperPlonk shift requires exponential number of opens
• Solution: Zeromorph-based shift reduces cost to one additional commitment
• Implementation:
  • open_shift() and verify_shifted_evaluation() in Zeromorph PCS
  • prove_with_shift() and verify_with_shift() in HyperPlonk backend
  • Evaluation_for_shift struct for batch operations

PlonkishCircuitInfo contains:

• k: Circuit size (2^k)
• num_instances: Instance polynomial counts
• preprocess_polys: Preprocessed polynomials
• num_witness_polys: Witness polynomials per phase
• constraints: Circuit constraints as expressions
• lookups: Vector lookup arguments
• permutations: Permutation arguments

• Workspace Structure: plonkish_backend
• Feature Flags:
  • timer: Enables timing instrumentation
  • parallel: Enables rayon parallelization
  • frontend-halo2: Enables Halo2 circuit frontend
• Testing: Most critical tests are in backend::hyperplonk::test module
• Dependencies: Uses custom forks of halo2 and other ZK libraries for compatibility

• Only Zeromorph PCS is currently supported due to shift requirements
• Other PCS implementations are disabled until shift support is added
• Requires specific versions of halo2 and related libraries from custom forks

• Types for plonkish circuit structure are ported from https://github.com/zcash/halo2.
• Most part of HyperPlonk and multilinear KZG PCS implementation are ported from https://github.com/EspressoSystems/hyperplonk with reorganization and extension to support halo2 constraint system.