WARNING: This is a work-in-progress prototype, and has not received careful code review. This implementation is NOT ready for production use.
This crate generates input to the proof circuit based on the test parameters. The proof input generated can be ported into
the plonky2 codex proof circuits
. Currently only generates fake data for testing.
-
merkle_tree
is the implementation of "safe" merkle tree used in codex, consistent with the one here. -
data_structs
contains the data structures for the codex storage, this is used to generate proof input. -
gen_input
contains the necessary function to generate the proof input. -
recursion
contains the tests for the uniform (2-to-1 tree) recursion. -
serialization
contains the serialization functions to read and write circuit data, input, and proofs. -
params
is the test parameters used to generate the input. -
sponge
contains the non-circuit version of hash function (with and without padding) used to hash cells and during sampling. -
utils
contains helper functions.
see workflow
for how to generate proof input.
see BENCHMARKS.md