hash-to-curve

gnark-crypto provides elliptic curve and pairing-based cryptography on BN, BLS12, BLS24 and BW6 curves. It also provides various algorithms (algebra, crypto) of particular interest to zero knowledge proof systems

Multilingual BLS12-381 signature library

Constantine: modular, high-performance, zero-dependency cryptography stack for verifiable computation, proof systems and blockchain protocols.

[RFC9380] Hash to curves - Rust reference implementation

[RFC9380] Hash to curves - Go reference implementation

Easy to use abstraction to elliptic-curve groups in Go.

Go implementation of RFC 9380 - Hashing to Elliptic Curves

Abstracted prime-order elliptic curve groups in Go.

Fast BLS12-381 implementation in OCaml

Standalone, zero-dependency C++ elliptic curve library implementing the Ran/Shaw curve for FCMP++. Runtime-dispatched backends (portable, x64, AVX2, AVX-512 IFMA) with constant-time scalar multiplication, MSM, polynomial arithmetic, and ECFFT support.

An extension to filippo.io/edwards25519 supporting hash-to-curve.

Implementation of RFC 9380 algorithms for encoding or hashing an arbitrary byte array to a point on an elliptic curve

Go implementation of Secp256k1 based on Fiat-Crypto, with RFC9380 hash-to-curve.

Hashing to Elliptic Curves for Ruby

Browser-based Private Set Intersection demo implementing classic DH-PSI (Meadows 1986, Huberman-Franklin-Hogg 1999) over ristretto255 with RFC 9380 hash-to-curve. The primitive behind Signal contact discovery and Apple password monitoring.

Witness-assisted RFC 9380 hash-to-curve for BLS12-381 on Solana. Aggregate BLS verify in one legacy transaction: 97 B witness, ~583k CU, byte-identical to blst, mainnet syscalls.