58 Repositories
Rust hash-trees Libraries
A programming language written in an "easy to understand" way
Trees Trees は、ブロックプログラミング言語で、以下の特徴を備えています! 分かりやすい (easy to understand) 読みやすい (readable) 曖昧性がない (clear) ┌─────┐ │print│ └───┬─┘
Like HashSet but retaining INSERTION order and without `Hash` requirement on the Element type.
identified_vec A collection of unique identifiable elements which retains insertion order, inspired by Pointfree's Swift Identified Collections. Simil
Hash trait that is object-safe
Hash trait that is object-safe This crate provides a DynHash trait that can be used in trait objects. Types that implement the standard library's std:
Rust implementation of the PTHash perfect hash function for static compile-time generated hash tables
QuickPHF QuickPHF is a Rust implementation of the PTHash minimal perfect hash function algorithm. It consists of two crates: quickphf - runtime code f
Uses Plonky2 proof system to build recursive circuits for Merkle Trees.
ProvableMerkleTrees Introduction This repo provides Rust code to build Merkle Trees, equipped with a Provable interface to generate Zero Knowledge pro
A console viewer for trees – pet project to help me learn Rust.
treeviewer This is a pet project to help me learn Rust. But maybe it’ll end up being of actual use for someone? The idea is to write a program that, g
Build Abstract Syntax Trees and tree-walking models quickly in Rust.
astmaker Build Abstract Syntax Trees and tree-walking models quickly in Rust. Example This example creates an AST for simple math expressions, and an
DAPOL+ Proof of Liabilities using Bulletproofs and Sparse Merkle trees
DAPOL+ implementation Implementation of the DAPOL+ protocol introduced in the "Generalized Proof of Liabilities" by Yan Ji and Konstantinos Chalkias A
Blazing fast Pedersen hash implementation for Node.JS
pedersen-fast Blazing fast Pedersen hash implementation for Node.JS Exposes starknet-crypto's implementation written in Rust as WASM package. Usage np
🦀 Rust crate that allows creating weighted prefix trees that can be used in autocomplete
weighted_trie 🦀 Rust crate that allows creating weighted prefix trees that can be used in autocomplete Released API Docs Quickstart To use weigthed-t
An opinionated 2D sparse grid made for use with Bevy. For storing and querying entities
bevy_sparse_grid_2d An opinionated 2D sparse grid made for use with Bevy. For storing and querying entities. Personally, I'm using it for simple stupi
Manage lockfiles in PKGBUILDs for upstreams that don't ship them, `updpkgsums` for dependency trees (Arch Linux tooling)
updlockfiles Manage lockfiles for packages that don't ship any upstream. Like updpkgsums but for 3rd party dependency trees. If you're not actively ma
Generate Nix packages from URLs
Generate Nix packages from URLs with hash prefetching, dependency inference, license detection, and more
Generate Nix fetcher calls from repository URLs [maintainer=@figsoda]
nurl Generate Nix fetcher calls from repository URLs $ nurl https://github.com/nix-community/patsh v0.2.0 2/dev/null fetchFromGitHub { owner = "nix
Stdto provides a set of functional traits for conversion between various data representations.
Stdto stdto provides a set of functional traits for conversion between various data representations. | Examples | Docs | Latest Note | stdto = "0.13.0
A general solution for commonly used crypt in rust, collection of cryptography-related traits and algorithms.
Crypto-rs A general solution for commonly used crypt in rust, collection of cryptography-related traits and algorithms. This is a Rust implementation
Rust type wrapper to cache hash of potentially large structures.
CachedHash For a type T, CachedHashT wraps T and implements Hash in a way that caches T's hash value. This is useful when T is expensive to hash (fo
tool for generating wordlists or extending an existing one using mutations.
gorilla gorilla is the ultimate wordlist tool packing a lot of amazing utilities like: building wordlists based on patterns (like crunch) building wor
Trees for fast location-to-value lookup.
HexTree hextree provides tree structures that represent geographic regions with H3 cells. The primary structures are: HexTreeMap: an H3 cell-to-value
MD5/SHA256 HASH ATTACK IN RUST
hashraccoon Installation Install cargo curl https://sh.rustup.rs -sSf | sh Install the hashraccoon crate cargo install hashraccoon Download the rockyo
Rust implementation of behavior trees.
Bonsai 盆栽 Rust implementation of Behavior Trees Contents Quick intro to Behavior Trees Concepts Examples Development Guide Kanban Board Honorable Ment
Left To My Own Devices - NT hash tools
ntcrack Left To My Own Devices - NT cracker A full writeup of how it works is available at the SensePost blog Invocation ./ntcrack input hashlist w
Generates a unique hash/identifier for a system given a set of parameters.
uniqueid 🔍 Generates a unique hash/identifier for a system given a set of parameters. Example usage use uniqueid; pub fn main() { let data = vec
NixEl is a Rust library that turns Nix code into a variety of correct, typed, memory-safe data-structures
🐉 NixEL Lexer, Parser, Abstract Syntax Tree and Concrete Syntax Tree for the Nix Expressions Language. NixEl is a Rust library that turns Nix code in
computed data's hash by webAssembly
wasm-hasher computed data's hash by webAssembly support md5,sha1,sha2-224,sha2-356,sha2-384,sha2-512,sha3-224,sha3-256,sha3-384,sha3-512,china-sm3 typ
A simple MD5 implementation with a focus on buffered reading
md5-rs A simple MD5 implementation with a focus on buffered reading, and is completely no_std. This shouldn't be used in any security-critical softwar
Memory usage monitor for process trees
gotta-watch-em-all Executes a process with given arguments and monitors, logs when memory usage grows to a new peak. Example: cargo run -- cargo -- bu
A hashmap implementation, which uses hashset, and keys are contained within values.
A hashmap implementation, which uses hashset, and keys are contained within values.
An implementation of Jakobsson's Fractal Hash Sequence Traversal algorithm
fractal-hash-traversal An implementation of Jakobsson's Fractal Hash Sequence Traversal algorithm. There is at least one hash traversal algorithm that
Generic decision trees for rust
Stamm Stamm is a rust library for creating decision trees and random forests in a very general way. Decision trees are used in machine learning for cl
An efficient implementation of Partitioned Label Trees & its variations for extreme multi-label classification
Omikuji An efficient implementation of Partitioned Label Trees (Prabhu et al., 2018) and its variations for extreme multi-label classification, writte
LibreAuth is a collection of tools for user authentication.
LibreAuth is a collection of tools for user authentication. Features Password / passphrase authentication no character-set limitation reason
Broot - A new way to see and navigate directory trees
Broot A better way to navigate directories Installation Instructions Get an overview of a directory, even a big one br -s Notice the unlisted? That's
Fastmurmur3 - Fast non-cryptographic hash, with the benchmarks to prove it.
Fastmurmur3 Murmur3 is a fast, non-cryptographic hash function. fastmurmur3 is, in my testing, the fastest implementation of Murmur3. Usage let bytes:
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
tree-sitter-traversal Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface. Using cursors, iteration over the tree c
A Rust port of the password primitives used in Django Project.
Rust DjangoHashers A Rust port of the password primitives used in Django Project. Django's django.contrib.auth.models.User class has a few methods to
A fun rust terminal program so you can make Christmas trees!
Xmastree 2021 A fun christmas tree where you can add ornaments! Then, you can export the file into either: a rust file a txt file About Taking a break
paq files to hash.
paq paq files to hash. Hash a single file or all files in directory recursively. Installation Requires cargo. Run cargo install paq. Usage Run paq [sr
the official Rust and C implementations of the BLAKE3 cryptographic hash function
BLAKE3 is a cryptographic hash function that is: Much faster than MD5, SHA-1, SHA-2, SHA-3, and BLAKE2. Secure, unlike MD5 and SHA-1. And secure again
Reference implementation for the Poseidon Snark-friendly Hash algorithm.
Dusk-Poseidon Reference implementation for the Poseidon Hashing algorithm. Reference Starkad and Poseidon: New Hash Functions for Zero Knowledge Proof
Rust Blake hash bindings for Node.js.
@napi-rs/blake-hash Node.js binding for https://github.com/BLAKE3-team/BLAKE3. High performance, and no postinstall scripts. Support matrix node12 nod
A rust binding for nodejs to generate md5 hash value
Hasher A rust binding for creating node module to generate md5 hash value This project was bootstrapped by create-neon. Installing hasher Installing h
Finds matching solidity function signatures for a given 4 byte signature hash and arguments.
Finds matching solidity function signatures for a given 4 byte signature hash and arguments. Useful for finding collisions or 0x00000000 gas saving methods (though there are better techniques for saving gas on calldata)
The most advanced Merkle tree library for Rust
rs-merkle rs-merkle is the most advanced Merkle tree library for Rust. Basic features include building a Merkle tree, creation, and verification of Me
Rust crate to generate, manipulate and traverse trees.
SOCAREL Rust crate to generate, manipulate and traverse trees. It provides iterators for eight different traversal algorithms. Add and remove nodes in
Ruo is a dictionary-based password cracker written in rust 🦀 .
Ruo is a dictionary-based password cracker written in rust 🦀 . The primary purpose is to crack weak hashes/commonly used passwords.
Hash Table Implementation in Rust
Hash Table Implementation in Rust Purely for educational and recreational purposes. For real world production please use std::collections::HashMap. Fo
The hash programming language compiler
The Hash Programming language Run Using the command cargo run hash. This will compile, build and run the program in the current terminal/shell. Submit
A number of collections, such as linked-lists, binary-trees, or B-Trees are most easily implemented with aliasing pointers.
StaticRc is a safe reference-counted pointer, similar to Rc or Arc, though performing its reference-counting at compile-time rather than run-time, and
A SIMD-accelerated Adler-32 rolling hash algorithm implementation.
simd-adler32 A SIMD-accelerated Adler-32 rolling hash algorithm implementation. Features No dependencies Support no_std (with default-features = false
Read and modify constituency trees in Rust.
lumberjack Read and process constituency trees in various formats. Install: From crates.io: cargo install lumberjack-utils From GitHub: cargo install
RiteLinked - LinkedHashMap & LinkedHashSet in Rust
RiteLinked -- HashMap-like containers that hold their key-value pairs in a user controllable order RiteLinked provides more up to date versions of Lin
Easily embed and manage assets for your web application to build standalone-executables. Offers filename hashing, templating and more.
reinda: easily embed and manage assets This library helps you manage your assets (external files) and is mostly intended to be used in web application
A Rust library for calculating perceptual hash values of images
img_hash Now builds on stable Rust! (But needs nightly to bench.) A library for getting perceptual hash values of images. Thanks to Dr. Neal Krawetz f
Rust implementation of CRC(16, 32, 64) with support of various standards
crc Rust implementation of CRC(16, 32, 64). MSRV is 1.46. Usage Add crc to Cargo.toml [dependencies] crc = "2.0" Compute CRC use crc::{Crc, Algorithm,
A Rust port of the password primitives used in Django Project.
Rust DjangoHashers A Rust port of the password primitives used in Django Project. Django's django.contrib.auth.models.User class has a few methods to
Collection of cryptographic hash functions written in pure Rust
RustCrypto: hashes Collection of cryptographic hash functions written in pure Rust. All algorithms reside in the separate crates and implemented using
Highly modular & configurable hash & crypto library
Octavo Highly modular & configurable hash & crypto library written in pure Rust. Installation [dependencies] octavo = { git = "https://github.com/libO