recursion

Documentation

Overview

Package recursion provides in-circuit verifiers for different proofs systems.

Index

• func NewHash(api frontend.API, target *big.Int, bitmode bool) (stdhash.FieldHasher, error)
• func NewShort(current, target *big.Int) (hash.Hash, error)
• func NewTranscript(api frontend.API, target *big.Int, challenges []string) (*fiatshamir.Transcript, error)

Functions

func NewHash

func NewHash(api frontend.API, target *big.Int, bitmode bool) (stdhash.FieldHasher, error)

NewHash returns a circuit hash function which reads elements in the current native field and outputs element in the target field (usually the scalar field of the circuit being recursed). The hash function is based on MiMC and partitions the excess bits to not overflow the target field.

func NewShort

func NewShort(current, target *big.Int) (hash.Hash, error)

NewShort returns a native hash function which reads elements in the current native field and outputs element in the target field (usually the scalar field of the circuit being recursed). The hash function is based on MiMC and partitions the excess bits to not overflow the target field.

func NewTranscript

func NewTranscript(api frontend.API, target *big.Int, challenges []string) (*fiatshamir.Transcript, error)

NewTranscript returns a new Fiat-Shamir transcript for computing bound challenges. It uses hasher returned by NewHash internally and configures the transcript to be compatible with gnark-crypto Fiat-Shamir transcript.