Go to file
Jack Grigg 6875667f1d group: CofactorGroup::mul_by_cofactor -> CofactorGroup::clear_cofactor
The generic API now only guarantees that the torsion component is
cleared deterministically; group elements may be multiplied by multiples
of the cofactor (not necessarily the actual cofactor), as long as the
choice of multiplier is fixed for a given implementation.
2020-08-25 23:11:18 +01:00
src group: CofactorGroup::mul_by_cofactor -> CofactorGroup::clear_cofactor 2020-08-25 23:11:18 +01:00
tests bellman: add VerificationError (#254) 2020-08-25 23:11:18 +01:00
.gitignore Initial commit 2015-12-24 02:58:38 -07:00
COPYRIGHT Make license files/copyright identical to `pairing` crate. 2017-11-12 15:56:03 -07:00
Cargo.toml impl ConditionallySelectable for Field 2020-08-25 23:09:46 +01:00
LICENSE-APACHE Make license files/copyright identical to `pairing` crate. 2017-11-12 15:56:03 -07:00
LICENSE-MIT Make license files/copyright identical to `pairing` crate. 2017-11-12 15:56:03 -07:00
README.md Update READMEs 2019-09-24 14:23:55 +01:00

README.md

bellman Crates.io

bellman is a crate for building zk-SNARK circuits. It provides circuit traits and primitive structures, as well as basic gadget implementations such as booleans and number abstractions.

Roadmap

bellman is being refactored into a generic proving library. Currently it is pairing-specific, and different types of proving systems need to be implemented as sub-modules. After the refactor, bellman will be generic using the ff and group crates, while specific proving systems will be separate crates that pull in the dependencies they require.

License

Licensed under either of

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.