operator
Nova
operator | Nova | |
---|---|---|
1 | 6 | |
241 | 667 | |
0.8% | 3.9% | |
9.2 | 8.4 | |
3 days ago | 3 days ago | |
Python | Rust | |
Apache License 2.0 | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
operator
-
Ask HN: Who is hiring? (December 2022)
Canonical | Python Software Engineer | Remote (Asia-Pacific, ±4h from NZ time) | Full-time
Canonical is known for producing Ubuntu, but we have a lot of other roles. This one is for a Python dev with an eye for detail, helping develop the Python Operator Framework library that's used for writing "Juju charms" -- software that operates software.
Project page: https://github.com/canonical/operator/
Job page: https://canonical.com/careers/3033974
Nova
-
Ask HN: Who is hiring? (December 2022)
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
-
Ask HN: Who is hiring? (November 2022)
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)
-
Ask HN: Who is hiring? (October 2022)
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
-
[AMA] We are EF Research (Pt. 8: 07 July, 2022)
There's been a lot of VDF progress. The new design is Sloth + SNARKs (specifically Nova with GPU-accelerated MSMs). We will have an end-to-end demo of a CPU-based VDF in a few weeks, and the first VDF ASICs test samples (12nm GlobalFoundries) will be produced in December 2022.
-
Lurk – Language for Recursive ZK-SNARKs Inspired by Common Lisp and Scheme
Arkworks isn't really addressing the core of what Lurk provides. In theory, we could use Arkworks to implement a backend — but we are targeting Nova (https://github.com/microsoft/Nova), and I don't think Arkworks supports Nova currently. So the part we are building from scratch (the language itself) is at a higher level of abstraction. We like Nova's characteristics and are actively helping with aspects of its implementation so we can use it as soon as possible.
-
RiB Newsletter #26
Nova. Recursive SNARKs without trusted setup.
What are some alternatives?
utsushis-charm - Easily import all of your Monster Hunter Rise charms to your armor set searcher of choice
blst - Multilingual BLS12-381 signature library
jsonrpsee - Rust JSON-RPC library on top of async/await
zexe - Rust library for decentralized private computation
winterfell - A STARK prover and verifier for arbitrary computations
anoma - Reference implementation of the Anoma protocols in Rust.
lurk-rs - Lurk is a Turing-complete programming language for recursive zk-SNARKs. It is a statically scoped dialect of Lisp, influenced by Scheme and Common Lisp.
zkevm-circuits
taiga - A framework for generalized shielded state transitions
librabft_simulator - Discrete-event simulation for BFT consensus protocols
jsonrpc - Rust JSON-RPC implementation
sprig - 🍃 Learn to code by making games in a JavaScript web-based game editor.