Search Results for "hash table"
Sort By:
Showing 41 open source projects for "hash table"
View related business solutions-
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.
-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
1
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... -
2
Hyprspace
A Lightweight VPN Built on top of IPFS + Libp2p
A Lightweight VPN Built on top of IPFS & Libp2p. Libp2p is a networking library created by Protocol Labs that allows nodes to discover each other using a Distributed Hash Table. Paired with NAT hole punching this allows Hyprspace to create a direct encrypted tunnel between two nodes even if they're both behind firewalls. Moreover! Each node doesn't even need to know the other's ip address prior to starting up the connection. This makes Hyprspace perfect for devices that frequently migrate between locations but still require a constant virtual ip address. -
3
TOML
Tom Preston-Werner's obvious, minimal language
...By Tom Preston-Werner, Pradyun Gedam, et al. TOML aims to be a minimal configuration file format that's easy to read due to obvious semantics. TOML is designed to map unambiguously to a hash table. TOML should be easy to parse into data structures in a wide variety of languages. TOML shares traits with other file formats used for application configuration and data serialization, such as YAML and JSON. TOML and JSON both are simple and use ubiquitous data types, making them easy to code for or parse with machines. TOML and YAML both emphasize human readability features, like comments that make it easier to understand the purpose of a given line. ... -
4
BitTorrent DHT
Simple, robust, BitTorrent DHT implementation
bittorrent-dht is a Node.js implementation of the BitTorrent Mainline Distributed Hash Table (DHT) protocol, enabling decentralized peer discovery for BitTorrent clients. This module allows users to announce and lookup peers for specific torrents without the need for trackers. It’s lightweight, fast, and well-suited for building custom torrent clients, browser-based peers, or decentralized apps. This project powers part of WebTorrent and is maintained with performance and minimalism in mind. -
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
5
KadNode
P2P DNS with content key, crypto key and PKI support
KadNode is a decentralized DNS resolver that uses the BitTorrent Distributed Hash Table (DHT) network to resolve domain names, particularly those ending with .p2p. It operates as a lightweight daemon, intercepting DNS requests and providing IP address resolutions without relying on centralized DNS infrastructure. KadNode supports authentication mechanisms to ensure the integrity and authenticity of the resolved addresses. -
6
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. ... -
7
Hivemind
Decentralized deep learning in PyTorch. Built to train models
...Its intended usage is training one large model on hundreds of computers from different universities, companies, and volunteers. Distributed training without a master node: Distributed Hash Table allows connecting computers in a decentralized network. Fault-tolerant backpropagation: forward and backward passes succeed even if some nodes are unresponsive or take too long to respond. Decentralized parameter averaging: iteratively aggregate updates from multiple workers without the need to synchronize across the entire network. ... -
8
Greenmask
PostgreSQL database anonymization and synthetic data generation tool
Greenmask is a powerful open-source utility that is designed for logical database backup dumping, obfuscation, and restoration. It offers extensive functionality for backup, anonymization, and data masking. Greenmask is written in pure Go and includes ported PostgreSQL libraries that allows for platform independence. This tool is stateless and does not require any changes to your database schema. It is designed to be highly customizable and backward-compatible with existing PostgreSQL... -
9
Naeon
The safest way to store private data in untrusted (cloud) environments
...The data is then sharded into one private chunk containing the encryption key and part of the data, and multiple public chunks. Each chunk is renamed using its SHA-512 hash, and all chunks are timestamped equally. A filename conversion table is created to restore the concatenation order during a restore. The method aims to guarantee confidentiality, integrity, and availability of data, regardless of the trustworthiness of the chosen storage environment, while protecting against data breaches and unauthorized access. ... -
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
10
DAR - Disk ARchive
For full, incremental, compressed and encrypted backups or archives
DAR is a command-line backup and archiving tool that uses selective compression (not compressing already compressed files), strong encryption, may split an archive in different files of given size and provides on-fly hashing, supports differential backup with or without binary delta, ftp and sftp protocols to remote cloud storage Archive internal's catalog, allows very quick restoration even a single file from a huge, eventually sliced, compressed, encrypted archive eventually located on... -
11
Sobbu
Encode-Decode Tool weaponized with Hash Encrypt & Hash Cracker
Sobbu is a cryprography tool with various encode-decode algorithm weaponized with Hash encrypting and Hash cracker via Rainbow Table method. This tool used 4 different hash database to identify hash value. Currently available for Windows (CLI + GUI) and Linux (CLI) Latest version : 1.4 Available Encode-Decode algorithm : - Base32 - Base64 - Binary - Octal - Hex - ASCII - URL - HTML - ROT13 Available Hash encrypting and Hash cracking algorithm : - MD5 - SHA1 - SHA224 - SHA256 - SHA384 - SHA512 - SHA3_224 - SHA3_256 - SHA3_384 - SHA3_512 -
12
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. -
13
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. ... -
14
pg_pathman
Partitioning tool for PostgreSQL
pg_pathman is a PostgreSQL extension that provides high-performance partitioning support, developed by PostgresPro. It improves query planning and execution speed for partitioned tables by introducing advanced partition pruning and runtime optimization strategies. It’s ideal for large datasets that require fine-tuned partition control. -
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
bt-btt
Guide and resources for accessing and using the U3C3 BitTorrent site
...It primarily serves as documentation describing how the site works, how users can access it, and how magnet link resources are organized and retrieved. It explains how BitTorrent and magnet link downloads operate, including the role of trackers and distributed hash table (DHT) networks in locating peers and downloading files. BT-btt also discusses different ways users can search for torrent resources, including strategies for improving search results when dealing with multiple language variants or different character encodings. Additional documentation explains why certain statistics such as active download counts may not always be accurate when DHT-based downloads are used. -
17
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. -
18
__Alien Cipher
A bespoke symmetric cipher.
...The primary aim is to simply learn the fundamentals and finer details of cryptography in general and build working examples of my ideas in code. The code is shared here for posterity (future folk) in the guise that it may help others also on the path to cryptography. This code demo uses a 256bit rolling hash table (8x8bytes) at its heart to mix together pre-defined parameters in a way that allows the cipher to produce encoded output that is locked to a key of arbitrary length without padding. Based upon some random data points the cipher produces encoded output that is non-deterministic in nature, the same key and message will never produce the same output each time it's run. ... -
19
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. -
20
Voldemort
A distributed key-value storage system
...It offers many other features such as pluggable serialization support, data item versioning and an SSD Optimized Read Write storage engine. Voldemort is not a relational database or an object database. It is essentially a big, distributed, persistent, fault-tolerant hash table. This doesn’t make it ideal for all applications but does offer unique advantages, such as the ability to read and write scale horizontally, and the ability to combine in memory caching with the storage system so that a separate caching tier is not required. -
21
...KMC 2 is one of the fastest k-mer counting implementations, so we employ KMC 2 for k-mer counting in our package. Because in many cases we need to compare tens of or even hundreds of samples, we adopt the concurrent hash table in Libcuckoo for efficient k-mer counting. Once the differential reads are extracted, they can be used for downstream analysis including assembly to identify genes that are differentially abundant between groups of metagenomes (e.g., healthy vs diseased). Please refer to our RECOMB paper for more details: Wontack Han, Mingjie Wang and Yuzhen Ye. ...
-
22
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. -
23
SimpleKey
Generates keys up to 500 characters and hashes.
...These keys can be all numerical, alphanumeric, all alphabetical or the previous three plus special characters. You may use your generated key for whatever purpose. SimpleKey also includes a hash table with which to hash strings and files alike. Hash algorithms include: MD4/5, Sha, Skein, Keccak, Grostl, JH, and Blake. -
24
libshmht
Shared memory hash table for cache pourposes.
Hash table in shared memory. Specifically developed to be used as a cache. -
25
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.
