Most blockchains use randomness through oracles, commit-reveal schemes, or trusted committees. EntropyChain bakes verifiable, hard-to-bias entropy into the consensus layer itself. Every block contributes a public beacon derived from its proof-of-work hash — usable directly by smart primitives like random NFT mints and on-chain lotteries.
CPU-mineable. Argon2id-based. Open and live on testnet.
EntropyChain is built for CPU mining. Argon2id makes GPUs and ASICs only marginally faster than commodity processors, so a regular machine at home contributes meaningfully to network security and randomness — not just heat.
Run the desktop miner, generate a wallet, and start earning real testnet ENTRO. Multi-account support, send/receive, token creation, your NFTs and lottery entries all built in.
1530ce0b2d50a7fdb577a5c3a3e843fd80b44081631affb338421f38b418630b
Check in PowerShell: Get-FileHash EntropyChainMiner.exe
Most chains pick one of these. EntropyChain insists on all three because none of them works as well in isolation: trustless randomness needs decentralized hashrate, decentralized hashrate needs CPU-friendly mining, and CPU-friendly mining needs a memory-hard hash.
Mining uses Argon2id, the PHC competition winner.
ASIC and GPU acceleration give a much smaller advantage than against
SHA-256 — the bottleneck becomes DRAM bandwidth, not silicon.
A laptop can mine. That's the point.
Every block publishes a beacon r_i = H("entropy" ‖ block_hash).
The block hash covers the proof of work, so no one knows a beacon until
its block is solved, and anyone can recompute it from public data. The
chain itself is a randomness beacon — no VDF, no oracle, no committee.
Transactions like nft_random_mint and
lottery_draw consume the beacon directly. No smart
contracts. No oracle integrations. The protocol enforces fair
derivation; verification is a single hash recomputation.
The end-to-end path from block production to verifiable trait derivation on a minted NFT — every step is deterministic, every input is public.
The miner assembles a block and searches for an Argon2id proof-of-work solution. Until a valid nonce is found, the block's hash does not exist, not even for the miner.
Every node computes r_i = sha256d("entropy" || block_hash).
Because the hash covers the PoW nonce, nobody could know
r_i in advance. It is queryable at
/rpc/entropy/{height}.
The user names a collection, token_id and recipient, but no source
of randomness. If the mint lands in block H, its traits
come from the beacon of block H + 1, which does not
exist yet.
Once block H + 1 is mined:
h = sha256(r_{H+1} || collection || token_id). Rarity,
power, element, colour and legendary status are read from bytes of
h. Anyone can recompute them.
The NFT records the block whose beacon revealed it. Anyone can verify nothing was cherry-picked: the beacon did not exist when the mint was signed.
Both fully on-chain. No oracles. No committees. No off-chain computation. Each is a single transaction type the protocol enforces directly.
Mint an NFT whose traits are revealed by the beacon of the block after the mint. No one, the minter included, can know or pick the traits in advance. Every property is reproducible from public data.
Create a lottery with a future draw_height, optionally a
window of up to 16 blocks. Tickets are bought until that block; the
winner comes from the window's block beacons. Prize paid natively,
no escrow contract.
Free, public, no registration. Spin up a wallet in the browser, request testnet ENTRO from the faucet, mint a random NFT or run a lottery. Verify everything you do on the explorer.