asonnino / narwhalLinks
Implementation of BFT consensus protocols based on the Narwhal mempool.
☆112Updated 7 months ago
Alternatives and similar repositories for narwhal
Users that are interested in narwhal are comparing it to the libraries listed below
Sorting:
- FFT, data-recovery and KZG commitments, a.k.a. Kate commitments, in Go - *super experimental*☆93Updated 2 years ago
- Mysticeti: Low-Latency DAG Consensus with Fast Commit Path☆81Updated 6 months ago
- Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus.☆221Updated 3 years ago
- Tutorial for writing constraints in the `arkworks` framework☆256Updated last year
- Zero-Knowledge Cryptography Infrastructure Stack☆129Updated 2 years ago
- ☆134Updated last year
- ED25519 implementation in Circom☆119Updated 2 years ago
- Geth-in-SGX provides an example of running go-ethereum in SGX☆76Updated last year
- Narwhal & Tusk are a high throughput mempool & consensus, used in the Sui smart contract platform☆179Updated 3 years ago
- ☆61Updated 2 years ago
- rapidsnark is a fast zkSNARK prover written in C++, that generates proofs for circuits created with circom and snarkjs.☆85Updated last week
- ☆138Updated 3 years ago
- ☆81Updated 5 years ago
- Zero-knowledge gadgets for Webb's cross-chain blockchain applications.☆93Updated 2 years ago
- Python/Rust implementations and notes from Proofs Arguments and Zero Knowledge study group☆133Updated last year
- Zirgen compiler and RISC Zero circuits☆104Updated 2 weeks ago
- A zkSNARK toolkit to work with circom zkp DSL in plonk proof system.☆159Updated 2 years ago
- A zero-knowledge Move language runtime environment.☆84Updated 7 months ago
- ☆45Updated 8 months ago
- Rust PLONK implementation☆39Updated last year
- Evaluating & benchmarking ZKP compilation strategies.☆121Updated 2 years ago
- Go implementation of some cryptographic primitives (that fit inside the SNARK field) and compatible with circomlib☆145Updated 11 months ago
- A library for mental poker (and other card games). Based on the Barnett-Smart protocol and the Bayer-Groth argument of correct shuffle☆116Updated 11 months ago
- ☆39Updated last year
- ☆167Updated this week
- Arkworks bindings to Circom's R1CS, for Groth16 Proof and Witness generation in Rust.☆276Updated 4 months ago
- A Plonkish folding framework for Incrementally Verifiable Computation (IVC).☆177Updated 9 months ago
- Experimental implementation of the SuperNova protocol. https://eprint.iacr.org/2022/1758☆122Updated 2 years ago
- Benchmarking framework for general purpose zero-knowledge proofs languages and libraries☆102Updated last year
- Compaction-Less Database Optimized for Efficiently Storing Recent Merkleized Blockchain State☆139Updated last week