This is an experimental implementation of Ligerito polynomial commitment scheme described in this paper by Andrija Novakovic and Guillermo Angeris.
The code is not audited and is meant for research purposes only.
- Clone the repository
- Launch a Julia REPL in the cloned directory (ideally launch it with multiple threads, via
julia --threads=8) - Activate the environment (e.g.,
using Pkg; Pkg.activate(".")) - Instantiate all dependencies (via
Pkg.instantiate()) - Run the example: (via
include("./examples/prove_verify.jl"), remember run it twice to ensure the code is compiled before benchmarking)
We provide multiple possible configurations. For more, see the
examples/prove.jl and src/configs.jl files.
We plan to upstream this into the bcc-research/CryptoUtilitiesExamples
repository and make this slightly more modular for use in future
implementations, but the current code serves as a reference and mirrors the
description of the algorithm in the Ligerito paper.