dedis / tlcLinks
Threshold Logical Clocks and Que Sera Consensus
☆28Updated 2 years ago
Alternatives and similar repositories for tlc
Users that are interested in tlc are comparing it to the libraries listed below
Sorting:
- Testground: SDK for developing test plans in Go☆12Updated last year
- Compact Sparse Merkle Trees (CSMT) with pluggable storage.☆38Updated 6 years ago
- Argument systems for inner pairing products☆42Updated last year
- TLA+ specifications of various protocols used by wallets in the nitro protocol.☆18Updated 5 years ago
- A zkSNARK implementation of a merkle tree membership preimage proof.☆23Updated 6 years ago
- BFT consensus in Rust☆21Updated 3 years ago
- Pastry DHT implementation with a standalone libp2p compatible node☆12Updated 5 years ago
- ☆22Updated 7 months ago
- Overlay Network for distributed protocols☆51Updated 2 years ago
- A specification of the CBC Casper consensus protocols written in TLA+ and PlusCal (transpiled to TLA+)☆21Updated 5 years ago
- Implementation of additive homomorphic ElGamal using the Ristretto group over Curve25519☆22Updated 2 years ago
- Erlang implementation of HoneyBadgerBFT☆70Updated 2 years ago
- A TLA+ implementation of the Avalanche Protocol Family, both for learning Avalanche and TLA+☆18Updated 5 years ago
- High Speed elliptic curve signature system using a 260-bit Granger Moss Prime.☆14Updated 4 years ago
- Multilayered Linkable Spontaneous Anonymous Group - Implemented as is from paper. Not Monero specific☆24Updated 5 years ago
- Futhark implementation of neptune-compatible Poseidon.☆27Updated 4 years ago
- a CCA-secure module-lattice-based KEM☆16Updated 6 years ago
- Hackathon project for Snarky workshop.☆11Updated 6 years ago
- fft impl for ff::Field☆16Updated last year
- Coded Merkle Tree☆26Updated 6 years ago
- Low-level language for encoding AIR of computations☆37Updated 2 years ago
- Discrete-event simulation for BFT consensus protocols☆47Updated 3 years ago
- An O(N\log{N}) time algorithm for computing all N proofs fast in the Pointproofs VC. Also, the O(N\log{N}) time Feist-Khovratovich algori…☆13Updated 4 years ago
- Intel assembly finite field library generator☆12Updated last year
- Compact linkable ring signatures. A modification on MLSAG.☆19Updated 5 years ago
- A TLA+ formalization of the algorithm described in "Paxos Made Simple"☆21Updated 6 months ago
- A minimal RedJubjub implementation for use in Zebra.☆28Updated 3 months ago
- Hyrax reference implementation: meta-repo with top-level makefile, etc☆37Updated 7 years ago
- Tendermint + Sqlite3 = BFT Database Replication☆38Updated 7 years ago
- Merkle tree toolkit☆46Updated 4 years ago