proof-of-exploit / cliLinks
Prove knowledge of smart contract bugs using zkEVM
☆43Updated 11 months ago
Alternatives and similar repositories for cli
Users that are interested in cli are comparing it to the libraries listed below
Sorting:
- Share private EVM state attestations using STARK proofs☆73Updated 3 years ago
- Infinitely Compressible Governance using Recursive SNARKs☆31Updated 2 years ago
- ☆40Updated 2 years ago
- A Brainfuck zkVM with Circom.☆59Updated 2 years ago
- an introduction to noir, with simple examples☆44Updated last year
- Honk Verifier in Solidity☆50Updated 10 months ago
- BigInt library for Aztec's noir language☆32Updated last year
- Axiom smart contracts☆26Updated 2 years ago
- Plonk verifier in solidity (using Commit api)☆22Updated last year
- ☆12Updated last year
- ☆30Updated last year
- Generate an optimized Groth16 SNARK verification smart contract for use on EVM-based blockchains.☆127Updated 2 years ago
- P256 (a.k.a. secp256r1 elliptic curve) signature verification 🐍Vyper contract.☆19Updated last week
- secp256k1 elliptic curve cryptography in pure Solidity for on- and offchain operations☆60Updated 3 weeks ago
- 🔒💬 A protocol for credible commitments.☆75Updated last year
- Hyper-Optimised Secp256r1/P256 Verifier Huff Implementation☆26Updated last year
- Code used in a recent presentation showing off noir storage proofs☆15Updated 2 years ago
- PoC of Revm execution in SGX☆80Updated last year
- Circuits, written in circom, for Proof Of Solvency☆26Updated 2 years ago
- Export Circom verifier to Cairo☆49Updated 3 years ago
- ☆28Updated 2 years ago
- zkSNARK circuits for the Telepathy protocol☆53Updated last year
- My personal notebook for various zk-related topics☆48Updated 7 months ago
- Helper functions enabling players to solve past curta puzzles on their own time.☆31Updated 2 years ago
- ☆33Updated last year
- A library to assist with handling sparse arrays in storage.☆27Updated 2 years ago
- A monorepo of reusable Noir circuits.☆43Updated 2 weeks ago
- An NFT with Huff, using polynomials over a finite field with order largest prime address, instead of mappings.☆16Updated 11 months ago
- Curta CTF #12☆20Updated last year
- 🌻 use L1 multisig owners to sign on L2 multisigs using zk proofs☆31Updated 2 years ago