Module prove 

End-to-end proof generation and verification.

Bridges plonkish-cat’s ConstraintSet with the sumcheck protocol: given a constraint set and a satisfying witness, prove produces a Proof; verify checks it.

The current protocol is binding but not zero-knowledge: all wire values are opened via Merkle proofs. A future version will replace Merkle openings with polynomial commitment evaluations for full zero-knowledge.

Structs

Proof

A complete proof of constraint satisfaction.

WireOpening

An opened wire value with its Merkle proof.

Witness

A witness: wire values satisfying the constraint set.

Functions

prove

Produce a proof that a witness satisfies a constraint set.

verify

Verify a proof of constraint satisfaction.