RandProof2. RandProof™: The Brand Layer
A RandProof is an on-chain proof artifact: a permanent, structured data record stored on a blockchain: cryptographically attesting to three things a
2.1 What Is a RandProof?
A RandProof is an on-chain proof artifact, a permanent, structured data record stored on a blockchain, cryptographically attesting to three things about a selection event:
The randomness used to determine the outcome was generated by a decentralized network of independent nodes with no single point of control.
The outcome could not have been known or influenced by any party before the randomness was committed.
The proof is independently verifiable by any third party at any time using only public on-chain data.
Key Distinction: A RandProof is not a claim of fairness. It is a mathematical proof.
2.2 The RandProof Artifact: On-Chain Data Structure
Every PoFR event produces a RandProof containing the following fields:
| Field | Contents | Verifiable By |
| requestId | Unique identifier for the PoFR event | Any party, on-chain |
| requestBlock | Block number at which event was requested | Any party, on-chain |
| drandRound | DRAND beacon round | Any party, via drand.love |
| drandSignature | BLS signature from DRAND consortium | Any party, DRAND public key |
| nistBeaconValue | NIST Randomness Beacon value | Any party, via NIST API |
| nistSignature | ECDSA signature from NIST | Any party, NIST public key |
| commitRevealXOR | XOR of all participant submissions | Any party, on-chain |
| blockVRF | Consensus-layer VRF or block hash | Any party, on-chain |
| blockTimestamp | Unix timestamp of the block | Any party, on-chain |
| aggregatedBLSSig | BLS threshold sig from t-of-n nodes | Any party, BN254 pairing |
| signerAddresses | Addresses of signing keeper nodes | Any party, on-chain |
| seed | Final entropy: keccak256(drand | |
| outcome | Selection result: seed % totalEntrants | Any party |
| fulfillTimestamp | Block timestamp of fulfillment | Any party |
| gasReserveUsed | Gas drawn from reserve pool | Any party |
1. The Problem: Trust in Selection
Every institution that selects, allocates, or assigns faces a structural vulnerability: the party that runs the selection controls the outcome. This a
3. Proof-of-Fair-Randomness (PoFR)™: The Protocol Standard
Proof-of-Fair-Randomness (PoFR) is the cryptographic protocol standard, coined by Mauricio Artigas on June 16th, 2026, that defines the technical requ