hoytech / quadrableLinks
Authenticated multi-version database: sparse binary merkle tree with compact partial-tree proofs
☆319Updated 2 years ago
Alternatives and similar repositories for quadrable
Users that are interested in quadrable are comparing it to the libraries listed below
Sorting:
- Authenticated key-value store (i.e. an urkel tree)☆316Updated 2 years ago
- A pseudo-random deterministic merkle tree built on LMDB☆75Updated 5 months ago
- Working area for Braid extensions to HTTP☆251Updated 8 months ago
- The secure data format for a modern world☆268Updated last year
- ☆288Updated 9 years ago
- Official Github Mirror of the LumoSQL Database Project (https://lumosql.org/src/lumosql)☆205Updated 2 years ago
- DISCoHAsH - Simple, fast, quality hash in 120 lines. 10GB/s serial (depending on hardware). Also in NodeJS☆218Updated 2 years ago
- Wolfsort is a stable adaptive hybrid radix / merge sort.☆196Updated last year
- A parser for SQLite create table sql statements.☆137Updated last year
- Synthesize CRDTs from classic data types with verified lifting!☆148Updated last year
- 🏰 the first JSON-like Byzantine Fault Tolerant CRDT☆219Updated last year
- Verneuil is a VFS extension for SQLite that asynchronously replicates databases to S3-compatible blob stores.☆499Updated 10 months ago
- A strongly-typed document database that runs on any transactional key-value store.☆394Updated 3 years ago
- Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.☆117Updated 2 years ago
- A super-fast, compact, JSON-equivalent binary data format☆322Updated this week
- A hash array-mapped trie implementation in C☆308Updated last year
- Hash consistent search trees.☆94Updated 2 years ago
- AergoLite: Trustless SQLite Replication☆114Updated 3 years ago
- A distributed hash table with unusually strong security properties☆64Updated 5 years ago
- 🌱 Grow delightful software☆265Updated 6 years ago
- Integer Map Data Structure☆131Updated 2 years ago
- Kivaloo is a collection of utilities which together form a data store associating keys of up to 255 bytes with values of up to 255 bytes.☆203Updated 5 months ago
- Chronofold is a conflict-free replicated data structure (a.k.a. CRDT) for versioned text.☆93Updated 3 years ago
- An implementation of the rete algorithm from 'Production Matching for Large Learning Systems'☆85Updated 5 years ago
- InterPlanetary SQL☆214Updated 4 years ago
- A $20k consensus challenge based on TigerBeetle's implementation of the pioneering Viewstamped Replication protocol.☆203Updated 3 years ago
- A library to create p2p applications, using the browser as a full peer.☆219Updated 11 months ago
- Byzantine Fault Tolerant CRDT's and other Eventually Consistent Algorithms☆62Updated 4 years ago
- ☆183Updated 2 months ago
- Generate (message) sequence diagrams from TLA+ state traces☆74Updated 2 years ago