🎲 A Distributed Randomness Beacon Daemon - Go implementation
-
Updated
Oct 6, 2026 - Go
🎲 A Distributed Randomness Beacon Daemon - Go implementation
💡 Compute and verify the SHA-256 random beacons used in the Zcash MPC ceremonies.
Verifiable Random Function (VRF) generating deterministic pseudorandom output with verifiable non-interactive proof
Verifiable Random Function (VRF) generating deterministic pseudorandom output with verifiable non-interactive proof
Elliptic curve verifiable random function (ECVRF) generating cryptographic pseudo-random outputs with public verification proofs.
Elliptic curve verifiable random function (ECVRF) generating cryptographic pseudo-random outputs with public verification proofs.
A smart contract toolkit for using verifiable randomness in ink! smart contracts
Reference implementation of the GRandLine distributed randomness beacon protocol.
Creative ritual studio with traceable draws seeded by NIST pulses, quantum and atmospheric noise, earthquakes, and live weather—Tarot, I Ching, decisions, prompts, generative art, and soundscapes.
Daily Conway Glyph Challenge
Verifiable AI-economy oracles — Platon, Chronos, Lattice, Murmuration, Lumen, Colony, and Turing on shared oracle-core.
Publicly verifiable proof that an LLM endpoint actually spent the compute you paid for — zero provider cooperation. Closes the effort gap (Hollow-LLM) and the transferability gap (IRIS).
A Collection of Randomness Powered Protocols and Platforms for the Primordial Livelihood
Browser-based randomness-beacon demo — recompute real NIST Beacon 2.0 pulses byte by byte, walk their SHA-512 hash chain and skiplist, verify drand rounds with a BLS12-381 pairing, and see what no check proves: whether the operator knew the value first.
Sharecoin (SHC): a real Bitcoin Core fork with a public, verifiable randomness beacon derived from GPU-mined ProgPoW blocks
Browser-based Verifiable Delay Function — repeated modular squaring (y = x^(2^T) mod N) in an RSA group with a Wesolowski short proof. Watch sequential work accrue one squaring at a time, confirm parallel workers don't speed it up, then verify the proof instantly and reveal the trapdoor that collapses the delay.
Browser-based VRF and VDF demo (RFC 9381) — ECVRF P-256 prove/verify with hash-to-curve, Wesolowski VDF repeated squaring with proof, RANDAO+VDF randomness beacon simulation with last-reveal attack and VDF protection. Chainlink VRF, Ethereum RANDAO, Filecoin leader election. No backends. No simulated math.
Verifiable raffles: quantum entropy from IBM hardware sealed under a Merkle root, mixed with drand, with a CHSH witness in every proof. Runs on a Cloudflare Worker.
Browser-based beacon timelock encryption — time-lock puzzles, VDFs, and drand-style IBE release side by side, with Boneh–Franklin FullIdent on BLS12-381, a live decryption of a real drand tlock ciphertext, nine attacks against the decryptor, and an adversary slider showing that a million times more hardware still opens at the same second
To associate your repository with the randomness-beacon topic, visit your repo's landing page and select "manage topics."