Randomness matters more than most people realize — especially in gaming, lotteries, simulations, and digital systems where fairness must be provable.

BlockRand delivers provably fair, auditable random numbers that anyone can independently verify. By combining cryptographic commit-reveal schemes, deterministic hashing, and external entropy sources, BlockRand ensures outcomes are unbiased, tamper-resistant, and mathematically reproducible.

This documentation explains the theory, algorithms, and verification models behind verifiable randomness systems.

---

Core Concepts

• What Is Verifiable Randomness?
• What Is Modulo Bias?
• Why One Seed Is Not Enough?
• Why Future Public Entropy Matters?
• How Provably Fair Systems Fail in Practice?
• How Randomness Audits Work?
• Why Traditional RNG APIs Are Not Auditable?
• Why Determinism Is Not the Enemy of Fairness?

---

Theory

• Why Single-Party RNG Fails?
• What Is the Double-Blind Entropy Model?
• Why Should There Be Delay in Randomness?
• Why Precommitment Matters?
• How to Build Verifiable Randomness Without Blockchain State?
• Understanding Trade-offs: Verifiable Randomness vs Oracles

---

Algorithms

• Fair Dice
• Unbiased Coin Toss
• Fair Shuffle
• Weighted Random Selection
• Random Sampling Without Replacement
• Multi-Winner Draws with Deterministic Ordering
• Progressive Probability Curves (Pity Systems)
• Secure Range Mapping for Large Outcome Spaces

---

Verification

• What Provably Fair Actually Means
• Deterministic Replay Verification
• Commit–Reveal Schemes Explained Simply
• Commit–Reveal and Double-Blind Verification
• Verify Randomness Without Trusting the Server
• Public Entropy Sources — What Counts and What Doesn’t
• Common Verification Failures and How Systems Get Caught