Everything, Everywhere
Verified Specification | Standardized Formulas | Instant Precision
Secure & Private (Zero Data Retention) Free Access • No Sign-Up
RFC 9381 Standard Cryptographic Unbiased Randomness

Verifiable Random Functions (VRF) Architecture Studio

Simulate IETF RFC 9381 Elliptic Curve VRFs (ECVRF). Model Hash-to-Curve deterministic mapping, Schnorr non-interactive zero-knowledge proofs (pi = (Gamma, c, s)), and third-party verification.

1. Elliptic Curve Suite & Keypair

Private Scalar (x): 0x4a9b...7e1c
Public Key (PK = x*G): 0x02a1...4d98
Security: 128-bit Post-Shor Classical Pre-Quantum

2. Prover & Verifier Simulation

VRF Verification: VALID (Unique Hash Y Authenticated)
Output Hash (Y): 0x9e8f...3210
Gamma (Γ = x*H): 0x03b4...11ae
Proof Size: 80 Bytes

ECVRF Computation Graph

RFC 9381 Cryptographic Step Trace

Security Properties & Complexity Bounds

Provable Uniqueness
100% Deterministic
Impossible to produce Y1 != Y2
Pseudorandomness
Full Uniformity
Indistinguishable from random oracle
Prover Latency
0.85 ms
HashToCurve + 2 scalar mults
Verifier Latency
1.42 ms
Double point mults (U and V)

Production Implementation (Rust & Go)


      
Sponsored Utility
While You're Here
Sponsored Recommendations
Advertisement