Module transcript

Objects used to read and write proof strings.

A Binius proof consists of the transcript of the simulated interaction between the prover and the verifier. Using the Fiat-Shamir heuristic, the prover and verifier can simulate the verifier’s messages, which are deterministically computed based on the sequence of prover messages and calls to sample verifier challenges. The interaction consists of two parallel tapes, the transcript tape and the advice tape. The values in the transcript tape affect the Fiat-Shamir state, whereas values in the advice tape do not. The advice tape must only be used for values that were previously committed to in the transcript tape. For example, it is secure to write a Merkle tree root to the transcript tape, sample a random index, then provide the Merkle leaf opening at that index in the advice tape.

Structs

• AdviceReader
  Readable(Verifier) advice that CanRead
• AdviceWriter
  Writable(Prover) advice that CanWrite
• Proof
  Helper struct combining Transcript and Advice data to create a Proof object
• TranscriptReader
  Readable(Verifier) transcript over some Challenger that CanRead and CanSample<F: TowerField>
• TranscriptWriter
  Writable(Prover) transcript over some Challenger that CanWrite and CanSample<F: TowerField>

Enums

• Error

Traits

• CanRead
  Trait that is used to read bytes and field elements from transcript/advice
• CanWrite
  Trait that is used to write bytes and field elements to transcript/advice

Functions

• read_u64
  Helper functions for serializing native types
• write_u64