Search Results for "hash"
Sort By:
58 projects for "hash" with 2 filters applied:
-
IT Asset Management (ITAM) SoftwareDrowning in misplaced IT assets, compliance headaches, and shadow IT? Navigate to clarity with an intuitive IT Asset Management solution. Experience crisp visibility, effortless control, and unshakable security – all while freeing up your budget with optimized software licenses. The best part? It’s easy.
-
DialedIn: Cloud Contact Center SoftwareDialedIn is a modern call center software designed to transform customer interactions and streamline your operations, helping teams achieve more daily. By automating and optimizing key workflows across inbound, outbound, and blended environments, DialedIn helps you boost agent productivity and deliver better outcomes across every call.
-
1
hash-wasm
Lightning fast hash functions using hand-tuned WebAssembly binaries
hash-wasm is a high-performance cryptographic and non-cryptographic hashing library that leverages hand-optimized WebAssembly binaries to deliver fast hashing capabilities in browsers, Node.js, and other JavaScript environments. The library supports a wide range of algorithms, including MD5, SHA variants, BLAKE, Argon2, bcrypt, and xxHash, making it suitable for applications ranging from security to data processing. -
2
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. ... -
3
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. ... -
4
RHash (Recursive Hasher) is a console utility for computing and verifying hash sums of files. It supports CRC32, CRC32C, MD4, MD5, SHA1, SHA256, SHA512, SHA3, AICH, ED2K, DC++ TTH, BTIH, Tiger, GOST R 34.11-2012, RIPEMD-160, HAS-160, EDON-R, and Whirlpool.
-
Estimating Software for Heavy ConstructionBuilt by an estimator, SharpeSoft Estimator is a fully comprehensive software that allows for a more efficient and quicker job-winning bids. Ideal for civil, utility, heavy/highway, grading, excavating, paving, and pipeline contractors, SharpeSoft Estimator offers advanced features such as Item Master, Subcontractor Comparison, Materials Comparison, Grouped Items, Trench Profiler, Haul Calculations, What-if Scenarios, Batch Reports, and more.
-
5
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. ... -
6
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... -
7
Largest Generic Hash and HMAC Program
57 Hash Functions In One Program, plus each with HMAC or KMAC
FEHASHMAC is the largest collection of publicly known hash algorithms integrated into a command-line utility. FEHASHMAC contains a set of known test vectors and results for each algorithm such that the correct implementation for each hardware platform and compiler version can directly be verified. Currently 57 hash algorithms like sha1 sha224 sha256 sha384 sha512 and variants, sha3 and shake, all SHA3 finalists and blake3, md2 md4 md5 md6, rmd128 rmd160 rmd256 rmd320, whirl gost lash160 lash256 lash384 lash512 tiger2 and RFC 2104 HMAC and KMAC support are included, plus SHA3 extensions kmac128, kmac256, kmacxof128, kmacxof256 for message. -
8
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. ... -
9
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. -
The fastest way to host, scale and get paid on WordPressLightning-fast hosting, AI-assisted site management, and enterprise payments all in one platform designed for agencies and growth-focused businesses.
-
10
...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.
-
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
minirepo (abreviated to mr) is designed to handle small to middle sized repositories with rcs. It supports version bumping and snapshoting, which is simmilar to a git or fossil commit hash It keeps track of files checked into the repo via a MANIFEST file The main configuration is located inside the MR/ directory for each subdirectory initialized. Its priamry purpose is to track files with rcs related commands. This is to make it easier to deal with a lot of files tracked by rcs and also to offer some extra functionality like snapshots and automatic versioning.
-
13
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. -
14
JavaScript MD5
Compatible with server-side environments like node.js
...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 md5(value) and receiving the 32-character hexadecimal hash. It supports multiple packaging formats, including UMD, making it easy to drop into legacy codebases as well as modern bundlers like webpack or Browserify. A comprehensive test suite and demo page are provided to validate behavior across platforms and edge cases. -
15
Essentials
General purpose utilities and hash functions for Android and Java
Essentials is a lightweight collection of high-performance utility classes designed to enhance standard Java and Android development without introducing heavy dependencies. The library focuses on providing efficient data structures and helper utilities that often outperform equivalent components in the standard Java API. It is intentionally minimalistic and is not positioned as a full framework, but rather as a focused toolkit that fills common gaps developers encounter in everyday projects.... -
16
GNU libdbh. As of April 9, 2014, DBH is a GNU program and is renamed to "GNU libdbh". Library to create and manage 64-bit disk based hash tables Associations are made between keys and values so that for a given a key the value can be found and loaded into memory quickly: 64 bit support
-
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
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). ... -
19
egg-token
Egg.js middleware that uses encrypted token to authenticate
Egg.js middleware that uses encrypted token to authenticate. -
20
one advanced C lib for UNIX and WINDOWS
one server framework
Advanced C/C++ library(ACL) for UNIX-like OS and WIN32 OS, including sync/async/ssl iostream for net/file, thread pool, process pool, db pool, server framework, event, memory, string, array/hash/ring/list, xml and json parser, http/smtp/icmp protocol, SSL/TLS, C unit test, etc -
21
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. -
22
C++ generic open address hash map
Simple oaht template class
The advantage of this project is that you can use this hash map by including only 2 files to your project. (or 1 if you want by cut/paste pool.hpp content directly in hashmap.hpp if you want). It is template and doesn't require that your contained types are PODs, it doesn't require to set delete_key and empty_key. Unlike google densemap. It is mostly "C++ unordered_map" standard conformant and if you download it, you'll find a visual studio project, or a CMakeLists.txt that integrates the test suite from GCC for unordered_map. ... -
23
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... -
24
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 -
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.
