pact VS Nova

Compare pact vs Nova and see what are their differences.

Nova

Nova: High-speed recursive arguments from folding schemes (by microsoft)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
pact Nova
3 6
577 637
0.0% 2.7%
8.4 8.7
8 days ago 6 days ago
Haskell Rust
BSD 3-clause "New" or "Revised" License MIT License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.

pact

Posts with mentions or reviews of pact. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-07-05.

Nova

Posts with mentions or reviews of Nova. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-12-01.
  • Ask HN: Who is hiring? (December 2022)
    14 projects | news.ycombinator.com | 1 Dec 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)
    20 projects | news.ycombinator.com | 1 Nov 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)
    13 projects | news.ycombinator.com | 3 Oct 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)
    6 projects | /r/ethereum | 7 Jul 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
    7 projects | news.ycombinator.com | 5 Jul 2022
    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
    7 projects | /r/rust | 4 Aug 2021
    Nova. Recursive SNARKs without trusted setup.

What are some alternatives?

When comparing pact and Nova you can also consider the following projects:

Exquisite - Easy window layout management for KDE Plasma

blst - Multilingual BLS12-381 signature library

netrc - Reads netrc files implemented in Elixir

jsonrpsee - Rust JSON-RPC library on top of async/await

ex2ms - :ets.fun2ms for Elixir, translate functions to match specifications

zexe - Rust library for decentralized private computation

exldap - A module for working with LDAP from Elixir

winterfell - A STARK prover and verifier for arbitrary computations

std_json_io - A simple library for Elixir that provides json over STDIO

anoma - Reference implementation of the Anoma protocols in Rust.

Apex - Awesome printing for Elixir

taiga - A framework for generalized shielded state transitions