This is really cool, thank you for posting here!! I love the overloading and monadic approach to EDSL in ocaml. It's very much in the style of Snarklib (and of Viff in the MPC world rather than zksnark world).
On Mon, Mar 12, 2018 at 1:31 PM, Izaak Meckler via zapps-wg < zapps...@lists.z.cash.foundation> wrote: > Hi all, > > Wanted to announce the initial release of a new high-level language called > Snarky <https://github.com/o1-labs/snarky> for writing verifiable > computations. Computations are compiled down into rank 1 constraint systems > and then passed off to a SNARK construction. It’s implemented as an OCaml > embedded DSL and is parametrized over the SNARK construction (right now > only libsnark backends are provided with the library but users can add > their own). > > The code is on GitHub <https://github.com/o1-labs/snarky> (example file > here > <https://github.com/o1-labs/snarky/blob/master/examples/election/election_main.ml>) > and there is a blog post <https://o1labs.org/blog/posts/snarky.html> > explaining the design at a high-level. Please don’t hesitate to get in > touch if you have any comments! > > Izaak > -- Andrew Miller University of Illinois at Urbana-Champaign
