Search Results for "distributed hash table"
Sort By:
Showing 34 open source projects for "distributed hash table"
View related business solutions-
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
Hypermind
The high-availability solution to a problem that doesn't exist
Hypermind is a whimsical yet technically intriguing decentralized application that combines a peer-to-peer (P2P) network counter with ephemeral chat functionality, built to “solve” the meta-problem of tracking how many peers are running its container in a decentralized mesh. There’s no central server or database; instead, Hypermind leverages a Distributed Hash Table (DHT) using Hyperswarm to discover peers and maintain approximate counts of active nodes, architected to be a fully decentralized service. Alongside counting nodes, the project also supports ephemeral chat over its mesh network, allowing users to send messages directly to local peers or broadcast via a gossip protocol without storing chat history. ... -
2
match-sorter
Simple, expected, and deterministic best-match sorting
...It also offers control over diacritics handling, allowing you to strip or keep accents depending on the UX you want. Distributed via npm and usable in both Node and browser environments. -
3
HighwayHash
Fast strong hash functions: SipHash/HighwayHash
HighwayHash is a fast, keyed hash function intended for scenarios where you need strong, DoS-resistant hashing without the full overhead of a general-purpose cryptographic hash. It’s designed to defeat hash-flooding attacks by mixing input with wide SIMD operations and a branch-free inner loop, so adversaries can’t cheaply craft many colliding keys. The implementation targets multiple CPU families with vectorized code paths while keeping a portable fallback, yielding high throughput across... -
4
Smallpond
A lightweight data processing framework built on DuckDB and 3FS
smallpond is a lightweight distributed data processing framework built by DeepSeek, designed to scale DuckDB workloads over clusters using their 3FS (Fire-Flyer File System) backend. The idea is to preserve DuckDB’s fast analytics engine but lift it from single-node to multi-node settings, giving you the ability to operate on large datasets (e.g. petabyte scale) without moving to a heavyweight system like Spark. Users write Python-like code (via DataFrame APIs or SQL strings) to express... -
$300 Free Credits to Build on Google CloudStart your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
-
5
Apache Flink
Stream processing framework with powerful stream
Apache Flink is a distributed engine for stateful computations over data streams and batches, designed for low-latency processing at scale. Its core runtime executes dataflow graphs with fine-grained backpressure and checkpointing, allowing applications to recover consistently from failures. Flink’s event-time model and watermarks enable accurate out-of-order processing, windowing, and complex time semantics that typical real-time systems struggle with. -
6
Apache Drill
Apache Drill is a distributed MPP query layer for self describing data
Apache Drill is a distributed MPP query layer that supports SQL and alternative query languages against NoSQL and Hadoop data storage systems. It was inspired in part by Google's Dremel. Get faster insights without the overhead (data loading, schema creation and maintenance, transformations, etc.) Analyze the multi-structured and nested data in non-relational datastores directly without transforming or restricting the data. Leverage your existing SQL skillsets and BI tools including Tableau,... -
7
LinAsm
Collection of fast and optimized assembly libraries for x86-64 Linux
LinAsm is collection of very fast and SIMD optimized assembly written libraries for x86-64 Linux. It implements many common and widely used algorithms for array manipulations: searching, sorting, arithmetic and vector operations, unit conversions; fast mathematical and statistic functions; numbers and time converting algorithms; finite impulse response (FIR) digital filters; spectrum analysis algorithms, Fast Hartley transformation; CPU cache friendly functions and extremely fast abstract... -
8
...It is designed to offer for C programmers common data structures with powerful algorithms, and hidden implementation. Available structures are lists, queues, stacks, hash tables, binary trees, binary search trees, red-black trees, 2D arrays, permutations, heaps and interval heaps. GDSL is free software distributed under the terms of the GNU General Public License.
-
9
libfc4c
Fast containers for C language
C dynamic containers are missing in the standard, so almost every single project in C uses different implementations. This library is yet another implementation of few basic containers, optimized for speed. A simplified interface to libarchive allows to save the containers in a compressed form. All the containers are 32bit. This greatly improves the performance (up to ~32%) and reduces the memory consumption (up to 41%) on 64bit systems. All the containers are pre-allocating buffers to... -
Earn up to 16% annual interest with Nexo.Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
-
10
LBRY SDK
The LBRY SDK for building decentralized content apps
...LBRY also provides a data network that consists of peers (seeders) uploading and downloading data from other peers, possibly in exchange for payments, as well as a distributed hash table used by peers to discover other peers. LBRY SDK for Python is currently the most fully featured implementation of the LBRY Network protocols and includes many useful components and tools for building decentralized applications. -
11
CityHash
Automatically exported from Google code CityHash
...The library emphasizes hashing performance and uniformity rather than cryptographic security, making it ideal for use in data structures like hash tables and distributed systems requiring rapid key lookups. CityHash has been rigorously tested using tools like SMHasher to ensure high-quality mixing and collision resistance across a wide range of inputs. Its speed and portability have made it a popular choice for developers needing dependable, lightweight hash functions. -
12
JavaScript MD5
Compatible with server-side environments like node.js
JavaScript-MD5 is a small, dependency-free implementation of the MD5 hashing algorithm written entirely in JavaScript, designed to run consistently across browsers, Node.js, and popular module loaders. It allows you to generate MD5 hashes from strings, arrays, ArrayBuffers, and other binary-like data types, making it useful for checksums, fingerprinting, and simple integrity checks on the client or server. The library is exposed as a plain function, so usage is as simple as calling... -
13
RadonDB
RadonDB is an open source, cloud-native MySQL database
RadonDB is a cloud-native database based on MySQL, and architected in fully distributed cluster that enable unlimited scalability (scale-out), capacity and performance. It supported distributed transaction that ensure high data consistency, and leveraged MySQL as storage engine for trusted data reliability. RadonDB is compatible with MySQL protocol, and sup-porting automatic table sharding as well as batch of automation feature for simplifying the maintenance and operation workflow. ... -
14
StructPie
A set of C libraries to implement data structures and algorithms
Struct-Pie (Structures Pie) is a set of C shared libraries to implement data structures and algorithms so that they can be used/integrated easily into C projects. LIFO & FIFO Stack, Binary Search Tree, Priority Queue and a Hash Table are implemented and included in this package. Future releases will have many other data structures. The hash table in this package uses separate chaining to avoid collision. In the "hash_table" directory, the hash table implementation uses linked lists. While in "HashBSTree" directory, a hash table with a binary tree in each index is implemented for faster lookup in large data. ... -
15
clzw
Implementation of LZW compression algorithm in C
... - Console encoder/decoder tools - OS independent - Could be used in embedded projects - Works with raw code-stream LZW features: - Hardcoded dictionary size - Variable code size - Code search is performed by hash table and embedded in dictionary linked lists (encoder) - No dynamic memory allocation -
16
Personal Blog
One article per week, the content is concise, neither salty nor light
...This makes the repo act as a navigable table of contents and knowledge map for a large body of Chinese-language backend engineering content. It also includes “toolbox” and miscellaneous categories. -
17
EasyVM
ezvm is a multi purpose language vm
evzm is a multi purpose language vm. It is based on Harvard architecture and it supports high level data type such as a hash table or array. -
18
PrydeWorX Library
The PrydeWorX C++ Library of workers, tools and utilities.
The PrydeWorX Library project has been moved to: https://pwxlib.prydeworx.com The page here is kept as historical reference. The information is outdated, and won't get updated any more. -
19
bps
A B-tree based associative array library.
B-tree with a twist pointer set. The ordered set approaches the speed of the fastest unordered, hash table based sets, while using several times less memory. -
20
ChunJun
A data integration framework
ChunJun is a distributed integration framework, and currently is based on Apache Flink. It was initially known as FlinkX and renamed ChunJun on February 22, 2022. It can realize data synchronization and calculation between various heterogeneous data sources. ChunJun has been deployed and running stably in thousands of companies so far. Based on the real-time computing engine--Flink, and supports JSON template and SQL script configuration tasks. The SQL script is compatible with Flink SQL... -
21
v1pad
One-time-pad encryption using a virtual pad
v1pad is a command-line tool that encrypts and decrypts files using one-time-pad encryption. v1pad uses a virtual pad, meaning that the one-time pad is generated dynamically based on user input instead of being stored in a file. The name v1pad is an abbreviation for Virtual One-Time Pad. -
22
Write a hash table in C
Learn how to write a hash table in C
...This tutorial assumes some familiarity with programming and C syntax. The code itself is relatively straightforward, and most issues should be solvable with a web search. A hash table is a data structure which offers a fast implementation of the associative array API. -
23
HeaDDaCHe
Hashed dynamic determinants for convex hulls
Description: We propose and implement in C++ the hashed dynamic determinants scheme. This consists of efficient implementations of dynamic determinant algorithms and a hash table that stores intermediate results (matrices and determinants) in order to be used in subsequent steps of the algorithm. Related papers: V.Fisikopoulos, L.Peñaranda. Faster Geometric Algorithms via Dynamic Determinant Computation. In Algorithms – ESA 2012, Lecture Notes in Computer Science Volume 7501, 2012, pp 443-454. -
24
libhash
Thread safe hash library
A hash table library that can store binary data. It is thread safe and you can use as many hash tables in your program as you wish because each has its own context. You can drop items from the hash table and can expire items that have become too old. String keys are default, but with your own comparison routine you can use binary or specialty keys. -
25
.... ======================================================================================= The goal of qLibc project is providing general purpose complete C/C++ library which includes all kinds of containers and general library routines. For example, it contains Doubly Linked List, List Table, Hash Table, Vector, Queue, Stack and more.