mirror of
https://github.com/logos-storage/plonky2.git
synced 2026-01-02 22:03:07 +00:00
7d6c0a448d
* Halo2 style lookup arguments in System Zero It's a really nice and simple protocol, particularly for the verifier since the constraints are trivial (aside from the underlying batched permutation checks, which we already support). See the [Halo2 book](https://zcash.github.io/halo2/design/proving-system/lookup.html) and this [talk](https://www.youtube.com/watch?v=YlTt12s7vGE&t=5237s) by @daira. Previously we generated the whole trace in row-wise form, but it's much more efficient to generate these "permuted" columns column-wise. So I changed our STARK framework to accept the trace in column-wise form. STARK impls now have the flexibility to do some generation row-wise and some column-wise (without extra costs; there's a single transpose as before). * sorting * fixes * PR feedback * into_iter * timing
24 lines
502 B
TOML
24 lines
502 B
TOML
[package]
|
|
name = "system_zero"
|
|
description = "A VM whose execution can be verified with STARKs; designed for proving Ethereum transactions"
|
|
version = "0.1.0"
|
|
edition = "2021"
|
|
|
|
[dependencies]
|
|
plonky2 = { path = "../plonky2" }
|
|
plonky2_util = { path = "../util" }
|
|
starky = { path = "../starky" }
|
|
anyhow = "1.0.40"
|
|
env_logger = "0.9.0"
|
|
itertools = "0.10.0"
|
|
log = "0.4.14"
|
|
rand = "0.8.4"
|
|
rand_chacha = "0.3.1"
|
|
|
|
[dev-dependencies]
|
|
criterion = "0.3.5"
|
|
|
|
[[bench]]
|
|
name = "lookup_permuted_cols"
|
|
harness = false
|