lurk-rs VS abstreet

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.

Super awesome! I like how you just color roads to show time. When you calculate polygons to try and cover the whole area in some 5-10 minute bucket, you can wind up with all sorts of odd holes far away from roads. Keep it simple.

https://github.com/a-b-street/abstreet/pull/1075

A|B Street does some of that, but it is not a game: https://github.com/a-b-street/abstreet

You can build it out in a cool simulator and show it off.

The tool you want exists, but you'll need to actually build the city in it. It's really an incredible program!

Active Travel England | Software Developers and Data Engineer | Full or Part Time | https://www.gov.uk/government/organisations/active-travel-en...

Active Travel England will be developing tools to support evidence-based investment and policies to support sustainable transport. We're hiring 3 roles at present (there will be more jobs in January): https://www.civilservicejobs.service.gov.uk/csr/index.cgi?SI...

We are already working with the transport simulation and scenario development tool A/B Street and the Low Traffic Neighbourhood design tool: https://a-b-street.github.io/docs/ and plan to create new web applications to transform active travel infrastructure design, monitoring and evaluation.

An exciting thing about these jobs from a software engineering perspective is that you will be starting with a relatively blank slate. In the UK we already have tools like https://bikedata.cyclestreets.net and https://www.pct.bike/ but need to go further than this. Long term, the 7 strong Data and Digital team that you will be part of will develop a comprehensive map based design support tool to provide data of the type in BikeData (and more datasets), drawing tools, and automated assessment of proposed interventions.

These opportunities will enable you to shape the future of tools for active travel investment and policy in England and, because the software develop as part of these roles will be open source, beyond.

These high profile jobs will have a large impact, see here for context: https://twitter.com/Chris_Boardman/status/159648662743800217...

I don't know the topic well enough to be sure, but isn't this what you're looking for: https://github.com/a-b-street/abstreet

https://github.com/a-b-street/abstreet - project to plan, simulate, and communicate visions for making cities friendlier to people walking, biking, and taking public transit.