bellman 0.7.0
This commit is contained in:
parent
c3cfe43dad
commit
2030fb488b
|
@ -6,7 +6,7 @@ homepage = "https://github.com/ebfull/bellman"
|
||||||
license = "MIT/Apache-2.0"
|
license = "MIT/Apache-2.0"
|
||||||
name = "bellman"
|
name = "bellman"
|
||||||
repository = "https://github.com/ebfull/bellman"
|
repository = "https://github.com/ebfull/bellman"
|
||||||
version = "0.6.0"
|
version = "0.7.0"
|
||||||
edition = "2018"
|
edition = "2018"
|
||||||
|
|
||||||
[dependencies]
|
[dependencies]
|
||||||
|
|
13
README.md
13
README.md
|
@ -4,13 +4,16 @@
|
||||||
and primitive structures, as well as basic gadget implementations such as
|
and primitive structures, as well as basic gadget implementations such as
|
||||||
booleans and number abstractions.
|
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.
|
||||||
|
|
||||||
## Roadmap
|
## Roadmap
|
||||||
|
|
||||||
`bellman` is being refactored into a generic proving library. Currently it is
|
Currently `bellman` bundles an implementation of the Groth16 proving system.
|
||||||
pairing-specific, and different types of proving systems need to be implemented
|
This will be moved into a separate crate in the future, and `bellman` will
|
||||||
as sub-modules. After the refactor, `bellman` will be generic using the `ff` and
|
contain any utilities that make implementing proving systems easier.
|
||||||
`group` crates, while specific proving systems will be separate crates that pull
|
|
||||||
in the dependencies they require.
|
|
||||||
|
|
||||||
## License
|
## License
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue