plonky2/Cargo.toml

[package]
name = "plonky2"
description = "Recursive SNARKs based on Plonk and FRI"
version = "0.1.0"
authors = ["Daniel Lubarov <daniel@mirprotocol.org>"]
readme = "README.md"
license = "MIT OR Apache-2.0"
repository = "https://github.com/mir-protocol/plonky2"
keywords = ["cryptography", "SNARK", "FRI"]
categories = ["cryptography"]
edition = "2018"
default-run = "bench_recursion"

[dependencies]
array_tool = "1.0.3"
bimap = "0.6.1"
env_logger = "0.9.0"
log = "0.4.14"
itertools = "0.10.0"
num = { version = "0.4", features = [ "rand" ] }
rand = "0.8.4"
rand_chacha = "0.3.1"
rayon = "1.5.1"
unroll = "0.1.5"
anyhow = "1.0.40"
serde = { version = "1.0", features = ["derive"] }
serde_cbor = "0.11.1"

[dev-dependencies]
criterion = "0.3.5"
tynm = "0.1.6"

[[bench]]
name = "field_arithmetic"
harness = false

[[bench]]
name = "ffts"
harness = false

[[bench]]
name = "hashing"
harness = false

[[bench]]
name = "transpose"
harness = false

[profile.release]
opt-level = 3
#lto = "fat"
#codegen-units = 1

[profile.bench]
opt-level = 3
Initial commit 2021-02-09 21:25:21 -08:00			`[package]`
			`name = "plonky2"`
Split main into multiple binaries ... and other minor refactoring. `bench_recursion` will be the default bin run by `cargo run`; the otheres can be selected with the `--bin` flag. We could probably delete some of the other binaries later. E.g. `field_search` might not be useful any more. `bench_fft` should maybe be converted to a benchmark (although there are some pros and cons, e.g. the bench framework has a minimum number of runs, and isn't helpful in testing multi-core performance). 2021-04-06 13:14:59 -07:00			`description = "Recursive SNARKs based on Plonk and FRI"`
Initial commit 2021-02-09 21:25:21 -08:00			`version = "0.1.0"`
Split main into multiple binaries ... and other minor refactoring. `bench_recursion` will be the default bin run by `cargo run`; the otheres can be selected with the `--bin` flag. We could probably delete some of the other binaries later. E.g. `field_search` might not be useful any more. `bench_fft` should maybe be converted to a benchmark (although there are some pros and cons, e.g. the bench framework has a minimum number of runs, and isn't helpful in testing multi-core performance). 2021-04-06 13:14:59 -07:00			`authors = ["Daniel Lubarov <daniel@mirprotocol.org>"]`
			`readme = "README.md"`
			`license = "MIT OR Apache-2.0"`
			`repository = "https://github.com/mir-protocol/plonky2"`
Merge with merkle_proofs_2 2021-04-12 10:38:07 +02:00			`keywords = ["cryptography", "SNARK", "FRI"]`
Split main into multiple binaries ... and other minor refactoring. `bench_recursion` will be the default bin run by `cargo run`; the otheres can be selected with the `--bin` flag. We could probably delete some of the other binaries later. E.g. `field_search` might not be useful any more. `bench_fft` should maybe be converted to a benchmark (although there are some pros and cons, e.g. the bench framework has a minimum number of runs, and isn't helpful in testing multi-core performance). 2021-04-06 13:14:59 -07:00			`categories = ["cryptography"]`
Initial commit 2021-02-09 21:25:21 -08:00			`edition = "2018"`
Split main into multiple binaries ... and other minor refactoring. `bench_recursion` will be the default bin run by `cargo run`; the otheres can be selected with the `--bin` flag. We could probably delete some of the other binaries later. E.g. `field_search` might not be useful any more. `bench_fft` should maybe be converted to a benchmark (although there are some pros and cons, e.g. the bench framework has a minimum number of runs, and isn't helpful in testing multi-core performance). 2021-04-06 13:14:59 -07:00			`default-run = "bench_recursion"`
Initial commit 2021-02-09 21:25:21 -08:00
			`[dependencies]`
witnessgenerator 2021-09-02 11:54:20 -07:00			`array_tool = "1.0.3"`
Update bimap 2021-10-19 19:35:10 -07:00			`bimap = "0.6.1"`
Update various dependencies (#163) 2021-08-09 10:11:42 -07:00			`env_logger = "0.9.0"`
More prover work 2021-03-25 15:20:14 -07:00			`log = "0.4.14"`
Attempt at simplification 2021-06-01 19:13:22 -07:00			`itertools = "0.10.0"`
addressed comments 2021-10-06 11:34:50 -07:00			`num = { version = "0.4", features = [ "rand" ] }`
Update various dependencies (#163) 2021-08-09 10:11:42 -07:00			`rand = "0.8.4"`
			`rand_chacha = "0.3.1"`
Parallel proof-of-work search (#92) 2021-07-15 07:40:41 -07:00			`rayon = "1.5.1"`
More prover work 2021-03-25 15:20:14 -07:00			`unroll = "0.1.5"`
Fixes from PR comments 2021-04-22 09:27:59 +02:00			`anyhow = "1.0.40"`
Proof serialization (#93) Using `serde_cbor` for now. It's probably far from optimal, as we have many `Vec`s which I assume it will prefix with their lengths, but it's a nice and easy method for now. 2021-07-15 07:35:12 -07:00			`serde = { version = "1.0", features = ["derive"] }`
			`serde_cbor = "0.11.1"`
Initial commit 2021-02-09 21:25:21 -08:00
A couple field benchmarks (#161) 2021-08-08 09:14:50 -07:00			`[dev-dependencies]`
			`criterion = "0.3.5"`
FFT/LDE benches (#188) And expose FftStrategy so we can bench both 2021-08-18 08:36:40 -07:00			`tynm = "0.1.6"`
A couple field benchmarks (#161) 2021-08-08 09:14:50 -07:00
			`[[bench]]`
			`name = "field_arithmetic"`
			`harness = false`

FFT/LDE benches (#188) And expose FftStrategy so we can bench both 2021-08-18 08:36:40 -07:00			`[[bench]]`
			`name = "ffts"`
			`harness = false`

Hash benchmarks (#295) 2021-10-09 14:07:49 -07:00			`[[bench]]`
			`name = "hashing"`
			`harness = false`

Benchmark transpose (#190) * Benchmark transpose * fmt 2021-08-18 09:43:19 -07:00			`[[bench]]`
			`name = "transpose"`
			`harness = false`

Initial commit 2021-02-09 21:25:21 -08:00			`[profile.release]`
			`opt-level = 3`
More prover work 2021-03-25 15:20:14 -07:00			`#lto = "fat"`
			`#codegen-units = 1`
FFT/LDE benches (#188) And expose FftStrategy so we can bench both 2021-08-18 08:36:40 -07:00
			`[profile.bench]`
			`opt-level = 3`