lurk-rs VS taiga

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.

Heliax | Multiple roles | REMOTE (+-2 hours from CEST ideal) | Full Time | https://heliax.dev/jobs#all-jobs

Heliax is a public goods lab which was built on years of pioneering experience across distributed systems, programming language theory, and zero-knowledge cryptography. All our work is open-source. Examples of some of our projects are Namada (https://github.com/anoma/namada), a sovereign proof-of-stake blockchain; Juvix (https://github.com/anoma/juvix), an experimental programming language; and Taiga (https://github.com/anoma/taiga), a framework for generalized shielded state transitions.

We are currently actively hiring for a number of positions, most notably Senior Rust Engineers, Senior Full Stack Engineers, and a Protocol Security Lead.

For the Senior Rust Engineer position, we are looking for experienced Rust developers that are interested in applying novel research to create high-quality open-source technology and solve outstanding problems in the blockchain space. You'll be working on distributed ledger technology implemented in Rust, all the way up and down the stack from the P2P layer to consensus algorithms, smart contract systems, proof-of-stake incentive mechanisms, privacy-enhancing cryptographic components, and on-chain governance procedures.

For the Senior Full Stack Engineer position, we are looking for either web developers with experience using TypeScript and other modern web frameworks or software developers who have experience with Rust. Some representative examples of features you’ll be working on in this role are: adding support for Ledger hardware wallet connectivity, support for generation and use of file-based keys, generation of shielded transactions using cryptographic libraries, display of any digital asset (including NFTs) and associated transaction history, and on-chain management of staking and governance. It's a plus if you've previously worked with WebAssembly.

For the Protocol Security Lead, you'll be responsible for breaking protocols both in theory and practice in and outside the company, and assembling a team to help them do so. You'll receive a high degree of latitude and autonomy to prioritize tasks and search for the weakest links in complex systems in order to break them. The rough structure could be compared to Google Project Zero, but with a focus on cryptographic protocols & implementations instead of web technology writ large.