We're an early stage startup building a new blockchain protocol. Each state transition in this protocol is accompanied by a cryptographic proof, so users can verify blockchain state without downloading and re-executing transactions. We see this as the key to scaling blockchains and making them viable for broad adoption.
A lot of our work will involve programming in R1CS (similar to arithmetic circuits), which presents unique challenges. We're looking for engineers with a strong math and/or cryptography background. Rust experience would also be a plus.
For the base protocol SNARKs, we're planning to do the programming in Rust, building on top of this little library we wrote: https://crates.io/crates/r1cs
We looked at a few DSLs but didn't find one that seemed to fit our needs well. I mostly focused on xjsnark, since it has nice features we wanted like permutation networks (to verify sorts/shuffles), but it seems far from production readiness.
We'd like to support DSLs like Zokrates as an option for writing dapps on top of the base protocol, though.
I couldn't find your email, but please drop me a note if you have suggestions or if the project interests you.
We're an early stage startup building a new blockchain protocol. Each state transition in this protocol is accompanied by a cryptographic proof, so users can verify blockchain state without downloading and re-executing transactions. We see this as the key to scaling blockchains and making them viable for broad adoption.
A lot of our work will involve programming in R1CS (similar to arithmetic circuits), which presents unique challenges. We're looking for engineers with a strong math and/or cryptography background. Rust experience would also be a plus.
Contact: daniel@mirprotocol.org