8 releases (1 stable)
new 1.0.0 | Nov 25, 2024 |
---|---|
0.4.0 | Apr 16, 2024 |
0.3.0 | Mar 21, 2024 |
0.2.1 | Feb 29, 2024 |
0.1.0 | Jan 30, 2023 |
#6 in #fri
21 downloads per month
Used in 3 crates
(via evm_arithmetization)
1.5MB
30K
SLoC
Starky
Starky is a FRI-based STARK implementation.
It is built for speed, features highly efficient recursive verification through plonky2
circuits and gadgets, and is
being used as backend proving system for the Polygon Zero Type-1 zkEVM.
Note on Zero-Knowledgeness
While STARKs can be made Zero-Knowledge, the primary purpose of starky
is to provide fast STARK proof generation. As such,
ZK is disabled by default on starky
. Applications requiring their proof to be zero-knowledge
would need to apply a
recursive wrapper on top of their STARK proof with the zero_knowledge
parameter activated in their CircuitConfig
.
See plonky2
documentation for more info.
License
Licensed under either of
- Apache License, Version 2.0, (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)
at your option.
Contribution
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.
Dependencies
~4–5.5MB
~97K SLoC