lurk-rs VS optimism

Lurk Lab @ Protocol Labs | Multiple Positions | REMOTE | Full-time

Lurk Lab is building Lurk (https://github.com/lurk-lang), a Turing-complete programming language for recursive zk-SNARKs. Lurk implements a minimal Lisp whose program executions can be proved in zero-knowledge, yielding succinct proofs that are concretely small and fast to verify. Lurk uses a Rust implementation (https://github.com/lurk-lang/lurk-rs) for expression evaluation, proving, and verification, with Nova (https://github.com/microsoft/Nova/) as its proving backend. Because Lurk is Turing-complete, it can be used to make and prove arbitrary computational claims (within resource limits).

We are looking for strong cryptography engineers, researchers, functional programming language specialists, applications developers, and start-up leaders/web3 entrepreneurs who want to build next-generation SNARK technology.

Ideal candidates will be knowledgeable about the state of the art in zero-knowledge proofs and (if looking for an engineering position) strong in Rust.

We are specifically hiring for:

- Rust Cryptography Engineers

Lurk Lab is building Lurk (https://github.com/lurk-lang), a Turing-complete programming language for recursive zk-SNARKs. Lurk implements a minimal Lisp whose program executions can be proved in zero-knowledge, yielding succinct proofs that are concretely small and fast to verify. Lurk uses a Rust implementation (https://github.com/lurk-lang/lurk-rs) for expression evaluation, proving, and verification, with Nova (https://github.com/microsoft/Nova/) as its proving backend. Because Lurk is Turing-complete, it can be used to make and prove arbitrary computational claims (within resource limits).

We are looking for strong cryptography engineers, researchers, documentation specialists, applications developers, and start-up leaders/web3 entrepreneurs who want to build next-generation SNARK technology. Relevant programming languages include Rust, Lisp, and (less significantly) WASM.

We are hiring for:

- Rust Cryptography Engineers, https://grnh.se/d94e94ec4us

- Software Engineers for Lurk Application Development, https://grnh.se/de7e82424us

- Documentation Engineer, https://grnh.se/10e2ca4d4us

- Start-up operator / business lead (currently unlisted, email [email protected] with CV and a brief cover letter describing your experience driving the business end of deep technical projects in the web3 space)

I recently published a fairly detailed blog post about how to formulate expressive provable programs in Lurk (https://github.com/lurk-lang/lurk-rs). Although this post goes into no details about the underlying proving mechanism, it does build to some pretty powerful ideas. If you haven't thought about the implications of being able to prove correctness of a computation without revealing some or all details of what the computation actually was, you might enjoy it. https://blog.lurk-lang.org/posts/prog-intro/

Lurk Lab @ Protocol Labs | Multiple Positions | REMOTE | Full-time contract-to-hire

Lurk Lab is building Lurk (https://github.com/lurk-lang), a Turing-complete programming language for recursive zk-SNARKs. Lurk implements a minimal Lisp whose program executions can be proved in zero-knowledge, yielding succinct proofs that are concretely small and fast to verify. Lurk uses a Rust implementation (https://github.com/lurk-lang/lurk-rs) for expression evaluation, proving, and verification, with Nova (https://github.com/microsoft/Nova/) as its proving backend. Because Lurk is Turing-complete, it can be used to make and prove arbitrary computational claims (within resource limits).

We are looking for strong cryptography engineers, researchers, documentation specialists, applications developers, and start-up leaders/web3 entrepreneurs who want to build next-generation SNARK technology. Relevant programming languages include Rust, Lisp, and (less significantly) WASM.

We are hiring for:

- Rust Cryptography Engineers, https://grnh.se/d94e94ec4us

Nova (for example) doesn't require a trusted setup. The circuit is just a schematic description of the underlying computation. In the case of the Lurk core language, this computation is 'one reduction step of a Lurk evaluation' (https://github.com/lurk-lang/lurk-rs/blob/master/spec/reduct...). Coming up with a 'fixed computation' that yields general computation is part of the design problem for Lurk (or any other Lurk-like language). Even if we did need a per-circuit trusted setup (which we don't), we could perform such a setup for our core circuit and use it to prove arbitrary programs. For example, although we have not actually performed the trusted setup, we do have an example using Groth16 (which does require a trusted setup to be secure) and aggregates the potentially many discrete reduction steps to produce a succinct proof.

open source. we’re building base on the OP Stack — which means that if you want to contribute, you can! you can review the code and start contributing here. we’ll be open sourcing as much as possible, so more people can get involved.

OP Labs | Remote-first | Full-time |

https://optimism.io

Optimism is an Ethereum scaling solution that enables anyone to execute any vision on an open source protocol that will never be captured by private interests. We’re building this technology as a public good, in order to fundamentally change the relationship between companies and their users.

From code to ethos, we are Ethereum-aligned. By operating as a Public Benefit Corporation, we align private incentives with public good and create a positive-sum economic model that provides a sustainable future for the internet.

Today, the most pressing bottleneck to Ethereum and crypto’s growth is its performance and scalability. We are building the most elegant solution to this problem. We do this out in the open because we believe in open source and its ability to accelerate innovation.

To date, we have raised $178M. Both series A and B were led by Andreessen Horowitz and Paradigm.

We are actively hiring for the roles listed here: All open roles are listed here:

https://boards.greenhouse.io/oplabs

Join us in scaling Ethereum and empowering the creators of public goods! :)

Optimism's Bedrock contracts have pretty good examples - https://github.com/ethereum-optimism/optimism/tree/develop/packages/contracts-bedrock

Perp-maker is an open-source market-making template for Perpetual Protocol v2, the most popular dApp on Optimism (a layer-2 scaling solution for Ethereum). Anyone can use or modify the template to facilitate trades on the protocol and earn fees.

Except that anyone with a minimal involvement with Ethereum already knows that the base layer is not meant to be used on day-to-day operations.

We already learned about the decentralization trillema. The strategy to scale Ethereum through will be through the adoption of "layer-2" systems, where users are expected to be doing their transactions and avoid these costly transactions altogether.

There are roll-ups already dealing with NFT marketplaces [0]. There are roll-ups that can execute any type of ethereum smart contract [1] [2]. There are payment channels that allow completely decentralized and gas-less transfers of ERC-20 tokens [3].

[0] https://loopring.io

[1] https://optimism.io/

[2] https://offchainlabs.com/

[3] https://raiden.network

Boba is a compute-focused L2. We believe that L2s can play a unique role in augmenting the base compute capabilities of the Ethereum ecosystem. You can learn more about Turing hybrid compute here. Boba is built on the Optimistic Rollup developed by Optimism. Aside from its main focus, augmenting compute, Boba differs from Optimism by:

The Across bridge is the fastest, cheapest, and most secure bridge between L1 and L2 (and soon between L2 and L2 hopefully). Across has integrated with the canonical bridges of Boba.network, Optimism.io, and Arbitrum.io, with more to come. Go take it for a spin and save yourself some ETH here: https://across.to/

Optimism - Already usable in alpha phase

Optimism Arbitrum Starknet dYdX Immutable X Hermez Aztec ZKSync Loopring