Re: [zapps-wg] ANN: Snarky (OCaml DSL for writing SNARKs)

[Nicola Greco via zapps-wg]

Regarding sha: There is some work that I have triggered in the ZoKrates 
community that has made a format for r1cs and a little tool that exports r1cs 
from libsnark (and another one that imports them into ZoKrates),

It would be worth taking a look (see here for updates: 
https://github.com/JacobEberhardt/ZoKrates/issues/19 )

Nicola Greco
- Keep on rocking the free web

On Mar 13, 2018, 8:14 AM +0100, Sean Bowe via zapps-wg 
, wrote:
> 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
>  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
> >  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

Re: [zapps-wg] ANN: Snarky (OCaml DSL for writing SNARKs)

[Sean Bowe via zapps-wg]

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
 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
>  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

Re: [zapps-wg] ANN: Snarky (OCaml DSL for writing SNARKs)

[Andrew Miller via zapps-wg]

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

[zapps-wg] ANN: Snarky (OCaml DSL for writing SNARKs)

[Izaak Meckler via zapps-wg]

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