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.

bellman uses the ff and group crates to build circuits generically over a scalar field type, which is used as the "word" of a circuit. Arithmetic operations modulo the scalar field's prime are efficient, while other operations (such as boolean logic) are implemented using these words.

Currently bellman bundles an implementation of the Groth16 proving system. This will be moved into a separate crate in the future, and bellman will contain any utilities that make implementing proving systems easier.

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.

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.