sdiehl / arithmetic-circuitsLinks
Arithmetic circuits for zero knowledge proof systems
☆83Updated last year
Alternatives and similar repositories for arithmetic-circuits
Users that are interested in arithmetic-circuits are comparing it to the libraries listed below
Sorting:
- Optimised bilinear pairings over elliptic curves☆56Updated last year
- Schnorr Protocol for Non-interactive Zero-Knowledge Proofs☆76Updated 5 years ago
- A minimalistic blockchain consensus implemented and verified in Coq☆113Updated 5 years ago
- A framework to execute and verify algorithms using Groth16 zkSNARKs.☆89Updated 5 years ago
- Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings☆47Updated 5 years ago
- ☆59Updated 3 years ago
- A Language and Compiler for Homomorphic Encryption Made easY☆67Updated 5 years ago
- A polymorphic interface for elliptic curve operations☆42Updated 2 years ago
- Super Amazing Universal Composability, Yeah!☆32Updated 3 years ago
- Formal verification of the Algorand consensus protocol☆27Updated 2 years ago
- EVM (Ethereum virtual machine) Assembly on Haskell DSL☆66Updated 7 years ago
- State-Transition Systems for Smart Contracts☆24Updated 5 years ago
- Byzantine model checker☆21Updated 2 years ago
- A framework for smart contract verification in Coq☆124Updated last month
- Privacy-preserving auditing for distributed ledgers☆67Updated 6 years ago
- authenticated data structures, generically☆55Updated 8 years ago
- Abe-Ohkubo-Suzuki Linkable Ring Signatures☆48Updated 5 years ago
- A formal verification of Linear PCP SNARKs.☆56Updated last year
- A model of the RISC Zero zkVM and ecosystem in the Lean 4 Theorem Prover☆71Updated 2 years ago
- Finite Fields and Curves in Lean☆13Updated 2 years ago
- A zero-knowledge Lean4 compiler and kernel☆139Updated 11 months ago
- The modular protocol framework based on Universal Composability☆18Updated 5 years ago
- Λ ⚬ λ: Functional Lattice Cryptography☆230Updated 4 years ago
- A copy of the verifiable computation projects from Microsoft Research, Pinnochio and Gepetto☆18Updated 6 years ago
- A formalization of a Proof-of-Stake Nakamoto-style blockchain in Coq☆25Updated 4 years ago
- A Formal Semantics of WebAssembly in K☆83Updated this week
- A Coq-based framework to verify the correctness of Byzantine fault-tolerant distributed systems☆31Updated 6 years ago
- Lean circuit DSL☆95Updated this week
- Language Design Community for the EVM: Intro and Resources☆135Updated 8 years ago
- Implementation of Valiant's universal circuit construction optimized for private function evaluation☆42Updated 4 years ago