This crate has an experimental zero-knowledge proof compiler implemented using Rust macros.
It provides a DSL resembing Camenisch-Stadler notation for proving
statements about discrete logarithms in the Decaf group on
Curve25519, as implemented in
curve25519-dalek.
Note that both the Decaf implementation in curve25519-dalek, as
well as this library, are currently UNFINISHED, UNREVIEWED, AND
EXPERIMENTAL. (I haven't actually checked carefully that the
proofs are sound, for instance...)