47,133 repositories indexed
1–24 of 26 · Most stars
The Rocq Prover is an interactive theorem prover, or proof assistant. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.
📜🔜🌲 Simple, fast, powerful parser toolkit for JavaScript.
Up to 100x faster strings for C, C++, CUDA, Python, Rust, Swift, JS, & Go, leveraging NEON, AVX2, AVX-512, SVE, GPGPU, & SWAR to accelerate search, hashing, sorting, edit distances, sketches, and memory ops 🦖
Functional Programming Library for C++. Write concise and readable C++ code.
bcrypt-ruby is a Ruby binding for the OpenBSD bcrypt() password hashing algorithm, allowing you to easily store a secure hash of your users' passwords.
Next generation API for .NET
Python interface for igraph
🤠 Object property paths with wildcards and regexps 🌵
Lossless compression C library built for ultra-fast decode. Faster than LZ4 (+35% to 105%+; best on ARM64), at a better ratio. Official Rust, Python, Node.js, Go and WASM bindings. Write-once/read-many, with optional seekable archives for O(1) random access.
A Library to parse natural language in pure Clojure and ClojureScript
A collection of containers & algorithms for the Crystal programming language
Various algorithms visualized interactively on the web, entirely with Rust 🦀
A rusty sdk for Algorand.
Streaming-first technical indicators with a Rust core: native Python, Node.js and WebAssembly bindings plus a C ABI hub for C, C++, C#, Go, Java and R. 514 indicators, O(1) per-tick updates, no system dependencies. Drop-in TA-Lib replacement.
Parameter Optimization for Lean Algorithms
Permutations and permutation groups in Common Lisp.
Functional Data Structures and Algorithms in SSReflect [maintainer=@clayrat]
Tealang - high level language for Algorand ASC1 and TEAL
NASA/JPL SPICE Toolkit for C – patched for cross-platform compatibility
Stable sort algorithms and their stability proofs in Rocq
Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]
A DSL for specifying Algorand smart contracts, which compiles into TEAL scripts.
A library for verifying graph-manipulating programs. Powered by Coq and VST. Compatible with CompCert.
Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components and SSReflect [maintainers=@CohenCyril,@palmskog]