Module non_interactive 

The non-interactive version of proof. Completed in one round, for example see the documentation of parent module.

Functions

challenge

Deterministically compute challenge based on prior known values in protocol

prove

Compute proof for the given data, producing random commitment and deriving deterministic challenge.

verify

Verify the proof, deriving challenge independently from same data