Keyboard shortcuts

Press or to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

DG1 → LDS

We need to first SHA-digest DG1, in order to prove that it exists in the expected position in LDS in later steps.

This step solely digests the DG1.

Implicit Variance

There needs to be a separate circuit for each (DG1 variant, SHA variant) pair.

TD1TD2TD3
sha-224
sha-256✔️
sha-384
sha-512✔️

Private Inputs

InputType
DG1Bytes

Public Output

carry is Poseidon-digest of SHA-digest of DG1.

right is DigestState.init with carry included.

LeftRight
Poseidon-digest of DigestState+carry