vrf-rs is an open source implementation of Verifiable Random Functions (VRFs) written in Rust.
DISCLAIMER: This is experimental software. Be careful!
This module uses the OpenSSL library to offer Elliptic Curve Verifiable Random Function (VRF) functionality.
It follows the algorithms described in:
Currently the supported cipher suites are:
P256_SHA256_TAI: the aforementioned algorithms withSHA256and thesecp256r1curve (akaNIST P-256).K163_SHA256_TAI: the aforementioned algorithms withSHA256and thesect163k1curve (akaNIST K-163).SECP256K1_SHA256_TAI: the aforementioned algorithms withSHA256and thesecp256k1curve.
Create and verify a VRF proof by using the cipher suite SECP256K1_SHA256_TAI:
use vrf::openssl::{CipherSuite, ECVRF};
use vrf::VRF;
fn main() {
// Initialization of VRF context by providing a curve
let mut vrf = ECVRF::from_suite(CipherSuite::SECP256K1_SHA256_TAI).unwrap();
// Inputs: Secret Key, Public Key (derived) & Message
let secret_key =
hex::decode("c9afa9d845ba75166b5c215767b1d6934e50c3db36e89b127b8a622b120f6721").unwrap();
let public_key = vrf.derive_public_key(&secret_key).unwrap();
let message: &[u8] = b"sample";
// VRF proof and hash output
let pi = vrf.prove(&secret_key, &message).unwrap();
let hash = vrf.proof_to_hash(&pi).unwrap();
// VRF proof verification (returns VRF hash output)
let beta = vrf.verify(&public_key, &pi, &message);
}A complete example can be found in examples/basic.rs
This library defines a VRF trait which can be extended in order to use different curves and algorithms.
pub trait VRF<PublicKey, SecretKey> {
type Error;
fn prove(&mut self, x: SecretKey, alpha: &[u8]) -> Result<Vec<u8>, Self::Error>;
fn verify(&mut self, y: PublicKey, pi: &[u8], alpha: &[u8]) -> Result<Vec<u8>, Self::Error>;
}vrf-rs is published under the MIT license.
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent