This is _very_ cool, thanks for sharing it with us! It looks like the
best DSL for R1CS that I've ever seen.

I encourage you to also share this with the Bitcoin community
(bitcoin-dev mailing list.) Bulletproofs support R1CS as well.

Have you written a SHA256 gadget with this library?

Sean

On Mon, Mar 12, 2018 at 1:17 PM, Andrew Miller via zapps-wg
<zapps...@lists.z.cash.foundation> wrote:
> 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 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 (example file here) and there is a blog post
>> 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

Reply via email to