Search Results for "hash"
Sort By:
Showing 29 open source projects for "hash"
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.
-
Context for your AI agentsBuild data pipelines that feed your AI models and agents without managing infrastructure. Crawl any website, transform content, and push directly to your preferred vector store. Use 10,000+ tools for RAG applications, AI assistants, and real-time knowledge bases. Monitor site changes, trigger workflows on new data, and keep your AIs fed with fresh, structured information. Cloud-native, API-first, and free to start until you need to scale.
-
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 platforms. ... -
2
Tiny CUDA Neural Networks
Lightning fast C++/CUDA neural network framework
...Lower-end cards must reduce the n_neurons parameter or use the CutlassMLP (better compatibility but slower) instead. tiny-cuda-nn comes with a PyTorch extension that allows using the fast MLPs and input encodings from within a Python context. These bindings can be significantly faster than full Python implementations; in particular for the multiresolution hash encoding. -
3
Optimus id transformation
Id obfuscation based on Knuth's multiplicative hashing method for PHP
With this library, you can transform your internal IDs to obfuscated integers based on Knuth's integer hash. It is similar to Hashids but will generate integers instead of random strings. It is also super fast. If you will be running your code on a 32-bit system or will be working with large prime numbers it is suggested that you install the GMP extension. -
4
spaCy
Industrial-strength Natural Language Processing (NLP)
spaCy is a library built on the very latest research for advanced Natural Language Processing (NLP) in Python and Cython. Since its inception it was designed to be used for real world applications-- for building real products and gathering real insights. It comes with pretrained statistical models and word vectors, convolutional neural network models, easy deep learning integration and so much more. spaCy is the fastest syntactic parser in the world according to independent benchmarks, with... -
Total Network Visibility for Network Engineers and IT ManagersThis means every device on your network, and every interface on every device is automatically analyzed for performance, errors, QoS, and configuration.
-
5
PSR-7
PSR-7 HTTP message library
This repository contains a full PSR-7 message implementation, several stream decorators, and some helpful functionality like query string parsing. This package comes with a number of stream implementations and stream decorators. Reads from multiple streams, one after the other. Provides a buffer stream that can be written to fill a buffer, and read from to remove bytes from the buffer. This stream returns a "hwm" metadata value that tells upstream consumers what the configured high water... -
6
BTree implementation for Go
BTree provides a simple, ordered, in-memory data structure for Go
This package is a high-performance, in-memory B-tree for Go that implements an ordered set/map with efficient insert, delete, and range iteration. It’s parameterized by tree degree so callers can tune cache behavior and memory overhead for their workload. Instead of relying on Go’s built-in maps—which are hash-based and unordered—btree preserves sorted order and provides rich traversal APIs like ascending, descending, and range scans. The implementation favors minimal allocations and locality, making it attractive for indexing, query engines, and caches that need predictable iteration costs. A simple Item interface with a Less method defines ordering, keeping the API small and flexible for custom types. ... -
7
LinAsm
Collection of fast and optimized assembly 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 data types (ADT) such as hash tables b-trees, and much more. LinAsm libraries are written on FASM assembly language. They are stable and have appropriate benchmarks for many units. All libraries are well documented and grouped by their functionality. To get more information about this library, please visit the official web site: http://linasm.sourceforge.net -
8
Dynamic Arrays and Hashes (Delphi, C++)
Very fast classes for working with Dynamic Arrays in Delphi and C++
...Flexible memory control, functionality that standard containers do not have, fast operations (assembler implementation for x86 and x64 platforms). Available for Delphi all latest versions and for C++. Powerful Hash and Double Hash classes to work with pairs of values (key and value) and with values that have two keys (key1, key2, value). Give it a try and let me know how it works. -
9
...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.
-
Nonprofit Budgeting SoftwareMartus' collaborative and easy-to-use budgeting and reporting platform will save you hundreds of hours each year. It's designed to make the entire budgeting process easier and create unlimited financial transparency.
-
10
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... -
11
Name-That-Hash
Identify MD5, SHA256 and 300+ other hashes
Name-That-Hash is a modern hash identification system that tells you what type of hash you are looking at, supporting MD5, SHA-256, and more than 300 other hash types. It is designed as a successor and improvement to older tools like HashID and Hash-Identifier, focusing on up-to-date hash databases and better usability. One of its core ideas is popularity-aware ranking: when you feed in a hash, it prioritizes likely real-world types such as NTLM over obscure ones like Skype hashes, instead of treating them equally. ... -
12
cppcrypto
C++ cryptographic library (modern hash functions, ciphers, KDFs)
...Key derivation functions: PBKDF2, scrypt, Argon2, HKDF. Includes sample command-line tools: - 'digest' - for calculating and verifying file checksum(s) using any of the supported hash algorithms (similar to md5sum or RHash). - 'cryptor' - for file encryption using Serpent-256 algorithm in AEAD mode. Check out the cppcrypto web site linked below for programming documentation. -
13
CityHash
Automatically exported from Google code CityHash
CityHash is a family of non-cryptographic hash functions optimized for extremely fast and high-quality hashing of strings on modern CPUs. Developed by Google, it is implemented in C++ and designed to efficiently handle both short and long inputs using techniques such as mixing operations and CPU-specific optimizations. CityHash offers multiple hash sizes—32-bit, 64-bit, 128-bit, and 256-bit variants—with the CRC-based versions leveraging hardware acceleration on CPUs that support SSE4.2 CRC32 instructions. ... -
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
sls
SLS Team Java Library
Java library with Cryptographic algorithms. Easy to use Crypto algorithms. Works on Windows, Linux, Android. No external lib dependencies, no useless abstractions, no 'crypto provider'. Elliptic curves was borrowed from BouncyCastle and simplified a lot. Most of EC classes are custom algorithms for certain curves. Can be easily deleted if u dont need them. With couple of classes u can parse and construct those ugly ASN.1 structures, look at RSA and EC key formats for example. No... -
16
ftdetector
File type detector library
This project is a tool to detect file types by signatures and mime types. It uses hash tables to make the detection of a file type as fast as possible. The signature and mime types lists are stored at simple user-friendly files. This file type detector supports a lot of formats (image, archive, text, documents, audio, video, fonts and others). It also includes Microsoft OLE compound file types. The detector's algorythm has special features to detect text file types like (HTML, XML, JSON, etc.) and text file UNICODE charsets by using their BOMs (Byte order marks). ... -
17
sjcl
Stanford Javascript Crypto Library
...The minified version of the library is under 6.4KB compressed, and yet it posts impressive speed results. SJCL is secure. It uses the industry-standard AES algorithm at 128, 192 or 256 bits; the SHA256 hash function; the HMAC authentication code; the PBKDF2 password strengthener; and the CCM and OCB authenticated-encryption modes. Just as importantly, the default parameters are sensible: SJCL strengthens your passwords by a factor of 1000 and salts them to protect against rainbow tables, and it authenticates every message it sends to prevent it from being modified. ... -
18
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. -
19
ALEPH-w
Data structures and Algorithms library
...It contains the main data structures: single and double lists, special arrays (dynamic and of bits), many types of trees: multitrees, binary search trees, avl, red-black, randomized, treaps, splay and other interesting types. Several types of hash tables are implemented: separated chaining, open adressing with linear probing and double function hash; this last one has a garbage colector mechanism that allows to free deleted entries. Dynamic linear hash tables are implemented too. The main algorithms on graphs are implemented in an easy way and with good performance features. ... -
20
QDAC3.0
QDAC 3.0 is a VCL & FMX data access component
[IMPORTANT NOTICE] This project is moved to my self website.The new SVN urls : svn://www.qdac.cc/QDAC3 GIT url is: git://www.qdac.cc/QDAC3.git Please check out with the new urls. QDAC 3.0 is a new version of Quick Data Access Component.Compare with version 2,the new version is base on XE6 and support all OS with XE6:Win32/Win64/Mac OSX/iOS/Andriod. QDAC 3.0 Include follow sub components: QXml/QJson/QLog/QWorker/QSort/QExp/QDB etc. QDAC now is in progress. Follow is from QDAC... -
21
unordered_flat_set
C++ continuous memory hash containers.
Continuous memory open addressing/closed hashing, with linear probing, container. Basically unordered_set, unordered_map, unordered_multiset, and unordered_multimap, but with vector like memory allocation. -
22
libcutils
Some Useful C-Utilities
Libcutils provides a self-contained set of fundamental routines which are essential to basically any Unix utility or daemon application written in C. The library provides fundamental data structures such as lists, hash-maps, strings and parsing functions for JSON or the typical dot-file based configuration data. The following list summarizes the currently supported functionality: * length delimited instead of NULL terminated strings * memory management based on reference counting * several list processing functions like iterators and map-reduce * support of [Ideal Hash Tries](http://infoscience.epfl.ch/record/64398/files/idealhashtrees.pdf) for highly efficient hash map data structures * parsers for [JSON](http://json.org) data and the text configuration files found in Unix system * doubly linked circular lists for reliable event queues * support for test and debugging of memory management problems such as memory leaks -
23
Immutable Collections for Java
Immutable/Persistent Collections Library
...The library includes a singly linked (cons/cddr style) list/stack, an integer trie based indexed list, a 2-3 tree based random access indexed list, a 2-3 tree based map, a hash trie based map, and hash and tree based sets, and sparse arrays. All collections provide immutable Cursor as well as standard Iterator classes for looping through all elements. A utility class provides functional style algorithmic processing of Cursors including foldLeft, foldRight, collect, select, and reject. The 2-3 tree and integer trie classes are optimized for performance and can be used alongside java.util Collections when immutability is needed for safe data sharing. -
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.
