blst
Nova
blst | Nova | |
---|---|---|
3 | 6 | |
435 | 647 | |
1.1% | 2.2% | |
8.5 | 8.6 | |
about 1 month ago | 3 days ago | |
Assembly | 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.
blst
-
[AMA] We are EF Research (Pt. 8: 07 July, 2022)
cryptographic versus non-cryptographic: Complex low-level BLS12-381 cryptography is encapsulated away in libraries. Péter can for example interact with the BLST API when working on Verkle trees.
-
blst VS ecc - a user suggested alternative
2 projects | 26 Jan 2022
-
Sha-256 input data type
Here is one I use in production (the same as OpenSSL but just SSE3, audited by NCC): - https://github.com/supranational/blst/blob/master/src/sha256.h - https://github.com/supranational/blst/blob/5435c307e5b3540a6600b816a6d01bdb13a81869/src/no_asm.h#L1089 - https://github.com/supranational/blst/blob/master/src/asm/sha256-x86_64.pl
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?
constantine - Constantine: modular, high-performance, zero-dependency cryptography stack for proof systems and blockchain protocols.
jsonrpsee - Rust JSON-RPC library on top of async/await
secp256k1 - Optimized C library for EC operations on curve secp256k1
zexe - Rust library for decentralized private computation
mev-boost - MEV-Boost allows Ethereum validators to source high-MEV blocks from a competitive builder marketplace
winterfell - A STARK prover and verifier for arbitrary computations
zkevm-circuits
anoma - Reference implementation of the Anoma protocols in Rust.
cherrybomb - Stop half-done APIs! Cherrybomb is a CLI tool that helps you avoid undefined user behaviour by auditing your API specifications, validating them and running API security tests.
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.
ecc - elliptic-curve cryptography